Dialpad Interview Questions and Answers

Basic DS question like dutch flag problem.

Q1. Implement debounce function
Ans. 
Debounce function delays the execution of a function until after a specified amount of time has passed since the last time it was invoked.
• Create a function that takes a function and a delay time as parameters

• Use setTimeout to delay the execution of the function

• Use clearTimeout to reset the timer if the function is invoked again within the delay time
Answered by AI
Add your answer
Q2. Closure based questions.
Add your answer

Write a program that solves sudoku

Q1. How do you build a tiny URL Application?
Ans. 
A tiny URL application is built by generating short aliases for long URLs, storing them in a database, and redirecting users to the original URL when the alias is accessed.
• Generate a unique short alias for each long URL

• Store the alias and corresponding long URL in a database

• Implement a redirect mechanism to redirect users from the alias to the original URL

• Handle edge cases like duplicate URLs, expired aliases, and inva
Answered by AI
Add your answer

Q1. Immediate higher number to right
Ans. 
The immediate higher number to the right of each element in an array
• Iterate through the array from right to left

• For each element, compare it with the elements to its right to find the immediate higher number

• Store the immediate higher number in a new array
Answered by AI
Add your answer
Q2. Count pair whose sum is perfect square.
Ans. 
Count pairs in an array whose sum is a perfect square.
• Iterate through the array and calculate the sum of each pair.

• Check if the sum is a perfect square using a function.

• Increment a counter if the sum is a perfect square.

• Return the final count of pairs.
Answered by AI
Add your answer
Q3. Parking lot LLD
Add your answer
Q4. E Commerce HLD and LLD
Add your answer
Q5. Kth largest number in BST
Ans. 
To find the Kth largest number in a Binary Search Tree (BST), we can perform an in-order traversal and keep track of the Kth largest element.
• Perform an in-order traversal of the BST to get the elements in non-decreasing order.

• Keep track of the Kth largest element while traversing the BST.

• Return the Kth largest element once found.
Answered by AI
Add your answer