Filter interviews by
I applied via Referral and was interviewed before Feb 2023. There were 3 interview rounds.
Trigger question on parent child relationship
Batch class and trigger
I applied via Naukri.com and was interviewed in Aug 2020. There were 3 interview rounds.
To check palindrome and anagram of a string with O(n), use a hash table to store character frequencies.
Create a hash table to store the frequency of each character in the string.
For palindrome, check that no more than one character has an odd frequency.
For anagram, compare the hash tables of the two strings.
If the hash tables are equal, the strings are anagrams.
If the hash tables differ by only one character, the strin...
Optimized solutions and core principles applied in OOPS
Encapsulation, Inheritance, Polymorphism, Abstraction are core principles of OOPS
Optimized solutions can be achieved through efficient algorithms and data structures
Design patterns like Singleton, Factory, Observer can also be used for optimized solutions
I appeared for an interview before May 2021.
Round duration - 45 Minutes
Round difficulty - Hard
Given an integer array 'ARR' of size 'N' containing numbers from 0 to (N - 2). Each number appears at least once, and there is one number that appears twice. Yo...
Find the duplicate number in an integer array containing numbers from 0 to (N - 2).
Iterate through the array and keep track of the frequency of each number using a hashmap.
Return the number that appears twice in the array.
The duplicate number is always present in the given array.
Round duration - 50 Minutes
Round difficulty - Easy
Sort an unsorted array of non-negative integers using the Bubble Sort algorithm, which swaps adjacent elements if they are not in the correct order to sort the array in non-d...
Bubble Sort is used to sort an array of non-negative integers in non-decreasing order by swapping adjacent elements if they are not in the correct order.
Iterate through the array and compare adjacent elements, swapping them if they are in the wrong order.
Repeat this process until the array is sorted in non-decreasing order.
Time complexity of Bubble Sort is O(n^2) in worst case.
Example: For input [6, 2, 8, 4, 10], the o
Round duration - 60 Minutes
Round difficulty - Medium
You are tasked with finding the shortest path between two houses in the city of Ninjaland, represented as an unweighted graph. The city has N
houses numbered from 1 ...
Find the shortest path between two houses in a city represented as an unweighted graph.
Use breadth-first search (BFS) algorithm to find the shortest path in an unweighted graph.
Start BFS from the source house and keep track of the shortest path to each house.
Once the destination house is reached, backtrack to find the shortest path.
Consider using a queue data structure to implement BFS efficiently.
Round duration - 60 Minutes
Round difficulty - Easy
Tip 1 : online resources
Tip 2 : cracking the coding interview by Gayle laykemann this is one of the best book for learning the concept at the initial level. Start practicing the approaches mention in the book once done apply the same to similar level pattern questions.
Tip 3 : geeks for geeks start from school level and then move towards easy medium and hard once done practice the previous year questions
Tip 1 : precise clear concise and well written
Tip 2 : mentions the skills sets along with the projects
I applied via Recruitment Consultant and was interviewed in Oct 2020. There were 4 interview rounds.
I applied via Recruitment Consulltant and was interviewed before Mar 2021. There was 1 interview round.
posted on 16 Dec 2021
I applied via Recruitment Consultant and was interviewed in Jun 2021. There were 4 interview rounds.
I applied via LinkedIn and was interviewed in Feb 2021. There was 1 interview round.
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
based on 1 interview
Interview experience
Assistant Vice President
4.8k
salaries
| ₹17 L/yr - ₹48.5 L/yr |
Assistant Manager
3.3k
salaries
| ₹6 L/yr - ₹20 L/yr |
Officer
2.9k
salaries
| ₹10.6 L/yr - ₹35.9 L/yr |
Vice President
2.6k
salaries
| ₹21 L/yr - ₹70.8 L/yr |
Manager
2.3k
salaries
| ₹11.5 L/yr - ₹38 L/yr |
Wells Fargo
JPMorgan Chase & Co.
HSBC Group
Cholamandalam Investment & Finance