Lynk Logistics First online round | On-Campus

Round 1:

The first round was online on campus..

The compiler was really bad … it was like notepad and we had to write the code from scratch..



Any of my mates was not able to run or compile the code …

If we navigated away from problem 1 to 2 then all the code of solution 1 vanished… it was really irritating

Still I would tell the questions

there were three coding questions and that was it..

Problem 1:

https://www.geeksforgeeks.org/combinatorial-game-theory-set-2-game-nim/   .. modification of this..

as if cheating is allowed what would be the minimum number of stones to be added to the pile so that nim doesn’t win the game

Problem 2:

given a number a and another b.. in the closed interval a, b find the number of integers such that their sum of digits… and sum of square of digits.. is prime..

Problem 3:



String reduction

https://www.geeksforgeeks.org/smallest-length-string-with-repeated-replacement-of-two-distinct-adjacent/

 

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.