Lenskart: Interview Experience for SDE-II

Round 1: HackerEarth
1) Given MxN keypad of characters and word. determine if it is possible to type word without lifting finger. Finger can only glide with adjacent keys who share common edges.

2) Given a language rules in the form of 26X26 matrix, where matrix[i][j] denotes, (j-‘a’)th character can occur after (i-‘a’)th character.

Determine how many unique possible strings of length ‘n’ can be generated?



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.




Article Tags :
Practice Tags :


Be the First to upvote.


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.