Filter interviews by
I applied via Naukri.com and was interviewed before Mar 2021. There was 1 interview round.
Time ,speed ,distance
Java application using oops concept
I applied via Campus Placement and was interviewed before Feb 2023. There were 2 interview rounds.
Topics:-
Duration-1.5 hours
Kadane's Algorithm, Even Numbers at even index & odd at odd index, print out the second highest node of the tree
ZigZag tree traversal is a method to traverse a binary tree in a zigzag pattern.
In ZigZag tree traversal, we visit the nodes of a binary tree in a zigzag pattern, moving from left to right and then right to left.
We can use a stack or a queue to implement ZigZag tree traversal.
The algorithm involves maintaining two stacks or two queues to keep track of the nodes at each level.
We start with the root node and alternate be...
JavaScript questions
I applied via Approached by Company and was interviewed in Jul 2023. There were 3 interview rounds.
Arrays, LinkedList basic dsa questions
To find the 2nd largest node in a binary tree, we can perform an in-order traversal and keep track of the two largest nodes.
Perform an in-order traversal of the binary tree
Keep track of the two largest nodes encountered
Return the second largest node when traversal is complete
I applied via Campus Placement and was interviewed before Jan 2023. There were 2 interview rounds.
Easy coding question generally A, B level question of codeforces
I applied via Referral and was interviewed before Aug 2022. There were 3 interview rounds.
I applied via Company Website and was interviewed in Aug 2023. There were 4 interview rounds.
I appeared for an interview in Apr 2021.
Round duration - 90 minutes
Round difficulty - Medium
Timing was 9 PM. Platform was not good. Platform was very lagging so overall it was bad experience.
Given an array 'ARR' of 'N' distinct integers, determine the third largest element in the array.
The first line contains a single integer 'T' representing the numb...
Find the third largest element in an array of distinct integers.
Sort the array in descending order and return the element at index 2.
Handle cases where the array has less than 3 elements separately.
Use a set to store distinct elements for efficient processing.
You are provided with a string STR
of length N. The task is to find the longest palindromic substring within STR
. If there are several palindromic substring...
Find the longest palindromic substring in a given string.
Iterate through the string and expand around each character to find palindromes
Keep track of the longest palindrome found so far
Return the longest palindromic substring
In this problem, Ninja is provided with two lines on a 2D plane. The first line 'AB' is determined by two points A and B. The second line 'PQ' is determined by two poi...
Calculate the intersection point of two lines on a 2D plane with precision up to six decimal places.
Implement a function to calculate the intersection point of two lines on a 2D plane
Handle precision up to six decimal places in the output
Return -1.000000 -1.000000 if the lines do not intersect
Ensure the lines 'AB' and 'PQ' are distinct
Tip 1 : Have some projects.
Tip 2 : Do a course from Coding Ninjas.
Tip 1 : Keep it short
Tip 2 : Add skills iff you are sure
I appeared for an interview in Apr 2021.
Round duration - 90 minutes
Round difficulty - Medium
Timing was 9 PM. Platform was not good. Platform was very lagging so overall it was bad experience.
Given an array 'ARR' of 'N' distinct integers, determine the third largest element in the array.
The first line contains a single integer 'T' representing the numb...
Find the third largest element in an array of distinct integers.
Sort the array in descending order and return the element at index 2.
Handle cases where there are less than 3 elements in the array.
Consider edge cases like negative integers and duplicates.
You are provided with a string STR
of length N
. The goal is to identify the longest palindromic substring within this string. In cases where multiple palind...
Identify the longest palindromic substring in a given string.
Iterate through each character in the string and expand around it to find palindromes
Keep track of the longest palindrome found so far
Return the longest palindromic substring with the smallest start index
In this problem, Ninja is provided with two lines on a 2D plane. The first line 'AB' is determined by two points A and B. The second line 'PQ' is determined by two poi...
Calculate the intersection point of two lines on a 2D plane with precision up to six decimal places.
Implement a function to calculate the intersection point of two lines on a 2D plane
Handle precision up to six decimal places in the output
Return -1.000000 -1.000000 if the lines do not intersect
Ensure the lines 'AB' and 'PQ' are distinct
Tip 1 : Have some projects.
Tip 2 : Do a course from Coding Ninjas.
Tip 1 : Keep it short.
Tip 2 : Do not put false things.
based on 6 reviews
Rating in categories
Software Developer
70
salaries
| ₹3.2 L/yr - ₹11.1 L/yr |
Application Developer
41
salaries
| ₹3.5 L/yr - ₹12 L/yr |
Senior Software Developer
38
salaries
| ₹7.6 L/yr - ₹16.5 L/yr |
Software Tester
31
salaries
| ₹3.5 L/yr - ₹9.1 L/yr |
Technical Lead
30
salaries
| ₹10.5 L/yr - ₹22 L/yr |
Mobikwik
Spice Money
Freecharge
Clix Capital Services