DSA-Module-3 Part1: Balance Parentheses Part2: Best, avg and worst case analysis Part3: Big-O-Notation Part4: Check if Tree is Binary Part5: Check-Anagrams Part6: Count Distnct Elements Part7: FIFO Part8: Hashing and Collision Part9: KMP Algorithm Part10: LIFO