Round 1:
The first round was an online round held on Hackerearth. It had 2 questions of easy-medium level.
Easliy solvable with decent coding skills.

Round 2:
This was a Zoom online round lasting for about 45 mins. The interviewer went through my resume and asked me to describe my projects.
Tip : Know about each word in your resume and each word you speak in detail.

He then gave me 2 algorithmic problems:

1st problem : Find the longest palindromic substring in the given string. I gave him the standard DP approach of O(n^2) time and space complexity. He asked me to improve my space complexity. I told him the idea, but was asked to write the code the O(n2) solution itself.
Simple approach
Optimized approach
2nd problem : Given x and y, find the numbers between x and y which do not have repetitive digits in them.
https://www.geeksforgeeks.org/total-numbers-no-repeated-digits-range/

Round 3:
This also was a Zoom online interview round lasting for about 30 mins with a different person. I introduced myself and was asked the following question –
Consider all 3 letter words in a dictionary. Given a source and destination word, and that the cost of changing a letter in a word at a time is 1, find the minimum cost to reach destination from source by changing only one letter at a time.
https://www.geeksforgeeks.org/word-ladder-length-of-shortest-chain-to-reach-a-target-word/
He then asked me questions about my projects, past , DBMS and OS.

Got the offer 🙂


If you like and would like to contribute, you can also write an 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 write comments if you find anything incorrect, or you want to share more information about the topic discussed above.

Article Tags :

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







Source link
thanks you RSS link
( https://www.geeksforgeeks.org/cohesity-internship-interview/)

LEAVE A REPLY

Please enter your comment!
Please enter your name here