Kanerika Software Associate Software Engineer Interview Questions and Answers

Mcqs on javascript,. 1 coding question

There will be 3 coding questions. They are of medium and hard level.

Q1. Sort array consisting 0's 1's and 2's without inbuilt functions
Ans. 
Sort an array of 0's, 1's, and 2's without using inbuilt functions.
• Use three pointers to keep track of the last index of 0's, 1's, and 2's

• Iterate through the array and swap elements based on their value

• Continue until all elements are sorted
Answered by AI
View 1 more answer

Q1. Os cn related questions
Add your answer

Q1. Java questions and general hr questions
Add your answer

I had to evaluate a software and let them understand where this software could be implemented and the pros and cons of the software.

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