Leetcode medium questions. Phone Screen 1. Simplify Path 2. K nearest points to origin On-site (Virtual) 1. Multiply strings 2. Task schedular with cool down 3. BST iterator Follow up on-site 1. Some BFS maze based question
New Grad Software Engineer Interview Questions
2,906 new grad software engineer interview questions shared by candidates
1. Implement next() and hasNext() function of the iterator; 2. find the max value of each layer in a binary tree
First was a leetcode easy. Second was similar to next permutation.
This was literally the question: https://leetcode.com/problems/path-sum-iii/. Phone screens or online screens can usually be found on leetcode or hackerrank.
What python version did you use? Why
Given an integer represent it in its String/Word format? Example - Input: 800/ Output: Eight Hundred. Since its an integer and I chose Java so by default the range was few Billions inclusive of negative integers as well. (Input: -800/ Output: Negative Eight Hundred)
Find the length of the longest increasing subsequence (with gaps allowed) in a list
Regex String Matching.
Check if an array of String (words) is sorted based on a given dictionary (this could be anything, not a real dictionary)
Verify if parentheses [ "(", ")" ] were used correctly in a string.
Viewing 311 - 320 interview questions