Five Leetcode questions: Round-1: 1. Find the depth of a binary tree. 2. Implement a stack with push, pop, top and getMin() functions in constant time. 3. Check if two strings are anagrams or not. Very optimal solutions required instead of brute-force. Round-2: 1. Partition Lables 2. Maximum value between two nodes in a binary search tree.
How to handle collisions in a hash table
I did not expect the interviewer would ask some DP question during phone interview stage and the collabedit is horrible.
The question was to fin the number of time an array was schifted. For example: [1 2 3 4 5 ] is 0 because it is in order [7 5 6] is 1 because it should be [5 6 7] [7 8 9 2] is 1 too.
What is functional programming?
You have been given an matrix of characters 5*5 which contains 24 elements a..y the matrix will look something like a b c d e f g h i j k l m n o p q r s t u v w x y You have been given alpha (starting character) and beta (Ending character) as two characters. You have to find all shortest paths between alpha and beta with a restriction that you are allowed to move vertical or horizontal.
(1) find the most frequent words in a sentence. (2) implementation of a linkedlist class.
How would you implement an Autocomplete feature and what data structures would you use to do so?
Implement function to find longest path in a tree.
given a pool(P) of co-ordinates (infinitely large), find the closest N to a given user co-ordinate
Viewing 1691 - 1700 interview questions