Gameskraft Full Stack Developer Interview Questions, Process, and Tips

Three coding questions to be solved in 90 minutes.

Q1. K rotation of a an array
Ans. 
Rotate an array by K positions to the right
• Create a new array and copy elements from original array starting from index (n-k) to n-1, then copy elements from index 0 to (n-k-1)

• Alternatively, reverse the entire array, then reverse the first k elements and the remaining n-k elements separately

• Handle cases where k is greater than array length by taking modulo of k with array length
Answered by AI
Add your answer
Q2. Spiral order matrix print
Add your answer

Q1. Unique paths from top left of a binary tree to bottom right.
Ans. 
Count the number of unique paths from top left to bottom right in a binary tree.
• Use dynamic programming to keep track of the number of paths at each node.

• At each node, the number of paths is the sum of the number of paths from the node to the right and the node below.

• Example: For a 2x2 binary tree, there are 2 unique paths.
Answered by AI
Add your answer
Q2. Maximum triplet sum such that i
Ans. 
Find the maximum triplet sum satisfying given conditions
• Sort the array in ascending order

• Iterate through the array and keep track of the maximum triplet sum meeting the conditions

• Return the maximum triplet sum found
Answered by AI
Add your answer

Q1. Implementation of LFU Cache
Ans. 
LFU (Least Frequently Used) cache is a data structure that removes the least frequently used items when the cache is full.
• LFU cache stores key-value pairs with a frequency count to track usage.

• When a new item is added, its frequency count is set to 1.

• When an existing item is accessed, its frequency count is incremented.

• When the cache is full, the item with the lowest frequency count is removed.

• Example: If cache size is...read more
Answered by AI
Add your answer
Q2. Some react and database questions.
Add your answer