About Author
- Final Year student pursuing Bachelors
- Looking for Job Opportunities 🏢
- Can be reached out at 📧 : maydev22@gmail.com
My LeetCode profile : Link
| S.No. | Title | Solutions | Time | Space | Difficulty | Related Topics |
|---|---|---|---|---|---|---|
| 1 | First Bad Version | Solution ⭐ | O(logn) | O(1) | Easy | Binary Search |
| 2 | Jewels and Stones | Solution | O(n+m) | O(n) | Easy | Set, Array |
| 3 | Ransom Note | Solution | O(n+m) | O(n+m) | Easy | Hash Map |
| 4 | Number Complement | Solution | O(n) | O(1) | Easy | Bit Manipulation |
| 5 | First Unique Character in a String | Solution | O(n) | O(n) | Easy | Dequeue, Hash Map |
| 6 | Majority Element | Solution ⭐ | O(n) | O(1) | Easy | Array |
| 7 | Cousins in Binary Tree | Solution ⭐ | O(n) | O(n) | Easy | Breadth First Search, Depth First Search, Tree |
| S.No. | Title | Solutions | Time | Space | Difficulty | Related Topics |
|---|---|---|---|---|---|---|
| 1 | Check If It Is a Straight Line | Solution | O(n) | O(1) | Easy | Array |
| 2 | Valid Perfect Square | Solution ⭐ | O(logn) | O(1) | Medium | Binary Search |
| 3 | Find the Town Judge | Solution ⭐ | O(n+m) | O(n) | Easy | Hash Map |
| 4 | Flood Fill | Solution ⭐ | O(m*n) | O(m*n) | Medium | Depth First Search, Breadth First Search |
| 5 | Single Element in a Sorted Array | Solution ⭐ | O(logn) | O(1) | Easy | Binary Search |
| 6 | Remove K Digits | Solution ⭐ | O(n) | O(n) | Medium | Array |
| 7 | Implement Trie (Prefix Tree) | Solution | O(n) | O(n) | Medium | Trie |
| S.No. | Title | Solutions | Time | Space | Difficulty | Related Topics |
|---|---|---|---|---|---|---|
| 1 | Maximum Sum Circular Subarray | Soution ⭐ | O(n) | O(1) | Medium | Circular Array |
| 2 | Odd Even Linked List | Soution | O(n) | O(1) | Medium | LinkedList |
| 3 | Find All Anagrams in a String | Soution ⭐ | O(n) | O(n) | Medium | Sliding Window, Strings |
| 4 | Permutation in String | Soution ⭐ | O(n) | O(n) | Medium | Sliding Window, Strings |
| 5 | Online Stock Span | Soution ⭐ | O(n) | O(n) | Medium | Stack |
| 6 | Kth Smallest Element in a BST | Soution ⭐ | O(logn) | O(1) | Medium | Tree |
| 7 | Count Square Submatrices with All Ones | Soution ⭐ | O(m*n) | O(1) | Medium | Dynamic Programming, Matrix |
| S.No. | Title | Solutions | Time | Space | Difficulty | Related Topics |
|---|---|---|---|---|---|---|
| 1 | Sort Characters By Frequency | Soution ⭐ | O(n) | O(n) | Medium | Bucket Sort, Heap, String |
| 2 | Interval List Intersections | Soution ⭐ | O(m+n) | O(n) | Medium | Two pointers |
| 3 | Construct Binary Search Tree from Preorder Traversal | Soution ⭐ | O(n) | O(n) | Medium | Tree, Stack, Recursion |
| 4 | Uncrossed Lines | Soution ⭐ | O(m*n) | O(n) | Medium | Dynamic Programming |
| 5 | Contiguous Array | Soution ⭐ | O(n) | O(n) | Medium | Hash Map |
| 6 | Possible Bipartition | Soution | O(n) | O(n) | Medium | Graph |
| 7 | Counting Bits | Soution ⭐ | O(n) | O(n) | Medium | Dynamic Programming, Bit Manipulation |
| S.No. | Title | Solutions | Time | Space | Difficulty | Related Topics |
|---|---|---|---|---|---|---|
| 1 | Course Schedule | Soution ⭐ | O(n) | O(n) | Medium | Graph, Topological Sort, Detect Cycle |
| 2 | K Closest Points to Origin | Soution | O(nlogk) | O(n) | Medium | Heap |
| 3 | Edit Distance | Soution ⭐ | O(m*n) | O(m*n) | Hard | Dynamic Programming |