EdgeQ Member Technical Staff Interview Questions and Answers

1 DP question, 1 simple integer manipulation

Q1. 4th smallest element in BST
Ans. 
Find the 4th smallest element in a Binary Search Tree.
• Traverse the BST in-order and keep track of the count of visited nodes.

• When the count reaches 4, return the current node's value.

• If the BST has less than 4 nodes, return null or throw an exception.
Answered by AI
Add your answer
Q2. Maximum number of distinct elements in every sliding window of size k
Ans. 
Find maximum distinct elements in every sliding window of size k.
• Create a hash table to store the frequency of each element in the current window.

• Use two pointers to maintain the current window and slide it over the array.

• Update the hash table for each new element in the window and remove the old element.

• Keep track of the maximum number of distinct elements seen so far.

• Repeat until all windows of size k have been proce
Answered by AI
Add your answer
Q3. Merge two sorted linked lists
Ans. 
Merge two sorted linked lists
• Create a new linked list to store the merged list

• Compare the first nodes of both lists and add the smaller one to the new list

• Move the pointer of the added node to the next node

• Repeat until one of the lists is empty

• Add the remaining nodes of the non-empty list to the new list
Answered by AI
Add your answer

Q1. A probability related question
Add your answer