Filter interviews by
I applied via Referral and was interviewed before Jul 2023. There were 3 interview rounds.
By interview Vector , 2 coding questions
I applied via Referral and was interviewed before Aug 2023. There were 4 interview rounds.
Had questions on graph
I appeared for an interview in May 2022.
Round duration - 90 minutes
Round difficulty - Easy
There will be 2 coding questions easy to medium based on DP and linkedlist.
You are given a number of stairs, N
. Starting at the 0th stair, you need to reach the Nth stair. Each time you can either climb one step or two steps. ...
The problem involves finding the number of distinct ways to climb to the N-th stair by taking one or two steps at a time.
Use dynamic programming to solve this problem efficiently.
The number of ways to reach the N-th stair is the sum of the number of ways to reach the (N-1)th stair and the (N-2)th stair.
Handle large inputs by taking modulo 10^9+7 of the result.
Example: For N=3, there are 3 ways to climb to the third sta
Round duration - 60 minutes
Round difficulty - Easy
the questions will be be based on trees, linked list and stacks and queues, DP
Given a binary tree, your task is to print the left view of the tree. The left view of a binary tree contains the nodes visible when the tree is viewed from the left side.
The task is to print the left view of a binary tree, which contains the nodes visible when the tree is viewed from the left side.
Traverse the tree level by level and keep track of the leftmost node at each level
Use a queue for level order traversal and a map to store the leftmost nodes
Print the values of the leftmost nodes stored in the map as the left view of the tree
You are given an array arr
of length N
. For each element in the array, find the next greater element (NGE) that appears to the right. If there is no such greater ele...
The task is to find the next greater element for each element in an array to its right, if no greater element exists, return -1.
Use a stack to keep track of elements for which the next greater element is not found yet.
Iterate through the array from right to left and pop elements from the stack until a greater element is found.
Store the next greater element for each element in a separate array.
If the stack is empty afte...
Round duration - 60 minutes
Round difficulty - Medium
(DSA, work experience and personal projects)
Given an array/list ARR
consisting of integers where each element is either 0, 1, or 2, your task is to sort this array in increasing order.
The input sta...
Sort an array of 0s, 1s, and 2s in increasing order.
Use a three-pointer approach to partition the array into sections of 0s, 1s, and 2s.
Iterate through the array and swap elements based on their values to achieve the sorting.
Time complexity should be O(N) where N is the number of elements in the array.
Round duration - 60 minutes
Round difficulty - Medium
It started in the afternoon after the lunch.
Approach to low-level system design involves understanding requirements, breaking down components, defining interfaces, and optimizing performance.
Understand the requirements and constraints of the system
Break down the system into smaller components/modules
Define clear interfaces between components for communication
Optimize performance by considering data structures, algorithms, and resource utilization
Round duration - 25 minutes
Round difficulty - Easy
Once all the rounds were cleared. I was told that i have 1 more round with manager.
I remain calm, assess the situation, prioritize tasks, communicate effectively, and collaborate with team members to find a solution.
Remain calm and composed under pressure
Assess the situation to understand the root cause
Prioritize tasks based on urgency and impact
Communicate effectively with team members and stakeholders
Collaborate with team members to brainstorm and implement solutions
Tip 1 : If you are good with any programming Language(Java and C++ preferred but again its your choice) start with DSA directly. Learn the basic Arrays, Linked List, Stacks, Queues, Trees, Hashing, Graphs, Dynamic programming, Heaps, searching and sorting. (PS:-Courses and resources i will not mention as there are many materials available just choose the one you like and start preparing!!)
Tip 2 : Once you feel OK start practising problems try to solve by yourself, if not take hints, and at the end you can check solution if still unsolved.
Tip 3 : Try to connect with people on linkedin. Try to know the techstacks and try to get referrals. Keep on applying once feel ready 80% because you are never 100% ready for anything.
Tip 1 : Keep your resume updated with all the tech stacks you worked on, your projects, your latest experience.
Tip 2 : The resume need to be short and crisp. it takes only a min. For HR to read your resume. and align it with job requirement.
I appeared for an interview in May 2022.
Round duration - 75 minutes
Round difficulty - Medium
There were 2 coding questions. One was easy to medium difficult and other was of medium difficulty.
Given two arrays arr
and queries
, your task is to determine the sum of all elements in arr
that are less than or equal to each element in queries
. The array arr
is provided i...
Find sum of elements in a sorted array less than or equal to each element in queries.
Iterate through queries and for each query, find the sum of elements in arr less than or equal to the query element.
Use binary search to efficiently find the index of the last element less than or equal to the query element.
Keep track of cumulative sum while iterating through arr to avoid recalculating sums.
Return the list of sums for
Given a sorted array 'A' of length 'N', and two integers 'K' and 'X', your task is to find 'K' integers from the array closest to 'X'. If two integers are at the same distance, pre...
Given a sorted array, find K integers closest to X, preferring smaller ones in case of same distance.
Use binary search to find the closest element to X in the array.
Maintain two pointers to expand around the closest element to find K closest elements.
Compare distances and values to select the K closest elements, preferring smaller ones if distances are equal.
Round duration - 60 Minutes
Round difficulty - Easy
You are given a string S
. The task is to reverse the letters of the string while keeping non-alphabet characters in their original position.
S = "...
Reverse the letters of a string while keeping non-alphabet characters in their original position.
Iterate through the string and store the non-alphabet characters in their original positions.
Reverse the letters of the string using two pointers approach.
Combine the reversed letters with the non-alphabet characters to get the final reversed string.
Given a binary tree with ‘root’, your task is to find and return the sum of all the left leaf nodes.
1 2 3 4 -1 5 6 -1 7 -1 -1 -1 -1 -1...
Find and return the sum of all the left leaf nodes in a binary tree.
Traverse the binary tree using depth-first search (DFS)
Check if a node is a leaf node and a left child
Sum up the values of all left leaf nodes
Round duration - 60 Minutes
Round difficulty - Easy
Questions related to Java, OOPs, SQL etc.
Round duration - 60 Minutes
Round difficulty - Easy
It was an HR round.Questions related to resume, Low level design, work experience, behavioural etc. This round stretched more than scheduled time so another round was scheduled which was again a DSA based technical round.
Round duration - 60 Minutes
Round difficulty - Medium
This round had 3 problems. easy, medium and hard.
Given two sorted arrays A
and B
of sizes N
and M
, find the median of the merged array formed by combining arrays A
and B
. If the total number of elements, N + M
, is even, the m...
Find the median of two sorted arrays by merging them and calculating the median of the combined array.
Merge the two sorted arrays into one sorted array.
Calculate the median of the combined array based on the total number of elements.
Return the median as the result.
Given an alphabetical string S
, determine whether it is a palindrome or not. A palindrome is a string that reads the same backward as forward.
The first line ...
Check if a given string is a palindrome or not.
Iterate through the string from both ends and compare characters.
If all characters match, return 1 indicating a palindrome.
If any characters don't match, return 0 indicating not a palindrome.
You have been provided a string STR
. Your task is to find and return the minimum number of characters that need to be deleted from STR
so that each character's...
Find the minimum number of character deletions needed to make each character's frequency unique in a given string.
Iterate through the string and count the frequency of each character.
Identify characters with the same frequency and calculate the minimum deletions needed to make them unique.
Return the total minimum deletions for each test case.
Tip 1 : Practice Daily. Consistency is the key
Tip 2 : Try to do at least 5 questions daily (LC, gfg, etc any platform u are comfortable with)
Tip 3 : Have some projects on resume related to the tech stack you want to work with.
Tip 1 : Have some projects on resume.
Tip 2 : Be prepared with in depth questions on whatever is written on resume
I appeared for an interview before May 2021.
Round duration - 50 minutes
Round difficulty - Easy
Problem-solving round in javascript.
Asked me questions of easy to medium level data structures and algorithm.
Two strings S1
and S2
are considered similar if either S1
equals S2
or we can swap two letters of S1
at different positions so that it equals S2
.
The first...
The problem involves determining the number of similar string groups in a given list of strings based on a specific criteria.
Iterate through each pair of strings in the list and check if they are similar based on the given criteria.
Use a hash set to keep track of visited strings to avoid counting duplicates in the same group.
Consider implementing a function to check if two strings are similar by allowing at most one sw...
Round duration - 50 minutes
Round difficulty - Medium
Javascrip specific questions
Round duration - 50 minutes
Round difficulty - Easy
Focussed on behavioural aptitude
Tip 1 : Prepare the concepts of JavaScript and react thoroughly
Tip 2 : Practice using projects
Tip 3 : Practice data structure and algorithms and practice there questions
Tip 1 : Use keywords in technologies where you want to be shortlisted in
Tip 2 : Do not put false things in your resume
I appeared for an interview before Jan 2021.
Round duration - 90 minutes
Round difficulty - Medium
It was conducted in Hacker rank which consisted of 10 aptitude questions that included C, C++, Java MCQ. 2 programming questions were also given.
Given an N x M
matrix filled with integers, determine the minimum sum obtainable from a path that starts at a specified cell (x, y)
and ends at the top left corner of t...
The problem involves finding the minimum sum path from a specified cell to the top left corner of a matrix.
Start from the specified cell and calculate the minimum sum path to reach the top left corner using dynamic programming.
Consider the three possible moves: down, right, and down-right diagonal.
Keep track of the minimum sum at each cell and update it based on the minimum of the three possible moves.
Finally, the mini...
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 closing parentheses if the number of open parentheses is greater than the number of clo...
Round duration - 60 minutes
Round difficulty - Medium
Technical round with questions based on data structures, oops and networking.
Create a program that counts and prints the total number of specific character types from user input. Specifically, you need to count lowercase English alphabets, numeric digi...
Create a program to count lowercase alphabets, digits, and white spaces from user input until '$' is encountered.
Read characters from input stream until '$' is encountered
Count lowercase alphabets, digits, and white spaces separately
Print the counts of each character type as three integers separated by spaces
Given an unsorted array containing 'N' integers, you are required to find 'K' largest elements from the array and return them in non-decreasing order.
The fir...
Find K largest elements in an unsorted array and return them in non-decreasing order.
Sort the array in non-decreasing order.
Return the last K elements of the sorted array.
To check internet connection on a system, you can use various methods like pinging a website or checking network status.
Use ping command to check connectivity to a website (e.g. ping www.google.com)
Check network status using network settings or command line tools
Try accessing a website or online service to verify internet connection
When you type a URL in a web browser, the browser sends a request to the server hosting the website, which then responds with the necessary files to display the webpage.
Browser checks cache for DNS resolution
If not found, browser sends a DNS query to resolve the domain name to an IP address
Browser establishes a TCP connection with the server
Browser sends an HTTP request to the server for the webpage
Server processes the...
Round duration - 60 minutes
Round difficulty - Medium
Technical round with questions based on data structures, oops and networking.
Ninja is learning about sorting algorithms, specifically those that do not rely on comparisons. Can you help Ninja implement the counting sort algorithm?
Implement counting sort algorithm to sort an array of integers without comparisons.
Count the frequency of each element in the input array.
Calculate the prefix sum of frequencies to determine the position of each element in the sorted array.
Place each element in its correct position based on the prefix sum.
Time complexity of counting sort is O(n+k), where n is the number of elements and k is the range of input.
Example: ...
The Fibonacci series has applications in various fields such as mathematics, computer science, art, and nature.
Used in algorithms for optimization problems and dynamic programming.
Found in nature, such as the arrangement of leaves on a stem, the branching of trees, and the spiral shapes of shells.
Applied in financial markets for predicting stock prices and analyzing market trends.
Utilized in art and design for creating
Round duration - 30 minutes
Round difficulty - Easy
HR round where the interviewer asked questions to know more about me.
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
I appeared for an interview before Jan 2021.
Round duration - 60 minutes
Round difficulty - Easy
Technical Interview Round with questions based on Data structures, OOPS and SQL.
You are provided with a linked list of integers. Your task is to implement a function that deletes a node located at a specified position 'POS'.
The first line co...
Implement a function to delete a node from a linked list at a specified position.
Traverse the linked list to find the node at the specified position.
Update the pointers of the previous and next nodes to skip the node to be deleted.
Handle edge cases such as deleting the head or tail of the linked list.
Ensure to free the memory of the deleted node to avoid memory leaks.
SQL query to find the nth highest salary
Use the ORDER BY clause to sort salaries in descending order
Use the LIMIT and OFFSET clauses to skip the first n-1 highest salaries
Combine the above steps in a single query to find the nth highest salary
OOP is a programming paradigm based on the concept of objects, which can contain data in the form of fields and code in the form of procedures.
OOP focuses on creating objects that interact with each other to solve problems.
Key concepts include encapsulation, inheritance, and polymorphism.
Encapsulation involves bundling data and methods that operate on the data into a single unit.
Inheritance allows classes to inherit at...
Round duration - 60 minutes
Round difficulty - Easy
Was asked me about my favorite technologies, What i liked about Facebook. And asked me to design a cinema ticket reservation web site like the one satyam has.
Given an array containing N
distinct positive integers and a number K
, determine the Kth largest element in the array.
N = 6, K = 3, array = [2, 1, 5, 6, 3, ...
Find the Kth largest element in an array of distinct positive integers.
Sort the array in non-increasing order and return the Kth element.
Handle multiple test cases efficiently.
Ensure all elements in the array are distinct.
Virtual functions are functions in a base class that are overridden in derived classes to achieve runtime polymorphism.
Virtual functions are declared in a base class with the 'virtual' keyword.
They are overridden in derived classes using the 'override' keyword.
They allow a function to be called based on the runtime type of an object.
Virtual functions enable dynamic binding and late binding in C++.
Example: virtual void ...
Design a Cinema Ticket Reservation System
Use a database to store movie information, showtimes, and seat availability
Allow users to search for movies, select showtimes, and choose seats
Implement a payment system for ticket purchases
Send confirmation emails with QR codes for ticket validation
You can find a defective ball among 10 given balls in 2 attempts using a two-pan balance scale.
Divide the 10 balls into two groups of 5 each.
Weigh the two groups on the balance scale.
If one group is heavier, it contains the defective ball. If they are equal, the defective ball is in the remaining 5 balls.
Divide the group of 5 balls with the defective one into two groups of 2 and 3 balls.
Weigh the two groups on the bala...
Round duration - 30 minutes
Round difficulty - Easy
HR round that lasted for about 30 minutes. The interviewer asked me questions to know more about me and a puzzle.
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
I appeared for an interview before Jan 2021.
Round duration - 60 minutes
Round difficulty - Easy
I couldn't find an optimal approach to the first question, so she skipped that question and proceeded to next questions. Remaining questions I have answered satisfactorily.
Given an array/list of positive integers and an integer K, determine if there exists a subset whose sum equals K.
Provide true
if such a subset exists, otherwise r...
Given an array of positive integers and an integer K, determine if there exists a subset whose sum equals K.
Use dynamic programming to solve this problem efficiently
Create a 2D array to store if a subset with a particular sum exists
Iterate through the array and update the 2D array accordingly
Check if the value at the end of the iteration is true for the given K
Given an undirected and disconnected graph G(V, E) where V vertices are numbered from 0 to V-1, and E represents edges, your task is to output the BFS traversal starting from the ...
BFS traversal in a disconnected graph starting from vertex 0.
Implement BFS algorithm to traverse the graph starting from vertex 0.
Use a queue to keep track of visited nodes and their neighbors.
Ensure to print the traversal sequence in the correct order.
Handle disconnected components by checking for unvisited nodes.
Follow the BFS approach of exploring neighbors before moving to the next level.
Round duration - 60 minutes
Round difficulty - Easy
I told that my strength is problem solving and I can always find a way when there is a bottle-neck. Gave some examples of my experiences while doing my assignments.
Given a string STR
consisting of words separated by spaces, your task is to replace all spaces between words with the characters "@40".
The first line contains an integ...
Replace spaces in a string with '@40'.
Iterate through each character in the string
Replace spaces with '@40'
Return the modified string
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
I applied via Company Website and was interviewed before Sep 2020. There were 5 interview rounds.
I applied via Referral and was interviewed in Sep 2020. There was 1 interview round.
based on 1 interview
Interview experience
Software Engineer
6
salaries
| ₹15 L/yr - ₹35 L/yr |
Software Developer
5
salaries
| ₹9 L/yr - ₹30 L/yr |
Senior Software Engineer
5
salaries
| ₹29 L/yr - ₹38 L/yr |
QA Engineer
4
salaries
| ₹3.5 L/yr - ₹12 L/yr |
Software Development Engineer II
4
salaries
| ₹25 L/yr - ₹45 L/yr |
Groww
Zerodha
Upstox
Paytm Money