Gameskraft Full Time On Campus Experience (Virtual 2020)
Round 1 (Coding Round): There were 3 coding questions
- Given three strings A, B, C where A and B have the same length n. Find no of strings alphabetically greater than A and alphabetically less than B whose length is n such that C is not a substring.
- Given an array, find the no of subset such that XOR of each consecutive elements is k (DP problem)
I forget the last question, 10 students were shortlisted for next round
Round 2 (Technical Interview): They asked DS Algo questions, and they also asked to implement my compiler and run test cases