Filter interviews by
I applied via Referral and was interviewed before Jul 2022. There were 4 interview rounds.
Its was more of quantitave and logic questions
Top trending discussions
I applied via Approached by Company
Joining tables with different joins in SQL
Use INNER JOIN to return rows when there is at least one match in both tables
Use LEFT JOIN to return all rows from the left table and the matched rows from the right table
Use RIGHT JOIN to return all rows from the right table and the matched rows from the left table
Use FULL JOIN to return rows when there is a match in one of the tables
posted on 28 Jul 2021
I applied via Campus Placement and was interviewed before Jul 2020. There was 1 interview round.
Check if binary tree is balanced or not.
A balanced binary tree has the height of left and right subtrees differ by at most 1.
Recursively check the height of left and right subtrees and compare.
Use a helper function to calculate the height of a subtree.
Time complexity: O(nlogn) for a balanced tree, O(n^2) for a skewed tree.
Detect loops in a linked list.
Use two pointers, one moving at a faster pace than the other.
If there is a loop, the faster pointer will eventually catch up to the slower one.
To detect the start of the loop, reset one pointer to the head and move both pointers at the same pace.
I applied via Campus Placement and was interviewed before Aug 2020. There were 4 interview rounds.
posted on 16 Sep 2021
I appeared for an interview before Sep 2020.
Round duration - 60 mins
Round difficulty - Medium
Given a railway seat number represented as an integer, determine if it is a valid seat number and identify its berth type. Possible berth types include lower berth, middle...
Given a railway seat number, determine if it is valid and identify its berth type.
Parse input integer 't' for number of test cases
For each test case, check if seat number is valid (1 <= N <= 100)
Identify berth type based on seat number and output the result
Possible berth types are Lower, Middle, Upper, Side Lower, and Side Upper
Round duration - 90 mins
Round difficulty - Hard
First they asked me to introduce myself then they started questioning on oops concept from basic to advance level such as inheritance, polymorphism, abstraction, exception handling , STL etc. Next they started questioning on data structures. They asked me the logic of “how to find the middle of a linked list”.
You are provided with a square matrix. Your task is to return true
if the matrix is symmetric; otherwise, return false
.
A symmetric matrix is characterized by its transpose being eq...
Check if a square matrix is symmetric by comparing it with its transpose.
Iterate through the matrix and compare each element with its corresponding element in the transpose
If any pair of elements do not match, return false immediately
If all pairs match, return true at the end
Tip 1 : Clear the basic concepts of data structure and OOPs.
Tip 2 : Use coding ninja platform and Hackerearth for practice on coding skills.
Tip 3 : Use Geeks For Geeks for interview preparation.
Tip 1: Make your resume short and try to make it of one page only.
Tip 2: Add relevant keywords
I applied via Campus Placement and was interviewed in Sep 2023. There were 2 interview rounds.
Quant, logical reasoning, mathematics
Abstract class is a class with abstract methods, interface is a contract with only abstract methods. Array is fixed size, ArrayList is dynamic. Method overloading is same method with different parameters, overriding is redefining a method. OOP pillars are inheritance, encapsulation, polymorphism, abstraction. Deadlock is a situation where two or more processes are unable to proceed because each is waiting for the other...
posted on 9 Oct 2024
Easy applitute question with 1 coding question at the end
String builder is faster but not thread-safe, while string buffer is slower but thread-safe.
String builder is recommended for single-threaded applications for better performance.
String buffer is recommended for multi-threaded applications to ensure thread safety.
Example: StringBuilder sb = new StringBuilder(); StringBuffer sbf = new StringBuffer();
The final keyword in OOP is used to restrict the user from changing the value of a variable, overriding a method, or inheriting from a class.
Final variable: value cannot be changed once assigned
Final method: cannot be overridden in child classes
Final class: cannot be inherited by other classes
BSF graph explanation
BFS (Breadth-First Search) is a graph traversal algorithm that explores all the neighbor nodes at the present depth before moving on to the nodes at the next depth.
It uses a queue data structure to keep track of the nodes to visit next.
BFS is often used to find the shortest path in an unweighted graph.
Example: BFS can be used to find the shortest path in a maze from the starting point to the exit.
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 Referral and was interviewed in Oct 2021. There were 3 interview rounds.
based on 1 interview
Interview experience
based on 3 reviews
Rating in categories
Software Engineer
92
salaries
| ₹5 L/yr - ₹18.3 L/yr |
Associate Software Engineer
42
salaries
| ₹5.9 L/yr - ₹8 L/yr |
Revenue Analyst
32
salaries
| ₹4.5 L/yr - ₹6.2 L/yr |
Senior Analyst
32
salaries
| ₹5.2 L/yr - ₹7.5 L/yr |
Senior Software Engineer
31
salaries
| ₹16 L/yr - ₹27 L/yr |
Medcode
Maxgen Technologies
Cyfuture
Value Point Systems