Phone screen 1:

• Talk with manager, general discussion on projects.
• Asked to code Febonacci Series https://leetcode.com/problems/fibonacci-number.
  Then follow up was if different n values are given, find Febonacci for them, but try not to calculate the values already calculated.

Phone screen 2:

• https://leetcode.com/problems/letter-combinations-of-a-phone-number
• https://leetcode.com/problems/two-sum

Onsite:

Round 1:

• https://leetcode.com/problems/roman-to-integer
• https://leetcode.com/problems/integer-to-roman

Round 2:

• This was linux specific rounds. How to build packages in Linux. Details on nslookup. ls command. Docker details etc

Round 3:

• Sort n strings in a custom sort manner. They had a way to sort strigns.
  Eg : www.google.com -> the string to be considered to be sorted was com.google.www.
  Given such n string first convert the strings and then sort it

Round 4:

• https://leetcode.com/problems/word-break