I had 4 rounds of interviews consisting of questions on Algorithms

Round 1: Reverse words in a string. (No additional space should be used)

Round 2: Given a string and the base, convert to a integer with the given base value. (Similar to string to integer but with additionally base given. So solution should work for not only decimal but also binary and hexadecimal)

Round 3: Find if a given linked list is a palindrome. (Solution should be in O(1n) time complexity)

Round 4: Given an array of integers, return the minimum possible contigious array with maximum sum value.