1. Implement next() and hasNext() function of the iterator; 2. find the max value of each layer in a binary tree
Grader Interview Questions
8,338 grader interview questions shared by candidates
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
Find a needle in the haystack: given two c-strings (null terminated), return a pointer to the location of where the needle occurs in the haystack, NULL otherwise.
Write a class providing an LRU cache
Phone interview Given a 2D array of gifts, find path from top left to bottom right corner with greatest aggregated gift values.
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.
Viewing 761 - 770 interview questions