| Day | Problem |
|---|---|
| Day1 | ✓ Two Sum Easy |
✓ Valid Parentheses Easy |
|
| Day2 | ✓ Merge Two Sorted Lists Easy |
✓ Best Time to Buy and Sell Stock Easy |
|
| Day3 | ✓ Valid Palindrome Easy |
| Day4 | ✓ Invert Binary Tree Easy |
| Day5 | ✓ Valid Anagram Easy |
| Day6 | ✓ Binary Search Easy |
| Day7 | ✓ Flood Fill Easy |
| Day8 | ✓ Search Tree Easy |
| Day9 | ✓ Balanced Binary Tree Easy |
| Day10 | ✓ Linked List Cycle Easy |
| Day11 | ✓ First Bad Version Easy |
| Day12 | ✓ Ransom Note Easy |
| Day13 | ✓ Climbing Stairs Easy |
| Day14 | ✓ Longest Palindrome Easy |
| Day15 | ✓ Add Binary Easy |
| Day16 | ✓ Diameter of Binary Tree Easy |
| Day17 | ✓ Middle of the Linked List Easy |
| Day18 | ✓ Maximum Depth of Binary Tree Easy |
| Day19 | ✓ K Closest Points to Origin Medium |
| Day20 | ✓ Longest Substring Without Repeating |
| Day21 | ✓ 3Sum Medium |
| Day22 | ✓ Binary Tree Level Order Traversal Medium |
| Day23 | ✓ Clone Graph Medium |
| Day24 | ✓ Evaluate Reverse Polish Notation Medium |
| Day25 | ✓ Course Schedule Medium |
| Day26 | ✓ Implement Trie (Prefix Tree) Medium |
| Day27 | ✓ Coin Change Medium |
| Day28 | ✓ Product of Array Except Self Medium |
| Day29 | ✓ Implement the MinStack class: |
| Day30 | ✓ Validate Binary Search Tree Medium |
| Day31 | ✓ Number of Islands Medium |
| Day32 | ✓ Rotting Oranges Medium |
| Day33 | ✓ Search in Rotated Sorted Array Medium |
| Day34 | ✓ Combination Sum Medium |
| Day35 | ✓ Permutations Medium |
| Day36 | ✓ Merge Intervals Medium |
| Day37 | Meeting Scheduler Medium |
| Day38 | ✓ Time Based Key-Value Store Medium |
| Day39 | ✓ Accounts Merge Medium |
| Day40 | ✓ Sort Colors Medium |
| Day41 | String to Integer (atoi) Medium |
| Day42 | Spiral Matrix Medium |
| Day43 | Subsets Medium |
| Day44 | Binary Tree Right Side View Medium |
| Day45 | Longest Palindromic Substring Medium |
| Day46 | Unique Paths Medium |
| Day47 | Construct Binary Tree from Preorder and Inorder Traversal Medium |
| Day48 | Container With Most Water Medium |
| Day49 | Find All Anagrams in a String Medium |
| Day50 | Minimum Height Trees Medium |
| Day51 | Task Scheduler Medium |
| Day52 | LRU Cache Medium |
| Day53 | Kth Smallest Element in a BST Medium |
| Day54 | Minimum Window Substring Hard |
| Day55 | Find Median from Data Stream Hard |
| Day56 | Word Ladder Hard |
| Day57 | Basic Calculator Hard |
| Day58 | Maximum Profit in Job Scheduling Hard |
| Day59 | Merge k Sorted Lists Hard |
| Day60 | Largest Rectangle in Histogram Hard |
-
Notifications
You must be signed in to change notification settings - Fork 0
alixizadi/DSA-Challenge
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
60 challenging exercises with focus on data structures and problem-solving [In Python]
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published