Filter interviews by
I applied via Campus Placement and was interviewed before Apr 2023. There were 3 interview rounds.
Consist of Aptitude + Coding Test both in coding Test asked about construct a sql and one logical question and rest aptitude + logical
I applied via Company Website and was interviewed before Feb 2023. There were 3 interview rounds.
Make a flow using flow chart
Workflow is the sequence of steps or tasks that need to be completed in order to achieve a specific goal or outcome.
Workflow is a series of interconnected steps or activities.
It defines the order in which tasks should be performed.
Each step in the workflow may have inputs, outputs, and dependencies.
Workflow helps in streamlining processes and improving efficiency.
Examples of workflows include software development proce...
Testing is the process of evaluating a system or component to determine if it meets specified requirements.
Testing is an essential part of software development
It involves executing a program or system with the intent of finding errors
Types of testing include functional, performance, security, and usability testing
Testers use various techniques such as black-box, white-box, and gray-box testing
Test cases are designed to...
Test cases for appointment scheduling page
Verify that the user can select a date and time for the appointment
Ensure that the selected date and time are displayed correctly
Check if the user can enter their personal information (name, contact details)
Validate that the user can choose the type of appointment (e.g., consultation, follow-up)
Confirm that the user can submit the appointment request
Test if the system displays ...
Top trending discussions
I applied via Campus Placement and was interviewed before Mar 2023. There were 3 interview rounds.
4 questions , 3 DSA questions medium level and 1 DB design round
I applied via Referral and was interviewed in Apr 2024. There was 1 interview round.
I applied via Naukri.com and was interviewed before Jul 2023. There were 3 interview rounds.
Coding round and technical questions
Some technical questions and few questions related to past projects
I applied via Campus Placement
1 Hour 2 Medium Coding Question and few DB OOPS OS Questions on Hackerearth
I was interviewed in Nov 2023.
Questions were based on Computer Science Fundamentals, Coding and SQL
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...
based on 2 interviews
Interview experience
based on 14 reviews
Rating in categories
Software Engineer
18
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
12
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Developer
7
salaries
| ₹0 L/yr - ₹0 L/yr |
Android Developer
7
salaries
| ₹0 L/yr - ₹0 L/yr |
HR Manager
5
salaries
| ₹0 L/yr - ₹0 L/yr |
Practo
Lybrate
Portea Medical
PharmEasy