Filter interviews by
I appeared for an interview before Feb 2024.
Core Java Basic Programming Questions, SQL Queries
I applied via Referral and was interviewed in Dec 2023. There were 2 interview rounds.
Basic Java Programming Questions
I applied via Company Website and was interviewed in Oct 2018. There was 0 interview round.
I applied via Naukri.com and was interviewed before Jul 2020. There were 3 interview rounds.
I appeared for an interview before Nov 2020.
Round duration - 90 minutes
Round difficulty - Medium
Timing was around 10am
It was quite a normal online examination kind of environment
People from the company were there to invigilate
All were quite nice and helpful in case the exam got stuck
An alien dropped its dictionary while visiting Earth. The Ninja wants to determine the order of characters used in the alien language, based on the given list of wor...
Determine the order of characters in an alien language based on a list of words.
Create a graph data structure to represent the relationships between characters in the words.
Perform a topological sort on the graph to find the order of characters.
Return the smallest lexicographical order of characters as the result.
Given an array of integers arr
of size N
and an integer K
, determine if there are any duplicate elements within a distance of K
from each other in the array. Return "true...
Check if there are any duplicate elements within a distance of K from each other in the array.
Iterate through the array and keep track of the indices of elements using a hashmap.
For each element, check if it already exists in the hashmap within distance K.
Return true if a duplicate is found within distance K, otherwise return false.
Round duration - 30 minutes
Round difficulty - Medium
Timing was 2pm when it started
Interviewer was polite
Ninja enjoys working with numbers, and Alice challenges him to find the Kth largest value from a given list of numbers.
The first line contains an integer 'T...
The task is to find the Kth largest element in a given list of numbers for each test case.
Read the number of test cases 'T'
For each test case, read the number of elements 'N' and the Kth largest number to find 'K'
Sort the array in descending order and output the Kth element
Round duration - 20 minutes
Round difficulty - Easy
Timing was 9 am onwards
Interviewer was good enough
Tip 1 : Focus on specialization of any one skill and keep a basic knowledge of all the skills you mention in your resume
Tip 2 : Gain confidence in presenting yourself by practicing well before
Tip 3 : Gain a basic knowledge of the company you go for selection
Tip 1 : Resume should be simple and precise but pretty smart to cover your skills
Tip 2 : Mention what you really know,no false things
I applied via Naukri.com and was interviewed in May 2020. There were 3 interview rounds.
I applied via Walk-in and was interviewed before Sep 2019. There were 3 interview rounds.
I appeared for an interview in Aug 2017.
Merge Sort is a divide and conquer algorithm that sorts an array by dividing it into two halves, sorting them separately, and then merging the sorted halves.
Divide the array into two halves
Recursively sort the two halves
Merge the sorted halves
Find pairs of integers in a BST whose sum is equal to a given number.
Traverse the BST and store the values in a hash set.
For each node, check if (X - node.value) exists in the hash set.
If yes, add the pair (node.value, X - node.value) to the result.
Continue traversal until all nodes are processed.
Merge overlapping time intervals into mutually exclusive intervals.
Sort the intervals based on their start time.
Iterate through the intervals and merge overlapping intervals.
Output the mutually exclusive intervals.
Example: [(1,3), (2,6), (8,10), (15,18)] -> [(1,6), (8,10), (15,18)]
Different types of hashing and alternative for Linear Chaining
Different types of hashing include division, multiplication, and universal hashing
Alternative for Linear Chaining is Open Addressing
Open Addressing includes Linear Probing, Quadratic Probing, and Double Hashing
An AVL tree is a self-balancing binary search tree where the heights of the left and right subtrees differ by at most one.
AVL tree is a binary search tree with additional balance factor for each node.
The balance factor is the difference between the heights of the left and right subtrees.
Insertion and deletion operations in AVL tree maintain the balance factor to ensure the tree remains balanced.
Rotations are performed ...
Find the minimum number of squares whose sum equals to a given number n.
Use dynamic programming to solve the problem efficiently.
Start with finding the square root of n and check if it is a perfect square.
If not, then try to find the minimum number of squares required for the remaining number.
Repeat the process until the remaining number becomes 0.
Return the minimum number of squares required for the given number n.
Insertion sort for a singly linked list.
Traverse the list and compare each node with the previous nodes
If the current node is smaller, swap it with the previous node
Repeat until the end of the list is reached
Time complexity is O(n^2)
I applied via Recruitment Consultant and was interviewed before Jun 2020. There were 3 interview rounds.
I applied via Naukri.com and was interviewed before Aug 2020. There were 4 interview rounds.
based on 2 interviews
Interview experience
based on 2 reviews
Rating in categories
Software Developer
5
salaries
| ₹2.2 L/yr - ₹3 L/yr |
Business Analyst
4
salaries
| ₹2.5 L/yr - ₹3 L/yr |
Developer
4
salaries
| ₹3.5 L/yr - ₹4.5 L/yr |
TCS
Accenture
Wipro
Cognizant