GeeksforGeeks App
Open App
Browser
Continue

# Gameskraft Technologies Interview Experience | (On Campus for FTE)

Recently, Gameskraft Technologies Pvt Ltd. a startup founded by Prithvi Singh (NSIT) along with his friends and expert professionals from many companies like Grofers, Codenation, Amazon, etc. came to our campus to hire people for the role of SDE. Firstly there was a pre-placement talk about the gaming industry in India and how quickly it is growing. After that, we had 1 coding round followed by 3 rounds of technical interviews.

Coding Round:

The first round comprised of 3 coding questions of easy to medium level on Hackerrank:-

1. Given a string comprising of lowercase characters and type of each of the characters (a-z) where each alphabet can be of type normal and special. We were asked to find the longest substring comprising of at most k normal characters. The string can be of length 10^5. (Hint: 2 pointer approach to be used).
2. Given certain conditions on the sequence made of vowels, for example,   A. a can only be preceded by e, u, i. B. e can be only preceded by a, i. C. i can only be preceded by e, o, u can be preceded by o, i and o can be only preceded by i. But the language was not direct so rules laid on the sequences were to be deduced. we were required to find the count of all possible strings containing only vowels of length l following those conditions. We were needed to report the answer mod 1000000007 as there may be a large number of such strings possible. Tip:- Remember the properties of modulo arithmetic. (Simple DP soln).
1. The third question was directly nim game where there can be n piles of coins. https://www.geeksforgeeks.org/combinatorial-game-theory-set-2-game-nim/

After the coding round, around 25 people were selected.

Round 1 (Skype Round):

The second was taken on skype from engineers at their Bangalore office. Here first my Resume was extensively discussed wherein I had mentioned technologies like React, Android for which I was asked about their lifecycle methods and some other miscellaneous concepts. I could answer the majority of questions related to my projects and also told him about my experience with these technologies in my Internship. After that, I was asked 2 coding questions.

1. We have a storage facility available at our office. With the N numbers of couriers stored there. Also, we have a truck outside our office to carry those couriers to another place. The truck has some capacity’ and it can take max M weight of the courier. So the weight of the couriers is given. e.g., [1, 10, 25, 35, 60] and also the capacity of the truck: 90. The truck wants to reserve 30 units for itself. And you can pick only 2 couriers to accommodate into the truck. The answer should be the list of index of those 2 couriers. e.g., [2, 3]
2. The second question was on greedy algorithms. In the question, we are given n ropes of some lengths. for example, [8, 4, 6, 11],   we are required to minimize the cost to combines all these ropes into a single rope. Here the cost of combining the ropes is equal to some of their lengths.

After the 1st round, around 8 people remained.

Round 2 (PI Technical):

After  2nd round, around  5 people remained.

Round 3 (PI Technical):