Filter interviews by
I applied via Naukri.com and was interviewed before Mar 2022. There were 3 interview rounds.
To find distinct elements in a list
Create an empty set
Iterate through the list and add each element to the set
Return the set
I am a software test engineer with experience in testing various software applications.
I have a strong understanding of software testing methodologies and techniques.
I am skilled in creating test plans, test cases, and test scripts.
I have experience in both manual and automated testing.
I am proficient in using testing tools such as Selenium and JUnit.
I have worked on testing web applications, mobile applications, and d...
Top trending discussions
Binary Search has a time complexity of O(log n) and is derived from dividing the search space in half at each step.
Binary Search is a search algorithm that works on sorted arrays.
It starts by comparing the target value to the middle element of the array.
If the target value is smaller, the search continues on the lower half of the array.
If the target value is larger, the search continues on the upper half of the array.
T...
QuickSort is a sorting algorithm that uses divide and conquer approach.
Choose a pivot element from the array
Partition the array into two sub-arrays, one with elements less than the pivot and one with elements greater than the pivot
Recursively apply the above steps to the sub-arrays
Combine the sorted sub-arrays to get the final sorted array
Code for Fibonacci Series using Recursion, Iteration and Dynamic Programming
Recursion: Define a function that calls itself with the previous two numbers in the series as arguments
Iteration: Use a loop to calculate the series by adding the previous two numbers in each iteration
Dynamic Programming: Store the previous two numbers in variables and use them to calculate the next number in the series
Implementing a Queue using Stacks
Use two stacks to implement a queue
Push elements onto the first stack
When dequeuing, pop all elements from the first stack and push onto the second stack
Pop the top element from the second stack to dequeue
If the second stack is empty, pop all elements from the first stack and push onto the second stack
MergeSort is a divide and conquer algorithm that sorts an array of strings.
Divide the array into two halves
Recursively sort the two halves
Merge the sorted halves
Counting Sort is a sorting algorithm that sorts elements by counting the number of occurrences of each unique element.
Count the occurrences of each element in the array
Calculate the cumulative sum of the counts
Place each element in the sorted array based on its count and cumulative sum
Time complexity is O(n+k) where n is the number of elements and k is the range of input
Example: Sort an array of strings based on their
Chrome uses an algorithm to predict and suggest words based on user input.
Chrome's algorithm uses a combination of user history, bookmarks, and popular searches to predict and suggest words.
The algorithm also takes into account the frequency and recency of the user's input.
Chrome's suggestion feature is powered by Google's Autocomplete API, which uses machine learning to predict and suggest words.
The suggestions are di...
I applied via Company Website and was interviewed before Dec 2020. There were 4 interview rounds.
I applied via Company Website and was interviewed before Jul 2021. There were 2 interview rounds.
Attended the codevita competition in final year of college.
I applied via Campus Placement and was interviewed before Mar 2021. There were 2 interview rounds.
OOPs concept in JAVA is a programming paradigm that focuses on objects and their interactions.
OOPs stands for Object-Oriented Programming
It involves the use of classes, objects, inheritance, polymorphism, and encapsulation
Classes are used to define objects and their properties
Objects are instances of classes that can interact with each other
Inheritance allows for the creation of new classes based on existing ones
Polymo...
Java provides Arrays.sort() method to sort an array.
Use Arrays.sort() method to sort an array of strings.
The method sorts the elements in ascending order by default.
To sort in descending order, use Collections.reverseOrder() method.
I applied via Newspaper Ad and was interviewed before Jun 2021. There were 3 interview rounds.
I applied via Company Website and was interviewed before Apr 2021. There were 2 interview rounds.
It's totally based on Basic understanding of concepts such as Linear arrangement, circular arrangement، blood relation, direction sense, ratio proportion, time, speed, distance
I applied via Naukri.com and was interviewed before Sep 2021. There were 3 interview rounds.
Entry level aptitude test
I applied via Company Website and was interviewed before Jul 2021. There were 2 interview rounds.
The first round is an aptitude online test that had Basics of Computer Science, Mathematics, English and then finally one basic program to code and compile like Palindrome.
Three panellists were present and it was a face-face round, Panellist 1 and 2 takes the technical discussions like classes, inheritance, oops concept, basic syntax, and such. Panellist 3 talks more about your resume skills, hobbies and the company overview.
I applied via Recruitment Consulltant and was interviewed before May 2021. There were 2 interview rounds.
based on 1 interview
Interview experience
based on 17 reviews
Rating in categories
4-5 Yrs
Not Disclosed
3-5 Yrs
Not Disclosed
4-5 Yrs
Not Disclosed
Assistant Manager
7
salaries
| ₹0 L/yr - ₹0 L/yr |
Associate Product Manager
4
salaries
| ₹0 L/yr - ₹0 L/yr |
Warehouse Associate
4
salaries
| ₹0 L/yr - ₹0 L/yr |
Purchase Manager
3
salaries
| ₹0 L/yr - ₹0 L/yr |
Customer Support Associate
3
salaries
| ₹0 L/yr - ₹0 L/yr |
HealthKart
Tata 1mg
PharmEasy
Netmeds.com