I am in a 100-story building. I have with me two glass balls. I know that if I throw the ball out of the window, it will not break if the floor number is less than X, and it will always breaks if the floor number is equal to or greater than X. Assuming that I can reuse the balls which don't break, find X in the minimum number of throws.
Given a set of inputs <number, userid> in a log file: log: <number, userid> example: 1,2 1,1 2,1 3,1 1,2 out: <number, count> 1,2 2,1 3,1 The output should be all the unique numbers and the count associated with them.
Design a linked list operation that takes a singly-linked list (only forward ptrs, no backward ptrs) as input and reverses the list.
You are given intervals of contiguous integers, like [1, 10), [15, 25), [40, 50), which are non-overlapping and of a fixed size. Design a data structure to store these intervals and have the operations of insert, delete, and find functions
It was a mathematical questions about finding the greatest number (but less than the given number) by reordering the digits in the number.
2 leetcode easies, 2 leetcode mediums (Codesignal)
Sort a matrix in diagonal order after manipulation
Max Profit Buy Sell Stocks, K Closest Points to Origin and Copy List with Random Pointers
Diameter of binary tree. Find number of islands. Meeting room problem.
Coding question: Q. Given two non-negative integers low and high. Return the count of odd numbers between low and high
Viewing 1481 - 1490 interview questions