Filter interviews by
I applied via Campus Placement and was interviewed before Apr 2020. There were 4 interview rounds.
Top trending discussions
I applied via Walk-in and was interviewed before Mar 2021. There were 3 interview rounds.
Aptitude test
Current affairs
I applied via Campus Placement and was interviewed before Oct 2021. There were 2 interview rounds.
Scaling refers to increasing capacity of a system. Horizontal scaling adds more machines, while vertical scaling adds more resources to a machine.
Horizontal scaling involves adding more machines to a system to increase capacity
Vertical scaling involves adding more resources to a machine to increase capacity
Use cases for horizontal scaling include handling increased traffic or adding redundancy
Use cases for vertical sca...
posted on 30 Nov 2022
I applied via LinkedIn and was interviewed before Nov 2021. There were 3 interview rounds.
There are basic aptitude questions for freshers level
posted on 10 Feb 2022
Nothing
posted on 16 Mar 2023
I applied via Walk-in and was interviewed before Mar 2022. There were 3 interview rounds.
Java and python test was there
posted on 21 Dec 2024
I applied via Approached by Company and was interviewed before Dec 2023. There were 4 interview rounds.
2 sum program from Geeks for Geeks
Lazy loading delays loading of related data until it is specifically requested, while eager loading loads all related data upfront. N+1 problem occurs when lazy loading results in multiple additional queries being made.
Lazy loading is used to improve performance by only loading related data when needed
Eager loading loads all related data upfront to reduce the number of queries made
N+1 problem occurs in lazy loading whe...
posted on 16 Sep 2021
I appeared for an interview before Sep 2020.
Round duration - 70 Minutes
Round difficulty - Hard
Prateek is a kindergarten teacher with a mission to distribute candies to students based on their performance. Each student must get at least one candy, and if two s...
The task is to distribute candies to students based on their performance while minimizing the total candies distributed.
Create an array to store the minimum candies required for each student.
Iterate through the students' ratings array to determine the minimum candies needed based on the adjacent ratings.
Consider both left-to-right and right-to-left passes to ensure fair distribution.
Keep track of the total candies dist
You are given a sequence of numbers, ARR
. Your task is to return a sorted sequence of ARR
in non-descending order using the Merge Sort algorithm.
The Merge Sort...
Implement Merge Sort algorithm to sort a sequence of numbers in non-descending order.
Use Divide and Conquer approach to recursively divide the input array into two halves.
Merge the sorted halves to produce a completely sorted array.
Ensure the implementation handles the constraints specified in the problem statement.
Example: For input [3, 1, 4, 1, 5], the output should be [1, 1, 3, 4, 5].
Tip 1 : Practice Atleast 250 Questions
Tip 2 : Do atleast 2 projects
Tip 1 : Do not put false things on resume.
Tip 2 : Have some projects on resume.
Member Technical Staff
39
salaries
| ₹3.8 L/yr - ₹6.2 L/yr |
Product Consultant
35
salaries
| ₹2.7 L/yr - ₹6.2 L/yr |
Business Consultant
24
salaries
| ₹3.6 L/yr - ₹5.6 L/yr |
Quality Analyst
22
salaries
| ₹4 L/yr - ₹7.2 L/yr |
Senior Member of Technical Staff
22
salaries
| ₹4.8 L/yr - ₹9 L/yr |
Maxgen Technologies
Value Point Systems
JoulestoWatts Business Solutions
F1 Info Solutions and Services