Xcelore Full Stack Developer Interview Questions and Answers

Q1. Find the second most occurrence of string.
Ans. 
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
Answered by AI
Add your answer

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.

Q1. The technical round takes place in which they ask different questions from your coding round, a few concept-based ones, and also a few questions to test your thinking and problem-solving abilities like the...read more
Add your answer

Easy aptitude test containing mathematics and logical questions

4 leetcode easy to medium level

Q1. Questions on project and tech stack.
Add your answer

Q1. Find the second most occurrence if string in JavaScript
Ans. 
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
Answered by AI
Add your answer

Coding test in any language

Any topics for the GD

Q1. Experience about the java script
Add your answer
Q2. My work experience about the java scirpt
Add your answer
Q3. Palindrome in any code language
Ans. 
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
Answered by AI
View 1 more answer
Q4. Other general maths programming questions
Add your answer

Q1. Peak element in array
Ans. 
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.
Answered by AI
View 1 more answer
Q2. 2 dimentional array rotate 90 degree
Ans. 
Rotate a 2D array by 90 degrees clockwise
• Transpose the array

• Reverse each row of the transposed array
Answered by AI
View 1 more answer

Pollitices current generation

Written Coding Test - Arrays, Matrix in any language

GD is Group Discussion only shortlisted students will attend GD Round

Q1. I've not attended
Add your answer
Q2. Then there will be a HR Round
Add your answer