i
Gameskraft
Filter interviews by
I applied via campus placement at National Institute of Technology (NIT), Calicut 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 30 Jun 2022
posted on 19 Dec 2024
I applied via Campus Placement
It was good 20 mcqs 3 coding questions
Basic DSA questions, best time to buy and sell stock and its variation
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
2 Leetcode Medium questions on hackerrank
posted on 28 Aug 2024
25 questions , 1 hour
1 coding , 2 logical question
posted on 7 Sep 2024
I applied via LinkedIn and was interviewed in Mar 2024. There were 4 interview rounds.
First round was coding test conducted by their IDE where you can program in any language like on hackerrank IDE . 5 question were asked from easy to hard
Stack is used for static memory allocation and stores local variables, while heap is used for dynamic memory allocation and stores objects.
Stack memory is allocated in a contiguous block and is faster to access compared to heap memory.
Variables stored on the stack have limited scope and lifetime, while objects on the heap can persist beyond the scope of the function.
Stack memory is managed by the compiler, while heap m...
Compiler translates entire code into machine code before execution, while interpreter translates code line by line during execution.
Compiler translates entire code into machine code before execution
Interpreter translates code line by line during execution
Compiler generates error messages after scanning entire code
Interpreter stops at first error encountered
Examples: C, C++ use compilers; Python, Ruby use interpreters
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
70
salaries
| ₹15 L/yr - ₹40 L/yr |
Senior Software Engineer
66
salaries
| ₹22 L/yr - ₹52 L/yr |
Senior Business Analyst
42
salaries
| ₹22 L/yr - ₹36 L/yr |
Product Manager
25
salaries
| ₹16.7 L/yr - ₹40 L/yr |
Business Analyst
23
salaries
| ₹8.5 L/yr - ₹28.2 L/yr |
Dream11
Nazara Technologies
Mobile Premier League
Paytm First Games