Given an array, rotate the array to the right by k steps, where k is non-negative. ExampleNo.1Input: [1,2,3,4,5,6,7] and k = 3 Output: [5,6,7,1,2,3,4] ...

Design and implement a TwoSum class. It should support the following operations: add and find. add - Add the number to an internal data structure.find ...

Write a function that takes an unsigned integer and return the number of ‘1’ bits it has (also known as the Hamming weight). ExampleNo.1Input: 0000000 ...

Reverse bits of a given 32 bits unsigned integer. ExampleNo.1Input: 00000010100101000001111010011100 Output: 00111001011110000010100101000000 Explanat ...

Given an integer n, return the number of trailing zeroes in n!. ExampleNo.1Input: 3 Output: 0 Explanation: 3! = 6, no trailing zero. No.2Input: 5 Outp ...

Write a program to find the node at which the intersection of two singly linked lists begins. For example, the following two linked lists: begin to i ...

We have a collection of rocks, each rock has a positive integer weight. Each turn, we choose any two rocks and smash them together. Suppose the stone ...

We have a collection of rocks, each rock has a positive integer weight. Each turn, we choose the two heaviest rocks and smash them together. Suppose ...

On an infinite number line, the position of the i-th stone is given by stones[i]. Call a stone an endpoint stone if it has the smallest or largest po ...

Three stones are on a number line at positions a, b, and c. Each turn, you pick up a stone at an endpoint (ie., either the lowest or highest position ...