Filter interviews by
I applied via Referral and was interviewed before Feb 2023. There was 1 interview round.
Top trending discussions
I applied via Naukri.com
posted on 28 Jul 2022
I applied via Campus Placement and was interviewed before Jul 2021. There were 4 interview rounds.
10 MCQs and 2 coding questions
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 in Jun 2017.
I appeared for an interview before Mar 2021.
Round duration - 60 minutes
Round difficulty - Medium
Technical round with questions on DSA and OS.
Design and implement a data structure for a Least Recently Used (LRU) cache that supports the following operations:
get(key)
- Retrieve the value associated with the...Design and implement a Least Recently Used (LRU) cache data structure that supports get and put operations with a specified capacity.
Implement a doubly linked list to keep track of the order of keys based on their usage.
Use a hashmap to store key-value pairs for quick access and updates.
When a key is accessed or updated, move it to the front of the linked list to mark it as the most recently used.
When the cache reaches...
Given an array of non-negative integers and an integer K representing the length of a subarray, your task is to determine the maximum elements for each subarray of size ...
Find the maximum elements for each subarray of size K in a given array.
Iterate through the array and maintain a deque to store the indices of elements in decreasing order.
Pop elements from the deque that are out of the current window.
Keep track of the maximum element in each subarray of size K.
Return the maximum elements for each subarray.
Virtual memory is a memory management technique that allows a computer to compensate for physical memory shortages by temporarily transferring data from RAM to disk storage.
Virtual memory allows programs to use more memory than is physically available on the system.
It helps in multitasking by allowing multiple programs to run simultaneously without running out of memory.
Virtual memory uses a combination of RAM and disk...
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 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 applied via Campus Placement
ATM transaction involves multiple background processes including authentication, authorization, and communication with bank servers.
Customer inserts card and enters PIN
ATM authenticates the card and PIN
ATM requests authorization from bank server
Bank server verifies account balance and approves or denies transaction
ATM dispenses cash or completes other requested transaction
ATM updates account balance and sends transacti
Cut cake into 8 pieces using knife 3 times only.
First, cut the cake horizontally into two equal halves.
Then, cut the cake vertically into four equal pieces.
Finally, cut the cake horizontally again into eight equal pieces.
Make sure to use the knife efficiently to minimize the number of cuts.
Practice visualization before making the cuts to avoid mistakes.
The one bird was already dead.
The bird was already dead before the shot was fired.
The bird was injured and unable to fly away with the rest of the birds.
The bird was a decoy bird used for hunting purposes.
The bird was a trained bird used for falconry.
Developed a web-based attendance management system and a mobile app for event management.
Created a database schema and implemented CRUD operations using PHP and MySQL.
Designed the user interface using HTML, CSS, and JavaScript.
Integrated Google Maps API for location tracking in the mobile app.
Implemented push notifications using Firebase Cloud Messaging.
Collaborated with a team of four to complete the projects within t
I applied via Campus Placement
Finding smallest of 4 numbers without using >.< and min function in Java.
Initialize a variable with the first number
Compare it with the remaining numbers using if-else statements
If a smaller number is found, update the variable
Repeat until all numbers are compared
The final value of the variable will be the smallest number
Code for palindrome checking
Convert the input to lowercase to ignore case sensitivity
Use two pointers, one at the start and one at the end of the string
Compare the characters at both pointers and move them towards each other
If all characters match, it's a palindrome
Javascript code to display 'Hello World!' on the webpage
Create a new HTML file
Add a script tag with 'type' attribute set to 'text/javascript'
Inside the script tag, use document.write() to display 'Hello World!'
Swap two numbers without using a temporary variable.
Use addition and subtraction to swap the values
Use XOR operator to swap the values
Use multiplication and division to swap the values
To add 2 tables, we need to use a join operation on a common column.
Identify the common column between the tables
Choose the appropriate join type (inner, outer, left, right)
Write the SQL query to join the tables
Example: SELECT * FROM table1 INNER JOIN table2 ON table1.column = table2.column
Union combines and removes duplicates, Union All combines all rows including duplicates.
Union is used to combine the result sets of two or more SELECT statements and remove duplicates.
Union All is used to combine the result sets of two or more SELECT statements and includes all rows, including duplicates.
Union is slower than Union All as it has to remove duplicates.
Union requires the same number of columns in all SELEC...
Being assigned a project with unrealistic deadlines and minimal guidance
Received a project with tight deadlines and unclear requirements
Struggled to meet the deadlines due to lack of guidance and support
Had to work long hours and weekends to try to complete the project
Learned the importance of clear communication and setting realistic expectations
based on 1 interview
Interview experience
Software Engineer
4
salaries
| ₹4.5 L/yr - ₹15 L/yr |
HDB Financial Services
AU Small Finance Bank
Bajaj Finance
Equitas Small Finance Bank