1) Possible ways to get from top left of mxn matrix to the top right 2) Make a code editor refractor (string replacement) 3) Find the longest path in a DAG 4) Card class and functions
Grad Interview Questions
7,989 grad interview questions shared by candidates
They asked about some arrays, trees questions. They are not difficult to find a solution.
Turn a n-ary tree into a binary tree.
Give two binary tree. you can switch left and right children anytime. Determine whether two trees can be same after serval switches
Got the assessment questions. There are two questions related to basic concepts learned in school
Algorithm question, using hash map, priority queue to solve
Write a function that removes whitespace ('\t', '\n', ' ') from a string
given a method that can show if a node should be deleted or not, return the tree
hard level coding question of strings
find the largest square in a matrix which the sum of numbers in the square less or equal to K
Viewing 691 - 700 interview questions