Filter interviews by
I applied via Company Website and was interviewed in Sep 2023. There were 2 interview rounds.
I applied via Company Website and was interviewed in Nov 2021. There were 5 interview rounds.
I applied via Naukri.com and was interviewed before Aug 2021. There were 2 interview rounds.
Test of software concepts
Top trending discussions
posted on 16 Nov 2021
I applied via Campus Placement and was interviewed before Nov 2020. There were 3 interview rounds.
posted on 14 Sep 2021
posted on 13 Sep 2021
I applied via Recruitment Consultant and was interviewed in Mar 2021. There was 1 interview round.
posted on 6 Aug 2021
Write a query
Specify the database and table name
List the columns to be selected
Add any conditions or filters
Specify the order of results
posted on 24 Mar 2021
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
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.
based on 3 interviews
Interview experience
based on 50 reviews
Rating in categories
Project Coordinator
14
salaries
| ₹3.4 L/yr - ₹7.2 L/yr |
Site Engineer
10
salaries
| ₹3.6 L/yr - ₹4.6 L/yr |
Assistant Manager- Purchase
7
salaries
| ₹6 L/yr - ₹8 L/yr |
Assistant Manager
5
salaries
| ₹3 L/yr - ₹7.6 L/yr |
Site Supervisor
4
salaries
| ₹2.5 L/yr - ₹4.3 L/yr |
Reliance Communications
Henry Harvin Education
GAO Tek
Tata Teleservices