HashedIn by Deloitte Interview Question

1. string based question. 2.sort the array which contain either 0 or 1 3. It was dp based question little bit difficult and it was based on subarray concept . 2nd round: You have given two sorted linked list you have to find the median of sorted merge linked list which does not contain any duplicate element. If it has odd number of nodes in merged linked list then return middle one and if it contain even number of nodes then return avg of middle nodes. 2.Rotate the array k times and return the same array in O(n) time.