Ho presentato la mia candidatura online. La procedura ha richiesto 4 settimane. Ho sostenuto un colloquio presso ninjacart (Bengaluru)
Colloquio
Their are two technical interview so in 1st the basics question related to program like, factorial, palindrome, etc.
In next they basically more focus on DSA (array, string) and in 3rd discuss about project and related basic question
Domande di colloquio [3]
Domanda 1
1. Fibonacci series with recursion and without recursion
2. String Palindrome
3. Count all repeated numbers from the array
Round 2:
1. Duplicate elements deletion without creating new array
2. Optimized Searching algorithm.
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 array any number of times.
2.Activity lifestyle
Ho presentato la mia candidatura tramite l'università. La procedura ha richiesto una settimana. Ho sostenuto un colloquio presso ninjacart (Bengaluru) nel mese di mar 2024
Colloquio
There are total 4 rounds
round 1-
online test
2 dsa questions 1 easy 1 medium
round 2-
technical interview 1- one dsa problem [ longest palindromic substring]
technical interview 2- two dsa problem in leetcode [interviewer give leetcode link ] binary tree easy [check two identical tree] , binary tree medium [ length of longest tree from leaf ]
technical interview 3 - one dsa problem + project discussion
binary tree problem[ print all tree path from root to leaf ]
Domande di colloquio [1]
Domanda 1
dsa problems
longest palindromic substring
length of longest tree from leaf
