Gameskraft Full Time On Campus Experience (Virtual 2020)

Round 1 (Coding Round): There were 3 coding questions

  1. 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.
  2. 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


Write your Interview Experience or mail it to contribute@geeksforgeeks.org

My Personal Notes arrow_drop_up

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.