Filter interviews by
Top trending discussions
I applied via Campus Placement and was interviewed in May 2022. There were 4 interview rounds.
Basic dsa questions , basic recursion questions of trees ,graphs and searching algorithms there are some mcq questions that too on dsa
They asked few sql and dsa questions like a open board test
Sort a vector based on another vector
Use std::sort with a custom comparator function
The comparator function should compare the indices of the elements in the second vector
The first vector should be sorted based on the order of the indices in the second vector
I applied via Company Website and was interviewed in Apr 2023. There were 4 interview rounds.
Leetcode easy, medium
Sort an array of strings containing '0', '1', and '2'.
Use counting sort algorithm to count the occurrences of '0', '1', and '2'.
Create a new array with the sorted counts of '0', '1', and '2'.
Join the sorted array back into a single array of strings.
I applied via Campus Placement and was interviewed before Sep 2023. There were 3 interview rounds.
Basic aptitude questions
3 basic questions they asked
Pointer and SQL related questions
I applied via Campus Placement and was interviewed in Nov 2024. There were 2 interview rounds.
Easy 1 hr test and can be completed easily
I applied via Campus Placement
Coding test was really good it was easier to tackle the problem and writting code for it.
Developed a web-based project management tool for tracking tasks and deadlines.
Used React.js for front-end development
Implemented RESTful APIs using Node.js and Express
Utilized MongoDB for database storage
Incorporated authentication and authorization features for user security
I applied via Campus Placement and was interviewed in Mar 2024. There were 2 interview rounds.
Aptitude and coding of 2 hours
I applied via Campus Placement and was interviewed in Apr 2023. There were 4 interview rounds.
It was an 1hr interview session
Count the occurrence of each element in an array of strings
Iterate through the array and use a hashmap to store the count of each element
If element already exists in the hashmap, increment its count by 1
Return the hashmap with element counts
I appeared for an interview in Apr 2021.
Round duration - 120 minutes
Round difficulty - Easy
Timing was 9: 30 AM. Platform was quite good and easy to understand.
You are given a string S
. The task is to reverse the letters of the string while keeping non-alphabet characters in their original position.
S = "...
Reverse the letters of a string while keeping non-alphabet characters in their original position.
Iterate through the string and store the non-alphabet characters in their original positions
Reverse the letters using two pointers technique
Combine the reversed letters with the non-alphabet characters to get the final reversed string
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 array of integers from 0 to N-2.
Iterate through the array and keep track of the frequency of each number using a hashmap.
Return the number with a frequency greater than 1 as the duplicate number.
Given an array containing 'N' elements, the task is to reverse the order of all array elements and display the reversed array.
The elements of the given array need to...
Reverse the order of elements in an array and display the reversed array.
Iterate through the array from both ends and swap the elements until the middle is reached.
Use a temporary variable to store the element being swapped.
Print the reversed array after all elements have been swapped.
Given an integer 'N', continue summing its digits until the result is a single-digit number. Your task is to determine the final value of 'N' after applying this operation ...
Given an integer, find the final single-digit value after summing its digits iteratively.
Iteratively sum the digits of the given integer until the result is a single-digit number
Output the final single-digit integer for each test case
Handle multiple test cases efficiently
Round duration - 30 minutes
Round difficulty - Easy
Timing was 9:30 AM. The interviewer was very nice.
Calculate the Nth term in the Fibonacci sequence, where the sequence is defined as follows: F(n) = F(n-1) + F(n-2)
, with initial conditions F(1) = F(2) = 1
.
Calculate the Nth Fibonacci number efficiently using dynamic programming.
Use dynamic programming to store and reuse previously calculated Fibonacci numbers.
Start with base cases F(1) and F(2) as 1, then calculate subsequent Fibonacci numbers.
Optimize the solution to avoid redundant calculations by storing intermediate results.
Time complexity can be reduced to O(N) using dynamic programming.
Example: For N = 5, the 5th F
SQL query to find the second highest salary from a table
Use the MAX() function to find the highest salary
Use the NOT IN operator to exclude the highest salary from the results
Order the results in descending order and limit the query to return only the second row
Round duration - 30 minutes
Round difficulty - Medium
Timing was 12 PM. Interviewer was not good.
You are given a string 'S' of length 'N'. Your task is to find the frequency of each character from 'a' to 'z' in the string.
S : abcdg
1...
The task is to find the frequency of each character from 'a' to 'z' in a given string.
Create an array of size 26 to store the frequency of each character from 'a' to 'z'.
Iterate through the string and increment the corresponding index in the array for each character encountered.
Print the array of frequencies as the output for each test case.
Normalization is the process of organizing data in a database to reduce redundancy and improve data integrity.
Normalization is a database design technique used to structure a relational database in a way that reduces data redundancy and improves data integrity.
Third Normal Form (3NF) is a level of database normalization where every non-prime attribute of a table is dependent on the primary key.
To achieve 3NF, a table m...
Tip 1 : Do 2 projects.
Tip 2 : Practice data structures programs.
Tip 3 : Take a course on Coding Ninjas.
Tip 1 : Keep it short.
Tip 2 : Do not put false things on resume.
I appeared for an interview in Oct 2020.
Round duration - 90 minutes
Round difficulty - Easy
There were two section Aptitude and Coding.
Imagine you are Harshad Mehta's friend, and you have been given the stock prices of a particular company for the next 'N' days. You can perform up to two buy-and-sell ...
The task is to determine the maximum profit that can be achieved by performing up to two buy-and-sell transactions on a given set of stock prices.
Iterate through the array of stock prices and calculate the maximum profit that can be achieved by buying and selling at different points.
Keep track of the maximum profit after the first transaction and the maximum profit overall by considering different combinations of buy a...
Round duration - 60 minutes
Round difficulty - Easy
This was the first technical interview.
You are given an integer array 'ARR' of size 'N' and an integer 'S'. Your task is to find and return a list of all pairs of elements where each sum of a pair equals 'S'.
Find pairs of elements in an array that sum up to a given value, sorted in a specific order.
Iterate through the array and for each element, check if the complement (S - current element) exists in a hash set.
Keep track of pairs in a hash set to avoid duplicates.
Sort the pairs based on the criteria mentioned in the question.
Return the sorted list of pairs.
Tip 1 : Prepare theory subjects well
Tip 2 : Start doing some development and learn a framework from 2nd year
Tip 1: Mention projects with technologies
Tip 2: Make important words in bold
based on 1 interview
Interview experience
Software Engineer
65
salaries
| ₹3.6 L/yr - ₹10.5 L/yr |
Senior Software Engineer
59
salaries
| ₹6.7 L/yr - ₹21 L/yr |
Project Engineer
39
salaries
| ₹1.5 L/yr - ₹4 L/yr |
Software Developer
36
salaries
| ₹3 L/yr - ₹12.1 L/yr |
Network Engineer
31
salaries
| ₹2.4 L/yr - ₹4.1 L/yr |
Tekwissen
Softenger
XcelServ Solutions
Damco Solutions