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
Round 3: 1.Oops concepts 2.Oops code 2.About Java Spring 3. Array stack questions 4.Project discussion
2 DSA questions, medium to hard level Some dev related questions related to HTTP methods and REST APIs
Basic of testing and project-based question. Questions about the project did in college.
Given two strings, output the common characters.
What is Python tuple. What is the significance?
c++ questions were asked first round
Name a time when you had to overcome a difficult challenge in the workplace.
What is your favourite module and why?
Describe this [a specific experience] on your resume?
Viewing 8381 - 8390 interview questions