Filter interviews by
Very hard, 2 hard leetcode questions
I applied via LinkedIn and was interviewed in Mar 2023. There was 1 interview round.
Solve 2 problems in codility test
Top trending discussions
I appeared for an interview before Sep 2020.
Round duration - 90 minutes
Round difficulty - Medium
The coding round consisted of 3 coding questions. 1st question was of 20 marks, 2nd and 3rd of 50 marks.
Given an array 'ARR' consisting of 'N' positive integers, determine the minimum number of operations needed to make all elements of the array equal. You may ...
Determine minimum operations to make all array elements equal using addition, subtraction, multiplication, or division.
Iterate through array to find the minimum and maximum values
Calculate the difference between the maximum and minimum values
Return the difference as the minimum number of operations needed
Given an array of obstacles' coordinates, determine the minimal jump length to reach beyond all obstacles starting from coordinate 0 while avoiding landing on any obstacle...
Find the minimal jump length to bypass all obstacles while avoiding landing on any obstacle.
Iterate through the obstacle coordinates to find the maximum coordinate.
Calculate the minimum jump length needed to bypass all obstacles.
Ensure the jump length consistently avoids all obstacle points.
The final jump can overshoot the line's end point.
You are given an unsorted array/list ‘ARR’ of ‘N’ integers. Your task is to return the length of the longest consecutive sequence.
The consecutive sequence ...
Find the length of the longest consecutive sequence in an unsorted array of integers.
Sort the array to make it easier to identify consecutive sequences.
Use a set to store unique elements and check for consecutive numbers.
Track the length of consecutive sequences and update the maximum length found.
Handle duplicates by counting only one occurrence in the consecutive sequence.
Round duration - 45 minutes
Round difficulty - Easy
Timing: 10:15 - 11:00 am.
The interview was online from home.
Round duration - 45 minutes
Round difficulty - Medium
Timing: 2:15 - 3:00 PM
The interview was online from home.
There were a few audio cuts in the video call but we were able to manage regardless.
Given a string STR
containing characters from [a-z], [A-Z], [0-9], and special characters, determine the reverse of the string.
The input starts with a single i...
Reverse a given string containing characters from [a-z], [A-Z], [0-9], and special characters.
Iterate through the characters of the string in reverse order and append them to a new string.
Use built-in functions like reverse() or StringBuilder in languages like Python or Java for efficient reversal.
Handle special characters and numbers along with alphabets while reversing the string.
Ensure to print each reversed string
Tip 1 : For OOPS, DS and programming, I recommend Codezen, Leetcode, InterviewBit and GeeksforGeeks.
Tip 2 : For OS, DBMS and Computer Network, I recommend GateSmasher, Knowledge Gate and TutorialsPoint.
Tip 3 : For SQL, I recommend W3Schools and GeeksforGeeks.
Tip 4 : Always maintain your cool during Interviews, and answer the questions calmly. If you get stuck in a problem, do not hesitate to ask for hints.
Tip 1: Mention only those projects and internships in your resume that you are comfortable with, that is, you can explain to the interviewee.
Tip 2: Mention only those skills/programming languages in your resume that you are comfortable with, that is, you have proper knowledge of as the interviewee can ask questions from those languages specifically.
Tip 3: Keep your data in your resume honest and accurate.
Code for rand7 using rand5 function
Use rand5 twice to generate a number in [1,25] with equal probability
If the number is greater than 21, discard and try again
Otherwise, return (number mod 7) + 1
LRU cache is implemented using a doubly linked list and a hash map.
Create a doubly linked list to keep track of the order of elements in the cache.
Create a hash map to store the key-value pairs of the cache.
When a new element is added, check if the cache is full. If it is, remove the least recently used element from the linked list and the hash map.
When an element is accessed, move it to the front of the linked list to...
Function to randomly select pivot element in Quick Sort
Generate a random index within the range of the array
Return the element at the randomly generated index as the pivot
I appeared for an interview before Sep 2020.
Round duration - 60 minutes
Round difficulty - Easy
The interviewer called my via phone and simultaneously provided me a link where I had to write the code for a given problem. It was scheduled at 12:30 pm, so timing was not an issue. It was a standard DP question involving a 2D matrix. The question was easy and I was able to code it within given time.
Round duration - 60 minutes
Round difficulty - Easy
The interviewer asked me two coding questions in this round.
Efficient program to find sum of largest contiguous subarray within a one-dimensional array.
Use Kadane's algorithm to find the maximum sum subarray in O(n) time complexity.
Initialize max_sum and current_sum to 0, iterate through array updating current_sum and max_sum.
Return max_sum as the result.
Round duration - 60 minutes
Round difficulty - Easy
This was on-site round at their Bangalore office. The interviewer was friendly and helpful. The interview held inside a conference room.
Given an undirected and disconnected graph G(V, E)
, where V
is the number of vertices and E
is the number of edges, the connections between vertices are provided in the 'GR...
DFS traversal problem to find connected components in an undirected and disconnected graph.
Use Depth First Search (DFS) algorithm to traverse the graph and find connected components
Maintain a visited array to keep track of visited vertices
Iterate through all vertices and perform DFS on unvisited vertices to find connected components
Round duration - 60 minutes
Round difficulty - Easy
This was the next round of the onsite interviews. Took place in the same conference room as that of the previous round.
Round duration - 60 minutes
Round difficulty - Easy
This was the third round of the onsite interview.
Practice DP based questions as much as you can. Also, be confident during the interview about your solution. For practice, you can prefer Coding Ninjas and Geeks For Geeks.
Application resume tips for other job seekersKeep it short. Mention the academic and professional projects you've done. Add your educational details properly with percentage or CGPA obtained.
Final outcome of the interviewSelectedI appeared for an interview before Sep 2023.
Java 8 introduced the concept of functional programming with the addition of lambda expressions and streams.
Lambda expressions allow for concise code and easier parallel programming.
Streams provide a way to work with collections of objects in a functional style.
Functional interfaces like Predicate, Function, and Consumer are commonly used with lambda expressions.
Implement a coding challenge in Java 8
Use lambda expressions and functional interfaces to write concise and readable code
Utilize streams to process collections efficiently
Leverage method references for cleaner code
It was data structures and algorithm
I applied via LinkedIn and was interviewed in Oct 2023. There was 1 interview round.
About 2 hours long interview in 3 sets one technical and 2 HR rounds
I applied via Internshala and was interviewed in Sep 2024. There were 2 interview rounds.
It was easy and main question wweer from mathr
Question from dsa cp segment tress
I appeared for an interview in Apr 2024.
This round was a one-to-one coding round where the interviewer asked Leetcode Hard questions(2) DSA based questions. Also had to write and explain a few testcases, followed by managerial questions.
based on 2 interviews
Interview experience
Software Developer
4
salaries
| ₹65 L/yr - ₹120 L/yr |
Executive Accountant
4
salaries
| ₹2.4 L/yr - ₹3.2 L/yr |
HR Manager
3
salaries
| ₹3.6 L/yr - ₹5.6 L/yr |
General Manager
3
salaries
| ₹12 L/yr - ₹12 L/yr |
Assistant Manager- HR
3
salaries
| ₹7 L/yr - ₹7.2 L/yr |
HDB Financial Services
AU Small Finance Bank
Bajaj Finance
Equitas Small Finance Bank