Filter interviews by
I appeared for an interview in Feb 2021.
Round duration - 70 Minutes
Round difficulty - Medium
Timing was 9:15AM. Platform was not very good. Questions were not well explained.
Given a specified number of intervals, where each interval is represented by two integers denoting its boundaries, the task is to merge all overlapping interv...
Merge overlapping intervals and return sorted list of merged intervals.
Identify overlapping intervals based on start and end times
Merge overlapping intervals to form new intervals
Sort the merged intervals in ascending order of start times
You need to determine all possible paths for a rat starting at position (0, 0) in a square maze to reach its destination at (N-1, N-1). The maze is represented as an N*N ma...
Find all possible paths for a rat in a maze to reach its destination, given a matrix representation of the maze.
Use backtracking to explore all possible paths from the starting position to the destination.
Keep track of the current path and explore all possible directions at each step.
Terminate the exploration when reaching the destination or hitting a blocked cell.
Return the list of valid paths found, sorted in alphabe
Given a string STR
consisting of lowercase English letters, your task is to return all permutations of the given string in lexicographically increasing order.
Return all permutations of a given string in lexicographically increasing order.
Generate all permutations of the given string using backtracking algorithm.
Sort the permutations lexicographically before printing them.
Ensure the string contains unique characters for correct output.
Handle multiple test cases efficiently.
Example: For input 'bca', output 'abc acb bac bca cab cba'.
Tip 1 : Prepare maximum algorithms.
Tip 2 : Deep knowledge of data structure.
Tip 3 : OOPS is must.
Tip 1 : Keep it short.
Tip 2 : Mention only your own projects.
I appeared for an interview in Feb 2021.
Round duration - 70 minutes
Round difficulty - Medium
Timing was 9:15AM. Platform was not very good. Questions were not well explained.
Given a specified number of intervals, where each interval is represented by two integers denoting its boundaries, the task is to merge all overlapping interv...
Merge overlapping intervals and return sorted list of merged intervals.
Identify overlapping intervals based on start and end times
Merge overlapping intervals to form new intervals
Sort the merged intervals in ascending order of start times
You need to determine all possible paths for a rat starting at position (0, 0) in a square maze to reach its destination at (N-1, N-1). The maze is represented as an N*N ma...
Find all possible paths for a rat in a maze from source to destination.
Use backtracking to explore all possible paths in the maze.
Keep track of visited cells to avoid revisiting them.
Recursively try moving in all directions (up, down, left, right) until reaching the destination.
Return the valid paths as a list of strings sorted in alphabetical order.
Tip 1 : Prepare maximum algorithms.
Tip 2 : Deep knowledge of data structure.
Tip 3 : OOPS is must.
Tip 1 : Keep it short.
Tip 2 : Mention only your own projects.
I appeared for an interview in Dec 2020.
Round duration - 120 minutes
Round difficulty - Easy
Given an array of integers ARR
of length N
and an integer Target
, your task is to return all pairs of elements such that they add up to the Target
.
The first line ...
Given an array of integers and a target, find all pairs of elements that add up to the target.
Iterate through the array and for each element, check if the target minus the element exists in a hash set.
If it exists, add the pair to the result. If not, add the element to the hash set.
Handle cases where the same element is used twice in a pair.
Return (-1, -1) if no pair is found.
Tip 1 : Have projects on your resume.
Tip 2 : Good to have internships
Tip 3 : Practice a lot
Tip 1 : Have good projects
Tip 2 : Have knowledge of everything you wrote
Top trending discussions
I applied via Company Website and was interviewed before Sep 2019. There were 5 interview rounds.
I applied via Referral and was interviewed before Aug 2021. There was 1 interview round.
Answer on how to list in react and the input box
Use the map function to create a list in React
Use the state to store the input value
Use onChange event to update the state when the input value changes
Use onSubmit event to handle the form submission
I applied via Walk-in and was interviewed in Jun 2024. There was 1 interview round.
Python technical SQL basic
I applied via Naukri.com and was interviewed before Oct 2023. There was 1 interview round.
Check if a string is the same forwards and backwards
Iterate through the string from both ends and compare characters
Use built-in functions like reverse() to check for palindrome
Ignore spaces and punctuation when checking for palindrome
I applied via Naukri.com and was interviewed in Dec 2024. There was 1 interview round.
Two dynamic programming challenges at the hard level on LeetCode and 10 medium-level SQL challenge.
I applied via Recruitment Consulltant and was interviewed in Jun 2024. There were 2 interview rounds.
Number system,30 min duration
Promises are objects representing the eventual completion or failure of an asynchronous operation.
Promises are used in JavaScript to handle asynchronous operations.
They can be in one of three states: pending, fulfilled, or rejected.
Promises can be chained together using .then() to handle success or failure.
They help avoid callback hell and make asynchronous code more readable.
Example: const myPromise = new Promise((res
HTML and CSS are languages used for creating and styling web pages.
HTML (Hypertext Markup Language) is used for structuring content on a web page.
CSS (Cascading Style Sheets) is used for styling the appearance of the content.
HTML uses tags to define elements like headings, paragraphs, images, and links.
CSS allows for customization of colors, fonts, layouts, and more.
Both HTML and CSS are essential for creating visually
I appeared for an interview before May 2021.
Round duration - 60 Minutes
Round difficulty - Easy
It was an coding round
Compute the skyline of given rectangular buildings in a 2D city, eliminating hidden lines and forming the outer contour of the silhouette when viewed from a distance. Each building is ...
Compute the skyline of given rectangular buildings in a 2D city, eliminating hidden lines and forming the outer contour of the silhouette.
Iterate through the buildings and create a list of critical points (x, y) where the height changes.
Sort the critical points based on x-coordinate and process them to form the skyline.
Merge consecutive horizontal segments of equal height into one to ensure no duplicates.
Return the fin...
You need to determine all possible paths for a rat starting at position (0, 0) in a square maze to reach its destination at (N-1, N-1). The maze is represented as an N*N ma...
Find all possible paths for a rat in a maze from source to destination.
Use backtracking to explore all possible paths in the maze.
Keep track of visited cells to avoid revisiting them.
Recursively try moving in all directions (up, down, left, right) until reaching the destination.
Return a list of strings representing valid paths sorted in alphabetical order.
Round duration - 30 Minutes
Round difficulty - Easy
It was an HR round with some general questions. it was just for formality.
Tip 1 : Stay focused
Tip 2 : Practice coding questions.
Tip 3 : View previous interviews of the companies
Tip 1 : Don't lie on resume
Tip 2 : Just write in format that is catchy
based on 1 review
Rating in categories
Business Development Associate
234
salaries
| ₹2.5 L/yr - ₹10 L/yr |
Marketing Associate
150
salaries
| ₹2 L/yr - ₹7 L/yr |
Business Development Executive
143
salaries
| ₹2 L/yr - ₹10 L/yr |
Online Tutor
73
salaries
| ₹1.5 L/yr - ₹7 L/yr |
Business Development Manager
58
salaries
| ₹5 L/yr - ₹15 L/yr |
BYJU'S
Vedantu
Whitehat jr
Unacademy