i
Aditi Consulting
Filter interviews by
Top trending discussions
I applied via Company Website and was interviewed before Sep 2023. There was 1 interview round.
I applied via Company Website and was interviewed in Aug 2024. There were 2 interview rounds.
I applied via Naukri.com and was interviewed in Apr 2024. There was 1 interview round.
posted on 17 Feb 2025
I appeared for an interview in Jan 2025.
posted on 7 May 2021
I applied via Campus Placement and was interviewed in Nov 2020. There were 5 interview rounds.
Sets are unordered collections of unique elements while lists are ordered collections of elements.
Sets do not allow duplicate elements while lists do.
Sets do not maintain the insertion order while lists do.
Sets have faster lookup time for specific elements while lists have faster iteration time.
Examples of sets in Java include HashSet and TreeSet while examples of lists include ArrayList and LinkedList.
Finally block is used to execute code after try-catch block, regardless of whether an exception is thrown or not.
Finally block is optional and follows the catch block.
It is used to clean up resources like closing files, database connections, etc.
Finally block is executed even if an exception is not caught.
It is used to ensure that a certain piece of code is always executed.
Example: try { //code } catch (Exception e) { ...
posted on 9 Nov 2019
I applied via Company Website and was interviewed in Oct 2019. There were 5 interview rounds.
I appeared for an interview before Mar 2021.
Round duration - 30 minutes
Round difficulty - Medium
This was a MCQ round. 30 ques in 30 mins consisting of difficult quantitative aptitude questions were to be solved.
Round duration - 60 minutes
Round difficulty - Medium
In this test round, 2 coding questions were given. Either write the code or pseudo code
Given an integer N
, find all possible placements of N
queens on an N x N
chessboard such that no two queens threaten each other.
A queen can attack another queen if they ar...
The N Queens Problem involves finding all possible placements of N queens on an N x N chessboard without threatening each other.
Use backtracking algorithm to explore all possible configurations.
Keep track of rows, columns, and diagonals to ensure queens do not threaten each other.
Generate all valid configurations and print them out.
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 traversing the array.
Swap elements based on the values encountered to sort the array in-place.
Time complexity should be O(N) and space complexity should be O(1).
Round duration - 60 minutes
Round difficulty - Easy
This was a technical round with questions on DSA.
You are given a string of length N
. Your task is to reverse the string word by word. The input may contain multiple spaces between words and may have leading o...
Reverse words in a string while handling leading, trailing, and multiple spaces.
Split the input string by spaces to get individual words
Reverse the order of the words
Join the reversed words with a single space in between
You are provided with the head of a linked list containing integers. Your task is to determine if the linked list is circular.
Detect if a given linked list is circular by checking if it forms a closed loop.
Traverse the linked list using two pointers, one moving at double the speed of the other.
If the two pointers meet at any point, the linked list is circular.
If the faster pointer reaches the end of the list (NULL), the linked list is not circular.
Round duration - 30 minutes
Round difficulty - Easy
HR round with typical behavioral problems.
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.
posted on 10 Nov 2015
based on 1 interview
Interview experience
based on 3 reviews
Rating in categories
Technical Recruiter
111
salaries
| ₹3 L/yr - ₹6 L/yr |
Senior Technical Recruiter
95
salaries
| ₹4.1 L/yr - ₹10.5 L/yr |
Software Engineer
29
salaries
| ₹7.4 L/yr - ₹27.1 L/yr |
Technical Lead
28
salaries
| ₹32 L/yr - ₹89 L/yr |
Lead Recruiter
20
salaries
| ₹6.3 L/yr - ₹13 L/yr |
Tekwissen
Softenger
XcelServ Solutions
Damco Solutions