Faster and better experience!
Filter interviews by
Find starting and ending indices of repetitive character in a string.
Iterate through the string and keep track of the current character and its count.
When a different character is encountered, check if the count is greater than 1 and store the indices.
Repeat the process until the end of the string is reached.
Top trending discussions
I applied via LinkedIn and was interviewed in Feb 2021. There were 5 interview rounds.
posted on 6 Jan 2025
I applied via LinkedIn and was interviewed in Dec 2024. There were 2 interview rounds.
Based on JavaScript and Java.
A task based on JavaScript.
Find the second most occurrence of string in an array of strings.
Create a dictionary to store the count of each string in the array
Sort the dictionary by count in descending order
Return the key of the second element in the sorted dictionary
I applied via Campus Placement and was interviewed before Aug 2022. There were 3 interview rounds.
Before Aptitude Test, There was a telephonic interview round in which they test your communication and ask questions about your education and projects. You just have to show your confidence to pass this round. After that, the aptitude test was quite easy. There are 15 questions all are doable in just 15 to 20 minutes of time span.
After that, The coding round takes place in which they provide you with a device with an online compiler of your preferred programming language and ask you to solve 4 questions without using any built-in function. The questions are based on Linked Lists, Stacks, Arrays, etc. You have to do it all manually. This round lasts up to 1 hour.
I applied via Job Portal
Easy aptitude test containing mathematics and logical questions
4 leetcode easy to medium level
Find the second most occurrence of a string in an array of strings in JavaScript.
Create a map to store the count of each string in the array
Sort the map by values in descending order to find the most occurrence
Return the key of the second element in the sorted map
Coding is based scenario question , we have to write the code in paper. There is 1 hour time to complete the coding test.
Coding test in any language
Any topics for the GD
A palindrome is a word, phrase, number, or other sequence of characters that reads the same forward and backward.
Check if the input string is equal to its reverse
Ignore spaces and punctuation when checking for palindromes
Convert the input string to lowercase for case-insensitive comparison
I applied via Campus Placement and was interviewed in Jun 2024. There were 2 interview rounds.
A peak element in an array is an element that is greater than or equal to its neighbors.
Iterate through the array and check if the current element is greater than its neighbors.
If the element at index i is greater than or equal to elements at indices i-1 and i+1, it is a peak element.
Example: ['1', '3', '2', '4', '1'] has peak elements at index 1 and 3.
Rotate a 2D array by 90 degrees clockwise
Transpose the array
Reverse each row of the transposed array
Pollitices current generation
based on 1 interview
Interview experience
Software Engineer
59
salaries
| ₹3.6 L/yr - ₹12.8 L/yr |
Senior Software Engineer
32
salaries
| ₹6 L/yr - ₹17 L/yr |
Senior QA Engineer
19
salaries
| ₹7.8 L/yr - ₹13.2 L/yr |
QA Engineer
15
salaries
| ₹4.9 L/yr - ₹9 L/yr |
Associate Software Engineer
11
salaries
| ₹2 L/yr - ₹5.6 L/yr |
NexTurn
Smarter BIZ Technologies
Nxtra Data
Zidio Development