Filter interviews by
I applied via Naukri.com and was interviewed before Oct 2022. There were 3 interview rounds.
30 questions to solve
Top trending discussions
posted on 24 Aug 2024
posted on 30 Nov 2024
Rate limiter is a mechanism to control the rate of requests sent to a server
Implement a sliding window algorithm to track the number of requests within a specific time frame
Set a limit on the number of requests allowed per unit of time
Return an error response when the limit is exceeded
Test cases: 1. Send requests below the limit - should be successful. 2. Send requests above the limit - should receive an error response
posted on 8 Mar 2023
jQuery is a JavaScript library for DOM manipulation and event handling. Django is a Python web framework for building web applications.
jQuery simplifies HTML document traversing, event handling, and animating.
Django follows the Model-View-Template (MVT) architectural pattern.
Both are open-source and widely used in web development.
jQuery can be used with any web framework, while Django has its own ORM and templating eng
I applied via Company Website and was interviewed before Oct 2023. There were 2 interview rounds.
Hiring assessment of total 75 minutes
I applied via Recruitment Consulltant and was interviewed in Apr 2022. There were 5 interview rounds.
Minimum 2 platforms required for a railway station.
At least 2 platforms are required for trains to arrive and depart simultaneously.
Additional platforms may be required based on the frequency of trains and passenger traffic.
Platforms should be long enough to accommodate the longest trains that will use the station.
Platforms should also have appropriate facilities for passengers, such as seating, shelter, and signage.
Find set of numbers from an array that can form nearest sum to the given number.
Sort the array in ascending order
Use two pointers approach to find the nearest sum
Return the set of numbers
Trapping Rain Water Problem
The problem involves calculating the amount of water trapped between bars in a histogram
The solution involves finding the maximum height of bars on both sides of each bar and subtracting the height of the bar itself
This can be done using two arrays to store the maximum height of bars on the left and right side of each bar
The problem is to find the least cost to travel from source to destination using dynamic programming.
Use dynamic programming to solve the problem
Create a 2D array to store the minimum cost to reach each cell
Fill the array using the recurrence relation: minCost[i][j] = cost[i][j] + min(minCost[i-1][j], minCost[i][j-1], minCost[i-1][j-1])
The final answer will be stored in minCost[m][n], where m and n are the coordinates ...
Level order traversal of Binary tree
Use a queue to traverse the tree level by level
Enqueue the root node and then dequeue it and enqueue its children
Repeat until the queue is empty
posted on 15 Jun 2021
I applied via Referral and was interviewed in Mar 2022. There were 2 interview rounds.
I applied via Referral and was interviewed before Oct 2022. There were 5 interview rounds.
Analytical ability and computer basics
Couple of simple string programs
I applied via Approached by Company and was interviewed in Nov 2021. There were 2 interview rounds.
based on 1 interview
Interview experience
based on 1 review
Rating in categories
Software Engineer
245
salaries
| ₹7.5 L/yr - ₹23 L/yr |
Technical Consultant
191
salaries
| ₹5.2 L/yr - ₹19 L/yr |
Senior Technical Associate
158
salaries
| ₹6.9 L/yr - ₹14 L/yr |
Data Engineer
152
salaries
| ₹6.1 L/yr - ₹23 L/yr |
Senior Software Engineer
123
salaries
| ₹12.2 L/yr - ₹35 L/yr |
IBM
SAP
Oracle
Microsoft Corporation