2 recursion problems, and other 2 were leetcode easy-medium
New Grad Software Engineer Interview Questions
2,866 new grad software engineer interview questions shared by candidates
Reverse Words in a String Find Path in a Maze Find Pivot in Sorted Array
How are the malloc and Free function in C is working? How will you construct one?
Binay Tree Lowest Common Ancestor
Run length encoding and Dynamic programming problem using matrices. The run-length is pretty easy using a stringbuilder and iterating over each char in the string they pass through as an argument. The other problem was iterating through a matrix using two different reference points and finding shortest path between the two.
Copy a linked list Make an iterator
Given a binary tree root and function which prints the value of the node at the (x,y) position in the screen, write a function to print the entire tree in the screen. A lot of edge cases to take care here... 1. The resolution of the screen (its dimensions). 2. Cannot collapse two values at the screen. 3. How do you take care of large numbers on the same vertical line? 4. This was the follow-up question. Maybe it was because I first started with using the same distance for all the children at the same level. The question was to optimize the distance used. For example to use only distance 1 if I didn't need more. Some examples to understand what I talking about. 1 d=1 / \ d = 1 2 3 1 / \ d = 2 / \ 2 5 / \ / \ d = 1 3 4 6 7 You can not use d=1 at the first level because 4 and 6 will collide.
Create a minesweeper board given board dimensions and number of mines where each cell in board has equal chance of containing the mine
Given a binary tree, find the minimum path length from root to leaf.
Given a sorted linked list with 2 nodes swapped, how would you fix it?
Viewing 1431 - 1440 interview questions