Find Kth minimum node in a binary tree and suggest a complexity
Engineer Interview Questions
934,946 engineer interview questions shared by candidates
Related to question 1, how could you implement debouncing? Say you wanted the `handleScroll` function to be called only after 200ms has passed between scroll events.
Given a pointer to the head of a singly linked list, iterate it backwards printing the values in reverse. Give 2 implementations - a recursive one, and an iterative one.
Given an array of integers, find the sub array with the largest sum. (must be done in linear time)
Given two events, each with a start and end time, implement a boolean check to see if they overlap.
Optimize the algorithm suggested above
In an array you have all the numbers from 1 through n (not in order) with one number missing. Find that number. Now, you have two numbers missing. Find both the numbers. Notes: O(n) time solution, O(1) extra space. n may be very large, so beware of overflows!
Draw a two-put NAND gate and size it, assuming the ratio of PMOS/NMOS is 2 in inverter. Then suppose two input are A and B for NMOS and PMOS. A is close to output and B is close to ground, input A change from 0 to 1 at t=t1, input B change from 0 to 1 at t =t1 (t1 > t0). Describe how the output change. Then input B changes from 0 to 1 first then input A changes from 0 to 1. Describe how the output changes. Are there any differences between these two scenarios?
How to delete a node in a singly linked list without access to the list header.
Didnt ask anything about me or my resume. They sent ma link to write the code. Asked me to write the code for finding the number of words in a string without using split and scanner. Then asked me to improve the code to accommodate corner case i.e if multiple spaces or null string etc. Asked me to write the test cases for the program.
Viewing 1481 - 1490 interview questions