Filter interviews by
I applied via Company Website and was interviewed in Jul 2022. There were 4 interview rounds.
Apt + coding questions, medium difficulty
I applied via Naukri.com and was interviewed in Mar 2022. There were 3 interview rounds.
1st Round is Up to an hr in that we have to perform Coding as per the test provided & also SQL round involve in it we have to show as output as per the test is concerned to provide valid outputs.
2nd round was an aptitude test of 90 mins it was like 100 Questions we have to solve and submit that it involved Logical Reasoning, Mathematical problems, Word Problems, etc.
I applied via Naukri.com and was interviewed before May 2020. There were 4 interview rounds.
Swapping two numbers without using a third variable
Use arithmetic operations to swap the values
Add the two numbers and store the result in the first variable
Subtract the second number from the result and store it in the second variable
Subtract the second variable from the first variable to get the original value of the second variable
Top trending discussions
I applied via Naukri.com and was interviewed in Apr 2020. There was 1 interview round.
Synchronous means happening at the same time, while asynchronous means not happening at the same time.
Synchronous operations occur in real-time, while asynchronous operations can be delayed or queued.
Synchronous operations block the program until they are completed, while asynchronous operations allow the program to continue running.
Examples of synchronous operations include function calls and loops, while examples of ...
CTE and temp table usage in SQL
Use CTE for recursive queries and complex subqueries
Use temp tables for large data sets and complex queries
CTE is more efficient for small data sets
Temp tables can be indexed for faster performance
Consider the scope and lifespan of the data when choosing between CTE and temp table
I was interviewed in Nov 2020.
Round duration - 135 minutes
Round difficulty - Easy
Coding questions was easy if you know the basic of coding in any language. I submitted optimized solution for every questions that's why i got selected in this round.
You are given an encrypted string where repeated substrings are represented by the substring followed by its count. Your task is to find the K'th character of the d...
Given an encrypted string with repeated substrings represented by counts, find the K'th character of the decrypted string.
Parse the encrypted string to extract substrings and their counts
Iterate through the substrings and counts to build the decrypted string
Track the position in the decrypted string to find the K'th character
You are provided with an undirected graph containing 'N' vertices and 'M' edges. The vertices are numbered from 1 to 'N'. Your objective is to determi...
Detect if an undirected graph contains a cycle.
Use Depth First Search (DFS) to traverse the graph and detect cycles.
Maintain a visited array to keep track of visited vertices.
If a visited vertex is encountered again during DFS, a cycle exists.
Check for back edges while traversing the graph.
Consider disconnected graphs as well.
Round duration - 150 minutes
Round difficulty - Medium
You are provided with an array ARR
consisting of N
distinct integers in ascending order and an integer TARGET
. Your objective is to count all the distinct pairs in ARR
whose sum...
Count distinct pairs in an array whose sum equals a given target.
Use two pointers approach to iterate through the array and find pairs with sum equal to target.
Keep track of visited pairs to avoid counting duplicates.
Return -1 if no such pair exists with the given target.
You are given a palindrome number represented as a string S
. Your task is to find the largest palindrome number that is strictly less than S
.
T...
Given a palindrome number represented as a string, find the largest palindrome number that is strictly less than the given number.
Iterate from the middle towards the start and end of the string to find the next smaller palindrome.
If the number is odd in length, simply mirror the left half to the right half to get the next smaller palindrome.
If the number is even in length, decrement the middle digit and mirror the left...
Given two strings STR1
and STR2
, determine the length of their longest common subsequence.
A subsequence is a sequence that can be derived from another sequen...
The problem involves finding the length of the longest common subsequence between two given strings.
Use dynamic programming to solve this problem efficiently.
Create a 2D array to store the lengths of common subsequences of substrings.
Iterate through the strings to fill the array and find the length of the longest common subsequence.
Example: For input STR1 = 'abcde' and STR2 = 'ace', the longest common subsequence is 'a
Round duration - 30 minutes
Round difficulty - Easy
Interview went well.The interviewer asked me how the previous interviews were.
Given a binary tree of integers, your task is to output the boundary nodes of this binary tree in Anti-Clockwise order, starting from the root node.
The b...
Output the boundary nodes of a binary tree in Anti-Clockwise order, starting from the root node.
Traverse the left boundary nodes in top-down order
Traverse the leaf nodes from left to right
Traverse the right boundary nodes in bottom-up order
Combine the above traversals to get the boundary nodes in Anti-Clockwise order
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 the positions of 0s, 1s, and 2s in the array.
Iterate through the array and swap elements based on the values encountered.
Maintain left pointer for 0s, right pointer for 2s, and current pointer for traversal.
Example: If current element is 0, swap it with element at left pointer and increment both pointers.
Round duration - 20 minutes
Round difficulty - Easy
This round is very easy, In this round they basically need confidence and truthful person.
Tip 1 : For Data Structures number of questions doesn't matter. Try to understand the logic behind them and try to apply them in creating multiple scenario's.
Tip 2 : Do lot of hard work and practice of Data Structures and Algorithms based questions
Tip 3 : See which part interests you more, Increase your knowledge horizon, Always try to build a system a system considering It will be served to millions of customers.
Tip 4 : I personally recommend you Coding Ninjas and Geeks For Geeks for interview preparation.
Tip 1 : Always try to make it a single page
Tip 2 : do mention all your skills which you are confident of in your resume.
Tip 3 : Always make resume company specific
I applied via Referral and was interviewed before Mar 2022. There were 3 interview rounds.
Basic coding questions And logical questions
Simple program for mathematics
I applied via Naukri.com and was interviewed in Feb 2024. There were 2 interview rounds.
Good number of questions on permutations, english etc
The company is a leading software development firm specializing in creating innovative solutions for various industries.
Specializes in creating innovative software solutions
Works with clients from various industries
Known for high-quality and reliable products
Has a strong team of experienced developers
Focuses on staying up-to-date with the latest technologies
based on 2 interviews
Interview experience
based on 12 reviews
Rating in categories
Research Manager
409
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Research Manager
370
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Analyst
280
salaries
| ₹0 L/yr - ₹0 L/yr |
Associate Research Manager
228
salaries
| ₹0 L/yr - ₹0 L/yr |
Consultant
158
salaries
| ₹0 L/yr - ₹0 L/yr |
Nielsen Holdings
GfK MODE
Ipsos
Market Xcel Data Matrix