Given a m x n matrix grid which is sorted in non-increasing order both row-wise and column-wise, return the number of negative numbers in grid.
Follow up: Could you find an O(n + m) solution?
230815(화) 코엑스에서 진행하였던
인프콘 2023에서 카카오뱅크가 후원을 하고
그 덕에 부스를 차려서 다양한 사람들을 맞이할 기회가 생겼다.
그리고 거기서 기술 성장 상담소 라는 프로그램을 진행하였고
운이 좋게 나에게 기회가 닿아서 참여하게 되었다.
내가 누군가의 기술 성장을 상담할 자격이 없다고 생각되었지만 근자감으로 참여했다.
Given the root of a binary tree, the level of its root is 1, the level of its children is 2, and so on.
Return the smallest level x such that the sum of all the values of nodes at level x is maximal.
A sequence of numbers is called an arithmetic progression if the difference between any two consecutive elements is the same.
Given an array of numbers arr, return true if the array can be rearranged to form an arithmetic progression. Otherwise, return false.
Given 3 positives numbers a, b and c. Return the minimum flips required in some bits of a and b to make ( a OR b == c ). (bitwise OR operation).
Flip operation consists of change any single bit 1 to 0 or change the bit 0 to 1 in their binary representation.
You are given an array coordinates, coordinates[i] = [x, y], where [x, y] represents the coordinate of a point. Check if these points make a straight line in the XY plane.