Empresa engajada
Round 1.) Q1.) Largest Subarray Length with equal number of 0's and 1's in a binary Array Q2.) Next Greater Element Q3.) Custom Question ( Easy ) Round 2.) Q1.) Design a DS which performs insertion, deletion, searching and getRandom Q2.) Minimum Sum of deleting exactly k elements elements can be deleted from front and back.