Maximum Subarray Sum in an Array: Given an integer array arr, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum and print the subarray.
Palindrome Partitioning: You are given a string s, partition it in such a way that every substring is a palindrome. Return all such palindromic partitions of s.
The second question was on binary tree.
Round 3: Technical Interview
Median of Two Sorted Arrays: Given two sorted arrays arr1 and arr2 of size m and n respectively, return the median of the two sorted arrays.
Minimum insertions required to make a string palindrome: A palindromic string is a string that is the same as its reverse. For example: “nitin” is a palindromic string. Now the question states that we are given a string, we need to find the minimum insertions that we can make in that string to make it a palindrome.