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?
Recommended Posts:
- Lenskart Interview Experience for Application Developer
- Lenskart interview for SDE2
- Lenskart 2+ year Experienced Interview Bangalore
- Goldman Sachs Interview Experience | Set 23 (2+ years Experience for Java Developer Role)
- TIAA Interview Experience -Java Back Backend Developer (3+ years Experience)
- Microsoft Interview Experience (Full Time 2018 Washington DC - with 2.5 years of experience)
- Arcesium Interview Experience - Senior Software Engineer (3 years experience)
- Arcesium Interview Experience Software Engineer (1+ year experience)
- Oyo Rooms Interview Experience | Set 3 (For Backend Engineer, Experience <=1yrs)
- Nagarro Interview Experience for Xamarin Developer | 3 Years Experience
- Brocade Interview Experience | Set 2 (For Software Engineer 0-2.5 Years Experience)
- Nutanix Interview Experience for MTS - QA (4+ year experience) [ Language - Python ]
- Arcesium Interview Experience | Set 5 (3+ years experience - Developer profile)
- Walmart Lab Interview Experience | Set 7 (Off-Campus 3 Years Experience)
- Goldman Sachs Interview Experience | Set 39 (1.5 years experience)
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.
