Round duration - 60 minutes Round difficulty - Medium
1 Medium/Easy DSA questions were asked similar to Leetcode.
I was expected to come up with the most optimal solution for the same. I completed the code and explained in 45 mins.
In the remaining time, I was asked questions from Computer Science fundamentals and Java
Q1.
Unique Element In Sorted Array
Nobita wants to impress Shizuka by correctly guessing her lucky number. Shizuka provides a sorted list where every number appears twice, except for her lucky number, which a...
Ans.
As the array was sorted we can make use of this information to use Binary Search.
// EXPLANATION:- // Suppose array is [1, 1, 2, 2, 3, 3, 4, 5, 5] // we can observe that for each pair, // first element takes even position and second element takes odd position // for example, 1 is appeared as a pair, // so it takes 0 and 1 positions. similarly for all the pairs also.
// this pattern will be missed when single element is ...
Low-level system design round. Expected to come up with a running code.
Q1.
LRU Cache Implementation Problem
Design and implement a Least Recently Used (LRU) cache data structure. This cache must support the following operations efficiently:
get(key): Return the value associate...
Ans.
Tip 1 : Ask clarification questions Tip 2 : Try and think in terms of brute force and then gradually optimize your solution Tip 3 : Ensure to check for edge cases Tip 4 : Ensure to be thorough with data structures, algorithms and system design concepts.
Q1. Can you describe your past work experiences and projects from your previous company?
Ans.
Ensure that you are thorough with the design of your project at your current organization.
Answered
Anonymously
Add your answer
Interview Preparation Tips
Professional and academic backgroundI applied for the job as SDE - 2 in GurgaonEligibility criteriaAbove 1 years of experienceLenskart interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 2 monthsInterview preparation tips for other job seekers
Tip 1 : Break down the total topics based on your comfort and ease and try and master one topic at a time Tip 2 : Try and up solve Tip 3 : Always try and come up with multiple solutions for a DSA question starting from brute force to optimal solution.
Application resume tips for other job seekers
Tip 1 : Try to keep it short and crisp. Tip 2 : Always make the entries chronological with the most recent experiences coming first followed by past experiences.
Round duration - 60 minutes Round difficulty - Medium
It was a problem solving round where a hackerrank link was given containing 2 questions. You have to solve them within 90 minutes. I was asked to solve it within a week.
Q1.
Find Distinct Palindromic Substrings
Given a string 'S', identify and print all distinct palindromic substrings within it. A palindrome reads the same forwards and backwards. For example, 'bccb' is a pali...
Ans.
Step 1 : Find all the palindromic sub-strings Step 2 : Remove duplicate palindromes Step 3 : Print the distinct palindromes and number of such palindromes
2 questions was asked by the interviewer. You have to clearly explain your approach and write a working solution. He even asked me to run on some additional test cases
Q1.
Job Sequencing Problem Statement
You are provided with a N x 2 2-D array called Jobs consisting of N jobs. In this array, Jobs[i][0] represents the deadline of the i-th job, while Jobs[i][1] indicates the...
Ans.
Sort the jobs based on their deadlines. Iterate from the end and calculate the available slots between every two consecutive deadlines. Include the profit, deadline, and job ID of ith job in the max heap. While the slots are available and there are jobs left in the max heap, include the job ID with maximum profit and deadline in the result. Sort the result array based on their deadlines.
Answered
Anonymously
Add your answer
Q2.
Partition Equal Subset Sum Problem
Given an array ARR consisting of 'N' positive integers, determine if it is possible to partition the array into two subsets such that the sum of the elements in both sub...
Ans.
Let isSubsetSum(arr, n, sum/2) be the function that returns true if there is a subset of arr[0..n-1] with sum equal to sum/2
The isSubsetSum problem can be divided into two subproblems a) isSubsetSum() without considering last element (reducing n to n-1) b) isSubsetSum considering the last element (reducing sum/2 by arr[n-1] and n to n-1) If any of the above subproblems return true, then return true. is...
I was asked 1 system design question. The question was to design an online multiplayer game which can be scaled for more than 10 million users. The interviewer helped me to collect requirement and also helped me in choosing different low latency protocol to communicate between client and server.
Round 4 - Face to Face
(1 Question)
Round duration - 60 minutes Round difficulty - Medium
The interviewer asked few sql based questions and asked me to write the solution. He also gave 1 problem solving question.
Q1. Can you explain the different types of joins in SQL and how to calculate the average of all values from a given table?
Add your answer
Interview Preparation Tips
Professional and academic backgroundI applied for the job as SDE - 2 in BangaloreEligibility criteriaNAOla interview preparation:Topics to prepare for the interview - Linked List, Stacks, Queues, Tree, Graph, System Design, Dynamic Programming.Time required to prepare for the interview - 2 monthsInterview preparation tips for other job seekers
Tip 1 : Prepare Data Structures topic by topic and also solve at least 10 interview questions from each topic. The have a list of excellent questions. Tip 2 : For system design try to take few questions by yourself and think of what different scenarios can arise considering it as a distributed system. There are multiple topics like Consistent Hashing, Partition tolerance, Availability, Sharing etc which needs special attention. The interviewers will dig them deep and will try to see how much of it you actually understand. Tip 3 : Also please do focus on LLD. Sometimes they can ask you to write sample code for problems. Try solving 4-5 problems. Tip 4 : You should do and prepare properly 2 -3 projects and try deploying it. You will face a lot of new challenges which you do not face in normal day to day usage.
Application resume tips for other job seekers
Tip 1 : You can go for 1 page resume, though it is not necessary. Mention about your projects, your actual contribution, languages that you have used in that project etc. Tip 2 : You should always put your academic achievements. Sometimes it gains interviewers attention. Tip 3 : Make it a little bit colourful rather than plain white.
Round duration - 60 minutes Round difficulty - Medium
It was a telephonic interview at 10 in the morning. Interviewer seemed cool.
Q1.
Best Insert Position for a Target in a Sorted Array
You are provided with a sorted array A of length N consisting of distinct integers and a target integer M. Your task is to determine the position where ...
Ans. Brute Force
Iterate through the given array.
If at any position i, we get A[i] ≥ M, return i.
If there is no such position i, return N.
Space Complexity: O(1)Explanation:
O(1).
As there is no extra space required.
Time Complexity: O(n)Explanation:
O(N), where ‘N’ is the length of the given array.
We are traversing the array only once. Hence, the overall complexity is O(N).
Answered
Anonymously
Add your answer
Round 2 - Face to Face
(1 Question)
Round duration - 60 minutes Round difficulty - Medium
The interview was in the morning at 10 AM in the office meeting room.
Q1.
House Robber Problem Statement
Mr. X is a professional robber with a plan to rob houses arranged in a circular street. Each house has a certain amount of money hidden, separated by a security system that ...
Ans.
Didn't get enough time to code the solution but explained the approach We can do this using DP We can maintain 2 arrays - one represents the ans if we start from first house and the other represents the answer if we start. from the second house.Then simply looping over the array and calculating these array's elements.
Answered
Anonymously
Add your answer
Round 3 - Face to Face
(1 Question)
Round duration - 60 minutes Round difficulty - Medium
The interview was at 11 AM in the meeting office.
Q1.
Running Median Problem
Given a stream of integers, calculate and print the median after each new integer is added to the stream.
Output only the integer part of the median.
Example:
Input:
N = 5 Stre...
Ans.
Started with the brute force solution of insertion sort Interviewer asked to optimize. Gave the solution which uses two heaps - max heap and min heap. the difference in size of both heaps cannot be more than 1. And we might need to remove elements from one heap to other heap as more input numbers are added
Answered
Anonymously
Add your answer
Round 4 - Face to Face
Round duration - 60 minutes Round difficulty - Medium
Q1. Can you provide a deeper discussion about all the projects you completed in your previous company?
Ans.
Tip 1: Know well about the projects that you have done in the past
Answered
Anonymously
Add your answer
Interview Preparation Tips
Professional and academic backgroundI applied for the job as SDE - 2 in HyderabadEligibility criteriaNoUber interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, Graphs, Dynamic programming, Trees, stack, queue, System DesignTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers
Tip 1 : Be consistent in the preparation. Practice atleast one question everyday Tip 2 : Make relevant notes that you can go through on the day before the interview Tip 3 :Try to note your progress by giving timed contests
Application resume tips for other job seekers
Tip 1 : Clearly mention the details of the projects that are relevant to the company that you are applying for Tip 2 : Ensure that there are no grammatical mistakes and that you have highlighted the important keywords in your resume
This was coding round and was conducted on Google meet with code link shared. Their were 2 interviewers that gave questions and later ran code on sample test cases.
Q1.
Print Permutations - String Problem Statement
Given an input string 'S', you are tasked with finding and returning all possible permutations of the input string.
Input:
The first and only line of input ...
Ans. Backtracking
We can find all the permutations by Backtracking.
1: Fix a character then swap all the rest of the remaining character with a fixed character.
2: Then find all permutations for all remaining characters by the recursive call.
3: The base case for the recursion will be when there is only one character left unprocessed.
Below is the illustration to approach.
Space Complexity: O(n)Explanation:
O(N)...
Answered
Anonymously
Add your answer
Q2.
Find the Kth Row of Pascal's Triangle Problem Statement
Given a non-negative integer 'K', determine the Kth row of Pascal’s Triangle.
Example:
Input:
K = 2
Output:
1 1
Input:
K = 4
Output:
1 4 6 ...
Ans. Naive Approach
In this approach, we find the row elements of the previous row using recursion, and based on the values of previous row elements, we will evaluate the current row elements.
We are given a function kthRow() which takes an integer ‘K’ as the only parameter and returns an integer vector. This is the definition of our recursive function too.
As the base condition of our recursive function, we will check if ‘K’ ...
Answered
Anonymously
Add your answer
Round 2 - Video Call
Round duration - 2 hours Round difficulty - Medium
This was a Machine Coding Round/LLD round followed by HLD round which was taken by Video Conferencing and Screen Sharing.
Round 3 - HR
Round duration - 75 minutes Round difficulty - Medium
This was the last round. This was HM round followed by the HR round.
Interview Preparation Tips
Professional and academic backgroundI completed Civil Engineering from Netaji Subhas University Of Technology. Eligibility criteriaPrior Work ExperienceOla interview preparation:Topics to prepare for the interview - Data Structures, OOPS, Algorithms, Dynamic Programming, Aptitude, Computer Netwroks and System ArchitectureTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers
Tip 1 : Solve previously asked questions. It tells you about the level of questions that the company asks. Check glass-door reviews it will help you to know what kind of questions company ask Tip 2 : Be real during the interview and don’t show off. Tip 3 : Prepare for theory subjects like Object-Oriented Programming System, Database Management System, Computer networks, etc.
Application resume tips for other job seekers
Tip 1 : Keep your resume simple with all work experience mentioned. Tip 2 : Any unwanted information on the resume leaves a bad impact on the interviewer. Tip 3 : You should be prepared to explain anything that’s written on your resume. Tip 4 : Keep it of 1 page or 2 pages only
Timing: evening Environment: Online round took at home
Q1.
Smallest Subarray with K Distinct Elements Problem
Given an array A consisting of N integers, find the smallest subarray of A that contains exactly K distinct integers.
Input:
The first line contains tw...
Ans.
At first sight this can be solved easily by using two loops to iterate over contiguous subarrays in O(n^2) and counting number of arrays and breaking the outer loop if number of odds exceed 'k'.
Optimised solution is to take two pointer approach where right pointer is incremented till num of odds not exceed 'k'. If limit is reached, increment left pointer and add number of arrays (right - left+1)*(right-left)/2 to the r
Answered
Anonymously
Add your answer
Round 2 - Face to Face
Round duration - 90 minutes Round difficulty - Medium
Machine coding round
Round 3 - Face to Face
(1 Question)
Round duration - 60 minutes Round difficulty - Medium
Q1.
Rat In a Maze Problem Statement
Given a N * N maze with a rat placed at position MAZE[0][0], find and print all possible paths for the rat to reach its destination at MAZE[N-1][N-1]. The rat is allowed to...
Ans. Backtracking Approach
Initialize, all the cells of the solution matrix used to print the path matrix to 0. First, you cannot make use of the existing maze to print the solution maze as you have to distinguish b/w 1 of maze or 1 of ‘SOLUTION matrix.
Form a recursive function, which will follow a path and check if the path reaches the destination or not. If the path does not reach the destination then backtrack and t...
Answered
Anonymously
Add your answer
Round 4 - Face to Face
Round duration - 60-90 minutes Round difficulty - Medium
Round 5 - HR
Round duration - 60 minutes Round difficulty - Medium
Hiring Manager round
Interview Preparation Tips
Professional and academic backgroundI applied for the job as SDE - 2 in BangaloreEligibility criteriaNone as such. Only eligible criteria for SDE-2 role is that one should have prior experience working as SDEUber interview preparation:Topics to prepare for the interview - Data structures and algorithms, Design patterns, System design, DatabasesTime required to prepare for the interview - 1 monthInterview preparation tips for other job seekers
Tip 1 : Do some basic research about the interview process and types of rounds while appearing for a company interview. Narrow down the topics and draft a realistic plan afterwards. Tip 2 : Try to solve as many problems as possible as this is primarily what you will be doing in live interview rounds.
Application resume tips for other job seekers
Tip 1 : Tailor your resume as per expectations from the role you are applying for. Tip 2 : Order your experiences and skills by relevance. Tip 3 : Try to fit the content in a single page.
Add office photos
Compare
Filter interviews by
Anonymous
