Add Two Numbers II
Given two linked lists that represent two numbers, return the sum of the numbers also represented as a list.
Given two linked lists that represent two numbers, return the sum of the numbers also represented as a list.
Given a positive integer N, return whether or not it has alternating bit values.
This question is asked by Google. Given a staircase with N steps and the ability to climb either one or two steps at a time, return the total number of ways to arrive at the top of the staircase.
Given an integer array nums, return the total number of "partners" in the array.
This question is asked by Facebook. Given two integers x and y, return the hamming distance between the two numbers.
Given an integer n, return whether or not it is a "magical" number. A magical number is an integer such that when you repeatedly replace the number with the sum of the squares of its digits, it eventually becomes one.
Given a list of points, return the k closest points to the origin (0, 0).
This question is asked by Amazon. Given an array that contains all distinct values from zero through N except one number, return the number that is missing from the array.
This question is asked by Facebook. Given an array nums, return whether or not its values are monotonically increasing or monotonically decreasing.
This question is asked by Facebook. In a gym hallway there are N lockers. You walk back and forth down the hallway opening and closing lockers. On your first pass you open all the lockers. On your second pass, you close every other locker. On your third pass you open every third locker. After walking the hallway N times opening/closing lockers in the previously described manner, how many lockers are left open?
Given an array digits that represents a non-negative integer, add one to the number and return the result as an array.
Given an integer n, return whether or not it is a power of three.
Given an integer array nums, return an array where each element i represents the product of all values in nums excluding nums[i].
This question is asked by Apple. Given a 32-bit signed integer, reverse it and return the result.
Given an image represented as a 2D array of pixels, return the image rotated 90 degrees clockwise.
Given an integer N, return the total number of self divisible numbers that are strictly less than N (starting from one).
This question is asked by Google. A ball is dropped into a special Galton board where at each level in the board the ball can only move right or down. Given that the Galton board has M rows and N columns, return the total number of unique ways the ball can arrive at the bottom right cell of the Galton board.