i
Gameskraft
Filter interviews by
Use recursion to generate all possible permutations of a given string.
Use recursion to swap characters in the string to generate permutations
Keep track of visited characters to avoid duplicates
Base case: when the length of the string is 1, add it to the result array
The coin change problem involves finding the number of ways to make a certain value using a given set of coins.
Use dynamic programming to solve the coin change problem efficiently.
Create a 1D array to store the number of ways to make each value from 0 to the target value.
Iterate through the coins and update the array based on the current coin's value.
The final answer will be stored in the last element of the array.
Exam...
Leetcode medium problem
I applied via campus placement at Indian Institute of Information Technology, Design and Manufacturing (IIITDM), Jabalpur and was interviewed before Oct 2022. There were 4 interview rounds.
Gave 2 medium leetcode questions.
Gave a medium hard DP problem
I applied via Recruitment Consultant and was interviewed in Jun 2020. There was 1 interview round.
Gameskraft interview questions for designations
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
posted on 28 Aug 2024
25 questions , 1 hour
1 coding , 2 logical question
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
It was the ask mostly about DSA
based on 3 interviews
Interview experience
based on 2 reviews
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