Filter interviews by
Clear (1)
I applied via Campus Placement
I applied via Campus Placement
Question on various topics
More questions on oops, coding
Not selected but the questions were mostly based on DSA time complexity and pseudo code
I applied via Campus Placement and was interviewed in Apr 2022. There were 5 interview rounds.
Basic aptitude questions. Just keep a track of time
2nd round is coding round. You can expect Leetcode medium questions. The topics asked are Linked list, Trees and arrays.
3rd round is again the Coding Test. Level of questions is Leetcode Medium to Leetcode Hard. Topics covered are Trees, Doubly Linked List, Dp etc.
Josh Technology Group interview questions for designations
I was interviewed 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 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.
Top trending discussions
I applied via Approached by Company and was interviewed before Apr 2021. There were 3 interview rounds.
My resume
I applied via Company Website and was interviewed before Sep 2021. There were 2 interview rounds.
2 coding questions which are of easy level
I applied via Walk-in and was interviewed before Jul 2021. There was 1 interview round.
I applied via Campus Placement and was interviewed before Jan 2021. There were 2 interview rounds.
Good
based on 3 interviews
Interview experience
based on 4 reviews
Rating in categories
Software Developer
98
salaries
| ₹0 L/yr - ₹0 L/yr |
Front end Developer
50
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Developer
41
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Quality Analyst
24
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
20
salaries
| ₹0 L/yr - ₹0 L/yr |
TCS
Infosys
Wipro
HCLTech