Filter interviews by
I applied via Recruitment Consultant and was interviewed in Jan 2021. There was 1 interview round.
Program to find the second-highest number in a List, without sorting.
Iterate through the list and keep track of the highest and second-highest numbers.
Compare each number with the highest and second-highest numbers and update accordingly.
Return the second-highest number.
Program to reverse a linked list
Iterate through the linked list and change the direction of the pointers
Use three pointers to keep track of the current, previous and next nodes
Handle the edge cases of empty list and single node list
CAP theorem states that a distributed system cannot guarantee consistency, availability, and partition tolerance at the same time.
Consistency: all nodes see the same data at the same time
Availability: every request receives a response, without guarantee that it contains the most recent version of the information
Partition tolerance: system continues to function even when network partitions occur
Examples: Cassandra prior...
A Binary Search Tree is a data structure where each node has at most two children and the left child is smaller than the parent while the right child is greater.
Nodes are arranged in a hierarchical order.
Searching, insertion, and deletion can be done in O(log n) time complexity.
In-order traversal of a BST gives the nodes in sorted order.
Example: 5 is the root node, 3 is its left child, and 7 is its right child. 2 is th...
Top trending discussions
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.
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 Campus Placement
Dsa problems dp and tress problem
I am a passionate software engineer with 5 years of experience in developing web applications using various technologies.
5 years of experience in software development
Proficient in developing web applications
Skilled in using various technologies
Passionate about software engineering
The test was in hackerrank platform, it was moderate level.
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 10 Feb 2022
Nothing
posted on 18 Aug 2022
I applied via Campus Placement and was interviewed in Jul 2022. There were 3 interview rounds.
Questions based or percentage, profit loss, ratio
Stacks are a data structure that follows the Last In First Out (LIFO) principle.
Elements are added and removed from the top of the stack
Common operations include push (add element) and pop (remove element)
Stacks can be implemented using arrays or linked lists
Examples of stack usage include function call stack and undo/redo functionality in text editors
To find the middle number in a linked list.
Traverse the linked list using two pointers, one moving twice as fast as the other.
When the fast pointer reaches the end, the slow pointer will be at the middle node.
If the linked list has even number of nodes, there will be two middle nodes. Return either one.
I applied via Campus Placement and was interviewed in Jul 2024. There were 2 interview rounds.
Dp, trees and basic time complexity
I am a software engineer with 5 years of experience in developing web applications using Java, Spring, and Angular.
5 years of experience in software development
Proficient in Java, Spring, and Angular
Strong problem-solving skills
Experience working in Agile development environment
Software Engineer
209
salaries
| ₹8 L/yr - ₹25 L/yr |
Senior Software Engineer
125
salaries
| ₹10.7 L/yr - ₹29.5 L/yr |
QA Engineer
72
salaries
| ₹5.2 L/yr - ₹12.4 L/yr |
Software Developer
67
salaries
| ₹8.4 L/yr - ₹18 L/yr |
Softwaretest Engineer
46
salaries
| ₹3.4 L/yr - ₹7.2 L/yr |
Maxgen Technologies
Value Point Systems
JoulestoWatts Business Solutions
F1 Info Solutions and Services