Filter interviews by
I applied via Referral and was interviewed in Oct 2024. There were 3 interview rounds.
Sorting algorithms are used to arrange elements in a specific order.
Different sorting algorithms include bubble sort, selection sort, insertion sort, merge sort, quick sort, etc.
Complexity of sorting algorithms varies based on the number of elements being sorted.
Efficient sorting algorithms like merge sort and quick sort are commonly used in practice.
I applied via Approached by Company and was interviewed in Oct 2024. There was 1 interview round.
Our current automation framework is a keyword-driven framework built using Selenium and TestNG.
Keyword-driven framework allows for easy test case creation and maintenance
Utilizes Selenium for web automation and TestNG for test execution and reporting
Supports data-driven testing for reusability and scalability
Java code to print frequency of each character in a string
Create a HashMap to store character frequencies
Iterate through the string and update the frequencies in the HashMap
Print the frequencies of each character
Basucs of HTML, CSS , SQL and competative question, each for 10 marks, score 40 go get into next round.
Blink Health interview questions for popular designations
On Codesignal, topics related to dsu, and minimum spanning tree, dp etc. were asked.
I applied via Naukri.com and was interviewed in Aug 2023. There were 3 interview rounds.
It was easy to solve case study
Reverse nodes in groups of K
Create a function that takes a linked list and an integer K as input
Reverse the nodes in groups of K
Return the modified linked list
A sliding window rate limiter limits the rate of incoming requests within a sliding time window.
Define a time window and a maximum number of requests allowed within that window
Track the number of requests received within the window using a data structure like a queue or circular buffer
Reject requests that exceed the maximum allowed within the window
Slide the window forward as time passes, removing requests that fall ou...
Identify data structure based on insertion and deletion order
If insertion and deletion follow LIFO order, it is a stack
If insertion follows FIFO order and deletion follows LIFO order, it is a queue
If insertion and deletion follow priority order, it is a priority queue
Find maximum element in an array in less than O(N)
Use divide and conquer approach
Compare maximum of left and right subarrays
Recursively find maximum element
I applied via Approached by Company and was interviewed in Feb 2022. There were 2 interview rounds.
I applied via Naukri.com and was interviewed in Jun 2024. There was 1 interview round.
The coding test was divided in 4 sections:
1> Java and SpringBoot multiple choice questions
The question topics included, multihreading, springboot context, security
2> Leetcode style program question 1 - Easy
3> Leetcode style program question 2 - Medium
Length of longest consecutive ones by at most one swap.
4> Sql query question
based on 6 interviews
Interview experience
based on 7 reviews
Rating in categories
Software Engineer
4
salaries
| ₹30 L/yr - ₹35 L/yr |
Devops Engineer
4
salaries
| ₹4.5 L/yr - ₹5 L/yr |
Senior Software Engineer
3
salaries
| ₹30 L/yr - ₹66.2 L/yr |
Senior Software Engineer 2
3
salaries
| ₹80 L/yr - ₹84 L/yr |
Tata 1mg
PharmEasy
Medlife
Netmeds.com