i
Gameskraft
Filter interviews by
I applied via Campus Placement and was interviewed in Aug 2022. There were 2 interview rounds.
CODING ON DSA AND THEY ARE VERY MUCH STANDARD QUESTIONS,
Find the lowest common ancestor of two nodes in a binary tree.
Traverse the tree recursively to find the paths from root to the two nodes.
Compare the paths to find the last common node.
If one of the nodes is the ancestor of the other, return the ancestor node.
If either of the nodes is not present in the tree, return null.
Finding nodes at a distance of K from the current node in a tree/graph.
Use BFS/DFS to traverse the tree/graph.
Maintain a visited set to avoid revisiting nodes.
Keep track of the distance of each node from the current node.
Return all nodes at a distance of K from the current node.
posted on 26 Jul 2022
I applied via Job Fair and was interviewed before Jul 2021. There were 2 interview rounds.
Real life problem to solve with your development skills
Medium hard round requires good knowledge of python SQL
posted on 30 Jun 2022
I applied via LinkedIn and was interviewed before Aug 2023. There were 2 interview rounds.
Data extraction, solid questions, oops
It was the ask mostly about DSA
I applied via Referral
Java internals, coding questions 2sum
Developed a web-based project management tool for tracking tasks and deadlines.
Used React.js for front-end development
Implemented RESTful APIs for backend using Node.js and Express
Utilized MongoDB for database storage
Incorporated authentication and authorization features for user security
Open to relocation for the right opportunity
Willing to relocate for the right job opportunity
Flexible with location for the right role
Open to considering different locations for the right position
I applied via Approached by Company and was interviewed before Feb 2023. There was 1 interview round.
I applied via Campus Placement and was interviewed in Jul 2022. There was 1 interview round.
Medium to hard questions based on arrays, dp
Quick sort is a popular sorting algorithm that uses divide and conquer strategy.
Divides array into smaller sub-arrays based on a pivot element
Recursively sorts sub-arrays
Combines sorted sub-arrays to get final sorted array
Time complexity: O(n log n) on average, O(n^2) worst case
Example: [3, 6, 8, 10, 1, 2, 1] -> [1, 1, 2, 3, 6, 8, 10]
Rotate a matrix by 90 degrees in place
Transpose the matrix
Reverse each row of the transposed matrix
based on 1 interview
Interview experience
based on 1 review
Rating in categories
Software Engineer
73
salaries
| ₹15 L/yr - ₹41 L/yr |
Senior Software Engineer
70
salaries
| ₹22 L/yr - ₹43.8 L/yr |
Senior Business Analyst
43
salaries
| ₹22 L/yr - ₹36 L/yr |
Product Manager
28
salaries
| ₹16.7 L/yr - ₹43.5 L/yr |
Senior Product Manager
20
salaries
| ₹24 L/yr - ₹55 L/yr |
Celebal Technologies
NoBrokerHOOD
Duck Creek Technologies
Ascent HR Technologies Private Limited