InterviewBit Interview Practice Problems from InterviewBit.com TimeComplexity - 85% Arrays - 80% Maths - 97% Binary Search - 61% Dynamic Programming - 0% Strings - 61% Bit Manipulation - 89% Two Pointers - 52% Linked Lists - 70% Stacks & Queues - 88% Backtracking - 45% Hashing - 48% Heaps and Maps - 60% Tree Data Structures - 58%