i
LambdaTest
Filter interviews by
There are 3 questions moderate one with topics like dp ( edit distance variant ), dequeue and hashing question. I cleared the test and move forward to interview round 1
Topological sort is a linear ordering of vertices in a directed acyclic graph.
Use Depth First Search (DFS) to visit each vertex and add it to the result list after visiting all its neighbors.
Maintain a visited set to keep track of visited vertices and a result list to store the sorted order.
If a cycle is detected during DFS, the graph is not a DAG and topological sort is not possible.
I applied via campus placement at Indian Institute of Information Technology (IIIT), Kota and was interviewed in Dec 2024. There were 2 interview rounds.
A 90-minute coding test on HackerRank, which includes one medium, one easy, and one hard question.
I applied via Company Website and was interviewed in May 2024. There were 2 interview rounds.
Some Objective questions and 1 Coding Questions
posted on 3 May 2024
I applied via campus placement at Sri Krishna College of Engineering and Technology, Coimbatore and was interviewed before May 2023. There were 3 interview rounds.
We had 21 questions including 3 coding questions. It was simple and beginners friendly questions
I applied via campus placement at National Institute of Technology (NIT), Warangal and was interviewed in Mar 2024. There were 3 interview rounds.
There were 3 questions in the online assessment.
1 - Binary Search
2 - DP
3 - Graphs
Implement a persistence stack with constant time operations
Use a combination of a stack and a hashmap to achieve constant time operations for push, pop, and get operations
Maintain a stack to store the elements and a hashmap to store the index of each element in the stack
When pushing an element, add it to the stack and update its index in the hashmap
When popping an element, remove it from the stack and also remove its i...
Finding the median of two sorted arrays and discussing OOPs basics
To find the median of two sorted arrays, merge the arrays and then calculate the median
OOPs basics include concepts like encapsulation, inheritance, polymorphism, and abstraction
Example: Median of [1, 3] and [2] is 2.0
I was interviewed in Apr 2022.
Round duration - 120 Minutes
Round difficulty - Medium
You are provided with a Binary Tree composed of 'N' nodes, each holding integer values. Your task is to compute the Inorder traversal of this binary tree.
For t...
The task is to find the in-order traversal of a given binary tree.
Implement a recursive function to perform in-order traversal of the binary tree
Start from the left subtree, then visit the root node, and finally visit the right subtree
Use an array to store the values of the nodes in the in-order traversal
Round duration - 50 minutes
Round difficulty - Medium
Interview on google meet
The inner join operation combines rows from two tables based on a common column (key).
Use the JOIN keyword in the SQL query to perform an inner join.
Specify the common column (key) in the ON clause of the join.
The result will contain only the matching rows from both tables.
Round duration - 50 minutes
Round difficulty - Medium
You are given an N * N matrix of integers where each row and each column is sorted in increasing order. Your task is to find the positi...
Given a sorted matrix, find the position of a target integer in the matrix.
Iterate through each row and column of the matrix
Compare the target integer with the current element
If the target integer is found, return the position
If the target integer is not found, return {-1, -1}
Tip 1 : Focus on data-structures and algorithms fundamentals
Tip 2 : Learn Javascript fundamentals for interviews
Tip 3 : Having good projects on resume is an added advantage
Tip 1 : Do not put false projects on resume.
Tip 2 : Have good projects on your resume
I was interviewed in Jan 2022.
Round duration - 3 Hours
Round difficulty - Hard
3 Coding questions ( 1 medium graph dfs based question , 2 hard level prefix array question ans 3 was a hard question which I don't remember)
2 Database question ( It mostly includes joining 2-3 tables and then you would be able to solve it)
You are provided with a 2-dimensional matrix having N
rows and M
columns, containing only 1s (land) and 0s (water). Your goal is to determine the number of islands in t...
We can use the flood fill algorithm to check for all connected 1s.
Given an array of integers, determine the contiguous subarray that produces the maximum product of its elements.
A subarray can be derived from th...
Steps:
O(1)
Constant space is u...
Round duration - 30 minutes
Round difficulty - Medium
These rounds depends on the type of interviewer.
My friends were asked questions from DSA but from me they asked a lot of questions on Node.JS and React.
Round duration - 30 Minutes
Round difficulty - Medium
This round depends on your interviewer.
My colleagues were asked questions from DS but my interviewer focused just on javascript.
Round duration - 45 minutes
Round difficulty - Easy
It was a managerial round they will test your communication and how well do you handle situations in your life
Tip 1 : just be confident and communicate with them
Tip 1 : Cpanies like SpringWorks are more focused on Development so make sure you have good knowledge in Javascript
Tip 2 : Complete 100-150 questions easy/medium questions on leetcode like 3 sum or invert binary tree
Tip 3 : Have a good knowledge of any RDBMS.
Tip 1 : Make sure your resume is not filled with lots of colors try to give it a simple look
Tip 2 : Mention only those skills in which you have minimum intermediate knowledge ex if you know docker but haven't used it nicely then just don't mention it
I was interviewed in Jan 2022.
Round duration - 90 minutes
Round difficulty - Medium
3 DSA questions, 2 SQL questions
On the DoSelect platform, which was good
Given 'N' 2-dimensional matrices and an array ARR
of length N + 1
, where the first N
integers denote the number of rows in each matrix and the last integer represents t...
It was a straightforward application of the matrix multiplication approach of DP
Hashing is a technique to map large non-negative integers to smaller indices using a hash function. In the context of collision resolution in hash tables, 'Linear Probing' is emp...
The approach is pretty simple. We just need to find the mapping index and if it is occupied, we need to search for the next available index.
The algorithm for the same is as follows:
Round duration - 60 minutes
Round difficulty - Easy
Started off with introductions and projects related questions.
Basic javascript and CSS property-related questions.
An easy DSA question
You are given an array of integers 'ARR' with a length 'N' and a specific integer 'Target'. Your objective is to determine and return all pairs of elements within the array whos...
Round duration - 45 minutes
Round difficulty - Easy
Introduction and two easy to medium DSA questions
Your task is to implement a queue using two stacks. You are provided with ‘Q’ queries and need to handle them, where each query falls under one of these two operations:
...In this approach, we make sure that the oldest element added to the queue stays at the top of the stack, the second oldest below it and so on. To achieve this, we will need two stacks.
First stack('STK1') is the main stack being used to store the data, while the second stack('STK2') is to assist and store data temporarily during various operations.
Following steps will...
Convert a string representing a Roman numeral into its integer equivalent and return the result.
Roman numerals are represented by seven different symbol...
The key idea is to follow the rules of roman numbers which are as follows:
Tip 1 : Be thorough with your projects
Tip 2 : Have a good understanding of the basics of CSS, React.js, and Node.js
Tip 1 : MERN Stack projects
Tip 2 : Past internships
I was interviewed in Mar 2021.
Round duration - 150 minutes
Round difficulty - Medium
You can give the test any time. Environment was not very well. Questions were not well explained.
You are given the task of reconstructing the address of an Internet resource from a given format.
The address format is: <protocol>://<domain>.ru[/<c...
The task is to extract and print the internet resource address from a given string.
The internet resource address has a specific format:
The
The
The
If
Given an undirected graph as an adjacency matrix and an integer M
, determine whether you can color the vertices of the graph using at most M
colors such that no two adjacent v...
The problem is to determine if it is possible to color the vertices of an undirected graph using at most M colors such that no two adjacent vertices have the same color.
The input consists of the number of test cases, the number of vertices and colors, and the adjacency matrix of the graph.
For each test case, check if it is possible to assign colors to the vertices such that no adjacent vertices have the same color.
Use ...
You are given ‘N’ fences. Your task is to compute the total number of ways to paint these fences using only 2 colors, such that no more than 2 adjacent fences have the sa...
The task is to find the total number of ways to paint fences using 2 colors such that at most 2 adjacent fences have the same color.
Use dynamic programming to solve the problem
Create a 2D array to store the number of ways to paint the fences
Initialize the base cases for the first two fences
Use recurrence relation to calculate the number of ways for the remaining fences
Return the result modulo 10^9 + 7
Tip 1 : Data Structures in must.
Tip 2 : Practice SQL queries.
Tip 3 : DBMS knowledge will be beneficial.
Tip 1 : Keep it short.
Tip 2 : Have some projects on resume.
I was interviewed in Mar 2021.
Round duration - 150 minutes
Round difficulty - Easy
You can give the test any time. Environment was not very well. Questions were not well explained.
You are given a string WORD
consisting of lowercase alphabets. Your task is to divide WORD
into N
strings of equal length.
The first line contains an integer 'T' r...
You have been given a set of 'N' houses, each house can be painted using one of three colors: green, red, or yellow. A cost matrix is provided with dimensions 'N' * 3, where ...
Tip 1 : Data Structures in must.
Tip 2 : Practice SQL queries.
Tip 3 : DBMS knowledge will be beneficial.
Tip 1 : Keep it short.
Tip 2 : Have some projects on resume.
based on 1 interview
Interview experience
based on 1 review
Rating in categories
Member Technical Staff
18
salaries
| ₹8 L/yr - ₹29.2 L/yr |
Solution Engineer
14
salaries
| ₹6.5 L/yr - ₹18.2 L/yr |
Software Engineer
12
salaries
| ₹11.5 L/yr - ₹35 L/yr |
Senior Member of Technical Staff
11
salaries
| ₹12.1 L/yr - ₹38.5 L/yr |
Senior Software Engineer
11
salaries
| ₹10.9 L/yr - ₹26.3 L/yr |
BrowserStack
QASource
SmartBear
Sauce Labs