Filter interviews by
I appeared for an interview in Jul 2021.
Round duration - 30 Minutes
Round difficulty - Easy
MCQ Challenge was to test basic computer fundamentals. The quiz had 30 questions to be attempted in 25 minutes consisting questions related to Data structures and algorithm, OOPS, OS, DBMS and some questions to find the output of Java Program.
Platform was fast and responsive, and we were not allowed to switch through tabs during the test.
Given the root node of a binary tree with N
nodes, where each node contains integer values, determine the maximum depth of the tree. The depth is defined a...
Find the maximum depth of a binary tree given its level order traversal.
Traverse the tree level by level and keep track of the depth using a queue data structure.
For each level, increment the depth by 1 until all nodes are processed.
Return the maximum depth encountered during traversal as the final result.
Example: For input [5, 10, 15, 20, -1, 25, 30, -1, 40, -1, -1, -1, -1, 45], the maximum depth is 7.
Round duration - 90 minutes
Round difficulty - Hard
90 minutes is what we get to present a logical coding solution to the challenge presented to us. There were 2 coding questions and we can submit the answer as many times we want. There were hidden test cases and after submitting we could only see the score.
You are given an array/list of integers with length 'N'. A sliding window of size 'K' moves from the start to the end of the array. For each of the 'N'-'K'+1 possi...
Sliding window maximum problem where we find maximum element in each window of size K.
Use a deque to store indices of elements in decreasing order within the window.
Pop elements from the deque that are out of the current window.
Add the maximum element to the result for each window.
Given a string (STR
) of length N
, you are tasked to create a new string through the following method:
Select the smallest character from the first K
characters of STR
, remov...
Given a string, select smallest character from first K characters, remove it, and append to new string until original string is empty.
Iterate through the string, selecting the smallest character from the first K characters each time.
Remove the selected character from the original string and append it to the new string.
Repeat the process until the original string is empty.
Return the final new string formed after the ope
Round duration - 40 Minutes
Round difficulty - Medium
It was the first technical round conducted on Zoom held for about 40 min. The video was enabled for this round. Computer fundamentals and problem solving was checked in this round.
You are given an array of N elements that represent the digits of a number. You can perform one swap operation to exchange the values at any two indices. Your task is to de...
Given an array of digits, find the maximum number that can be achieved by performing at most one swap.
Iterate through the array to find the maximum digit.
If the maximum digit is already at the beginning, find the next maximum digit and swap them.
If the maximum digit is not at the beginning, swap it with the digit at the beginning.
Given an array Arr
consisting of N integers, your task is to find the equilibrium index of the array.
An index is considered as an equilibrium index if the sum of elem...
Find the equilibrium index of an array where sum of elements on left equals sum on right.
Iterate through the array and calculate prefix sum and suffix sum at each index.
Compare prefix sum and suffix sum to find equilibrium index.
Return the left-most equilibrium index found.
Round duration - 30 Minutes
Round difficulty - Easy
It was the first technical round conducted on Zoom held for about 40 min. The video was enabled for this round.
Given an array of integers with numbers in random order, write a program to find and return the number which appears the most frequently in the array.
If multip...
Find the number with the maximum frequency in an array of integers.
Create a hashmap to store the frequency of each element in the array.
Iterate through the array to update the frequency count.
Find the element with the maximum frequency and return it.
If multiple elements have the same maximum frequency, return the one with the lowest index.
Round duration - 30 Minutes
Round difficulty - Easy
This was the final round held for about 30 min on Zoom. My video was enabled all the time and basic HR questions were being asked.
Tip 1 : Make sure you have your computer science fundamentals very clear.
Tip 2 : Should know the complexity of code you write and should know the internal implementation of data structure you use while coding.
Tip 3 : Should know about everything you write in resume.
Tip 4: Practice a lot of programming problems. Participate in competitive programming contests.
Tip 1 : Be honest about what you write in resume.
Tip 2 : Should have at least 2 projects
Tip 3 : Maintain a precise and self speaking one page resume.
Tip 4 : Add technical achievements only.
I appeared for an interview in Sep 2021.
Round duration - 50 Minutes
Round difficulty - Medium
Standard Data Structures and Algorithms round . One has to be fairly comfortable in solving algorithmic problems to pass this round with ease.
You are given an integer array 'ARR' of size 'N' and an integer 'S'. Your task is to find and return a list of all pairs of elements where each sum of a pair equals 'S'.
Find pairs of elements in an array that sum up to a given value, sorted in a specific order.
Iterate through the array and for each element, check if the complement (S - current element) exists in a hash set.
If the complement exists, add the pair to the result list.
Sort the result list based on the criteria mentioned in the question.
Return the sorted list of pairs.
Given a sorted array of length N
, your task is to construct a balanced binary search tree (BST) from the array. If multiple balanced BSTs are possible, you ca...
Construct a balanced binary search tree from a sorted array.
Create a recursive function to construct the BST by selecting the middle element as the root.
Recursively construct the left subtree with elements to the left of the middle element and the right subtree with elements to the right.
Ensure that the constructed tree is balanced by maintaining the height difference of left and right subtrees at most 1.
Round duration - 50 Minutes
Round difficulty - Medium
Again a DSA specific round , where I was given two problems to solve ranging from Medium to Hard. Major topics discussed were Binary Trees and Dynamic Programming.
You are given a Binary Tree of integers. Your task is to determine and return the top view of this binary tree.
The top view of a binary tree consists of all th...
The task is to determine and return the top view of a given Binary Tree of integers.
The top view of a binary tree consists of all the nodes visible when the tree is viewed from the top.
Identify the nodes that appear on the top when looking from above the tree.
Output the top view as a space-separated list of node values from left to right.
Bob and his wife are in the famous 'Arcade' mall in the city of Berland. This mall has a unique way of moving between shops using trampolines. Each shop is laid out in a st...
Find the minimum number of jumps Bob needs to make from shop 0 to reach the final shop, or return -1 if impossible.
Use a greedy approach to keep track of the farthest reachable shop from the current shop.
If at any point the current shop is not reachable, return -1.
Update the current farthest reachable shop as you iterate through the array.
Round duration - 50 Minutes
Round difficulty - Medium
This round majorly focused on past projects and experiences from my Resume and some standard System Design + LLD questions + some basic OS questions which a SDE-2 is expected to know .
Design a URL shortener system to generate short URLs for long URLs.
Use a unique identifier for each long URL to generate a short URL.
Store the mapping of short URL to long URL in a database.
Implement a redirection mechanism to redirect short URLs to their corresponding long URLs.
Use multiple threads to print numbers from 1 to 100 in an optimized approach.
Divide the range of numbers (1-100) among the threads to avoid overlap.
Use synchronization mechanisms like mutex or semaphore to ensure proper order of printing.
Implement a logic where each thread prints its assigned numbers in sequence.
Consider using a thread pool to manage and optimize thread creation and execution.
Example: Thread 1 prints n...
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 in Mar 2021.
Round duration - 60 Minutes
Round difficulty - Medium
Standard Data Structures and Algorithms round . One has to be fairly comfortable in solving algorithmic problems to pass this round with ease.
You are provided with an array, ARR
, of N
positive integers. Each integer represents the length of a stick. The task is to connect all sticks into one by paying a cost to jo...
Find the minimum cost to connect all sticks into one by joining two sticks at a time.
Sort the array of stick lengths in non-decreasing order.
Keep adding the two smallest sticks at a time to minimize cost.
Repeat until all sticks are connected into one.
Bob and his wife are in the famous 'Arcade' mall in the city of Berland. This mall has a unique way of moving between shops using trampolines. Each shop is laid out in a st...
Find the minimum number of jumps Bob needs to make from shop 0 to reach the final shop, or return -1 if impossible.
Use BFS to traverse through the shops and keep track of the minimum jumps needed to reach each shop.
If at any point the current shop has Arr[i] = 0, return -1 as it is impossible to reach the final shop.
Return the minimum number of jumps needed to reach the last shop.
Example: For the input [5, 3, 2, 1, 0, ...
Round duration - 70 Minutes
Round difficulty - Hard
This round was preety intense and went for over 1 hour . I was asked 2 preety good coding questions (one was from Graphs and the other one was from DP) . After that I was grilled on my Computer Networks concepts but luckily I was able to answer all the questions and the interviewer was also quite impressed .
Determine if a given graph is bipartite. A graph is bipartite if its vertices can be divided into two independent sets, 'U' and 'V', such that every edge ('u', 'v') conne...
Check if a given graph is bipartite by dividing its vertices into two independent sets.
Create two sets 'U' and 'V' to store vertices based on their connections
Use BFS or DFS to traverse the graph and assign vertices to sets
Check if any edge connects vertices within the same set, if yes, the graph is not bipartite
You are provided with 'N' pairs of integers such that in any given pair (a, b), the first number is always smaller than the second number, i.e., a < b. A pai...
Given pairs of integers, find the length of the longest pair chain where each pair follows the given condition.
Sort the pairs based on the second element in ascending order.
Iterate through the sorted pairs and keep track of the maximum chain length.
Update the chain length if the current pair can be added to the chain.
Return the maximum chain length as the result.
TCP/IP is a set of protocols that governs the transmission of data over the internet.
TCP/IP stands for Transmission Control Protocol/Internet Protocol.
It is a suite of communication protocols used to interconnect network devices on the internet.
TCP ensures that data packets are delivered reliably and in order.
IP is responsible for addressing and routing packets to their destination.
Examples of TCP/IP applications inclu...
DHCP is a network protocol that automatically assigns IP addresses to devices on a network.
DHCP stands for Dynamic Host Configuration Protocol
It allows devices to obtain IP addresses and other network configuration information dynamically
DHCP servers assign IP addresses to devices within a network
DHCP uses a lease mechanism to control the amount of time a device can use an IP address
DHCP reduces the administrative burd
Round duration - 50 Minutes
Round difficulty - Medium
This round majorly focused on past projects and experiences from my Resume and some standard System Design +
LLD questions + some basic OS questions which a SDE-2 is expected to know .
A system like Pastebin allows users to store and share text snippets online.
Allow users to paste text content into a form
Generate a unique URL for each paste
Set expiration time for pastes to be automatically deleted
Implement syntax highlighting for various programming languages
Provide options for users to set visibility (public/private) of their pastes
Data abstraction is the process of hiding implementation details and showing only the necessary features of an object.
Data abstraction can be achieved through abstract classes and interfaces in object-oriented programming.
It helps in reducing complexity by providing a simplified view of the data.
By using access specifiers like private, protected, and public, we can control the visibility of data members and methods.
Exa...
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/experiences explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Top trending discussions
I applied via Naukri.com and was interviewed in Oct 2020. There was 1 interview round.
I appeared for an interview before Sep 2020.
Round duration - 90 minutes
Round difficulty - Medium
Round duration - 60 minutes
Round difficulty - Medium
This was the technical round, held around at 10 AM IST on Google Meet.
Firstly she greeted me and asked me to tell something about myself, to which I introduced myself, explaining my academic and some projects also.
After that we moved on to the Hackathon project, which was smart cart self-checkout system. I explained the project along with the code, wherever necessary.
Every word you say while explaining should be clear to you.I used Firebase and SQL while explaining my project, to which she asked some questions related to it,
Then she moved to the DBMS part, types of joins,what is indexing, how to approach if you were to design a payment system.
At last she asked me some Data Structure questions, which were of medium complexity
You are given a singly Linked List with 'N' nodes containing integer data and an integer 'K'. Your task is to delete the Kth node from the end of this Lin...
Remove the Kth node from the end of a singly linked list given the position 'K'.
Traverse the list to find the length 'N' of the linked list.
Calculate the position of the node to be removed from the beginning as 'N - K + 1'.
Traverse the list again and remove the node at the calculated position.
Consider Mr. X, a professional robber who is planning to rob houses along a street. These houses are arranged in a circle, which means the first house is a neighbor to the l...
House Robber problem where adjacent houses have connected security system, find maximum money Mr. X can rob without triggering security.
Use dynamic programming to keep track of maximum money robbed at each house.
At each house, decide whether to rob the current house or skip it based on maximum money robbed so far.
Handle the circular nature of houses by considering two cases: robbing the first house and not robbing the ...
Round duration - 30 minutes
Round difficulty - Easy
The interviewer was very frank and cheerful. This was held at 2:30 PM IST on Google Meet.
He firstly greeted me and asked me how I was doing.
How was my previous round, any technical difficulties?
Then he asked me to introduce myself.
He started telling about his journey to Lowe's and his technical background.
Then he asked some HR related questions
Tip 1 : Practice DSA questions, interview questions as much as you can.(400 leetcode questions) + (1000+ geeksforgeeks score) is good approximation of your preparation.
Tip 2 : You should have a good internship experience or 1 or 2 good projects on Android/web-d or Machine Learning.You should be through with your projects and be able to tell further improvements for the future.
Tip 3 : Be CONFIDENT with what you say. Don't murmur or speak in the mouth.The interviewer wants to know your thought process.
Tip 1 : Resume is the first impression of you.so it must be very eye-catching. write some decent (maybe 1 or 2 is enough) projects on resume.
Tip 2 : Should be through with each and every point you have written on your resume. people usually write 10- 15 skills on resume while confident in only 5.Please don't do it.
I applied via Walk-in and was interviewed before Apr 2023. There were 2 interview rounds.
There was a aptitude test with coding problems
I applied via Campus Placement and was interviewed in Mar 2024. There were 3 interview rounds.
Coding test contains 2 questions 1 moderate and 1 easy level
I am a passionate software developer with experience in Java, Python, and web development.
Graduated with a degree in Computer Science
Worked on various projects using Java and Python
Familiar with web development technologies like HTML, CSS, and JavaScript
I believe Lowe's is a reputable company with a strong focus on customer satisfaction. They can improve their customer services by implementing personalized recommendations, enhancing their online platform, and providing better in-store experiences.
Implement personalized recommendations based on customer preferences and purchase history
Enhance the online platform for easier navigation, product search, and checkout proce...
I applied via LinkedIn and was interviewed in Mar 2024. There was 1 interview round.
To delete a node from a binary search tree (BST), we need to handle three cases: node has no children, node has one child, and node has two children.
Start at the root and traverse the tree to find the node to be deleted.
Handle the three cases: node has no children, node has one child, and node has two children.
For a node with two children, find the inorder successor (smallest node in the right subtree) to replace the n
String arrays are immutable because they cannot be changed once created.
Strings in an array cannot be modified individually
Any changes to a string array result in a new array being created
Immutable arrays ensure data integrity and prevent unintended side effects
To create a custom immutable class, use final keyword for class, private final fields, and no setter methods.
Use the final keyword for the class to prevent inheritance
Declare all fields as private and final to prevent modification
Do not provide setter methods for the fields to maintain immutability
Provide getter methods to access the fields
I applied via Company Website and was interviewed in Mar 2021. There were 4 interview rounds.
Hash map is a data structure that stores key-value pairs and uses a hash function to map keys to indices in an array.
Hash function is used to convert the key into an index in the array
Collisions occur when two keys map to the same index, which can be resolved using separate chaining or open addressing
Load factor is the ratio of number of elements to the size of the array, and affects the performance of hash map
Operatio...
SQL query to get 2nd highest salary
Use ORDER BY and LIMIT to get the highest salary
Use subquery to exclude the highest salary and get the 2nd highest
Example: SELECT salary FROM employees ORDER BY salary DESC LIMIT 1,1
based on 5 reviews
Rating in categories
Software Engineer III
1.9k
salaries
| ₹14.5 L/yr - ₹47 L/yr |
Senior Software Engineer
1.4k
salaries
| ₹23 L/yr - ₹70 L/yr |
Software Engineer
837
salaries
| ₹10 L/yr - ₹43 L/yr |
Software Development Engineer 3
274
salaries
| ₹15.6 L/yr - ₹45 L/yr |
Software Developer
263
salaries
| ₹13 L/yr - ₹53.1 L/yr |
Amazon
Reliance Retail
DMart
Future Group