Filter interviews by
I applied via Recruitment Consulltant and was interviewed in Jul 2022. There were 3 interview rounds.
30 min duration 1 simple program
Top trending discussions
I applied via Campus Placement and was interviewed in Jun 2024. There was 1 interview round.
To determine if a number is a Fibonacci number or not.
Check if 5*n^2 + 4 or 5*n^2 - 4 is a perfect square
If either of the above conditions is true, the number is a Fibonacci number
Example: 5 is a Fibonacci number as 5*5 - 4 = 21 which is a perfect square
Implement caching by storing frequently accessed data in memory to improve response time.
Identify frequently accessed data that can be cached
Choose an appropriate caching strategy (e.g. in-memory caching, distributed caching)
Implement caching mechanisms such as Redis or Memcached
Set expiration policies for cached data to ensure freshness
Monitor cache performance and adjust as needed
I applied via Naukri.com and was interviewed before Apr 2021. There were 2 interview rounds.
posted on 10 May 2020
I applied via Recruitment Consultant and was interviewed in Apr 2020. There were 4 interview rounds.
I applied via Naukri.com and was interviewed before Nov 2021. There were 2 interview rounds.
I applied via Company Website and was interviewed in Jul 2021. There was 1 interview round.
Complex SQL scenarios and their results
Using subqueries to filter data
Joining multiple tables with complex conditions
Using window functions to calculate running totals
Pivoting data to transform rows into columns
Using recursive queries to traverse hierarchical data
posted on 15 Jul 2022
I applied via Referral and was interviewed before Jul 2021. There were 3 interview rounds.
If you are a fresher , then this is for you else almost no coding test for experienced candidates.
I applied via Walk-in and was interviewed before Mar 2021. There were 3 interview rounds.
Aptitude test
Current affairs
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.
based on 1 interview
Interview experience
based on 1 review
Rating in categories
Technical Lead
50
salaries
| ₹9.1 L/yr - ₹24 L/yr |
Senior System Executive
43
salaries
| ₹5 L/yr - ₹13.5 L/yr |
Senior Systems Engineer
29
salaries
| ₹4.3 L/yr - ₹19 L/yr |
System Executive
25
salaries
| ₹3 L/yr - ₹8 L/yr |
System Engineer
23
salaries
| ₹3.6 L/yr - ₹6.5 L/yr |
Maxgen Technologies
Value Point Systems
JoulestoWatts Business Solutions
F1 Info Solutions and Services