You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adjacent houses have security system connected and it will automatically contact the police if two adjacent houses were broken into on the same night.
Find the contiguous subarray within an array (containing at least one number) which has the largest sum.
Say you have an array for which the ith element is the price of a given stock on day i.
Given an array of integers that is already sorted in ascending order, find two numbers such that they add up to a specific target number.
Given an array of integers, return indices of the two numbers such that they add up to a specific target.
Given an integer n, count the total number of digit 1 appearing in all non-negative integers less than or equal to n.
An image is represented by a binary matrix with 0 as a white pixel and 1 as a black pixel. The black pixels are connected, i.e., there is only one black region. Pixels are connected horizontally and vertically. Given the location (x, y) of one of the black pixels, return the area of the smallest (axis-aligned) rectangle that encloses all black pixels.
A sequence of number is called arithmetic if it consists of at least three elements and if the difference between any two consecutive elements is the same.
Given a string of numbers and operators, return all possible results from computing all the different possible ways to group numbers and operators. The valid operators are +, - and *.
Given an Iterator class interface with methods: next() and hasNext(), design and implement a PeekingIterator that support the peek() operation – it essentially peek() at the element that will be returned by the next call to next().
Design a Tic-tac-toe game that is played between two players on a n x n grid.
This is a follow up of Shortest Word Distance. The only difference is now word1 could be the same as word2.
Given a nested list of integers, return the sum of all integers in the list weighted by their depth.
There are n bulbs that are initially off. You first turn on all the bulbs. Then, you turn off every second bulb. On the third round, you toggle every third bulb (turning on if it’s off or turning off if it’s on). For the ith round, you toggle every i bulb. For the nth round, you only toggle the last bulb. Find how many bulbs are on after n rounds.
Given two non-negative numbers num1 and num2 represented as string, return the sum of num1 and num2.
A group of two or more people wants to meet and minimize the total travel distance. You are given a 2D grid of values 0 or 1, where each 1 marks the home of someone in the group. The distance is calculated using Manhattan Distance,
where distance(p1, p2) = |p2.x - p1.x| + |p2.y - p1.y|.
Given a non-negative integer n, count all numbers with unique digits, x, where 0 ≤ x < 10n.
Design a hit counter which counts the number of hits received in the past 5 minutes.
Given a non-negative number represented as a singly linked list of digits, plus one to the number.
Assume you have an array of length n initialized with all 0’s and are given k update operations.
Given two 1d vectors, implement an iterator to return their elements alternately.
Given a string, we can “shift” each of its letter to its successive letter, for example: “abc” -> “bcd”. We can keep “shifting” which forms the sequence:
Median is the middle value in an ordered integer list. If the size of the list is even, there is no middle value. So the median is the mean of the two middle value.
Suppose you have a random list of people standing in a queue. Each person is described by a pair of integers (h, k), where h is the height of the person and k is the number of people in front of this person who have a height greater than or equal to h. Write an algorithm to reconstruct the queue.
Given a singly linked list, return a random node’s value from the linked list. Each node must have the same probability of being chosen.
Given an array of integers with possible duplicates, randomly output the index of a given target number. You can assume that the given target number must exist in the array.
A character in UTF8 can be from 1 to 4 bytes long, subjected to the following rules:
Given a range [m, n] where 0 <= m <= n <= 2147483647, return the bitwise AND of all numbers in this range, inclusive.
A frog is crossing a river. The river is divided into x units and at each unit there may or may not exist a stone. The frog can jump on a stone, but it must not jump into the water.
Given n points on a 2D plane, find if there is such a line parallel to y-axis that reflect the given points.
Given a non-empty string s and an abbreviation abbr, return whether the string matches with the given abbreviation.
Given an integer, write an algorithm to convert it to hexadecimal. For negative integer, two’s complement method is used.
Given a binary tree, collect a tree’s nodes as if you were doing this: Collect and remove all leaves, repeat until the tree is empty.
Given an integer array nums, find the sum of the elements between indices i and j (i ≤ j), inclusive.
Given a non-negative integer num represented as a string, remove k digits from the number so that the new number is the smallest possible.
Given an array which consists of non-negative integers and an integer m, you can split the array into m non-empty continuous subarrays. Write an algorithm to minimize the largest sum among these m subarrays.
A binary watch has 4 LEDs on the top which represent the hours (0-11), and the 6 LEDs on the bottom represent the minutes (0-59).