Filter interviews by
I applied via Naukri.com and was interviewed before Sep 2023. There were 4 interview rounds.
Easy questions with all main topics like work, distance and time.
Python,java coding questions with multiple choice also.
In 2 years, I see myself as a skilled software engineer contributing to innovative projects and taking on more responsibilities.
Continuing to enhance my technical skills through ongoing learning and training opportunities
Taking on leadership roles within project teams
Contributing to the development of new software products or features
Building strong relationships with colleagues and mentors for career growth
Possibly pu...
I appeared for an interview in Feb 2024.
Single responsibility principle states that a class should have only one reason to change.
Each class should have only one responsibility
Helps in making code more maintainable and easier to understand
Promotes separation of concerns
Example: A class that handles user authentication should not also handle file management
I applied via Campus Placement and was interviewed in Oct 2024. There were 2 interview rounds.
Loop in linked list is a situation where a node points to a previous node in the list, creating an infinite loop.
Check for loops using Floyd's cycle detection algorithm
Use two pointers, one moving twice as fast as the other, to detect a loop
If the fast pointer catches up to the slow pointer, there is a loop
Two coding questions, one is easy and the other is difficult. Who solved 2nd question was shortlisted for an interview.
posted on 10 Sep 2023
It was an easy test. It consisted of MCQs and two coding qns. Prepare SQL well. It also had 2 programming question. Both were medium difficukty
I applied via Referral and was interviewed in Aug 2021. There was 1 interview round.
Find k min elements in given array.
Sort the array and return the first k elements.
Use a min heap of size k to find the k min elements.
Use quickselect algorithm to find the kth smallest element and return first k elements smaller than it.
Check if a given tree is a Binary Search Tree (BST) or not.
Traverse the tree in-order and check if the elements are in ascending order.
Check if the maximum value in the left subtree is less than the root and the minimum value in the right subtree is greater than the root.
Use recursion to check if all subtrees are BSTs.
Time complexity: O(n), Space complexity: O(h) where h is the height of the tree.
Given a BST and a sum, find a pair of nodes whose values add up to the given sum.
Traverse the BST in-order and store the nodes in a list
Use two pointers approach to find the pair with the given sum
If the sum is less than the current pair, move the right pointer to the left
If the sum is greater than the current pair, move the left pointer to the right
If the sum is equal to the current pair, return the pair
Time complexit
I applied via Company Website and was interviewed in May 2021. There were 5 interview rounds.
Two easy questions two wasy questions two easy questions two easy questions
First round was aptitude with coding round it was easy
1 coding question, and basic MCQ
based on 1 interview
Interview experience
Software Development Engineer
54
salaries
| ₹4.8 L/yr - ₹9 L/yr |
Data Engineer
51
salaries
| ₹5 L/yr - ₹13 L/yr |
Software Developer
35
salaries
| ₹4.8 L/yr - ₹12 L/yr |
Software Engineer
34
salaries
| ₹4 L/yr - ₹11.7 L/yr |
Hadoop Administrator
25
salaries
| ₹5.2 L/yr - ₹16 L/yr |
Markelytics Solutions
Savista Global Solutions
Jasper Colin
GfK MODE