Python solutions for AlgoExpert. Difficulty Levels 🟢 Easy - 25/25 🔵 Medium - 5/55 🔴 Hard - 0/46 ⚫️ Very Hard - 0/34 Questions Question Difficulty Category Two Number Sum 🟢 Arrays Validate Subsequence 🟢 Arrays Tournament Winner 🟢 Arrays Sorted Squared Array 🟢 Arrays Non-Constructible Change 🟢 Arrays Minimum Waiting Time 🟢 Greedy Algorithms Class Photos 🟢 Greedy Algorithms Tandem Bicycle 🟢 Greedy Algorithms Nth Fibonacci 🟢 Arrays Product Sum 🟢 Recursion Binary Search 🟢 Searching Find Three Largest Numbers 🟢 Searching Bubble Sort 🟢 Sorting Selection Sort 🟢 Sorting Insertion Sort 🟢 Sorting Palindrome Check 🟢 Strings First Non Repeating-Character 🟢 Strings Generate Document 🟢 Strings Caesar Cipher Encryptor 🟢 Strings Run-Length Encoding 🟢 Strings Find Closest Value In BST 🟢 Binary Search Trees Branch Sums 🟢 Binary Search Trees Node Depths 🟢 Binary Search Trees Depth-first Search 🟢 Graphs Remove Duplicates From Linked List 🟢 Linked Lists Monotonic Array 🔵 Arrays Three Number Sum 🔵 Arrays Remove Kth Node From End 🔵 Linked Lists Task Assignment 🔵 Greedy Algorithms Valid Starting City 🔵 Greedy Algorithms Minimum Characters For Words 🔵 Strings