Ninjacart Software Developer Intern Interview Questions and Answers for Freshers

Easy to medium level of leet code

Q1. 1. Fibonacci series with recursion and without recursion 2. String Palindrome 3. Count all repeated numbers from the array
Ans. 
Answering questions related to Fibonacci series, string palindrome, and counting repeated numbers in an array.
• For Fibonacci series with recursion, write a function that calls itself to calculate the next number in the series.

• For Fibonacci series without recursion, use a loop to calculate the series.

• For string palindrome, compare characters from start and end of the string.

• To count all repeated numbers from the array, u...read more
Answered by AI
View 2 more answers

Q1. 1.Given an array(0-based indexing), you have to find the max sum of i*A[i] where A[i] is the element at index i in the array. The only operation allowed is to rotate(clock-wise or counter clock-wise) the ...read more
Ans. 
Rotate array to find max sum of i*A[i]
• Rotate array to bring maximum element to front

• Calculate sum of i*A[i] for each rotation

• Keep track of maximum sum found
Answered by AI
Add your answer

Q1. 1.Oops concepts 2.Oops code 2.About Java Spring 3. Array stack questions 4.Project discussion
Add your answer

3 Questions were asked out of which if you did 2 you were shortlisted for next round. Questions were mostly from topics like array, string and greedy