Filter interviews by
I applied via Company Website and was interviewed in May 2024. There were 3 interview rounds.
First round was screening of resume and few basic coding questions
In second round there is 3 panels at same day for 3 hours one after one all there round are technical and coding interviews level is hard one after another round. Situational questions and current project details in deep. Be prepare for coding.
Top trending discussions
I applied via Company Website and was interviewed in Mar 2022. There were 3 interview rounds.
Reverse the linked list in groups of k
Iterate through the linked list in groups of k
Reverse each group of k nodes
Connect the reversed groups to form the final linked list
I applied via Naukri.com and was interviewed in Oct 2020. There were 3 interview rounds.
I was interviewed in Dec 2024.
The Longest Substring Without Repeating Characters problem involves finding the length of the longest substring without any repeating characters.
Best solution: Sliding Window approach with HashSet to track unique characters. Time complexity O(n), space complexity O(min(n, m)) where n is the length of the string and m is the size of the character set.
Worst solution: Brute force approach checking all substrings for uniqu...
posted on 15 Nov 2024
I applied via Referral and was interviewed in Oct 2024. There were 2 interview rounds.
Merge two sorted linked lists into a single sorted linked list
Create a new linked list to store the merged result
Iterate through both input linked lists and compare nodes to determine the order in which they should be added to the result list
Handle cases where one list is longer than the other
To check if parentheses are balanced, use a stack data structure to keep track of opening and closing parentheses.
Use a stack to push opening parentheses and pop when encountering a closing parenthesis
If stack is empty when encountering a closing parenthesis, return false
After iterating through all parentheses, if stack is empty, return true
The right view of a Binary Search Tree shows the nodes that are visible when viewing the tree from the right side.
The right view of a Binary Search Tree includes the rightmost node at each level.
Nodes at each level that are not visible from the right side are not included in the right view.
Example: For the Binary Search Tree with values 1, 2, 3, 4, 5, the right view would be 1, 3, 5.
posted on 3 Jan 2025
I applied via Campus Placement
A test that covers all fundamental topics, including networking, object-oriented programming (OOP), and data structures and algorithms (DSA).
I applied via Job Portal
React lifecycle functions are methods that are automatically called at specific points in a component's life cycle.
Mounting: constructor, render, componentDidMount
Updating: render, componentDidUpdate
Unmounting: componentWillUnmount
Padding is the space inside the border of an element, while margin is the space outside the border.
Padding is used to create space between the content and the border of an element.
Margin is used to create space between the border of an element and other elements.
Padding affects the size of the content area, while margin affects the positioning of the element.
Example: padding: 10px will create 10 pixels of space inside ...
posted on 28 Dec 2024
I applied via LinkedIn and was interviewed in Jun 2024. There were 5 interview rounds.
Java coding questions, basic Java questions.
posted on 29 Jan 2025
I was interviewed in Dec 2024.
Basic Oops MCQ and aptitude and one da
based on 1 interview
Interview experience
based on 9 reviews
Rating in categories
Senior Software Engineer
713
salaries
| ₹13.5 L/yr - ₹45 L/yr |
Software Engineer2
245
salaries
| ₹9.6 L/yr - ₹30 L/yr |
Software Engineer
236
salaries
| ₹6.1 L/yr - ₹22.9 L/yr |
Consultant
183
salaries
| ₹13.6 L/yr - ₹40 L/yr |
Lead Software Engineer
138
salaries
| ₹20 L/yr - ₹57.5 L/yr |
PayPal
Visa
American Express
Discover Financial Services