Gameskraft Interview Questions and Answers

Q1. How would you approach the relaunch of Zepto Pass, and what tracking methods would you implement to measure its success?
Ans. 
Relaunching Zepto Pass involves strategic planning, user feedback, and robust tracking for success measurement.
• Conduct user research to gather feedback on the previous version of Zepto Pass.

• Define clear objectives for the relaunch, such as increasing user engagement by 30%.

• Implement A/B testing for different features to determine user preferences.

• Utilize analytics tools like Google Analytics to track user behavior and ...read more
Answered by AI
Add your answer
Q2. Based on your past work experience and interests, can you explain how you have launched and scaled products?
Add your answer
Q3. What is your approach to identifying and resolving the root cause analysis (RCA) of a dip in Daily Active Users (DAU) at Gameskraft?
Ans. 
My approach to RCA for DAU dips involves data analysis, user feedback, and iterative testing to identify and resolve issues.
• Analyze user engagement metrics to identify trends and patterns leading to the dip.

• Conduct surveys or interviews with users to gather qualitative feedback on their experience.

• Review recent product updates or changes that may have impacted user experience, such as bugs or feature removals.

• Segment u...read more
Answered by AI
Add your answer

Q1. Round -1 SQL Questions
Add your answer
Q2. Round -2 RCA & Case Studies
Add your answer

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
Ans. 
Prints elements of a matrix in a spiral order, starting from the top-left corner and moving clockwise.
• Initialize boundaries: top, bottom, left, right.

• Iterate while top <= bottom and left <= right.

• Print top row, then increment top boundary.

• Print right column, then decrement right boundary.

• Print bottom row (if applicable), then decrement bottom boundary.

• Print left column (if applicable), then increment left boundar...read more
Answered by AI
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

Q1. To print all permutation of a string
Ans. 
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
Answered by AI
Add your answer

Q1. Coin change Problem of finding number of ways to achieve K value
Ans. 
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...read more
Answered by AI
Add your answer

Q1. Suduko solver question is given to me
Add your answer