1. Given a lot of transactions, one transaction contain company name and the number of money in this transaction. Design a data structure, find the transaction with most money in it. follow up, find the company who owns transactions with most money (add-up). 2. Find the max number in an integer array. follow up, find the second number in this array.
Compare two strings and see if they have the same frequency of letters, in MAXIMAL efficiency.
First round: Asked about my resume. Was asked to solve coding on leetcode Second round: Drilled deep into projects that were mentioned in resume
Cut a cake into 8 equal pieces
enter any odd positive no . and do output as n=3 @@@ @@@ @@@***@ @@@ @@@ n=5 @@@@@ @@@@ @@@@@ @ @@@@@*****@ @@@@@ @ @@@@@ @@@@@
You have a list of numbers from 1-1000, each number only exists once and they are in random order. You randomly take one out. How do you know which is the missing number?
For a given binary tree, assign the sibling pointer of each node. A sibling is always the node to its immediate right on the same level of the tree.
Smallest missing natural number in a linked list in linear time without a hash table.
Write a function that calculates the root of a given number.
Find Kth minimum node in a binary tree and suggest a complexity
Viewing 931 - 940 interview questions