Given a matrix m X n, count paths from left-top to the right bottom of a matrix with the constraints that from each cell you can either only move to the rightward direction or the downward direction. (Link)
Given an array print all the sum of the subset generated from it, in the increasing order. (Link)
Round 3: Technical Interview
Given two sorted arrays arr1 and arr2 of size m and n respectively, return the median of the two sorted arrays. (Link)
Design data structure that supports insert(), remove(), find-max(), delete-max() operations. All operations should run in O(1) time.
Round 3: Technical + Managerial Interview
What difference between process and program and thread? Different types of processes.
What is a deadlock? Different conditions to achieve a deadlock.