1st Round - Easy array problem, an array is given, you have to check if it is sorted or not, if sorted return true else check if you can swap any number with it to make it sorted, we can do at most once swap only. if even after swapping array is unsorted return false.

Asked to explain Rabin Karp, KMP algorithms and how Red black tree works.

In the end, Java questions were asked like internal working of HashMap, difference between volatile and atomic integer, how to make class immutable, wait vs join, what are future objects. What is patch request in REST, etc

Easy array problem, an array is given, you have to check if it is sorted or not, if sorted return true else check if you can swap any number with it to make it sorted, we can do at most once swap only. If even after swapping array is unsorted return false.