Filter interviews by
Clear (1)
I applied via Campus Placement
Coding questions with some development related questions
Top trending discussions
The program capitalizes the first letter of each reversed word in a sentence.
Split the sentence into an array of words using space as a delimiter.
Reverse each word in the array and capitalize the first letter.
Join the modified words back into a sentence.
I applied via Company Website and was interviewed before Sep 2022. There were 2 interview rounds.
Very basic problem solving round
I applied via Walk-in and was interviewed before Oct 2022. There were 4 interview rounds.
Easy round a hackerrank test with easy to medium problems
I applied via Approached by Company and was interviewed before Jan 2023. There were 2 interview rounds.
Write a program that solves sudoku
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
Basic DS question like dutch flag problem.
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
I applied via Naukri.com and was interviewed in Jul 2024. There was 1 interview round.
Two questions asked:
1. Partition equal sum
2. find length largest region boolean matrix
I was interviewed before Sep 2023.
Hacker rank evaluation with three questions
I applied via Approached by Company and was interviewed before Apr 2023. There was 1 interview round.
Live coding with interviewer
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
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.
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.
based on 1 review
Rating in categories
Product Support Engineer
7
salaries
| ₹0 L/yr - ₹0 L/yr |
Engineering Manager
7
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
7
salaries
| ₹0 L/yr - ₹0 L/yr |
Executive Accountant
7
salaries
| ₹0 L/yr - ₹0 L/yr |
Sde1
6
salaries
| ₹0 L/yr - ₹0 L/yr |
Freshworks
Zoho
Chargebee
CleverTap