Filter interviews by
It's hard to solve but try better
It's completely on tree algorithms
I was interviewed in Dec 2021.
Round duration - 90 minutes
Round difficulty - Medium
Some aptitude questions are there and 2 problem solving questions
Given an integer N
representing the number of pairs of parentheses, find all the possible combinations of balanced parentheses using the given number of pairs.
Generate all possible combinations of balanced parentheses for a given number of pairs.
Use backtracking to generate all possible combinations of balanced parentheses.
Keep track of the number of open and close parentheses used in each combination.
Recursively generate combinations by adding open parentheses if there are remaining, and close parentheses if the number of open parentheses is greater than the number of close
Round duration - 50 Minutes
Round difficulty - Medium
Interviewer discussed some dsa questions which was in a 1 st round and gave me some problems to solve
Given a string input of length 'n', your task is to determine the length of the longest substring that contains no repeating characters.
A substri...
Find the length of the longest substring with unique characters in a given string.
Use a sliding window approach to keep track of the longest substring without repeating characters.
Use a hashmap to store the index of each character in the string.
Update the start index of the window when a repeating character is encountered.
Calculate the maximum length of the window as you iterate through the string.
Round duration - 20 minutes
Round difficulty - Easy
HR asked me some managerial questions.
Tip 1 : Practice Data Structures
Tip 2 : Do some awesome industry level projects
Tip 3 : Be confident during interview
Tip 1 : Add projects with GitHub links in projects
Tip 2 : Add only those things which will help you during interview
Top trending discussions
Medium leveln coding round
I applied via LinkedIn and was interviewed in Nov 2023. There were 3 interview rounds.
Mcq + dsa JavaScript questions
Print unique numbers in list
Iterate through the list and store each number in a set to keep track of unique numbers
Print out the numbers in the set to display the unique numbers
I applied via LinkedIn and was interviewed in Sep 2021. There was 1 interview round.
Spring is a framework for building Java applications, while Spring Boot is a tool for quickly creating Spring-based applications.
Spring provides a comprehensive framework for building Java applications, while Spring Boot is a tool that simplifies and accelerates the process of creating Spring-based applications.
Spring requires more configuration and setup, while Spring Boot provides a pre-configured environment that re...
A program to check if two strings are anagrams of each other.
Create two character arrays from the input strings
Sort the arrays
Compare the sorted arrays to check if they are equal
Using Streams API to filter and map an array of strings
Create a stream from the array using Arrays.stream()
Use filter() to select elements that meet a certain condition
Use map() to transform each element into a new value
Use toArray() to convert the stream back into an array
REST API is a web service that uses HTTP requests to access and manipulate data.
REST stands for Representational State Transfer
It is an architectural style for building web services
It uses HTTP methods like GET, POST, PUT, DELETE to perform operations on resources
It is stateless and can be cached
It returns data in various formats like JSON, XML, etc.
I was interviewed in Oct 2021.
Round duration - 105 minutes
Round difficulty - Medium
There were 3 problems .
One was easy but the other two were of medium level.
Given an array representing positions of stalls and an integer ‘K’ representing the number of aggressive cows, determine the largest minimum distance between any two cows ...
The problem requires assigning aggressive cows to stalls in a way that maximizes the minimum distance between any two cows.
Sort the array of stall positions in ascending order.
Use binary search to find the largest minimum distance between cows.
Check if it is possible to assign cows with this minimum distance by iterating through the sorted array.
If it is possible, update the maximum distance and continue binary search ...
The city of Ninjaland is represented as an unweighted graph with houses and roads. There are 'N' houses numbered 1 to 'N', connected by 'M' bidirectional roads. A road...
The problem is to find the shortest path between two houses in an unweighted graph.
The graph represents the city of Ninjaland with houses connected by roads.
The input consists of the number of test cases, number of houses and roads, starting and ending house, and the roads between houses.
The output is a vector of nodes representing the shortest path from the starting house to the ending house.
If there are multiple shor...
Given a positive integer N
, compute the total number of '1's in the binary representation of all numbers from 1 to N. Return this count modulo 1e9+7 because the result can...
The task is to count the total number of '1' in the binary representation of all numbers from 1 to N.
Convert each number from 1 to N into its binary representation
Count the number of '1' bits in each binary representation
Sum up the counts of '1' bits for all numbers
Return the sum modulo 1e9+7
Round duration - 60 minutes
Round difficulty - Easy
The interviewer was very polite and straightforward.
Firstly he introduced himself and then asked me to introduce myself and then he jumped to the coding problems.
After the coding problems, he asked some questions from the OS and DBMS.
You are given a string of length N
. Your task is to reverse the string word by word. The input may contain multiple spaces between words and may have leading o...
The task is to reverse the words in a given string, removing any leading or trailing spaces and replacing multiple spaces between words with a single space.
Split the string into words using spaces as delimiters
Reverse the order of the words
Join the reversed words with a single space between them
Remove any leading or trailing spaces
You are provided with a linked list containing 'N' nodes and an integer 'K'. The task is to reverse the linked list in groups of size K, which means reversing the nodes ...
The task is to reverse a linked list in groups of size K.
Iterate through the linked list in groups of size K
Reverse each group using a helper function
Connect the reversed groups to form the final reversed linked list
Round duration - 60 minutes
Round difficulty - Medium
The interviewer was very polite and straightforward, firstly he introduce himself and then ask me to introduce myself and then ask some ques on my projects and then he jumps to the coding problems.
Given a string STR
consisting of both lower and upper case characters, your task is to remove consecutive duplicate characters from the string a...
The task is to remove consecutive duplicate characters from a given string and return the new string.
Iterate through the characters of the string
Compare each character with the next character
If they are the same, skip the next character
If they are different, add the current character to the new string
Return the new string
Given an N*M matrix filled with integer numbers, determine the maximum sum that can be obtained from a path starting from any cell in the first row to any cell in the last row...
The question asks to find the maximum sum that can be obtained from a path starting from any cell in the first row to any cell in the last row of a given matrix.
Iterate through each cell in the first row and calculate the maximum sum path ending at that cell
For each cell, calculate the maximum sum path ending at that cell by considering the three possible directions
Store the maximum sum path ending at each cell in a se...
Tip 1 : Deep knowledge of the projects mentioned in your resume is a must.
Tip 2 : Practice must do GFG coding questions.
Tip 3 : Practice as many problems as you can from Leetcode.
Tip 1 : Mention 1 or 2 projects in your resume.
Tip 2 : Don't put false things in your resume.
I applied via Approached by Company and was interviewed in Jan 2024. There were 3 interview rounds.
It was mostly on JavaScript
I applied via Approached by Company and was interviewed before Apr 2023. There were 2 interview rounds.
based on 1 interview
Interview experience
based on 15 reviews
Rating in categories
Product Development Engineer
205
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
114
salaries
| ₹0 L/yr - ₹0 L/yr |
Product Development Engineer 2
91
salaries
| ₹0 L/yr - ₹0 L/yr |
Product Development Engineer 1
75
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
32
salaries
| ₹0 L/yr - ₹0 L/yr |
Talentica Software
TalentSprint
TALENTEDGE
PeopleStrong