Filter interviews by
I applied via Campus Placement and was interviewed in Jul 2024. There were 3 interview rounds.
2 coding questions and 1 sql query question
LRU cache memory can be implemented using a linked list to store and manage recently used items efficiently.
Use a doubly linked list to keep track of the order of items based on their usage.
When an item is accessed, move it to the front of the list to indicate it is the most recently used.
If the cache is full, remove the least recently used item from the end of the list.
Maintain a hashmap for quick access to items in t
I applied via Campus Placement and was interviewed in Jun 2024. There were 2 interview rounds.
HackerRank Test on 2 coding and 1 SQL question.
Top trending discussions
I appeared for an interview before Dec 2020.
Round duration - 90 minutes
Round difficulty - Medium
The round consisted of 3 coding Questions and 20 Technical MCQs.
Given a number of ropes denoted as 'N' and an array containing the lengths of these ropes, your task is to connect the ropes into one single rope. The cost to connect two r...
The task is to find the minimum cost required to connect all the ropes by summing their lengths.
Iterate through the ropes and connect the two shortest ropes at each step to minimize cost
Use a priority queue to efficiently find the shortest ropes
Keep track of the total cost as you connect the ropes
Example: For input [4, 3, 2, 6], connect 2 and 3 (cost 5), then connect 4 and 5 (cost 9), then connect 9 and 6 (cost 15) for
Determine if a given N * N matrix is an idempotent matrix. A matrix is considered idempotent if it satisfies the following condition:
M * M = M
The first line cont...
Check if a given matrix is idempotent by verifying if M * M = M.
Iterate through the matrix and multiply it with itself to check if it equals the original matrix.
If the condition M * M = M is satisfied, then the matrix is idempotent.
If the condition is not satisfied, then the matrix is not idempotent.
Given an integer 'N', calculate and print the sum of the least common multiples (LCM) for each integer from 1 to N with N.
The sum is represented as:LCM(1, N) + LCM(2, N) + ....
Calculate and print the sum of least common multiples (LCM) for each integer from 1 to N with N.
Iterate from 1 to N and calculate LCM of each number with N
Add all the calculated LCM values to get the final sum
Return the sum for each test case
Round duration - 120 minutes
Round difficulty - Medium
This round is a Long Coding Round. Every Candidate was assigned with a mentor who guides them, We were given a real-life scenario for which we have to construct a database with required tables. We should draw an ER Diagram to demonstrate the Database. After the Database Completion, We have to Start Coding the Application. The Design(like Placing the button or background colour) is not given much importance. They mainly test the practical knowledge of candidates in OOPS and expertise in a C, C++, Java, Android or any other language were OOPS Concepts can be applied.
Round duration - 180 Minutes
Round difficulty - Medium
This Round is a technical Interview. I was asked Questions to test my Technical Knowledge.
Given an integer array arr
of size 'N' containing only 0s, 1s, and 2s, write an algorithm to sort the array.
The first line contains an integer 'T' representing the n...
Sort an array of 0s, 1s, and 2s in linear time complexity.
Use three pointers to keep track of 0s, 1s, and 2s while iterating through the array.
Swap elements based on the values encountered to sort the array in-place.
Time complexity of the algorithm should be O(N) where N is the size of the array.
Round duration - 20 Minutes
Round difficulty - Easy
Tip 1 : Do Atleast 2 Projects
Tip 2 : Be Strong in what you have in your resume
Tip 3 : Be Confident and Polite
Tip 1 : Keep it Short to one or two pages
Tip 2 : Keep it standout..as it is what projects you uniquely.
Find an odd occurring number among even occurring numbers.
Use XOR operation to cancel out even occurring numbers and get the odd occurring number.
Iterate through the array and XOR each element with the result variable.
The final result will be the odd occurring number.
Print the spiral order of a binary tree and matrix.
For binary tree, use level order traversal and alternate direction for each level.
For matrix, use four pointers to traverse in spiral order.
Example for binary tree: 1 -> 2 -> 3 -> 4 -> 5 -> 6 -> 7 -> 8 -> 9
Example for matrix: 1 2 3 4 -> 8 7 6 5 -> 9 10 11 12 -> 16 15 14 13
Finding pairs in an array with a given sum.
Iterate through the array and for each element, check if the difference between the given sum and the element exists in the array.
Use a hash table to store the elements of the array and their indices for faster lookup.
If there are multiple pairs with the same sum, return any one of them.
If no pair is found, return null or an empty array.
Find total number of k element with given avg in an array in minimum time complexity.
Use sliding window technique to traverse the array in O(n) time complexity.
Maintain a sum variable to keep track of the sum of elements in the window.
If the sum of elements in the window is equal to k times the given avg, increment the count.
Move the window by subtracting the first element and adding the next element in the array.
Printing non-boundary elements of a binary tree
Traverse the tree in any order (preorder, inorder, postorder)
Check if the current node is not a boundary node (not the first or last node in its level)
If it is not a boundary node, print its value
Recursively traverse its left and right subtrees
Policy manager is a software tool used to centrally manage and enforce policies across an organization's systems and applications.
Policy manager helps define, monitor, and enforce policies related to security, compliance, access control, and other governance aspects.
It allows administrators to set rules and regulations that govern how data and resources are accessed and used within an organization.
Policy manager can au...
I applied via Referral and was interviewed in Jan 2024. There were 2 interview rounds.
Find k closest elements in an array
Sort the array based on the absolute difference between each element and the target element
Return the first k elements from the sorted array
I applied via Recruitment Consulltant and was interviewed before Apr 2023. There were 4 interview rounds.
It was a online hacker rank type test with medium hard question
Print left view of binary tree
Traverse the binary tree level by level
Print the first node at each level encountered
I applied via Naukri.com and was interviewed in Apr 2024. There were 4 interview rounds.
Some question related professional round
String ,array, linkedlist
I applied via Referral and was interviewed in Jul 2024. There were 2 interview rounds.
Leet code problem. Sliding window
based on 2 interviews
Interview experience
Senior Associate
497
salaries
| ₹18 L/yr - ₹60 L/yr |
Associate
495
salaries
| ₹9 L/yr - ₹33.4 L/yr |
Analyst
237
salaries
| ₹5 L/yr - ₹20 L/yr |
Vice President
215
salaries
| ₹22 L/yr - ₹94 L/yr |
Data Analyst
64
salaries
| ₹2.4 L/yr - ₹7.8 L/yr |
SBI Cards & Payment Services
Axis Direct
Kotak Securities
FactSet