├── .gitignore ├── Cargo.toml ├── LICENSE ├── Makefile ├── README.md ├── courses ├── advanced_graphs │ ├── course_manifest.json │ ├── hard │ │ ├── alien-dictionary │ │ │ ├── back.md │ │ │ ├── exercise_manifest.json │ │ │ └── front.md │ │ ├── lesson_manifest.json │ │ ├── reconstruct-itinerary │ │ │ ├── back.md │ │ │ ├── exercise_manifest.json │ │ │ └── front.md │ │ └── swim-in-rising-water │ │ │ ├── back.md │ │ │ ├── exercise_manifest.json │ │ │ └── front.md │ ├── instructions.md │ └── medium │ │ ├── cheapest-flight-within-k-stops │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md │ │ ├── lesson_manifest.json │ │ ├── min-cost-to-connect-all-points │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md │ │ └── network-delay-time │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md ├── arrays_hashing │ ├── course_manifest.json │ ├── easy │ │ ├── contains-duplicate │ │ │ ├── back.md │ │ │ ├── exercise_manifest.json │ │ │ └── front.md │ │ ├── lesson_manifest.json │ │ ├── two-sum │ │ │ ├── back.md │ │ │ ├── exercise_manifest.json │ │ │ └── front.md │ │ └── valid-anagram │ │ │ ├── back.md │ │ │ ├── exercise_manifest.json │ │ │ └── front.md │ ├── instructions.md │ └── medium │ │ ├── encode-and-decode-strings │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md │ │ ├── group-anagrams │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md │ │ ├── lesson_manifest.json │ │ ├── longest-consecutive-sequence │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md │ │ ├── product-of-array-except-self │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md │ │ ├── top-k-frequent-elements │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md │ │ └── valid-sudoky │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md ├── backtracking │ ├── course_manifest.json │ ├── hard │ │ ├── lesson_manifest.json │ │ └── n-queens │ │ │ ├── back.md │ │ │ ├── exercise_manifest.json │ │ │ └── front.md │ ├── instructions.md │ └── medium │ │ ├── combination-sum-ii │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md │ │ ├── combination-sum │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md │ │ ├── lesson_manifest.json │ │ ├── letter-combinations-of-a-phone-number │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md │ │ ├── palindrome-partitioning │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md │ │ ├── permutations │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md │ │ ├── subsets-ii │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md │ │ ├── subsets │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md │ │ └── word-search │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md ├── binary_search │ ├── course_manifest.json │ ├── easy │ │ ├── binary-search │ │ │ ├── back.md │ │ │ ├── exercise_manifest.json │ │ │ └── front.md │ │ └── lesson_manifest.json │ ├── hard │ │ ├── lesson_manifest.json │ │ └── median-of-two-sorted-arrays │ │ │ ├── back.md │ │ │ ├── exercise_manifest.json │ │ │ └── front.md │ ├── instructions.md │ └── medium │ │ ├── find-minimum-in-rotated-sorted-array │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md │ │ ├── koko-eating-bananas │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md │ │ ├── lesson_manifest.json │ │ ├── search-a-2d-matrix │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md │ │ ├── search-in-rotated-sorted-array │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md │ │ └── time-based-key-value-store │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md ├── bit_manipulation │ ├── course_manifest.json │ ├── easy │ │ ├── counting-bits │ │ │ ├── back.md │ │ │ ├── exercise_manifest.json │ │ │ └── front.md │ │ ├── lesson_manifest.json │ │ ├── missing-number │ │ │ ├── back.md │ │ │ ├── exercise_manifest.json │ │ │ └── front.md │ │ ├── number-of-1-bits │ │ │ ├── back.md │ │ │ ├── exercise_manifest.json │ │ │ └── front.md │ │ ├── reverse-bits │ │ │ ├── back.md │ │ │ ├── exercise_manifest.json │ │ │ └── front.md │ │ └── single-number │ │ │ ├── back.md │ │ │ ├── exercise_manifest.json │ │ │ └── front.md │ ├── instructions.md │ └── medium │ │ ├── lesson_manifest.json │ │ ├── reverse-integer │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md │ │ └── sum-of-two-integers │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md ├── graphs │ ├── course_manifest.json │ ├── hard │ │ ├── lesson_manifest.json │ │ └── word-ladder │ │ │ ├── back.md │ │ │ ├── exercise_manifest.json │ │ │ └── front.md │ ├── instructions.md │ └── medium │ │ ├── clone-graph │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md │ │ ├── course-schedule-ii │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md │ │ ├── course-schedule │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md │ │ ├── lesson_manifest.json │ │ ├── max-area-of-island │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md │ │ ├── number-of-connected-components-in-an-undirected-graph │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md │ │ ├── number-of-islands │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md │ │ ├── pacific-atlantic-water-flow │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md │ │ ├── redundant-connection │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md │ │ ├── rotting-oranges │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md │ │ ├── surrounded-regions │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md │ │ └── walls-and-gates │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md ├── greedy │ ├── course_manifest.json │ ├── instructions.md │ └── medium │ │ ├── gas-station │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md │ │ ├── hand-of-straights │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md │ │ ├── jump-game-ii │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md │ │ ├── jump-game │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md │ │ ├── lesson_manifest.json │ │ ├── maximum-subarray │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md │ │ ├── merge-triplets-to-form-target-triplet │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md │ │ ├── partition-labels │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md │ │ └── valid-parentheses-string │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md ├── heap_priority_queue │ ├── course_manifest.json │ ├── easy │ │ ├── kth-largest-element-in-a-stream │ │ │ ├── back.md │ │ │ ├── exercise_manifest.json │ │ │ └── front.md │ │ ├── last-stone-weight │ │ │ ├── back.md │ │ │ ├── exercise_manifest.json │ │ │ └── front.md │ │ └── lesson_manifest.json │ ├── hard │ │ ├── find-median-from-data-stream │ │ │ ├── back.md │ │ │ ├── exercise_manifest.json │ │ │ └── front.md │ │ └── lesson_manifest.json │ ├── instructions.md │ └── medium │ │ ├── design-twitter │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md │ │ ├── k-closest-points-to-origin │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md │ │ ├── kth-largest-element-in-an-array │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md │ │ ├── lesson_manifest.json │ │ └── task-scheduler │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md ├── intervals │ ├── course_manifest.json │ ├── easy │ │ ├── lesson_manifest.json │ │ └── meeting-rooms │ │ │ ├── back.md │ │ │ ├── exercise_manifest.json │ │ │ └── front.md │ ├── hard │ │ ├── lesson_manifest.json │ │ └── minimum-interval-to-include-each-query │ │ │ ├── back.md │ │ │ ├── exercise_manifest.json │ │ │ └── front.md │ ├── instructions.md │ └── medium │ │ ├── insert-interval │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md │ │ ├── lesson_manifest.json │ │ ├── meeting-rooms-ii │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md │ │ ├── merge-intervals │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md │ │ └── non-overlapping-intervals │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md ├── linked_list │ ├── course_manifest.json │ ├── easy │ │ ├── lesson_manifest.json │ │ ├── linked-list-cycle │ │ │ ├── back.md │ │ │ ├── exercise_manifest.json │ │ │ └── front.md │ │ ├── merge-two-sorted-lists │ │ │ ├── back.md │ │ │ ├── exercise_manifest.json │ │ │ └── front.md │ │ └── reverse-linked-list │ │ │ ├── back.md │ │ │ ├── exercise_manifest.json │ │ │ └── front.md │ ├── hard │ │ ├── lesson_manifest.json │ │ ├── merge-k-sorted-lists │ │ │ ├── back.md │ │ │ ├── exercise_manifest.json │ │ │ └── front.md │ │ └── reverse-node-in-k-group │ │ │ ├── back.md │ │ │ ├── exercise_manifest.json │ │ │ └── front.md │ ├── instructions.md │ └── medium │ │ ├── add-two-numbers │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md │ │ ├── copy-list-with-random-pointer │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md │ │ ├── find-the-duplicate-number │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md │ │ ├── lesson_manifest.json │ │ ├── lru-cache │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md │ │ ├── remove-nth-node-from-end-of-list │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md │ │ └── reorder-list │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md ├── math_and_geometry │ ├── course_manifest.json │ ├── easy │ │ ├── happy-number │ │ │ ├── back.md │ │ │ ├── exercise_manifest.json │ │ │ └── front.md │ │ ├── lesson_manifest.json │ │ └── plus-one │ │ │ ├── back.md │ │ │ ├── exercise_manifest.json │ │ │ └── front.md │ ├── instructions.md │ └── medium │ │ ├── detect-squares │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md │ │ ├── lesson_manifest.json │ │ ├── multiply-strings │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md │ │ ├── powx-n │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md │ │ ├── rotate-image │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md │ │ ├── set-matrix-zeroes │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md │ │ └── spiral-matrix │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md ├── one_d_dynamic_programming │ ├── course_manifest.json │ ├── easy │ │ ├── Min Cost Climbing Stairs │ │ │ ├── back.md │ │ │ ├── exercise_manifest.json │ │ │ └── front.md │ │ ├── climbing-stairs │ │ │ ├── back.md │ │ │ ├── exercise_manifest.json │ │ │ └── front.md │ │ └── lesson_manifest.json │ ├── instructions.md │ └── medium │ │ ├── coin-change │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md │ │ ├── decode-ways │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md │ │ ├── house-robber-ii │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md │ │ ├── house-robber │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md │ │ ├── lesson_manifest.json │ │ ├── longest-increasing-subsequence │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md │ │ ├── longest-palindrome-substring │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md │ │ ├── maximum-product-subarray │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md │ │ ├── palindromic-substrings │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md │ │ ├── partition-equal-subset-sum │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md │ │ └── word-break │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md ├── sliding_window │ ├── course_manifest.json │ ├── easy │ │ ├── best-time-to-buy-and-sell-stock │ │ │ ├── back.md │ │ │ ├── exercise_manifest.json │ │ │ └── front.md │ │ └── lesson_manifest.json │ ├── hard │ │ ├── lesson_manifest.json │ │ ├── minimum-window-substring │ │ │ ├── back.md │ │ │ ├── exercise_manifest.json │ │ │ └── front.md │ │ └── sliding-window-maximum │ │ │ ├── back.md │ │ │ ├── exercise_manifest.json │ │ │ └── front.md │ ├── instructions.md │ └── medium │ │ ├── lesson_manifest.json │ │ ├── longest-repeating-character-replacement │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md │ │ ├── longest-substring-without-repeating-characters │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md │ │ └── permutation-in-string │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md ├── stack │ ├── course_manifest.json │ ├── easy │ │ ├── lesson_manifest.json │ │ └── valid-parentheses │ │ │ ├── back.md │ │ │ ├── exercise_manifest.json │ │ │ └── front.md │ ├── hard │ │ ├── lesson_manifest.json │ │ └── longest-rectangle-in-histogram │ │ │ ├── back.md │ │ │ ├── exercise_manifest.json │ │ │ └── front.md │ ├── instructions.md │ └── medium │ │ ├── car-fleet │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md │ │ ├── daily-temperatures │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md │ │ ├── evaluate-reverse-polish-notation │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md │ │ ├── generate-parentheses │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md │ │ ├── lesson_manifest.json │ │ └── min-stack │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md ├── trees │ ├── course_manifest.json │ ├── easy │ │ ├── balanced-binary-tree │ │ │ ├── back.md │ │ │ ├── exercise_manifest.json │ │ │ └── front.md │ │ ├── diameter-of-binary-tree │ │ │ ├── back.md │ │ │ ├── exercise_manifest.json │ │ │ └── front.md │ │ ├── invert-binary-tree │ │ │ ├── back.md │ │ │ ├── exercise_manifest.json │ │ │ └── front.md │ │ ├── lesson_manifest.json │ │ ├── lowest-common-ancestor-of-a-binary-search-tree │ │ │ ├── back.md │ │ │ ├── exercise_manifest.json │ │ │ └── front.md │ │ ├── maximum-depth-of-binary-tree │ │ │ ├── back.md │ │ │ ├── exercise_manifest.json │ │ │ └── front.md │ │ ├── same-tree │ │ │ ├── back.md │ │ │ ├── exercise_manifest.json │ │ │ └── front.md │ │ └── subtree-of-another-tree │ │ │ ├── back.md │ │ │ ├── exercise_manifest.json │ │ │ └── front.md │ ├── hard │ │ ├── binary-tree-max-path-sum │ │ │ ├── back.md │ │ │ ├── exercise_manifest.json │ │ │ └── front.md │ │ ├── lesson_manifest.json │ │ └── serialize-and-deserialize-binary-tree │ │ │ ├── back.md │ │ │ ├── exercise_manifest.json │ │ │ └── front.md │ ├── instructions.md │ └── medium │ │ ├── binary-tree-level-order-traversal │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md │ │ ├── binary-tree-right-side-view │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md │ │ ├── construct-tree-from-preorder-and-inorder-traversal │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md │ │ ├── count-good-nodes-in-binary-tree │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md │ │ ├── kth-smallest-element-in-a-bst │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md │ │ ├── lesson_manifest.json │ │ └── validate-binary-search-tree │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md ├── tries │ ├── course_manifest.json │ ├── hard │ │ ├── lesson_manifest.json │ │ └── word-search-ii │ │ │ ├── back.md │ │ │ ├── exercise_manifest.json │ │ │ └── front.md │ ├── instructions.md │ └── medium │ │ ├── design-add-and-search-words-data-structure │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md │ │ ├── implement-trie-prefix-tree │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md │ │ └── lesson_manifest.json ├── two_d_dynamic_programming │ ├── course_manifest.json │ ├── hard │ │ ├── burst-balloons │ │ │ ├── back.md │ │ │ ├── exercise_manifest.json │ │ │ └── front.md │ │ ├── distinct-subsequences │ │ │ ├── back.md │ │ │ ├── exercise_manifest.json │ │ │ └── front.md │ │ ├── edit-distance │ │ │ ├── back.md │ │ │ ├── exercise_manifest.json │ │ │ └── front.md │ │ ├── lesson_manifest.json │ │ ├── longest-increasing-path-in-a-matrix │ │ │ ├── back.md │ │ │ ├── exercise_manifest.json │ │ │ └── front.md │ │ └── regular-expression-matching │ │ │ ├── back.md │ │ │ ├── exercise_manifest.json │ │ │ └── front.md │ ├── instructions.md │ └── medium │ │ ├── best-time-to-buy-and-sell-stock-with-cooldown │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md │ │ ├── coin-change-2 │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md │ │ ├── interleaving-string │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md │ │ ├── lesson_manifest.json │ │ ├── longest-common-subsequence │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md │ │ ├── target-sum │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md │ │ └── unique-paths │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md └── two_pointers │ ├── course_manifest.json │ ├── easy │ ├── lesson_manifest.json │ └── valid-palindrome │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md │ ├── hard │ ├── lesson_manifest.json │ └── trapping-rain-water │ │ ├── back.md │ │ ├── exercise_manifest.json │ │ └── front.md │ ├── instructions.md │ └── medium │ ├── 3sum │ ├── back.md │ ├── exercise_manifest.json │ └── front.md │ ├── container-with-most-water │ ├── back.md │ ├── exercise_manifest.json │ └── front.md │ ├── lesson_manifest.json │ └── two-sum-ii-input-array-is-sorted │ ├── back.md │ ├── exercise_manifest.json │ └── front.md └── src ├── advanced_graphs.rs ├── arrays_hashing.rs ├── backtracking.rs ├── binary_search.rs ├── bit_manipulation.rs ├── graphs.rs ├── greedy.rs ├── heap_priority_queue.rs ├── intervals.rs ├── leetcode.rs ├── linked_list.rs ├── main.rs ├── math_and_geometry.rs ├── one_d_dynamic_programming.rs ├── sliding_window.rs ├── stack.rs ├── trees.rs ├── tries.rs ├── two_d_dynamic_programming.rs └── two_pointers.rs /.gitignore: -------------------------------------------------------------------------------- 1 | # Generated by Cargo 2 | # will have compiled files and executables 3 | /target/ 4 | 5 | # Remove Cargo.lock from gitignore if creating an executable, leave it for libraries 6 | # More information here https://doc.rust-lang.org/cargo/guide/cargo-toml-vs-cargo-lock.html 7 | Cargo.lock 8 | 9 | # These are backup files generated by rustfmt 10 | **/*.rs.bk 11 | 12 | 13 | # Added by cargo 14 | 15 | /target 16 | -------------------------------------------------------------------------------- /Cargo.toml: -------------------------------------------------------------------------------- 1 | [package] 2 | name = "trane-leetcode" 3 | version = "0.1.0" 4 | edition = "2021" 5 | 6 | # See more keys and their definitions at https://doc.rust-lang.org/cargo/reference/manifest.html 7 | 8 | [dependencies] 9 | anyhow = "1.0.57" 10 | indoc = "1.0" 11 | lazy_static = "1.4.0" 12 | trane = "0.10.0" 13 | ustr = "0.9.0" 14 | # Commented out for use for local development. 15 | # trane = { path = "../trane" } 16 | 17 | [dev-dependencies] 18 | tempfile = "3.3.0" 19 | -------------------------------------------------------------------------------- /Makefile: -------------------------------------------------------------------------------- 1 | clean: 2 | cargo clean 3 | 4 | build: 5 | cargo build 6 | 7 | clean_courses: 8 | rm -rf courses/ 9 | 10 | build_courses: build clean_courses 11 | mkdir courses 12 | cd courses; cargo run 13 | -------------------------------------------------------------------------------- /courses/advanced_graphs/hard/alien-dictionary/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/advanced_graphs/hard/alien-dictionary/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::advanced_graphs::hard::alien-dictionary", 3 | "lesson_id": "trane::leetcode::advanced_graphs::hard", 4 | "course_id": "trane::leetcode::advanced_graphs", 5 | "name": "Alien Dictionary", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/advanced_graphs/hard/alien-dictionary/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Alien Dictionary. 2 | The URL of the problem is [https://leetcode.com/problems/alien-dictionary](https://leetcode.com/problems/alien-dictionary). 3 | -------------------------------------------------------------------------------- /courses/advanced_graphs/hard/lesson_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::advanced_graphs::hard", 3 | "dependencies": [ 4 | "trane::leetcode::advanced_graphs::medium" 5 | ], 6 | "course_id": "trane::leetcode::advanced_graphs", 7 | "name": "Advanced Graphs - hard", 8 | "description": null, 9 | "metadata": null, 10 | "lesson_material": null, 11 | "lesson_instructions": null 12 | } 13 | -------------------------------------------------------------------------------- /courses/advanced_graphs/hard/reconstruct-itinerary/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/advanced_graphs/hard/reconstruct-itinerary/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::advanced_graphs::hard::reconstruct-itinerary", 3 | "lesson_id": "trane::leetcode::advanced_graphs::hard", 4 | "course_id": "trane::leetcode::advanced_graphs", 5 | "name": "Reconstruct Itinerary", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/advanced_graphs/hard/reconstruct-itinerary/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Reconstruct Itinerary. 2 | The URL of the problem is [https://leetcode.com/problems/reconstruct-itinerary](https://leetcode.com/problems/reconstruct-itinerary). 3 | -------------------------------------------------------------------------------- /courses/advanced_graphs/hard/swim-in-rising-water/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/advanced_graphs/hard/swim-in-rising-water/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::advanced_graphs::hard::swim-in-rising-water", 3 | "lesson_id": "trane::leetcode::advanced_graphs::hard", 4 | "course_id": "trane::leetcode::advanced_graphs", 5 | "name": "Swim in Rising Water", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/advanced_graphs/hard/swim-in-rising-water/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Swim in Rising Water. 2 | The URL of the problem is [https://leetcode.com/problems/swim-in-rising-water](https://leetcode.com/problems/swim-in-rising-water). 3 | -------------------------------------------------------------------------------- /courses/advanced_graphs/instructions.md: -------------------------------------------------------------------------------- 1 | Make progress in this course by solving the given Leetcode problems. 2 | 3 | What solving a problem means is open-ended. You could code the solution from 4 | scratch every time, or do it only the first time and just review the solution 5 | any subsequent time you are given the problem. 6 | 7 | You can find the video solutions to all the problems on 8 | [neetcode.io](neetcode.io). 9 | -------------------------------------------------------------------------------- /courses/advanced_graphs/medium/cheapest-flight-within-k-stops/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/advanced_graphs/medium/cheapest-flight-within-k-stops/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::advanced_graphs::medium::cheapest-flight-within-k-stops", 3 | "lesson_id": "trane::leetcode::advanced_graphs::medium", 4 | "course_id": "trane::leetcode::advanced_graphs", 5 | "name": "Cheapest Flight Within K Stops", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/advanced_graphs/medium/cheapest-flight-within-k-stops/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Cheapest Flight Within K Stops. 2 | The URL of the problem is [https://leetcode.com/problems/cheapest-flight-within-k-stops](https://leetcode.com/problems/cheapest-flight-within-k-stops). 3 | -------------------------------------------------------------------------------- /courses/advanced_graphs/medium/lesson_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::advanced_graphs::medium", 3 | "dependencies": [], 4 | "course_id": "trane::leetcode::advanced_graphs", 5 | "name": "Advanced Graphs - medium", 6 | "description": null, 7 | "metadata": null, 8 | "lesson_material": null, 9 | "lesson_instructions": null 10 | } 11 | -------------------------------------------------------------------------------- /courses/advanced_graphs/medium/min-cost-to-connect-all-points/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/advanced_graphs/medium/min-cost-to-connect-all-points/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::advanced_graphs::medium::min-cost-to-connect-all-points", 3 | "lesson_id": "trane::leetcode::advanced_graphs::medium", 4 | "course_id": "trane::leetcode::advanced_graphs", 5 | "name": "Min Cost to Connect All Points", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/advanced_graphs/medium/min-cost-to-connect-all-points/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Min Cost to Connect All Points. 2 | The URL of the problem is [https://leetcode.com/problems/min-cost-to-connect-all-points](https://leetcode.com/problems/min-cost-to-connect-all-points). 3 | -------------------------------------------------------------------------------- /courses/advanced_graphs/medium/network-delay-time/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/advanced_graphs/medium/network-delay-time/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::advanced_graphs::medium::network-delay-time", 3 | "lesson_id": "trane::leetcode::advanced_graphs::medium", 4 | "course_id": "trane::leetcode::advanced_graphs", 5 | "name": "Network Delay Time", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/advanced_graphs/medium/network-delay-time/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Network Delay Time. 2 | The URL of the problem is [https://leetcode.com/problems/network-delay-time](https://leetcode.com/problems/network-delay-time). 3 | -------------------------------------------------------------------------------- /courses/arrays_hashing/easy/contains-duplicate/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/arrays_hashing/easy/contains-duplicate/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::arrays_hashing::easy::contains-duplicate", 3 | "lesson_id": "trane::leetcode::arrays_hashing::easy", 4 | "course_id": "trane::leetcode::arrays_hashing", 5 | "name": "Contains Duplicate", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/arrays_hashing/easy/contains-duplicate/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Contains Duplicate. 2 | The URL of the problem is [https://leetcode.com/problems/contains-duplicate](https://leetcode.com/problems/contains-duplicate). 3 | -------------------------------------------------------------------------------- /courses/arrays_hashing/easy/lesson_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::arrays_hashing::easy", 3 | "dependencies": [], 4 | "course_id": "trane::leetcode::arrays_hashing", 5 | "name": "Arrays & Hashing - easy", 6 | "description": null, 7 | "metadata": null, 8 | "lesson_material": null, 9 | "lesson_instructions": null 10 | } 11 | -------------------------------------------------------------------------------- /courses/arrays_hashing/easy/two-sum/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/arrays_hashing/easy/two-sum/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::arrays_hashing::easy::two-sum", 3 | "lesson_id": "trane::leetcode::arrays_hashing::easy", 4 | "course_id": "trane::leetcode::arrays_hashing", 5 | "name": "Two Sum", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/arrays_hashing/easy/two-sum/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Two Sum. 2 | The URL of the problem is [https://leetcode.com/problems/two-sum](https://leetcode.com/problems/two-sum). 3 | -------------------------------------------------------------------------------- /courses/arrays_hashing/easy/valid-anagram/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/arrays_hashing/easy/valid-anagram/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::arrays_hashing::easy::valid-anagram", 3 | "lesson_id": "trane::leetcode::arrays_hashing::easy", 4 | "course_id": "trane::leetcode::arrays_hashing", 5 | "name": "Valid Anagram", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/arrays_hashing/easy/valid-anagram/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Valid Anagram. 2 | The URL of the problem is [https://leetcode.com/problems/valid-anagram](https://leetcode.com/problems/valid-anagram). 3 | -------------------------------------------------------------------------------- /courses/arrays_hashing/instructions.md: -------------------------------------------------------------------------------- 1 | Make progress in this course by solving the given Leetcode problems. 2 | 3 | What solving a problem means is open-ended. You could code the solution from 4 | scratch every time, or do it only the first time and just review the solution 5 | any subsequent time you are given the problem. 6 | 7 | You can find the video solutions to all the problems on 8 | [neetcode.io](neetcode.io). 9 | -------------------------------------------------------------------------------- /courses/arrays_hashing/medium/encode-and-decode-strings/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/arrays_hashing/medium/encode-and-decode-strings/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::arrays_hashing::medium::encode-and-decode-strings", 3 | "lesson_id": "trane::leetcode::arrays_hashing::medium", 4 | "course_id": "trane::leetcode::arrays_hashing", 5 | "name": "Encode and Decode Strings", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/arrays_hashing/medium/encode-and-decode-strings/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Encode and Decode Strings. 2 | The URL of the problem is [https://leetcode.com/problems/encode-and-decode-strings](https://leetcode.com/problems/encode-and-decode-strings). 3 | -------------------------------------------------------------------------------- /courses/arrays_hashing/medium/group-anagrams/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/arrays_hashing/medium/group-anagrams/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::arrays_hashing::medium::group-anagrams", 3 | "lesson_id": "trane::leetcode::arrays_hashing::medium", 4 | "course_id": "trane::leetcode::arrays_hashing", 5 | "name": "Group Anagrams", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/arrays_hashing/medium/group-anagrams/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Group Anagrams. 2 | The URL of the problem is [https://leetcode.com/problems/group-anagrams](https://leetcode.com/problems/group-anagrams). 3 | -------------------------------------------------------------------------------- /courses/arrays_hashing/medium/lesson_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::arrays_hashing::medium", 3 | "dependencies": [ 4 | "trane::leetcode::arrays_hashing::easy" 5 | ], 6 | "course_id": "trane::leetcode::arrays_hashing", 7 | "name": "Arrays & Hashing - medium", 8 | "description": null, 9 | "metadata": null, 10 | "lesson_material": null, 11 | "lesson_instructions": null 12 | } 13 | -------------------------------------------------------------------------------- /courses/arrays_hashing/medium/longest-consecutive-sequence/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/arrays_hashing/medium/longest-consecutive-sequence/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::arrays_hashing::medium::longest-consecutive-sequence", 3 | "lesson_id": "trane::leetcode::arrays_hashing::medium", 4 | "course_id": "trane::leetcode::arrays_hashing", 5 | "name": "Longest Consecutive Sequence", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/arrays_hashing/medium/longest-consecutive-sequence/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Longest Consecutive Sequence. 2 | The URL of the problem is [https://leetcode.com/problems/longest-consecutive-sequence](https://leetcode.com/problems/longest-consecutive-sequence). 3 | -------------------------------------------------------------------------------- /courses/arrays_hashing/medium/product-of-array-except-self/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/arrays_hashing/medium/product-of-array-except-self/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::arrays_hashing::medium::product-of-array-except-self", 3 | "lesson_id": "trane::leetcode::arrays_hashing::medium", 4 | "course_id": "trane::leetcode::arrays_hashing", 5 | "name": "Product of Array Except Self", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/arrays_hashing/medium/product-of-array-except-self/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Product of Array Except Self. 2 | The URL of the problem is [https://leetcode.com/problems/product-of-array-except-self](https://leetcode.com/problems/product-of-array-except-self). 3 | -------------------------------------------------------------------------------- /courses/arrays_hashing/medium/top-k-frequent-elements/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/arrays_hashing/medium/top-k-frequent-elements/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::arrays_hashing::medium::top-k-frequent-elements", 3 | "lesson_id": "trane::leetcode::arrays_hashing::medium", 4 | "course_id": "trane::leetcode::arrays_hashing", 5 | "name": "Top K Frequent Elements", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/arrays_hashing/medium/top-k-frequent-elements/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Top K Frequent Elements. 2 | The URL of the problem is [https://leetcode.com/problems/top-k-frequent-elements](https://leetcode.com/problems/top-k-frequent-elements). 3 | -------------------------------------------------------------------------------- /courses/arrays_hashing/medium/valid-sudoky/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/arrays_hashing/medium/valid-sudoky/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::arrays_hashing::medium::valid-sudoky", 3 | "lesson_id": "trane::leetcode::arrays_hashing::medium", 4 | "course_id": "trane::leetcode::arrays_hashing", 5 | "name": "Valid Sudoku", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/arrays_hashing/medium/valid-sudoky/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Valid Sudoku. 2 | The URL of the problem is [https://leetcode.com/problems/valid-sudoky](https://leetcode.com/problems/valid-sudoky). 3 | -------------------------------------------------------------------------------- /courses/backtracking/course_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::backtracking", 3 | "name": "Backtracking", 4 | "dependencies": [], 5 | "description": "Solve Leetcode problems related to the topic Backtracking", 6 | "authors": [ 7 | "The Trane Project" 8 | ], 9 | "metadata": { 10 | "leetcode_topic": [ 11 | "Backtracking" 12 | ] 13 | }, 14 | "course_material": null, 15 | "course_instructions": { 16 | "MarkdownAsset": { 17 | "path": "instructions.md" 18 | } 19 | }, 20 | "generator_config": null 21 | } 22 | -------------------------------------------------------------------------------- /courses/backtracking/hard/lesson_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::backtracking::hard", 3 | "dependencies": [ 4 | "trane::leetcode::backtracking::medium" 5 | ], 6 | "course_id": "trane::leetcode::backtracking", 7 | "name": "Backtracking - hard", 8 | "description": null, 9 | "metadata": null, 10 | "lesson_material": null, 11 | "lesson_instructions": null 12 | } 13 | -------------------------------------------------------------------------------- /courses/backtracking/hard/n-queens/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/backtracking/hard/n-queens/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::backtracking::hard::n-queens", 3 | "lesson_id": "trane::leetcode::backtracking::hard", 4 | "course_id": "trane::leetcode::backtracking", 5 | "name": "N-Queens", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/backtracking/hard/n-queens/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem N-Queens. 2 | The URL of the problem is [https://leetcode.com/problems/n-queens](https://leetcode.com/problems/n-queens). 3 | -------------------------------------------------------------------------------- /courses/backtracking/instructions.md: -------------------------------------------------------------------------------- 1 | Make progress in this course by solving the given Leetcode problems. 2 | 3 | What solving a problem means is open-ended. You could code the solution from 4 | scratch every time, or do it only the first time and just review the solution 5 | any subsequent time you are given the problem. 6 | 7 | You can find the video solutions to all the problems on 8 | [neetcode.io](neetcode.io). 9 | -------------------------------------------------------------------------------- /courses/backtracking/medium/combination-sum-ii/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/backtracking/medium/combination-sum-ii/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::backtracking::medium::combination-sum-ii", 3 | "lesson_id": "trane::leetcode::backtracking::medium", 4 | "course_id": "trane::leetcode::backtracking", 5 | "name": "Combination Sum II", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/backtracking/medium/combination-sum-ii/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Combination Sum II. 2 | The URL of the problem is [https://leetcode.com/problems/combination-sum-ii](https://leetcode.com/problems/combination-sum-ii). 3 | -------------------------------------------------------------------------------- /courses/backtracking/medium/combination-sum/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/backtracking/medium/combination-sum/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::backtracking::medium::combination-sum", 3 | "lesson_id": "trane::leetcode::backtracking::medium", 4 | "course_id": "trane::leetcode::backtracking", 5 | "name": "Combination Sum", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/backtracking/medium/combination-sum/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Combination Sum. 2 | The URL of the problem is [https://leetcode.com/problems/combination-sum](https://leetcode.com/problems/combination-sum). 3 | -------------------------------------------------------------------------------- /courses/backtracking/medium/lesson_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::backtracking::medium", 3 | "dependencies": [], 4 | "course_id": "trane::leetcode::backtracking", 5 | "name": "Backtracking - medium", 6 | "description": null, 7 | "metadata": null, 8 | "lesson_material": null, 9 | "lesson_instructions": null 10 | } 11 | -------------------------------------------------------------------------------- /courses/backtracking/medium/letter-combinations-of-a-phone-number/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/backtracking/medium/letter-combinations-of-a-phone-number/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::backtracking::medium::letter-combinations-of-a-phone-number", 3 | "lesson_id": "trane::leetcode::backtracking::medium", 4 | "course_id": "trane::leetcode::backtracking", 5 | "name": "Letter Combinations of a Phone Number", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/backtracking/medium/letter-combinations-of-a-phone-number/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Letter Combinations of a Phone Number. 2 | The URL of the problem is [https://leetcode.com/problems/letter-combinations-of-a-phone-number](https://leetcode.com/problems/letter-combinations-of-a-phone-number). 3 | -------------------------------------------------------------------------------- /courses/backtracking/medium/palindrome-partitioning/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/backtracking/medium/palindrome-partitioning/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::backtracking::medium::palindrome-partitioning", 3 | "lesson_id": "trane::leetcode::backtracking::medium", 4 | "course_id": "trane::leetcode::backtracking", 5 | "name": "Palindrome Partitioning", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/backtracking/medium/palindrome-partitioning/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Palindrome Partitioning. 2 | The URL of the problem is [https://leetcode.com/problems/palindrome-partitioning](https://leetcode.com/problems/palindrome-partitioning). 3 | -------------------------------------------------------------------------------- /courses/backtracking/medium/permutations/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/backtracking/medium/permutations/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::backtracking::medium::permutations", 3 | "lesson_id": "trane::leetcode::backtracking::medium", 4 | "course_id": "trane::leetcode::backtracking", 5 | "name": "Permutations", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/backtracking/medium/permutations/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Permutations. 2 | The URL of the problem is [https://leetcode.com/problems/permutations](https://leetcode.com/problems/permutations). 3 | -------------------------------------------------------------------------------- /courses/backtracking/medium/subsets-ii/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/backtracking/medium/subsets-ii/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::backtracking::medium::subsets-ii", 3 | "lesson_id": "trane::leetcode::backtracking::medium", 4 | "course_id": "trane::leetcode::backtracking", 5 | "name": "Subsets II", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/backtracking/medium/subsets-ii/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Subsets II. 2 | The URL of the problem is [https://leetcode.com/problems/subsets-ii](https://leetcode.com/problems/subsets-ii). 3 | -------------------------------------------------------------------------------- /courses/backtracking/medium/subsets/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/backtracking/medium/subsets/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::backtracking::medium::subsets", 3 | "lesson_id": "trane::leetcode::backtracking::medium", 4 | "course_id": "trane::leetcode::backtracking", 5 | "name": "Subsets", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/backtracking/medium/subsets/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Subsets. 2 | The URL of the problem is [https://leetcode.com/problems/subsets](https://leetcode.com/problems/subsets). 3 | -------------------------------------------------------------------------------- /courses/backtracking/medium/word-search/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/backtracking/medium/word-search/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::backtracking::medium::word-search", 3 | "lesson_id": "trane::leetcode::backtracking::medium", 4 | "course_id": "trane::leetcode::backtracking", 5 | "name": "Word Search", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/backtracking/medium/word-search/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Word Search. 2 | The URL of the problem is [https://leetcode.com/problems/word-search](https://leetcode.com/problems/word-search). 3 | -------------------------------------------------------------------------------- /courses/binary_search/course_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::binary_search", 3 | "name": "Binary Search", 4 | "dependencies": [], 5 | "description": "Solve Leetcode problems related to the topic Binary Search", 6 | "authors": [ 7 | "The Trane Project" 8 | ], 9 | "metadata": { 10 | "leetcode_topic": [ 11 | "Binary Search" 12 | ] 13 | }, 14 | "course_material": null, 15 | "course_instructions": { 16 | "MarkdownAsset": { 17 | "path": "instructions.md" 18 | } 19 | }, 20 | "generator_config": null 21 | } 22 | -------------------------------------------------------------------------------- /courses/binary_search/easy/binary-search/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/binary_search/easy/binary-search/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::binary_search::easy::binary-search", 3 | "lesson_id": "trane::leetcode::binary_search::easy", 4 | "course_id": "trane::leetcode::binary_search", 5 | "name": "Binary Search", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/binary_search/easy/binary-search/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Binary Search. 2 | The URL of the problem is [https://leetcode.com/problems/binary-search](https://leetcode.com/problems/binary-search). 3 | -------------------------------------------------------------------------------- /courses/binary_search/easy/lesson_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::binary_search::easy", 3 | "dependencies": [], 4 | "course_id": "trane::leetcode::binary_search", 5 | "name": "Binary Search - easy", 6 | "description": null, 7 | "metadata": null, 8 | "lesson_material": null, 9 | "lesson_instructions": null 10 | } 11 | -------------------------------------------------------------------------------- /courses/binary_search/hard/lesson_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::binary_search::hard", 3 | "dependencies": [ 4 | "trane::leetcode::binary_search::medium" 5 | ], 6 | "course_id": "trane::leetcode::binary_search", 7 | "name": "Binary Search - hard", 8 | "description": null, 9 | "metadata": null, 10 | "lesson_material": null, 11 | "lesson_instructions": null 12 | } 13 | -------------------------------------------------------------------------------- /courses/binary_search/hard/median-of-two-sorted-arrays/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/binary_search/hard/median-of-two-sorted-arrays/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::binary_search::hard::median-of-two-sorted-arrays", 3 | "lesson_id": "trane::leetcode::binary_search::hard", 4 | "course_id": "trane::leetcode::binary_search", 5 | "name": "Median of Two Sorted Arrays", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/binary_search/hard/median-of-two-sorted-arrays/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Median of Two Sorted Arrays. 2 | The URL of the problem is [https://leetcode.com/problems/median-of-two-sorted-arrays](https://leetcode.com/problems/median-of-two-sorted-arrays). 3 | -------------------------------------------------------------------------------- /courses/binary_search/instructions.md: -------------------------------------------------------------------------------- 1 | Make progress in this course by solving the given Leetcode problems. 2 | 3 | What solving a problem means is open-ended. You could code the solution from 4 | scratch every time, or do it only the first time and just review the solution 5 | any subsequent time you are given the problem. 6 | 7 | You can find the video solutions to all the problems on 8 | [neetcode.io](neetcode.io). 9 | -------------------------------------------------------------------------------- /courses/binary_search/medium/find-minimum-in-rotated-sorted-array/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/binary_search/medium/find-minimum-in-rotated-sorted-array/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::binary_search::medium::find-minimum-in-rotated-sorted-array", 3 | "lesson_id": "trane::leetcode::binary_search::medium", 4 | "course_id": "trane::leetcode::binary_search", 5 | "name": "Find Minimum in Rotated Sorted Array", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/binary_search/medium/find-minimum-in-rotated-sorted-array/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Find Minimum in Rotated Sorted Array. 2 | The URL of the problem is [https://leetcode.com/problems/find-minimum-in-rotated-sorted-array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array). 3 | -------------------------------------------------------------------------------- /courses/binary_search/medium/koko-eating-bananas/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/binary_search/medium/koko-eating-bananas/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::binary_search::medium::koko-eating-bananas", 3 | "lesson_id": "trane::leetcode::binary_search::medium", 4 | "course_id": "trane::leetcode::binary_search", 5 | "name": "Koko Eating Bananas", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/binary_search/medium/koko-eating-bananas/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Koko Eating Bananas. 2 | The URL of the problem is [https://leetcode.com/problems/koko-eating-bananas](https://leetcode.com/problems/koko-eating-bananas). 3 | -------------------------------------------------------------------------------- /courses/binary_search/medium/lesson_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::binary_search::medium", 3 | "dependencies": [ 4 | "trane::leetcode::binary_search::easy" 5 | ], 6 | "course_id": "trane::leetcode::binary_search", 7 | "name": "Binary Search - medium", 8 | "description": null, 9 | "metadata": null, 10 | "lesson_material": null, 11 | "lesson_instructions": null 12 | } 13 | -------------------------------------------------------------------------------- /courses/binary_search/medium/search-a-2d-matrix/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/binary_search/medium/search-a-2d-matrix/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::binary_search::medium::search-a-2d-matrix", 3 | "lesson_id": "trane::leetcode::binary_search::medium", 4 | "course_id": "trane::leetcode::binary_search", 5 | "name": "Search a 2D Matrix", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/binary_search/medium/search-a-2d-matrix/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Search a 2D Matrix. 2 | The URL of the problem is [https://leetcode.com/problems/search-a-2d-matrix](https://leetcode.com/problems/search-a-2d-matrix). 3 | -------------------------------------------------------------------------------- /courses/binary_search/medium/search-in-rotated-sorted-array/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/binary_search/medium/search-in-rotated-sorted-array/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::binary_search::medium::search-in-rotated-sorted-array", 3 | "lesson_id": "trane::leetcode::binary_search::medium", 4 | "course_id": "trane::leetcode::binary_search", 5 | "name": "Search Rotated Sorted Array", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/binary_search/medium/search-in-rotated-sorted-array/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Search Rotated Sorted Array. 2 | The URL of the problem is [https://leetcode.com/problems/search-in-rotated-sorted-array](https://leetcode.com/problems/search-in-rotated-sorted-array). 3 | -------------------------------------------------------------------------------- /courses/binary_search/medium/time-based-key-value-store/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/binary_search/medium/time-based-key-value-store/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::binary_search::medium::time-based-key-value-store", 3 | "lesson_id": "trane::leetcode::binary_search::medium", 4 | "course_id": "trane::leetcode::binary_search", 5 | "name": "Time Based Key-Value Store", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/binary_search/medium/time-based-key-value-store/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Time Based Key-Value Store. 2 | The URL of the problem is [https://leetcode.com/problems/time-based-key-value-store](https://leetcode.com/problems/time-based-key-value-store). 3 | -------------------------------------------------------------------------------- /courses/bit_manipulation/easy/counting-bits/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/bit_manipulation/easy/counting-bits/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::bit_manipulation::easy::counting-bits", 3 | "lesson_id": "trane::leetcode::bit_manipulation::easy", 4 | "course_id": "trane::leetcode::bit_manipulation", 5 | "name": "Counting Bits", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/bit_manipulation/easy/counting-bits/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Counting Bits. 2 | The URL of the problem is [https://leetcode.com/problems/counting-bits](https://leetcode.com/problems/counting-bits). 3 | -------------------------------------------------------------------------------- /courses/bit_manipulation/easy/lesson_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::bit_manipulation::easy", 3 | "dependencies": [], 4 | "course_id": "trane::leetcode::bit_manipulation", 5 | "name": "Bit Manipulation - easy", 6 | "description": null, 7 | "metadata": null, 8 | "lesson_material": null, 9 | "lesson_instructions": null 10 | } 11 | -------------------------------------------------------------------------------- /courses/bit_manipulation/easy/missing-number/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/bit_manipulation/easy/missing-number/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::bit_manipulation::easy::missing-number", 3 | "lesson_id": "trane::leetcode::bit_manipulation::easy", 4 | "course_id": "trane::leetcode::bit_manipulation", 5 | "name": "Missing Number", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/bit_manipulation/easy/missing-number/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Missing Number. 2 | The URL of the problem is [https://leetcode.com/problems/missing-number](https://leetcode.com/problems/missing-number). 3 | -------------------------------------------------------------------------------- /courses/bit_manipulation/easy/number-of-1-bits/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/bit_manipulation/easy/number-of-1-bits/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::bit_manipulation::easy::number-of-1-bits", 3 | "lesson_id": "trane::leetcode::bit_manipulation::easy", 4 | "course_id": "trane::leetcode::bit_manipulation", 5 | "name": "Number of 1 Bits", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/bit_manipulation/easy/number-of-1-bits/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Number of 1 Bits. 2 | The URL of the problem is [https://leetcode.com/problems/number-of-1-bits](https://leetcode.com/problems/number-of-1-bits). 3 | -------------------------------------------------------------------------------- /courses/bit_manipulation/easy/reverse-bits/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/bit_manipulation/easy/reverse-bits/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::bit_manipulation::easy::reverse-bits", 3 | "lesson_id": "trane::leetcode::bit_manipulation::easy", 4 | "course_id": "trane::leetcode::bit_manipulation", 5 | "name": "Reverse Bits", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/bit_manipulation/easy/reverse-bits/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Reverse Bits. 2 | The URL of the problem is [https://leetcode.com/problems/reverse-bits](https://leetcode.com/problems/reverse-bits). 3 | -------------------------------------------------------------------------------- /courses/bit_manipulation/easy/single-number/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/bit_manipulation/easy/single-number/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::bit_manipulation::easy::single-number", 3 | "lesson_id": "trane::leetcode::bit_manipulation::easy", 4 | "course_id": "trane::leetcode::bit_manipulation", 5 | "name": "Single Number", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/bit_manipulation/easy/single-number/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Single Number. 2 | The URL of the problem is [https://leetcode.com/problems/single-number](https://leetcode.com/problems/single-number). 3 | -------------------------------------------------------------------------------- /courses/bit_manipulation/instructions.md: -------------------------------------------------------------------------------- 1 | Make progress in this course by solving the given Leetcode problems. 2 | 3 | What solving a problem means is open-ended. You could code the solution from 4 | scratch every time, or do it only the first time and just review the solution 5 | any subsequent time you are given the problem. 6 | 7 | You can find the video solutions to all the problems on 8 | [neetcode.io](neetcode.io). 9 | -------------------------------------------------------------------------------- /courses/bit_manipulation/medium/lesson_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::bit_manipulation::medium", 3 | "dependencies": [ 4 | "trane::leetcode::bit_manipulation::easy" 5 | ], 6 | "course_id": "trane::leetcode::bit_manipulation", 7 | "name": "Bit Manipulation - medium", 8 | "description": null, 9 | "metadata": null, 10 | "lesson_material": null, 11 | "lesson_instructions": null 12 | } 13 | -------------------------------------------------------------------------------- /courses/bit_manipulation/medium/reverse-integer/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/bit_manipulation/medium/reverse-integer/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::bit_manipulation::medium::reverse-integer", 3 | "lesson_id": "trane::leetcode::bit_manipulation::medium", 4 | "course_id": "trane::leetcode::bit_manipulation", 5 | "name": "Reverse Integer", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/bit_manipulation/medium/reverse-integer/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Reverse Integer. 2 | The URL of the problem is [https://leetcode.com/problems/reverse-integer](https://leetcode.com/problems/reverse-integer). 3 | -------------------------------------------------------------------------------- /courses/bit_manipulation/medium/sum-of-two-integers/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/bit_manipulation/medium/sum-of-two-integers/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::bit_manipulation::medium::sum-of-two-integers", 3 | "lesson_id": "trane::leetcode::bit_manipulation::medium", 4 | "course_id": "trane::leetcode::bit_manipulation", 5 | "name": "Sum of Two Integers", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/bit_manipulation/medium/sum-of-two-integers/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Sum of Two Integers. 2 | The URL of the problem is [https://leetcode.com/problems/sum-of-two-integers](https://leetcode.com/problems/sum-of-two-integers). 3 | -------------------------------------------------------------------------------- /courses/graphs/course_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::graphs", 3 | "name": "Graphs", 4 | "dependencies": [], 5 | "description": "Solve Leetcode problems related to the topic Graphs", 6 | "authors": [ 7 | "The Trane Project" 8 | ], 9 | "metadata": { 10 | "leetcode_topic": [ 11 | "Graphs" 12 | ] 13 | }, 14 | "course_material": null, 15 | "course_instructions": { 16 | "MarkdownAsset": { 17 | "path": "instructions.md" 18 | } 19 | }, 20 | "generator_config": null 21 | } 22 | -------------------------------------------------------------------------------- /courses/graphs/hard/lesson_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::graphs::hard", 3 | "dependencies": [ 4 | "trane::leetcode::graphs::medium" 5 | ], 6 | "course_id": "trane::leetcode::graphs", 7 | "name": "Graphs - hard", 8 | "description": null, 9 | "metadata": null, 10 | "lesson_material": null, 11 | "lesson_instructions": null 12 | } 13 | -------------------------------------------------------------------------------- /courses/graphs/hard/word-ladder/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/graphs/hard/word-ladder/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::graphs::hard::word-ladder", 3 | "lesson_id": "trane::leetcode::graphs::hard", 4 | "course_id": "trane::leetcode::graphs", 5 | "name": "Word Ladder", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/graphs/hard/word-ladder/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Word Ladder. 2 | The URL of the problem is [https://leetcode.com/problems/word-ladder](https://leetcode.com/problems/word-ladder). 3 | -------------------------------------------------------------------------------- /courses/graphs/instructions.md: -------------------------------------------------------------------------------- 1 | Make progress in this course by solving the given Leetcode problems. 2 | 3 | What solving a problem means is open-ended. You could code the solution from 4 | scratch every time, or do it only the first time and just review the solution 5 | any subsequent time you are given the problem. 6 | 7 | You can find the video solutions to all the problems on 8 | [neetcode.io](neetcode.io). 9 | -------------------------------------------------------------------------------- /courses/graphs/medium/clone-graph/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/graphs/medium/clone-graph/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::graphs::medium::clone-graph", 3 | "lesson_id": "trane::leetcode::graphs::medium", 4 | "course_id": "trane::leetcode::graphs", 5 | "name": "Clone Graph", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/graphs/medium/clone-graph/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Clone Graph. 2 | The URL of the problem is [https://leetcode.com/problems/clone-graph](https://leetcode.com/problems/clone-graph). 3 | -------------------------------------------------------------------------------- /courses/graphs/medium/course-schedule-ii/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/graphs/medium/course-schedule-ii/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::graphs::medium::course-schedule-ii", 3 | "lesson_id": "trane::leetcode::graphs::medium", 4 | "course_id": "trane::leetcode::graphs", 5 | "name": "Course Schedule II", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/graphs/medium/course-schedule-ii/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Course Schedule II. 2 | The URL of the problem is [https://leetcode.com/problems/course-schedule-ii](https://leetcode.com/problems/course-schedule-ii). 3 | -------------------------------------------------------------------------------- /courses/graphs/medium/course-schedule/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/graphs/medium/course-schedule/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::graphs::medium::course-schedule", 3 | "lesson_id": "trane::leetcode::graphs::medium", 4 | "course_id": "trane::leetcode::graphs", 5 | "name": "Course Schedule", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/graphs/medium/course-schedule/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Course Schedule. 2 | The URL of the problem is [https://leetcode.com/problems/course-schedule](https://leetcode.com/problems/course-schedule). 3 | -------------------------------------------------------------------------------- /courses/graphs/medium/lesson_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::graphs::medium", 3 | "dependencies": [], 4 | "course_id": "trane::leetcode::graphs", 5 | "name": "Graphs - medium", 6 | "description": null, 7 | "metadata": null, 8 | "lesson_material": null, 9 | "lesson_instructions": null 10 | } 11 | -------------------------------------------------------------------------------- /courses/graphs/medium/max-area-of-island/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/graphs/medium/max-area-of-island/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::graphs::medium::max-area-of-island", 3 | "lesson_id": "trane::leetcode::graphs::medium", 4 | "course_id": "trane::leetcode::graphs", 5 | "name": "Max Area of Island", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/graphs/medium/max-area-of-island/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Max Area of Island. 2 | The URL of the problem is [https://leetcode.com/problems/max-area-of-island](https://leetcode.com/problems/max-area-of-island). 3 | -------------------------------------------------------------------------------- /courses/graphs/medium/number-of-connected-components-in-an-undirected-graph/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/graphs/medium/number-of-connected-components-in-an-undirected-graph/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Number of Connected Components in an Undirected Graph. 2 | The URL of the problem is [https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph](https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph). 3 | -------------------------------------------------------------------------------- /courses/graphs/medium/number-of-islands/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/graphs/medium/number-of-islands/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::graphs::medium::number-of-islands", 3 | "lesson_id": "trane::leetcode::graphs::medium", 4 | "course_id": "trane::leetcode::graphs", 5 | "name": "Number of Islands", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/graphs/medium/number-of-islands/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Number of Islands. 2 | The URL of the problem is [https://leetcode.com/problems/number-of-islands](https://leetcode.com/problems/number-of-islands). 3 | -------------------------------------------------------------------------------- /courses/graphs/medium/pacific-atlantic-water-flow/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/graphs/medium/pacific-atlantic-water-flow/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::graphs::medium::pacific-atlantic-water-flow", 3 | "lesson_id": "trane::leetcode::graphs::medium", 4 | "course_id": "trane::leetcode::graphs", 5 | "name": "Pacific Atlantic Water Flow", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/graphs/medium/pacific-atlantic-water-flow/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Pacific Atlantic Water Flow. 2 | The URL of the problem is [https://leetcode.com/problems/pacific-atlantic-water-flow](https://leetcode.com/problems/pacific-atlantic-water-flow). 3 | -------------------------------------------------------------------------------- /courses/graphs/medium/redundant-connection/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/graphs/medium/redundant-connection/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::graphs::medium::redundant-connection", 3 | "lesson_id": "trane::leetcode::graphs::medium", 4 | "course_id": "trane::leetcode::graphs", 5 | "name": "Redundant Connection", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/graphs/medium/redundant-connection/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Redundant Connection. 2 | The URL of the problem is [https://leetcode.com/problems/redundant-connection](https://leetcode.com/problems/redundant-connection). 3 | -------------------------------------------------------------------------------- /courses/graphs/medium/rotting-oranges/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/graphs/medium/rotting-oranges/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::graphs::medium::rotting-oranges", 3 | "lesson_id": "trane::leetcode::graphs::medium", 4 | "course_id": "trane::leetcode::graphs", 5 | "name": "Rotting Oranges", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/graphs/medium/rotting-oranges/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Rotting Oranges. 2 | The URL of the problem is [https://leetcode.com/problems/rotting-oranges](https://leetcode.com/problems/rotting-oranges). 3 | -------------------------------------------------------------------------------- /courses/graphs/medium/surrounded-regions/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/graphs/medium/surrounded-regions/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::graphs::medium::surrounded-regions", 3 | "lesson_id": "trane::leetcode::graphs::medium", 4 | "course_id": "trane::leetcode::graphs", 5 | "name": "Surrounded Regions", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/graphs/medium/surrounded-regions/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Surrounded Regions. 2 | The URL of the problem is [https://leetcode.com/problems/surrounded-regions](https://leetcode.com/problems/surrounded-regions). 3 | -------------------------------------------------------------------------------- /courses/graphs/medium/walls-and-gates/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/graphs/medium/walls-and-gates/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::graphs::medium::walls-and-gates", 3 | "lesson_id": "trane::leetcode::graphs::medium", 4 | "course_id": "trane::leetcode::graphs", 5 | "name": "Walls and Gates", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/graphs/medium/walls-and-gates/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Walls and Gates. 2 | The URL of the problem is [https://leetcode.com/problems/walls-and-gates](https://leetcode.com/problems/walls-and-gates). 3 | -------------------------------------------------------------------------------- /courses/greedy/course_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::greedy", 3 | "name": "Greedy", 4 | "dependencies": [], 5 | "description": "Solve Leetcode problems related to the topic Greedy", 6 | "authors": [ 7 | "The Trane Project" 8 | ], 9 | "metadata": { 10 | "leetcode_topic": [ 11 | "Greedy" 12 | ] 13 | }, 14 | "course_material": null, 15 | "course_instructions": { 16 | "MarkdownAsset": { 17 | "path": "instructions.md" 18 | } 19 | }, 20 | "generator_config": null 21 | } 22 | -------------------------------------------------------------------------------- /courses/greedy/instructions.md: -------------------------------------------------------------------------------- 1 | Make progress in this course by solving the given Leetcode problems. 2 | 3 | What solving a problem means is open-ended. You could code the solution from 4 | scratch every time, or do it only the first time and just review the solution 5 | any subsequent time you are given the problem. 6 | 7 | You can find the video solutions to all the problems on 8 | [neetcode.io](neetcode.io). 9 | -------------------------------------------------------------------------------- /courses/greedy/medium/gas-station/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/greedy/medium/gas-station/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::greedy::medium::gas-station", 3 | "lesson_id": "trane::leetcode::greedy::medium", 4 | "course_id": "trane::leetcode::greedy", 5 | "name": "Gas Station", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/greedy/medium/gas-station/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Gas Station. 2 | The URL of the problem is [https://leetcode.com/problems/gas-station](https://leetcode.com/problems/gas-station). 3 | -------------------------------------------------------------------------------- /courses/greedy/medium/hand-of-straights/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/greedy/medium/hand-of-straights/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::greedy::medium::hand-of-straights", 3 | "lesson_id": "trane::leetcode::greedy::medium", 4 | "course_id": "trane::leetcode::greedy", 5 | "name": "Hand of Straights", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/greedy/medium/hand-of-straights/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Hand of Straights. 2 | The URL of the problem is [https://leetcode.com/problems/hand-of-straights](https://leetcode.com/problems/hand-of-straights). 3 | -------------------------------------------------------------------------------- /courses/greedy/medium/jump-game-ii/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/greedy/medium/jump-game-ii/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::greedy::medium::jump-game-ii", 3 | "lesson_id": "trane::leetcode::greedy::medium", 4 | "course_id": "trane::leetcode::greedy", 5 | "name": "Jump Game II", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/greedy/medium/jump-game-ii/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Jump Game II. 2 | The URL of the problem is [https://leetcode.com/problems/jump-game-ii](https://leetcode.com/problems/jump-game-ii). 3 | -------------------------------------------------------------------------------- /courses/greedy/medium/jump-game/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/greedy/medium/jump-game/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::greedy::medium::jump-game", 3 | "lesson_id": "trane::leetcode::greedy::medium", 4 | "course_id": "trane::leetcode::greedy", 5 | "name": "Jump Game", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/greedy/medium/jump-game/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Jump Game. 2 | The URL of the problem is [https://leetcode.com/problems/jump-game](https://leetcode.com/problems/jump-game). 3 | -------------------------------------------------------------------------------- /courses/greedy/medium/lesson_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::greedy::medium", 3 | "dependencies": [], 4 | "course_id": "trane::leetcode::greedy", 5 | "name": "Greedy - medium", 6 | "description": null, 7 | "metadata": null, 8 | "lesson_material": null, 9 | "lesson_instructions": null 10 | } 11 | -------------------------------------------------------------------------------- /courses/greedy/medium/maximum-subarray/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/greedy/medium/maximum-subarray/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::greedy::medium::maximum-subarray", 3 | "lesson_id": "trane::leetcode::greedy::medium", 4 | "course_id": "trane::leetcode::greedy", 5 | "name": "Maximum Subarray", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/greedy/medium/maximum-subarray/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Maximum Subarray. 2 | The URL of the problem is [https://leetcode.com/problems/maximum-subarray](https://leetcode.com/problems/maximum-subarray). 3 | -------------------------------------------------------------------------------- /courses/greedy/medium/merge-triplets-to-form-target-triplet/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/greedy/medium/merge-triplets-to-form-target-triplet/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::greedy::medium::merge-triplets-to-form-target-triplet", 3 | "lesson_id": "trane::leetcode::greedy::medium", 4 | "course_id": "trane::leetcode::greedy", 5 | "name": "Merge Triplets to Form Target Triplet", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/greedy/medium/merge-triplets-to-form-target-triplet/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Merge Triplets to Form Target Triplet. 2 | The URL of the problem is [https://leetcode.com/problems/merge-triplets-to-form-target-triplet](https://leetcode.com/problems/merge-triplets-to-form-target-triplet). 3 | -------------------------------------------------------------------------------- /courses/greedy/medium/partition-labels/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/greedy/medium/partition-labels/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::greedy::medium::partition-labels", 3 | "lesson_id": "trane::leetcode::greedy::medium", 4 | "course_id": "trane::leetcode::greedy", 5 | "name": "Partition Labels", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/greedy/medium/partition-labels/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Partition Labels. 2 | The URL of the problem is [https://leetcode.com/problems/partition-labels](https://leetcode.com/problems/partition-labels). 3 | -------------------------------------------------------------------------------- /courses/greedy/medium/valid-parentheses-string/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/greedy/medium/valid-parentheses-string/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::greedy::medium::valid-parentheses-string", 3 | "lesson_id": "trane::leetcode::greedy::medium", 4 | "course_id": "trane::leetcode::greedy", 5 | "name": "Valid Parentheses String", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/greedy/medium/valid-parentheses-string/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Valid Parentheses String. 2 | The URL of the problem is [https://leetcode.com/problems/valid-parentheses-string](https://leetcode.com/problems/valid-parentheses-string). 3 | -------------------------------------------------------------------------------- /courses/heap_priority_queue/easy/kth-largest-element-in-a-stream/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/heap_priority_queue/easy/kth-largest-element-in-a-stream/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::heap_priority_queue::easy::kth-largest-element-in-a-stream", 3 | "lesson_id": "trane::leetcode::heap_priority_queue::easy", 4 | "course_id": "trane::leetcode::heap_priority_queue", 5 | "name": "Kth Largest Element in a Stream", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/heap_priority_queue/easy/kth-largest-element-in-a-stream/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Kth Largest Element in a Stream. 2 | The URL of the problem is [https://leetcode.com/problems/kth-largest-element-in-a-stream](https://leetcode.com/problems/kth-largest-element-in-a-stream). 3 | -------------------------------------------------------------------------------- /courses/heap_priority_queue/easy/last-stone-weight/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/heap_priority_queue/easy/last-stone-weight/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::heap_priority_queue::easy::last-stone-weight", 3 | "lesson_id": "trane::leetcode::heap_priority_queue::easy", 4 | "course_id": "trane::leetcode::heap_priority_queue", 5 | "name": "Last Stone Weight", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/heap_priority_queue/easy/last-stone-weight/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Last Stone Weight. 2 | The URL of the problem is [https://leetcode.com/problems/last-stone-weight](https://leetcode.com/problems/last-stone-weight). 3 | -------------------------------------------------------------------------------- /courses/heap_priority_queue/easy/lesson_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::heap_priority_queue::easy", 3 | "dependencies": [], 4 | "course_id": "trane::leetcode::heap_priority_queue", 5 | "name": "Heap / Priority Queue - easy", 6 | "description": null, 7 | "metadata": null, 8 | "lesson_material": null, 9 | "lesson_instructions": null 10 | } 11 | -------------------------------------------------------------------------------- /courses/heap_priority_queue/hard/find-median-from-data-stream/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/heap_priority_queue/hard/find-median-from-data-stream/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::heap_priority_queue::hard::find-median-from-data-stream", 3 | "lesson_id": "trane::leetcode::heap_priority_queue::hard", 4 | "course_id": "trane::leetcode::heap_priority_queue", 5 | "name": "Find Median from Data Stream", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/heap_priority_queue/hard/find-median-from-data-stream/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Find Median from Data Stream. 2 | The URL of the problem is [https://leetcode.com/problems/find-median-from-data-stream](https://leetcode.com/problems/find-median-from-data-stream). 3 | -------------------------------------------------------------------------------- /courses/heap_priority_queue/hard/lesson_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::heap_priority_queue::hard", 3 | "dependencies": [ 4 | "trane::leetcode::heap_priority_queue::medium" 5 | ], 6 | "course_id": "trane::leetcode::heap_priority_queue", 7 | "name": "Heap / Priority Queue - hard", 8 | "description": null, 9 | "metadata": null, 10 | "lesson_material": null, 11 | "lesson_instructions": null 12 | } 13 | -------------------------------------------------------------------------------- /courses/heap_priority_queue/instructions.md: -------------------------------------------------------------------------------- 1 | Make progress in this course by solving the given Leetcode problems. 2 | 3 | What solving a problem means is open-ended. You could code the solution from 4 | scratch every time, or do it only the first time and just review the solution 5 | any subsequent time you are given the problem. 6 | 7 | You can find the video solutions to all the problems on 8 | [neetcode.io](neetcode.io). 9 | -------------------------------------------------------------------------------- /courses/heap_priority_queue/medium/design-twitter/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/heap_priority_queue/medium/design-twitter/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::heap_priority_queue::medium::design-twitter", 3 | "lesson_id": "trane::leetcode::heap_priority_queue::medium", 4 | "course_id": "trane::leetcode::heap_priority_queue", 5 | "name": "Design Twitter", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/heap_priority_queue/medium/design-twitter/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Design Twitter. 2 | The URL of the problem is [https://leetcode.com/problems/design-twitter](https://leetcode.com/problems/design-twitter). 3 | -------------------------------------------------------------------------------- /courses/heap_priority_queue/medium/k-closest-points-to-origin/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/heap_priority_queue/medium/k-closest-points-to-origin/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::heap_priority_queue::medium::k-closest-points-to-origin", 3 | "lesson_id": "trane::leetcode::heap_priority_queue::medium", 4 | "course_id": "trane::leetcode::heap_priority_queue", 5 | "name": "K Closest Points to Origin", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/heap_priority_queue/medium/k-closest-points-to-origin/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem K Closest Points to Origin. 2 | The URL of the problem is [https://leetcode.com/problems/k-closest-points-to-origin](https://leetcode.com/problems/k-closest-points-to-origin). 3 | -------------------------------------------------------------------------------- /courses/heap_priority_queue/medium/kth-largest-element-in-an-array/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/heap_priority_queue/medium/kth-largest-element-in-an-array/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::heap_priority_queue::medium::kth-largest-element-in-an-array", 3 | "lesson_id": "trane::leetcode::heap_priority_queue::medium", 4 | "course_id": "trane::leetcode::heap_priority_queue", 5 | "name": "Kth Largest Element in an Array", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/heap_priority_queue/medium/kth-largest-element-in-an-array/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Kth Largest Element in an Array. 2 | The URL of the problem is [https://leetcode.com/problems/kth-largest-element-in-an-array](https://leetcode.com/problems/kth-largest-element-in-an-array). 3 | -------------------------------------------------------------------------------- /courses/heap_priority_queue/medium/lesson_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::heap_priority_queue::medium", 3 | "dependencies": [ 4 | "trane::leetcode::heap_priority_queue::easy" 5 | ], 6 | "course_id": "trane::leetcode::heap_priority_queue", 7 | "name": "Heap / Priority Queue - medium", 8 | "description": null, 9 | "metadata": null, 10 | "lesson_material": null, 11 | "lesson_instructions": null 12 | } 13 | -------------------------------------------------------------------------------- /courses/heap_priority_queue/medium/task-scheduler/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/heap_priority_queue/medium/task-scheduler/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::heap_priority_queue::medium::task-scheduler", 3 | "lesson_id": "trane::leetcode::heap_priority_queue::medium", 4 | "course_id": "trane::leetcode::heap_priority_queue", 5 | "name": "Task Scheduler", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/heap_priority_queue/medium/task-scheduler/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Task Scheduler. 2 | The URL of the problem is [https://leetcode.com/problems/task-scheduler](https://leetcode.com/problems/task-scheduler). 3 | -------------------------------------------------------------------------------- /courses/intervals/course_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::intervals", 3 | "name": "Intervals", 4 | "dependencies": [], 5 | "description": "Solve Leetcode problems related to the topic Intervals", 6 | "authors": [ 7 | "The Trane Project" 8 | ], 9 | "metadata": { 10 | "leetcode_topic": [ 11 | "Intervals" 12 | ] 13 | }, 14 | "course_material": null, 15 | "course_instructions": { 16 | "MarkdownAsset": { 17 | "path": "instructions.md" 18 | } 19 | }, 20 | "generator_config": null 21 | } 22 | -------------------------------------------------------------------------------- /courses/intervals/easy/lesson_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::intervals::easy", 3 | "dependencies": [], 4 | "course_id": "trane::leetcode::intervals", 5 | "name": "Intervals - easy", 6 | "description": null, 7 | "metadata": null, 8 | "lesson_material": null, 9 | "lesson_instructions": null 10 | } 11 | -------------------------------------------------------------------------------- /courses/intervals/easy/meeting-rooms/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/intervals/easy/meeting-rooms/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::intervals::easy::meeting-rooms", 3 | "lesson_id": "trane::leetcode::intervals::easy", 4 | "course_id": "trane::leetcode::intervals", 5 | "name": "Meeting Rooms", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/intervals/easy/meeting-rooms/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Meeting Rooms. 2 | The URL of the problem is [https://leetcode.com/problems/meeting-rooms](https://leetcode.com/problems/meeting-rooms). 3 | -------------------------------------------------------------------------------- /courses/intervals/hard/lesson_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::intervals::hard", 3 | "dependencies": [ 4 | "trane::leetcode::intervals::medium" 5 | ], 6 | "course_id": "trane::leetcode::intervals", 7 | "name": "Intervals - hard", 8 | "description": null, 9 | "metadata": null, 10 | "lesson_material": null, 11 | "lesson_instructions": null 12 | } 13 | -------------------------------------------------------------------------------- /courses/intervals/hard/minimum-interval-to-include-each-query/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/intervals/hard/minimum-interval-to-include-each-query/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::intervals::hard::minimum-interval-to-include-each-query", 3 | "lesson_id": "trane::leetcode::intervals::hard", 4 | "course_id": "trane::leetcode::intervals", 5 | "name": "Minimum Interval to Include Each Query", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/intervals/hard/minimum-interval-to-include-each-query/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Minimum Interval to Include Each Query. 2 | The URL of the problem is [https://leetcode.com/problems/minimum-interval-to-include-each-query](https://leetcode.com/problems/minimum-interval-to-include-each-query). 3 | -------------------------------------------------------------------------------- /courses/intervals/instructions.md: -------------------------------------------------------------------------------- 1 | Make progress in this course by solving the given Leetcode problems. 2 | 3 | What solving a problem means is open-ended. You could code the solution from 4 | scratch every time, or do it only the first time and just review the solution 5 | any subsequent time you are given the problem. 6 | 7 | You can find the video solutions to all the problems on 8 | [neetcode.io](neetcode.io). 9 | -------------------------------------------------------------------------------- /courses/intervals/medium/insert-interval/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/intervals/medium/insert-interval/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::intervals::medium::insert-interval", 3 | "lesson_id": "trane::leetcode::intervals::medium", 4 | "course_id": "trane::leetcode::intervals", 5 | "name": "Insert Interval", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/intervals/medium/insert-interval/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Insert Interval. 2 | The URL of the problem is [https://leetcode.com/problems/insert-interval](https://leetcode.com/problems/insert-interval). 3 | -------------------------------------------------------------------------------- /courses/intervals/medium/lesson_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::intervals::medium", 3 | "dependencies": [ 4 | "trane::leetcode::intervals::easy" 5 | ], 6 | "course_id": "trane::leetcode::intervals", 7 | "name": "Intervals - medium", 8 | "description": null, 9 | "metadata": null, 10 | "lesson_material": null, 11 | "lesson_instructions": null 12 | } 13 | -------------------------------------------------------------------------------- /courses/intervals/medium/meeting-rooms-ii/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/intervals/medium/meeting-rooms-ii/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::intervals::medium::meeting-rooms-ii", 3 | "lesson_id": "trane::leetcode::intervals::medium", 4 | "course_id": "trane::leetcode::intervals", 5 | "name": "Meeting Rooms II", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/intervals/medium/meeting-rooms-ii/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Meeting Rooms II. 2 | The URL of the problem is [https://leetcode.com/problems/meeting-rooms-ii](https://leetcode.com/problems/meeting-rooms-ii). 3 | -------------------------------------------------------------------------------- /courses/intervals/medium/merge-intervals/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/intervals/medium/merge-intervals/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::intervals::medium::merge-intervals", 3 | "lesson_id": "trane::leetcode::intervals::medium", 4 | "course_id": "trane::leetcode::intervals", 5 | "name": "Merge Intervals", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/intervals/medium/merge-intervals/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Merge Intervals. 2 | The URL of the problem is [https://leetcode.com/problems/merge-intervals](https://leetcode.com/problems/merge-intervals). 3 | -------------------------------------------------------------------------------- /courses/intervals/medium/non-overlapping-intervals/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/intervals/medium/non-overlapping-intervals/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::intervals::medium::non-overlapping-intervals", 3 | "lesson_id": "trane::leetcode::intervals::medium", 4 | "course_id": "trane::leetcode::intervals", 5 | "name": "Non-overlapping Intervals", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/intervals/medium/non-overlapping-intervals/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Non-overlapping Intervals. 2 | The URL of the problem is [https://leetcode.com/problems/non-overlapping-intervals](https://leetcode.com/problems/non-overlapping-intervals). 3 | -------------------------------------------------------------------------------- /courses/linked_list/course_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::linked_list", 3 | "name": "Linked List", 4 | "dependencies": [], 5 | "description": "Solve Leetcode problems related to the topic Linked List", 6 | "authors": [ 7 | "The Trane Project" 8 | ], 9 | "metadata": { 10 | "leetcode_topic": [ 11 | "Linked List" 12 | ] 13 | }, 14 | "course_material": null, 15 | "course_instructions": { 16 | "MarkdownAsset": { 17 | "path": "instructions.md" 18 | } 19 | }, 20 | "generator_config": null 21 | } 22 | -------------------------------------------------------------------------------- /courses/linked_list/easy/lesson_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::linked_list::easy", 3 | "dependencies": [], 4 | "course_id": "trane::leetcode::linked_list", 5 | "name": "Linked List - easy", 6 | "description": null, 7 | "metadata": null, 8 | "lesson_material": null, 9 | "lesson_instructions": null 10 | } 11 | -------------------------------------------------------------------------------- /courses/linked_list/easy/linked-list-cycle/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/linked_list/easy/linked-list-cycle/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::linked_list::easy::linked-list-cycle", 3 | "lesson_id": "trane::leetcode::linked_list::easy", 4 | "course_id": "trane::leetcode::linked_list", 5 | "name": "Linked List Cycle", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/linked_list/easy/linked-list-cycle/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Linked List Cycle. 2 | The URL of the problem is [https://leetcode.com/problems/linked-list-cycle](https://leetcode.com/problems/linked-list-cycle). 3 | -------------------------------------------------------------------------------- /courses/linked_list/easy/merge-two-sorted-lists/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/linked_list/easy/merge-two-sorted-lists/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::linked_list::easy::merge-two-sorted-lists", 3 | "lesson_id": "trane::leetcode::linked_list::easy", 4 | "course_id": "trane::leetcode::linked_list", 5 | "name": "Merge Two Sorted Lists", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/linked_list/easy/merge-two-sorted-lists/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Merge Two Sorted Lists. 2 | The URL of the problem is [https://leetcode.com/problems/merge-two-sorted-lists](https://leetcode.com/problems/merge-two-sorted-lists). 3 | -------------------------------------------------------------------------------- /courses/linked_list/easy/reverse-linked-list/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/linked_list/easy/reverse-linked-list/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::linked_list::easy::reverse-linked-list", 3 | "lesson_id": "trane::leetcode::linked_list::easy", 4 | "course_id": "trane::leetcode::linked_list", 5 | "name": "Reverse Linked List", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/linked_list/easy/reverse-linked-list/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Reverse Linked List. 2 | The URL of the problem is [https://leetcode.com/problems/reverse-linked-list](https://leetcode.com/problems/reverse-linked-list). 3 | -------------------------------------------------------------------------------- /courses/linked_list/hard/lesson_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::linked_list::hard", 3 | "dependencies": [ 4 | "trane::leetcode::linked_list::medium" 5 | ], 6 | "course_id": "trane::leetcode::linked_list", 7 | "name": "Linked List - hard", 8 | "description": null, 9 | "metadata": null, 10 | "lesson_material": null, 11 | "lesson_instructions": null 12 | } 13 | -------------------------------------------------------------------------------- /courses/linked_list/hard/merge-k-sorted-lists/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/linked_list/hard/merge-k-sorted-lists/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::linked_list::hard::merge-k-sorted-lists", 3 | "lesson_id": "trane::leetcode::linked_list::hard", 4 | "course_id": "trane::leetcode::linked_list", 5 | "name": "Merge k Sorted Lists", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/linked_list/hard/merge-k-sorted-lists/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Merge k Sorted Lists. 2 | The URL of the problem is [https://leetcode.com/problems/merge-k-sorted-lists](https://leetcode.com/problems/merge-k-sorted-lists). 3 | -------------------------------------------------------------------------------- /courses/linked_list/hard/reverse-node-in-k-group/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/linked_list/hard/reverse-node-in-k-group/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::linked_list::hard::reverse-node-in-k-group", 3 | "lesson_id": "trane::leetcode::linked_list::hard", 4 | "course_id": "trane::leetcode::linked_list", 5 | "name": "Reverse Node in k Group", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/linked_list/hard/reverse-node-in-k-group/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Reverse Node in k Group. 2 | The URL of the problem is [https://leetcode.com/problems/reverse-node-in-k-group](https://leetcode.com/problems/reverse-node-in-k-group). 3 | -------------------------------------------------------------------------------- /courses/linked_list/instructions.md: -------------------------------------------------------------------------------- 1 | Make progress in this course by solving the given Leetcode problems. 2 | 3 | What solving a problem means is open-ended. You could code the solution from 4 | scratch every time, or do it only the first time and just review the solution 5 | any subsequent time you are given the problem. 6 | 7 | You can find the video solutions to all the problems on 8 | [neetcode.io](neetcode.io). 9 | -------------------------------------------------------------------------------- /courses/linked_list/medium/add-two-numbers/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/linked_list/medium/add-two-numbers/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::linked_list::medium::add-two-numbers", 3 | "lesson_id": "trane::leetcode::linked_list::medium", 4 | "course_id": "trane::leetcode::linked_list", 5 | "name": "Add Two Numbers", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/linked_list/medium/add-two-numbers/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Add Two Numbers. 2 | The URL of the problem is [https://leetcode.com/problems/add-two-numbers](https://leetcode.com/problems/add-two-numbers). 3 | -------------------------------------------------------------------------------- /courses/linked_list/medium/copy-list-with-random-pointer/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/linked_list/medium/copy-list-with-random-pointer/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::linked_list::medium::copy-list-with-random-pointer", 3 | "lesson_id": "trane::leetcode::linked_list::medium", 4 | "course_id": "trane::leetcode::linked_list", 5 | "name": "Copy List with Random Pointer", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/linked_list/medium/copy-list-with-random-pointer/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Copy List with Random Pointer. 2 | The URL of the problem is [https://leetcode.com/problems/copy-list-with-random-pointer](https://leetcode.com/problems/copy-list-with-random-pointer). 3 | -------------------------------------------------------------------------------- /courses/linked_list/medium/find-the-duplicate-number/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/linked_list/medium/find-the-duplicate-number/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::linked_list::medium::find-the-duplicate-number", 3 | "lesson_id": "trane::leetcode::linked_list::medium", 4 | "course_id": "trane::leetcode::linked_list", 5 | "name": "Find the Duplicate Number", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/linked_list/medium/find-the-duplicate-number/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Find the Duplicate Number. 2 | The URL of the problem is [https://leetcode.com/problems/find-the-duplicate-number](https://leetcode.com/problems/find-the-duplicate-number). 3 | -------------------------------------------------------------------------------- /courses/linked_list/medium/lesson_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::linked_list::medium", 3 | "dependencies": [ 4 | "trane::leetcode::linked_list::easy" 5 | ], 6 | "course_id": "trane::leetcode::linked_list", 7 | "name": "Linked List - medium", 8 | "description": null, 9 | "metadata": null, 10 | "lesson_material": null, 11 | "lesson_instructions": null 12 | } 13 | -------------------------------------------------------------------------------- /courses/linked_list/medium/lru-cache/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/linked_list/medium/lru-cache/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::linked_list::medium::lru-cache", 3 | "lesson_id": "trane::leetcode::linked_list::medium", 4 | "course_id": "trane::leetcode::linked_list", 5 | "name": "LRU Cache", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/linked_list/medium/lru-cache/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem LRU Cache. 2 | The URL of the problem is [https://leetcode.com/problems/lru-cache](https://leetcode.com/problems/lru-cache). 3 | -------------------------------------------------------------------------------- /courses/linked_list/medium/remove-nth-node-from-end-of-list/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/linked_list/medium/remove-nth-node-from-end-of-list/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::linked_list::medium::remove-nth-node-from-end-of-list", 3 | "lesson_id": "trane::leetcode::linked_list::medium", 4 | "course_id": "trane::leetcode::linked_list", 5 | "name": "Remove Nth Node From End of List", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/linked_list/medium/remove-nth-node-from-end-of-list/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Remove Nth Node From End of List. 2 | The URL of the problem is [https://leetcode.com/problems/remove-nth-node-from-end-of-list](https://leetcode.com/problems/remove-nth-node-from-end-of-list). 3 | -------------------------------------------------------------------------------- /courses/linked_list/medium/reorder-list/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/linked_list/medium/reorder-list/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::linked_list::medium::reorder-list", 3 | "lesson_id": "trane::leetcode::linked_list::medium", 4 | "course_id": "trane::leetcode::linked_list", 5 | "name": "Reorder List", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/linked_list/medium/reorder-list/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Reorder List. 2 | The URL of the problem is [https://leetcode.com/problems/reorder-list](https://leetcode.com/problems/reorder-list). 3 | -------------------------------------------------------------------------------- /courses/math_and_geometry/easy/happy-number/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/math_and_geometry/easy/happy-number/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::math_and_geometry::easy::happy-number", 3 | "lesson_id": "trane::leetcode::math_and_geometry::easy", 4 | "course_id": "trane::leetcode::math_and_geometry", 5 | "name": "Happy Number", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/math_and_geometry/easy/happy-number/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Happy Number. 2 | The URL of the problem is [https://leetcode.com/problems/happy-number](https://leetcode.com/problems/happy-number). 3 | -------------------------------------------------------------------------------- /courses/math_and_geometry/easy/lesson_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::math_and_geometry::easy", 3 | "dependencies": [], 4 | "course_id": "trane::leetcode::math_and_geometry", 5 | "name": "Math & Geometry - easy", 6 | "description": null, 7 | "metadata": null, 8 | "lesson_material": null, 9 | "lesson_instructions": null 10 | } 11 | -------------------------------------------------------------------------------- /courses/math_and_geometry/easy/plus-one/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/math_and_geometry/easy/plus-one/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::math_and_geometry::easy::plus-one", 3 | "lesson_id": "trane::leetcode::math_and_geometry::easy", 4 | "course_id": "trane::leetcode::math_and_geometry", 5 | "name": "Plus One", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/math_and_geometry/easy/plus-one/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Plus One. 2 | The URL of the problem is [https://leetcode.com/problems/plus-one](https://leetcode.com/problems/plus-one). 3 | -------------------------------------------------------------------------------- /courses/math_and_geometry/instructions.md: -------------------------------------------------------------------------------- 1 | Make progress in this course by solving the given Leetcode problems. 2 | 3 | What solving a problem means is open-ended. You could code the solution from 4 | scratch every time, or do it only the first time and just review the solution 5 | any subsequent time you are given the problem. 6 | 7 | You can find the video solutions to all the problems on 8 | [neetcode.io](neetcode.io). 9 | -------------------------------------------------------------------------------- /courses/math_and_geometry/medium/detect-squares/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/math_and_geometry/medium/detect-squares/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::math_and_geometry::medium::detect-squares", 3 | "lesson_id": "trane::leetcode::math_and_geometry::medium", 4 | "course_id": "trane::leetcode::math_and_geometry", 5 | "name": "Detect Squares", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/math_and_geometry/medium/detect-squares/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Detect Squares. 2 | The URL of the problem is [https://leetcode.com/problems/detect-squares](https://leetcode.com/problems/detect-squares). 3 | -------------------------------------------------------------------------------- /courses/math_and_geometry/medium/lesson_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::math_and_geometry::medium", 3 | "dependencies": [ 4 | "trane::leetcode::math_and_geometry::easy" 5 | ], 6 | "course_id": "trane::leetcode::math_and_geometry", 7 | "name": "Math & Geometry - medium", 8 | "description": null, 9 | "metadata": null, 10 | "lesson_material": null, 11 | "lesson_instructions": null 12 | } 13 | -------------------------------------------------------------------------------- /courses/math_and_geometry/medium/multiply-strings/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/math_and_geometry/medium/multiply-strings/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::math_and_geometry::medium::multiply-strings", 3 | "lesson_id": "trane::leetcode::math_and_geometry::medium", 4 | "course_id": "trane::leetcode::math_and_geometry", 5 | "name": "Multiply Strings", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/math_and_geometry/medium/multiply-strings/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Multiply Strings. 2 | The URL of the problem is [https://leetcode.com/problems/multiply-strings](https://leetcode.com/problems/multiply-strings). 3 | -------------------------------------------------------------------------------- /courses/math_and_geometry/medium/powx-n/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/math_and_geometry/medium/powx-n/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::math_and_geometry::medium::powx-n", 3 | "lesson_id": "trane::leetcode::math_and_geometry::medium", 4 | "course_id": "trane::leetcode::math_and_geometry", 5 | "name": "Pow(x, n)", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/math_and_geometry/medium/powx-n/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Pow(x, n). 2 | The URL of the problem is [https://leetcode.com/problems/powx-n](https://leetcode.com/problems/powx-n). 3 | -------------------------------------------------------------------------------- /courses/math_and_geometry/medium/rotate-image/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/math_and_geometry/medium/rotate-image/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::math_and_geometry::medium::rotate-image", 3 | "lesson_id": "trane::leetcode::math_and_geometry::medium", 4 | "course_id": "trane::leetcode::math_and_geometry", 5 | "name": "Rotate Image", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/math_and_geometry/medium/rotate-image/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Rotate Image. 2 | The URL of the problem is [https://leetcode.com/problems/rotate-image](https://leetcode.com/problems/rotate-image). 3 | -------------------------------------------------------------------------------- /courses/math_and_geometry/medium/set-matrix-zeroes/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/math_and_geometry/medium/set-matrix-zeroes/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::math_and_geometry::medium::set-matrix-zeroes", 3 | "lesson_id": "trane::leetcode::math_and_geometry::medium", 4 | "course_id": "trane::leetcode::math_and_geometry", 5 | "name": "Set Matrix Zeroes", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/math_and_geometry/medium/set-matrix-zeroes/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Set Matrix Zeroes. 2 | The URL of the problem is [https://leetcode.com/problems/set-matrix-zeroes](https://leetcode.com/problems/set-matrix-zeroes). 3 | -------------------------------------------------------------------------------- /courses/math_and_geometry/medium/spiral-matrix/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/math_and_geometry/medium/spiral-matrix/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::math_and_geometry::medium::spiral-matrix", 3 | "lesson_id": "trane::leetcode::math_and_geometry::medium", 4 | "course_id": "trane::leetcode::math_and_geometry", 5 | "name": "Spiral Matrix", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/math_and_geometry/medium/spiral-matrix/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Spiral Matrix. 2 | The URL of the problem is [https://leetcode.com/problems/spiral-matrix](https://leetcode.com/problems/spiral-matrix). 3 | -------------------------------------------------------------------------------- /courses/one_d_dynamic_programming/easy/Min Cost Climbing Stairs/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/one_d_dynamic_programming/easy/Min Cost Climbing Stairs/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::one_d_dynamic_programming::easy::Min Cost Climbing Stairs", 3 | "lesson_id": "trane::leetcode::one_d_dynamic_programming::easy", 4 | "course_id": "trane::leetcode::one_d_dynamic_programming", 5 | "name": "Min Cost Climbing Stairs", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/one_d_dynamic_programming/easy/Min Cost Climbing Stairs/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Min Cost Climbing Stairs. 2 | The URL of the problem is [https://leetcode.com/problems/Min Cost Climbing Stairs](https://leetcode.com/problems/Min Cost Climbing Stairs). 3 | -------------------------------------------------------------------------------- /courses/one_d_dynamic_programming/easy/climbing-stairs/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/one_d_dynamic_programming/easy/climbing-stairs/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::one_d_dynamic_programming::easy::climbing-stairs", 3 | "lesson_id": "trane::leetcode::one_d_dynamic_programming::easy", 4 | "course_id": "trane::leetcode::one_d_dynamic_programming", 5 | "name": "Climbing Stairs", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/one_d_dynamic_programming/easy/climbing-stairs/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Climbing Stairs. 2 | The URL of the problem is [https://leetcode.com/problems/climbing-stairs](https://leetcode.com/problems/climbing-stairs). 3 | -------------------------------------------------------------------------------- /courses/one_d_dynamic_programming/easy/lesson_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::one_d_dynamic_programming::easy", 3 | "dependencies": [], 4 | "course_id": "trane::leetcode::one_d_dynamic_programming", 5 | "name": "1-D Dynamic Programming - easy", 6 | "description": null, 7 | "metadata": null, 8 | "lesson_material": null, 9 | "lesson_instructions": null 10 | } 11 | -------------------------------------------------------------------------------- /courses/one_d_dynamic_programming/instructions.md: -------------------------------------------------------------------------------- 1 | Make progress in this course by solving the given Leetcode problems. 2 | 3 | What solving a problem means is open-ended. You could code the solution from 4 | scratch every time, or do it only the first time and just review the solution 5 | any subsequent time you are given the problem. 6 | 7 | You can find the video solutions to all the problems on 8 | [neetcode.io](neetcode.io). 9 | -------------------------------------------------------------------------------- /courses/one_d_dynamic_programming/medium/coin-change/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/one_d_dynamic_programming/medium/coin-change/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::one_d_dynamic_programming::medium::coin-change", 3 | "lesson_id": "trane::leetcode::one_d_dynamic_programming::medium", 4 | "course_id": "trane::leetcode::one_d_dynamic_programming", 5 | "name": "Coin Change", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/one_d_dynamic_programming/medium/coin-change/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Coin Change. 2 | The URL of the problem is [https://leetcode.com/problems/coin-change](https://leetcode.com/problems/coin-change). 3 | -------------------------------------------------------------------------------- /courses/one_d_dynamic_programming/medium/decode-ways/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/one_d_dynamic_programming/medium/decode-ways/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::one_d_dynamic_programming::medium::decode-ways", 3 | "lesson_id": "trane::leetcode::one_d_dynamic_programming::medium", 4 | "course_id": "trane::leetcode::one_d_dynamic_programming", 5 | "name": "Decode Ways", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/one_d_dynamic_programming/medium/decode-ways/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Decode Ways. 2 | The URL of the problem is [https://leetcode.com/problems/decode-ways](https://leetcode.com/problems/decode-ways). 3 | -------------------------------------------------------------------------------- /courses/one_d_dynamic_programming/medium/house-robber-ii/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/one_d_dynamic_programming/medium/house-robber-ii/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::one_d_dynamic_programming::medium::house-robber-ii", 3 | "lesson_id": "trane::leetcode::one_d_dynamic_programming::medium", 4 | "course_id": "trane::leetcode::one_d_dynamic_programming", 5 | "name": "House Robber II", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/one_d_dynamic_programming/medium/house-robber-ii/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem House Robber II. 2 | The URL of the problem is [https://leetcode.com/problems/house-robber-ii](https://leetcode.com/problems/house-robber-ii). 3 | -------------------------------------------------------------------------------- /courses/one_d_dynamic_programming/medium/house-robber/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/one_d_dynamic_programming/medium/house-robber/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::one_d_dynamic_programming::medium::house-robber", 3 | "lesson_id": "trane::leetcode::one_d_dynamic_programming::medium", 4 | "course_id": "trane::leetcode::one_d_dynamic_programming", 5 | "name": "House Robber", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/one_d_dynamic_programming/medium/house-robber/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem House Robber. 2 | The URL of the problem is [https://leetcode.com/problems/house-robber](https://leetcode.com/problems/house-robber). 3 | -------------------------------------------------------------------------------- /courses/one_d_dynamic_programming/medium/lesson_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::one_d_dynamic_programming::medium", 3 | "dependencies": [ 4 | "trane::leetcode::one_d_dynamic_programming::easy" 5 | ], 6 | "course_id": "trane::leetcode::one_d_dynamic_programming", 7 | "name": "1-D Dynamic Programming - medium", 8 | "description": null, 9 | "metadata": null, 10 | "lesson_material": null, 11 | "lesson_instructions": null 12 | } 13 | -------------------------------------------------------------------------------- /courses/one_d_dynamic_programming/medium/longest-increasing-subsequence/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/one_d_dynamic_programming/medium/longest-increasing-subsequence/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Longest Increasing Subsequence. 2 | The URL of the problem is [https://leetcode.com/problems/longest-increasing-subsequence](https://leetcode.com/problems/longest-increasing-subsequence). 3 | -------------------------------------------------------------------------------- /courses/one_d_dynamic_programming/medium/longest-palindrome-substring/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/one_d_dynamic_programming/medium/longest-palindrome-substring/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Longest Palindrome Substring. 2 | The URL of the problem is [https://leetcode.com/problems/longest-palindrome-substring](https://leetcode.com/problems/longest-palindrome-substring). 3 | -------------------------------------------------------------------------------- /courses/one_d_dynamic_programming/medium/maximum-product-subarray/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/one_d_dynamic_programming/medium/maximum-product-subarray/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::one_d_dynamic_programming::medium::maximum-product-subarray", 3 | "lesson_id": "trane::leetcode::one_d_dynamic_programming::medium", 4 | "course_id": "trane::leetcode::one_d_dynamic_programming", 5 | "name": "Maximum Product Subarray", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/one_d_dynamic_programming/medium/maximum-product-subarray/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Maximum Product Subarray. 2 | The URL of the problem is [https://leetcode.com/problems/maximum-product-subarray](https://leetcode.com/problems/maximum-product-subarray). 3 | -------------------------------------------------------------------------------- /courses/one_d_dynamic_programming/medium/palindromic-substrings/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/one_d_dynamic_programming/medium/palindromic-substrings/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::one_d_dynamic_programming::medium::palindromic-substrings", 3 | "lesson_id": "trane::leetcode::one_d_dynamic_programming::medium", 4 | "course_id": "trane::leetcode::one_d_dynamic_programming", 5 | "name": "Palindromic Substrings", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/one_d_dynamic_programming/medium/palindromic-substrings/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Palindromic Substrings. 2 | The URL of the problem is [https://leetcode.com/problems/palindromic-substrings](https://leetcode.com/problems/palindromic-substrings). 3 | -------------------------------------------------------------------------------- /courses/one_d_dynamic_programming/medium/partition-equal-subset-sum/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/one_d_dynamic_programming/medium/partition-equal-subset-sum/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Partition Equal Subset Sum. 2 | The URL of the problem is [https://leetcode.com/problems/partition-equal-subset-sum](https://leetcode.com/problems/partition-equal-subset-sum). 3 | -------------------------------------------------------------------------------- /courses/one_d_dynamic_programming/medium/word-break/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/one_d_dynamic_programming/medium/word-break/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::one_d_dynamic_programming::medium::word-break", 3 | "lesson_id": "trane::leetcode::one_d_dynamic_programming::medium", 4 | "course_id": "trane::leetcode::one_d_dynamic_programming", 5 | "name": "Word Break", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/one_d_dynamic_programming/medium/word-break/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Word Break. 2 | The URL of the problem is [https://leetcode.com/problems/word-break](https://leetcode.com/problems/word-break). 3 | -------------------------------------------------------------------------------- /courses/sliding_window/course_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::sliding_window", 3 | "name": "Sliding Window", 4 | "dependencies": [], 5 | "description": "Solve Leetcode problems related to the topic Sliding Window", 6 | "authors": [ 7 | "The Trane Project" 8 | ], 9 | "metadata": { 10 | "leetcode_topic": [ 11 | "Sliding Window" 12 | ] 13 | }, 14 | "course_material": null, 15 | "course_instructions": { 16 | "MarkdownAsset": { 17 | "path": "instructions.md" 18 | } 19 | }, 20 | "generator_config": null 21 | } 22 | -------------------------------------------------------------------------------- /courses/sliding_window/easy/best-time-to-buy-and-sell-stock/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/sliding_window/easy/best-time-to-buy-and-sell-stock/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::sliding_window::easy::best-time-to-buy-and-sell-stock", 3 | "lesson_id": "trane::leetcode::sliding_window::easy", 4 | "course_id": "trane::leetcode::sliding_window", 5 | "name": "Best Time to Buy and Sell Stock", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/sliding_window/easy/best-time-to-buy-and-sell-stock/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Best Time to Buy and Sell Stock. 2 | The URL of the problem is [https://leetcode.com/problems/best-time-to-buy-and-sell-stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock). 3 | -------------------------------------------------------------------------------- /courses/sliding_window/easy/lesson_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::sliding_window::easy", 3 | "dependencies": [], 4 | "course_id": "trane::leetcode::sliding_window", 5 | "name": "Sliding Window - easy", 6 | "description": null, 7 | "metadata": null, 8 | "lesson_material": null, 9 | "lesson_instructions": null 10 | } 11 | -------------------------------------------------------------------------------- /courses/sliding_window/hard/lesson_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::sliding_window::hard", 3 | "dependencies": [ 4 | "trane::leetcode::sliding_window::medium" 5 | ], 6 | "course_id": "trane::leetcode::sliding_window", 7 | "name": "Sliding Window - hard", 8 | "description": null, 9 | "metadata": null, 10 | "lesson_material": null, 11 | "lesson_instructions": null 12 | } 13 | -------------------------------------------------------------------------------- /courses/sliding_window/hard/minimum-window-substring/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/sliding_window/hard/minimum-window-substring/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::sliding_window::hard::minimum-window-substring", 3 | "lesson_id": "trane::leetcode::sliding_window::hard", 4 | "course_id": "trane::leetcode::sliding_window", 5 | "name": "Minimum Window Substring", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/sliding_window/hard/minimum-window-substring/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Minimum Window Substring. 2 | The URL of the problem is [https://leetcode.com/problems/minimum-window-substring](https://leetcode.com/problems/minimum-window-substring). 3 | -------------------------------------------------------------------------------- /courses/sliding_window/hard/sliding-window-maximum/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/sliding_window/hard/sliding-window-maximum/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::sliding_window::hard::sliding-window-maximum", 3 | "lesson_id": "trane::leetcode::sliding_window::hard", 4 | "course_id": "trane::leetcode::sliding_window", 5 | "name": "Sliding Window Maximum", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/sliding_window/hard/sliding-window-maximum/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Sliding Window Maximum. 2 | The URL of the problem is [https://leetcode.com/problems/sliding-window-maximum](https://leetcode.com/problems/sliding-window-maximum). 3 | -------------------------------------------------------------------------------- /courses/sliding_window/instructions.md: -------------------------------------------------------------------------------- 1 | Make progress in this course by solving the given Leetcode problems. 2 | 3 | What solving a problem means is open-ended. You could code the solution from 4 | scratch every time, or do it only the first time and just review the solution 5 | any subsequent time you are given the problem. 6 | 7 | You can find the video solutions to all the problems on 8 | [neetcode.io](neetcode.io). 9 | -------------------------------------------------------------------------------- /courses/sliding_window/medium/lesson_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::sliding_window::medium", 3 | "dependencies": [ 4 | "trane::leetcode::sliding_window::easy" 5 | ], 6 | "course_id": "trane::leetcode::sliding_window", 7 | "name": "Sliding Window - medium", 8 | "description": null, 9 | "metadata": null, 10 | "lesson_material": null, 11 | "lesson_instructions": null 12 | } 13 | -------------------------------------------------------------------------------- /courses/sliding_window/medium/longest-repeating-character-replacement/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/sliding_window/medium/longest-repeating-character-replacement/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Longest Repeating Character Replacement. 2 | The URL of the problem is [https://leetcode.com/problems/longest-repeating-character-replacement](https://leetcode.com/problems/longest-repeating-character-replacement). 3 | -------------------------------------------------------------------------------- /courses/sliding_window/medium/longest-substring-without-repeating-characters/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/sliding_window/medium/longest-substring-without-repeating-characters/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Longest Substring Without Repeating Characters. 2 | The URL of the problem is [https://leetcode.com/problems/longest-substring-without-repeating-characters](https://leetcode.com/problems/longest-substring-without-repeating-characters). 3 | -------------------------------------------------------------------------------- /courses/sliding_window/medium/permutation-in-string/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/sliding_window/medium/permutation-in-string/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::sliding_window::medium::permutation-in-string", 3 | "lesson_id": "trane::leetcode::sliding_window::medium", 4 | "course_id": "trane::leetcode::sliding_window", 5 | "name": "Permutation in String", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/sliding_window/medium/permutation-in-string/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Permutation in String. 2 | The URL of the problem is [https://leetcode.com/problems/permutation-in-string](https://leetcode.com/problems/permutation-in-string). 3 | -------------------------------------------------------------------------------- /courses/stack/course_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::stack", 3 | "name": "Stack", 4 | "dependencies": [], 5 | "description": "Solve Leetcode problems related to the topic Stack", 6 | "authors": [ 7 | "The Trane Project" 8 | ], 9 | "metadata": { 10 | "leetcode_topic": [ 11 | "Stack" 12 | ] 13 | }, 14 | "course_material": null, 15 | "course_instructions": { 16 | "MarkdownAsset": { 17 | "path": "instructions.md" 18 | } 19 | }, 20 | "generator_config": null 21 | } 22 | -------------------------------------------------------------------------------- /courses/stack/easy/lesson_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::stack::easy", 3 | "dependencies": [], 4 | "course_id": "trane::leetcode::stack", 5 | "name": "Stack - easy", 6 | "description": null, 7 | "metadata": null, 8 | "lesson_material": null, 9 | "lesson_instructions": null 10 | } 11 | -------------------------------------------------------------------------------- /courses/stack/easy/valid-parentheses/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/stack/easy/valid-parentheses/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::stack::easy::valid-parentheses", 3 | "lesson_id": "trane::leetcode::stack::easy", 4 | "course_id": "trane::leetcode::stack", 5 | "name": "Valid Parentheses", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/stack/easy/valid-parentheses/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Valid Parentheses. 2 | The URL of the problem is [https://leetcode.com/problems/valid-parentheses](https://leetcode.com/problems/valid-parentheses). 3 | -------------------------------------------------------------------------------- /courses/stack/hard/lesson_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::stack::hard", 3 | "dependencies": [ 4 | "trane::leetcode::stack::medium" 5 | ], 6 | "course_id": "trane::leetcode::stack", 7 | "name": "Stack - hard", 8 | "description": null, 9 | "metadata": null, 10 | "lesson_material": null, 11 | "lesson_instructions": null 12 | } 13 | -------------------------------------------------------------------------------- /courses/stack/hard/longest-rectangle-in-histogram/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/stack/hard/longest-rectangle-in-histogram/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::stack::hard::longest-rectangle-in-histogram", 3 | "lesson_id": "trane::leetcode::stack::hard", 4 | "course_id": "trane::leetcode::stack", 5 | "name": "Longest Rectangle in Histogram", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/stack/hard/longest-rectangle-in-histogram/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Longest Rectangle in Histogram. 2 | The URL of the problem is [https://leetcode.com/problems/longest-rectangle-in-histogram](https://leetcode.com/problems/longest-rectangle-in-histogram). 3 | -------------------------------------------------------------------------------- /courses/stack/instructions.md: -------------------------------------------------------------------------------- 1 | Make progress in this course by solving the given Leetcode problems. 2 | 3 | What solving a problem means is open-ended. You could code the solution from 4 | scratch every time, or do it only the first time and just review the solution 5 | any subsequent time you are given the problem. 6 | 7 | You can find the video solutions to all the problems on 8 | [neetcode.io](neetcode.io). 9 | -------------------------------------------------------------------------------- /courses/stack/medium/car-fleet/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/stack/medium/car-fleet/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::stack::medium::car-fleet", 3 | "lesson_id": "trane::leetcode::stack::medium", 4 | "course_id": "trane::leetcode::stack", 5 | "name": "Car Fleet", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/stack/medium/car-fleet/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Car Fleet. 2 | The URL of the problem is [https://leetcode.com/problems/car-fleet](https://leetcode.com/problems/car-fleet). 3 | -------------------------------------------------------------------------------- /courses/stack/medium/daily-temperatures/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/stack/medium/daily-temperatures/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::stack::medium::daily-temperatures", 3 | "lesson_id": "trane::leetcode::stack::medium", 4 | "course_id": "trane::leetcode::stack", 5 | "name": "Daily Temperatures", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/stack/medium/daily-temperatures/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Daily Temperatures. 2 | The URL of the problem is [https://leetcode.com/problems/daily-temperatures](https://leetcode.com/problems/daily-temperatures). 3 | -------------------------------------------------------------------------------- /courses/stack/medium/evaluate-reverse-polish-notation/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/stack/medium/evaluate-reverse-polish-notation/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::stack::medium::evaluate-reverse-polish-notation", 3 | "lesson_id": "trane::leetcode::stack::medium", 4 | "course_id": "trane::leetcode::stack", 5 | "name": "Evaluate Reverse Polish Notation", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/stack/medium/evaluate-reverse-polish-notation/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Evaluate Reverse Polish Notation. 2 | The URL of the problem is [https://leetcode.com/problems/evaluate-reverse-polish-notation](https://leetcode.com/problems/evaluate-reverse-polish-notation). 3 | -------------------------------------------------------------------------------- /courses/stack/medium/generate-parentheses/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/stack/medium/generate-parentheses/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::stack::medium::generate-parentheses", 3 | "lesson_id": "trane::leetcode::stack::medium", 4 | "course_id": "trane::leetcode::stack", 5 | "name": "Generate Parentheses", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/stack/medium/generate-parentheses/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Generate Parentheses. 2 | The URL of the problem is [https://leetcode.com/problems/generate-parentheses](https://leetcode.com/problems/generate-parentheses). 3 | -------------------------------------------------------------------------------- /courses/stack/medium/lesson_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::stack::medium", 3 | "dependencies": [ 4 | "trane::leetcode::stack::easy" 5 | ], 6 | "course_id": "trane::leetcode::stack", 7 | "name": "Stack - medium", 8 | "description": null, 9 | "metadata": null, 10 | "lesson_material": null, 11 | "lesson_instructions": null 12 | } 13 | -------------------------------------------------------------------------------- /courses/stack/medium/min-stack/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/stack/medium/min-stack/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::stack::medium::min-stack", 3 | "lesson_id": "trane::leetcode::stack::medium", 4 | "course_id": "trane::leetcode::stack", 5 | "name": "Min Stack", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/stack/medium/min-stack/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Min Stack. 2 | The URL of the problem is [https://leetcode.com/problems/min-stack](https://leetcode.com/problems/min-stack). 3 | -------------------------------------------------------------------------------- /courses/trees/course_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::trees", 3 | "name": "Trees", 4 | "dependencies": [], 5 | "description": "Solve Leetcode problems related to the topic Trees", 6 | "authors": [ 7 | "The Trane Project" 8 | ], 9 | "metadata": { 10 | "leetcode_topic": [ 11 | "Trees" 12 | ] 13 | }, 14 | "course_material": null, 15 | "course_instructions": { 16 | "MarkdownAsset": { 17 | "path": "instructions.md" 18 | } 19 | }, 20 | "generator_config": null 21 | } 22 | -------------------------------------------------------------------------------- /courses/trees/easy/balanced-binary-tree/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/trees/easy/balanced-binary-tree/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::trees::easy::balanced-binary-tree", 3 | "lesson_id": "trane::leetcode::trees::easy", 4 | "course_id": "trane::leetcode::trees", 5 | "name": "Balanced Binary Tree", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/trees/easy/balanced-binary-tree/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Balanced Binary Tree. 2 | The URL of the problem is [https://leetcode.com/problems/balanced-binary-tree](https://leetcode.com/problems/balanced-binary-tree). 3 | -------------------------------------------------------------------------------- /courses/trees/easy/diameter-of-binary-tree/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/trees/easy/diameter-of-binary-tree/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::trees::easy::diameter-of-binary-tree", 3 | "lesson_id": "trane::leetcode::trees::easy", 4 | "course_id": "trane::leetcode::trees", 5 | "name": "Diameter of Binary Tree", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/trees/easy/diameter-of-binary-tree/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Diameter of Binary Tree. 2 | The URL of the problem is [https://leetcode.com/problems/diameter-of-binary-tree](https://leetcode.com/problems/diameter-of-binary-tree). 3 | -------------------------------------------------------------------------------- /courses/trees/easy/invert-binary-tree/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/trees/easy/invert-binary-tree/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::trees::easy::invert-binary-tree", 3 | "lesson_id": "trane::leetcode::trees::easy", 4 | "course_id": "trane::leetcode::trees", 5 | "name": "Invert Binary Tree", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/trees/easy/invert-binary-tree/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Invert Binary Tree. 2 | The URL of the problem is [https://leetcode.com/problems/invert-binary-tree](https://leetcode.com/problems/invert-binary-tree). 3 | -------------------------------------------------------------------------------- /courses/trees/easy/lesson_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::trees::easy", 3 | "dependencies": [], 4 | "course_id": "trane::leetcode::trees", 5 | "name": "Trees - easy", 6 | "description": null, 7 | "metadata": null, 8 | "lesson_material": null, 9 | "lesson_instructions": null 10 | } 11 | -------------------------------------------------------------------------------- /courses/trees/easy/lowest-common-ancestor-of-a-binary-search-tree/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/trees/easy/lowest-common-ancestor-of-a-binary-search-tree/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::trees::easy::lowest-common-ancestor-of-a-binary-search-tree", 3 | "lesson_id": "trane::leetcode::trees::easy", 4 | "course_id": "trane::leetcode::trees", 5 | "name": "Lowest Common Ancestor of a Binary Search Tree", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/trees/easy/lowest-common-ancestor-of-a-binary-search-tree/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Lowest Common Ancestor of a Binary Search Tree. 2 | The URL of the problem is [https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree). 3 | -------------------------------------------------------------------------------- /courses/trees/easy/maximum-depth-of-binary-tree/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/trees/easy/maximum-depth-of-binary-tree/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::trees::easy::maximum-depth-of-binary-tree", 3 | "lesson_id": "trane::leetcode::trees::easy", 4 | "course_id": "trane::leetcode::trees", 5 | "name": "Maximum Depth of Binary Tree", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/trees/easy/maximum-depth-of-binary-tree/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Maximum Depth of Binary Tree. 2 | The URL of the problem is [https://leetcode.com/problems/maximum-depth-of-binary-tree](https://leetcode.com/problems/maximum-depth-of-binary-tree). 3 | -------------------------------------------------------------------------------- /courses/trees/easy/same-tree/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/trees/easy/same-tree/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::trees::easy::same-tree", 3 | "lesson_id": "trane::leetcode::trees::easy", 4 | "course_id": "trane::leetcode::trees", 5 | "name": "Same Tree", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/trees/easy/same-tree/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Same Tree. 2 | The URL of the problem is [https://leetcode.com/problems/same-tree](https://leetcode.com/problems/same-tree). 3 | -------------------------------------------------------------------------------- /courses/trees/easy/subtree-of-another-tree/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/trees/easy/subtree-of-another-tree/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::trees::easy::subtree-of-another-tree", 3 | "lesson_id": "trane::leetcode::trees::easy", 4 | "course_id": "trane::leetcode::trees", 5 | "name": "Subtree of Another Tree", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/trees/easy/subtree-of-another-tree/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Subtree of Another Tree. 2 | The URL of the problem is [https://leetcode.com/problems/subtree-of-another-tree](https://leetcode.com/problems/subtree-of-another-tree). 3 | -------------------------------------------------------------------------------- /courses/trees/hard/binary-tree-max-path-sum/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/trees/hard/binary-tree-max-path-sum/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::trees::hard::binary-tree-max-path-sum", 3 | "lesson_id": "trane::leetcode::trees::hard", 4 | "course_id": "trane::leetcode::trees", 5 | "name": "Binary Tree Max Path Sum", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/trees/hard/binary-tree-max-path-sum/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Binary Tree Max Path Sum. 2 | The URL of the problem is [https://leetcode.com/problems/binary-tree-max-path-sum](https://leetcode.com/problems/binary-tree-max-path-sum). 3 | -------------------------------------------------------------------------------- /courses/trees/hard/lesson_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::trees::hard", 3 | "dependencies": [ 4 | "trane::leetcode::trees::medium" 5 | ], 6 | "course_id": "trane::leetcode::trees", 7 | "name": "Trees - hard", 8 | "description": null, 9 | "metadata": null, 10 | "lesson_material": null, 11 | "lesson_instructions": null 12 | } 13 | -------------------------------------------------------------------------------- /courses/trees/hard/serialize-and-deserialize-binary-tree/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/trees/hard/serialize-and-deserialize-binary-tree/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::trees::hard::serialize-and-deserialize-binary-tree", 3 | "lesson_id": "trane::leetcode::trees::hard", 4 | "course_id": "trane::leetcode::trees", 5 | "name": "Serialize and Deserialize Binary Tree", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/trees/hard/serialize-and-deserialize-binary-tree/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Serialize and Deserialize Binary Tree. 2 | The URL of the problem is [https://leetcode.com/problems/serialize-and-deserialize-binary-tree](https://leetcode.com/problems/serialize-and-deserialize-binary-tree). 3 | -------------------------------------------------------------------------------- /courses/trees/instructions.md: -------------------------------------------------------------------------------- 1 | Make progress in this course by solving the given Leetcode problems. 2 | 3 | What solving a problem means is open-ended. You could code the solution from 4 | scratch every time, or do it only the first time and just review the solution 5 | any subsequent time you are given the problem. 6 | 7 | You can find the video solutions to all the problems on 8 | [neetcode.io](neetcode.io). 9 | -------------------------------------------------------------------------------- /courses/trees/medium/binary-tree-level-order-traversal/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/trees/medium/binary-tree-level-order-traversal/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::trees::medium::binary-tree-level-order-traversal", 3 | "lesson_id": "trane::leetcode::trees::medium", 4 | "course_id": "trane::leetcode::trees", 5 | "name": "Binary Tree Level Order Traversal", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/trees/medium/binary-tree-level-order-traversal/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Binary Tree Level Order Traversal. 2 | The URL of the problem is [https://leetcode.com/problems/binary-tree-level-order-traversal](https://leetcode.com/problems/binary-tree-level-order-traversal). 3 | -------------------------------------------------------------------------------- /courses/trees/medium/binary-tree-right-side-view/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/trees/medium/binary-tree-right-side-view/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::trees::medium::binary-tree-right-side-view", 3 | "lesson_id": "trane::leetcode::trees::medium", 4 | "course_id": "trane::leetcode::trees", 5 | "name": "Binary Tree Right Side View", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/trees/medium/binary-tree-right-side-view/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Binary Tree Right Side View. 2 | The URL of the problem is [https://leetcode.com/problems/binary-tree-right-side-view](https://leetcode.com/problems/binary-tree-right-side-view). 3 | -------------------------------------------------------------------------------- /courses/trees/medium/construct-tree-from-preorder-and-inorder-traversal/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/trees/medium/construct-tree-from-preorder-and-inorder-traversal/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Construct Tree from Preorder and Inorder Traversal. 2 | The URL of the problem is [https://leetcode.com/problems/construct-tree-from-preorder-and-inorder-traversal](https://leetcode.com/problems/construct-tree-from-preorder-and-inorder-traversal). 3 | -------------------------------------------------------------------------------- /courses/trees/medium/count-good-nodes-in-binary-tree/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/trees/medium/count-good-nodes-in-binary-tree/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::trees::medium::count-good-nodes-in-binary-tree", 3 | "lesson_id": "trane::leetcode::trees::medium", 4 | "course_id": "trane::leetcode::trees", 5 | "name": "Count Good Nodes in Binary Tree", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/trees/medium/count-good-nodes-in-binary-tree/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Count Good Nodes in Binary Tree. 2 | The URL of the problem is [https://leetcode.com/problems/count-good-nodes-in-binary-tree](https://leetcode.com/problems/count-good-nodes-in-binary-tree). 3 | -------------------------------------------------------------------------------- /courses/trees/medium/kth-smallest-element-in-a-bst/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/trees/medium/kth-smallest-element-in-a-bst/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::trees::medium::kth-smallest-element-in-a-bst", 3 | "lesson_id": "trane::leetcode::trees::medium", 4 | "course_id": "trane::leetcode::trees", 5 | "name": "Kth Smallest Element in a BST", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/trees/medium/kth-smallest-element-in-a-bst/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Kth Smallest Element in a BST. 2 | The URL of the problem is [https://leetcode.com/problems/kth-smallest-element-in-a-bst](https://leetcode.com/problems/kth-smallest-element-in-a-bst). 3 | -------------------------------------------------------------------------------- /courses/trees/medium/lesson_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::trees::medium", 3 | "dependencies": [ 4 | "trane::leetcode::trees::easy" 5 | ], 6 | "course_id": "trane::leetcode::trees", 7 | "name": "Trees - medium", 8 | "description": null, 9 | "metadata": null, 10 | "lesson_material": null, 11 | "lesson_instructions": null 12 | } 13 | -------------------------------------------------------------------------------- /courses/trees/medium/validate-binary-search-tree/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/trees/medium/validate-binary-search-tree/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::trees::medium::validate-binary-search-tree", 3 | "lesson_id": "trane::leetcode::trees::medium", 4 | "course_id": "trane::leetcode::trees", 5 | "name": "Validate Binary Search Tree", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/trees/medium/validate-binary-search-tree/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Validate Binary Search Tree. 2 | The URL of the problem is [https://leetcode.com/problems/validate-binary-search-tree](https://leetcode.com/problems/validate-binary-search-tree). 3 | -------------------------------------------------------------------------------- /courses/tries/course_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::tries", 3 | "name": "Tries", 4 | "dependencies": [], 5 | "description": "Solve Leetcode problems related to the topic Tries", 6 | "authors": [ 7 | "The Trane Project" 8 | ], 9 | "metadata": { 10 | "leetcode_topic": [ 11 | "Tries" 12 | ] 13 | }, 14 | "course_material": null, 15 | "course_instructions": { 16 | "MarkdownAsset": { 17 | "path": "instructions.md" 18 | } 19 | }, 20 | "generator_config": null 21 | } 22 | -------------------------------------------------------------------------------- /courses/tries/hard/lesson_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::tries::hard", 3 | "dependencies": [ 4 | "trane::leetcode::tries::medium" 5 | ], 6 | "course_id": "trane::leetcode::tries", 7 | "name": "Tries - hard", 8 | "description": null, 9 | "metadata": null, 10 | "lesson_material": null, 11 | "lesson_instructions": null 12 | } 13 | -------------------------------------------------------------------------------- /courses/tries/hard/word-search-ii/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/tries/hard/word-search-ii/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::tries::hard::word-search-ii", 3 | "lesson_id": "trane::leetcode::tries::hard", 4 | "course_id": "trane::leetcode::tries", 5 | "name": "Word Search II", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/tries/hard/word-search-ii/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Word Search II. 2 | The URL of the problem is [https://leetcode.com/problems/word-search-ii](https://leetcode.com/problems/word-search-ii). 3 | -------------------------------------------------------------------------------- /courses/tries/instructions.md: -------------------------------------------------------------------------------- 1 | Make progress in this course by solving the given Leetcode problems. 2 | 3 | What solving a problem means is open-ended. You could code the solution from 4 | scratch every time, or do it only the first time and just review the solution 5 | any subsequent time you are given the problem. 6 | 7 | You can find the video solutions to all the problems on 8 | [neetcode.io](neetcode.io). 9 | -------------------------------------------------------------------------------- /courses/tries/medium/design-add-and-search-words-data-structure/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/tries/medium/design-add-and-search-words-data-structure/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::tries::medium::design-add-and-search-words-data-structure", 3 | "lesson_id": "trane::leetcode::tries::medium", 4 | "course_id": "trane::leetcode::tries", 5 | "name": "Design Add and Search Words Data Structure", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/tries/medium/design-add-and-search-words-data-structure/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Design Add and Search Words Data Structure. 2 | The URL of the problem is [https://leetcode.com/problems/design-add-and-search-words-data-structure](https://leetcode.com/problems/design-add-and-search-words-data-structure). 3 | -------------------------------------------------------------------------------- /courses/tries/medium/implement-trie-prefix-tree/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/tries/medium/implement-trie-prefix-tree/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::tries::medium::implement-trie-prefix-tree", 3 | "lesson_id": "trane::leetcode::tries::medium", 4 | "course_id": "trane::leetcode::tries", 5 | "name": "Implement Trie (Prefix Tree)", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/tries/medium/implement-trie-prefix-tree/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Implement Trie (Prefix Tree). 2 | The URL of the problem is [https://leetcode.com/problems/implement-trie-prefix-tree](https://leetcode.com/problems/implement-trie-prefix-tree). 3 | -------------------------------------------------------------------------------- /courses/tries/medium/lesson_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::tries::medium", 3 | "dependencies": [], 4 | "course_id": "trane::leetcode::tries", 5 | "name": "Tries - medium", 6 | "description": null, 7 | "metadata": null, 8 | "lesson_material": null, 9 | "lesson_instructions": null 10 | } 11 | -------------------------------------------------------------------------------- /courses/two_d_dynamic_programming/hard/burst-balloons/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/two_d_dynamic_programming/hard/burst-balloons/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::two_d_dynamic_programming::hard::burst-balloons", 3 | "lesson_id": "trane::leetcode::two_d_dynamic_programming::hard", 4 | "course_id": "trane::leetcode::two_d_dynamic_programming", 5 | "name": "Burst Balloons", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/two_d_dynamic_programming/hard/burst-balloons/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Burst Balloons. 2 | The URL of the problem is [https://leetcode.com/problems/burst-balloons](https://leetcode.com/problems/burst-balloons). 3 | -------------------------------------------------------------------------------- /courses/two_d_dynamic_programming/hard/distinct-subsequences/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/two_d_dynamic_programming/hard/distinct-subsequences/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::two_d_dynamic_programming::hard::distinct-subsequences", 3 | "lesson_id": "trane::leetcode::two_d_dynamic_programming::hard", 4 | "course_id": "trane::leetcode::two_d_dynamic_programming", 5 | "name": "Distinct Subsequences", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/two_d_dynamic_programming/hard/distinct-subsequences/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Distinct Subsequences. 2 | The URL of the problem is [https://leetcode.com/problems/distinct-subsequences](https://leetcode.com/problems/distinct-subsequences). 3 | -------------------------------------------------------------------------------- /courses/two_d_dynamic_programming/hard/edit-distance/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/two_d_dynamic_programming/hard/edit-distance/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::two_d_dynamic_programming::hard::edit-distance", 3 | "lesson_id": "trane::leetcode::two_d_dynamic_programming::hard", 4 | "course_id": "trane::leetcode::two_d_dynamic_programming", 5 | "name": "Edit Distance", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/two_d_dynamic_programming/hard/edit-distance/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Edit Distance. 2 | The URL of the problem is [https://leetcode.com/problems/edit-distance](https://leetcode.com/problems/edit-distance). 3 | -------------------------------------------------------------------------------- /courses/two_d_dynamic_programming/hard/lesson_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::two_d_dynamic_programming::hard", 3 | "dependencies": [ 4 | "trane::leetcode::two_d_dynamic_programming::medium" 5 | ], 6 | "course_id": "trane::leetcode::two_d_dynamic_programming", 7 | "name": "2-D Dynamic Programming - hard", 8 | "description": null, 9 | "metadata": null, 10 | "lesson_material": null, 11 | "lesson_instructions": null 12 | } 13 | -------------------------------------------------------------------------------- /courses/two_d_dynamic_programming/hard/longest-increasing-path-in-a-matrix/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/two_d_dynamic_programming/hard/longest-increasing-path-in-a-matrix/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Longest Increasing Path in a Matrix. 2 | The URL of the problem is [https://leetcode.com/problems/longest-increasing-path-in-a-matrix](https://leetcode.com/problems/longest-increasing-path-in-a-matrix). 3 | -------------------------------------------------------------------------------- /courses/two_d_dynamic_programming/hard/regular-expression-matching/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/two_d_dynamic_programming/hard/regular-expression-matching/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Regular Expression Matching. 2 | The URL of the problem is [https://leetcode.com/problems/regular-expression-matching](https://leetcode.com/problems/regular-expression-matching). 3 | -------------------------------------------------------------------------------- /courses/two_d_dynamic_programming/instructions.md: -------------------------------------------------------------------------------- 1 | Make progress in this course by solving the given Leetcode problems. 2 | 3 | What solving a problem means is open-ended. You could code the solution from 4 | scratch every time, or do it only the first time and just review the solution 5 | any subsequent time you are given the problem. 6 | 7 | You can find the video solutions to all the problems on 8 | [neetcode.io](neetcode.io). 9 | -------------------------------------------------------------------------------- /courses/two_d_dynamic_programming/medium/best-time-to-buy-and-sell-stock-with-cooldown/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/two_d_dynamic_programming/medium/best-time-to-buy-and-sell-stock-with-cooldown/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Best Time to Buy and Sell Stock with Cooldown. 2 | The URL of the problem is [https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-cooldown](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-cooldown). 3 | -------------------------------------------------------------------------------- /courses/two_d_dynamic_programming/medium/coin-change-2/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/two_d_dynamic_programming/medium/coin-change-2/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::two_d_dynamic_programming::medium::coin-change-2", 3 | "lesson_id": "trane::leetcode::two_d_dynamic_programming::medium", 4 | "course_id": "trane::leetcode::two_d_dynamic_programming", 5 | "name": "Coin Change II", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/two_d_dynamic_programming/medium/coin-change-2/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Coin Change II. 2 | The URL of the problem is [https://leetcode.com/problems/coin-change-2](https://leetcode.com/problems/coin-change-2). 3 | -------------------------------------------------------------------------------- /courses/two_d_dynamic_programming/medium/interleaving-string/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/two_d_dynamic_programming/medium/interleaving-string/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::two_d_dynamic_programming::medium::interleaving-string", 3 | "lesson_id": "trane::leetcode::two_d_dynamic_programming::medium", 4 | "course_id": "trane::leetcode::two_d_dynamic_programming", 5 | "name": "Interleaving String", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/two_d_dynamic_programming/medium/interleaving-string/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Interleaving String. 2 | The URL of the problem is [https://leetcode.com/problems/interleaving-string](https://leetcode.com/problems/interleaving-string). 3 | -------------------------------------------------------------------------------- /courses/two_d_dynamic_programming/medium/lesson_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::two_d_dynamic_programming::medium", 3 | "dependencies": [], 4 | "course_id": "trane::leetcode::two_d_dynamic_programming", 5 | "name": "2-D Dynamic Programming - medium", 6 | "description": null, 7 | "metadata": null, 8 | "lesson_material": null, 9 | "lesson_instructions": null 10 | } 11 | -------------------------------------------------------------------------------- /courses/two_d_dynamic_programming/medium/longest-common-subsequence/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/two_d_dynamic_programming/medium/longest-common-subsequence/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Longest Common Subsequence. 2 | The URL of the problem is [https://leetcode.com/problems/longest-common-subsequence](https://leetcode.com/problems/longest-common-subsequence). 3 | -------------------------------------------------------------------------------- /courses/two_d_dynamic_programming/medium/target-sum/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/two_d_dynamic_programming/medium/target-sum/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::two_d_dynamic_programming::medium::target-sum", 3 | "lesson_id": "trane::leetcode::two_d_dynamic_programming::medium", 4 | "course_id": "trane::leetcode::two_d_dynamic_programming", 5 | "name": "Target Sum", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/two_d_dynamic_programming/medium/target-sum/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Target Sum. 2 | The URL of the problem is [https://leetcode.com/problems/target-sum](https://leetcode.com/problems/target-sum). 3 | -------------------------------------------------------------------------------- /courses/two_d_dynamic_programming/medium/unique-paths/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/two_d_dynamic_programming/medium/unique-paths/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::two_d_dynamic_programming::medium::unique-paths", 3 | "lesson_id": "trane::leetcode::two_d_dynamic_programming::medium", 4 | "course_id": "trane::leetcode::two_d_dynamic_programming", 5 | "name": "Unique Paths", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/two_d_dynamic_programming/medium/unique-paths/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Unique Paths. 2 | The URL of the problem is [https://leetcode.com/problems/unique-paths](https://leetcode.com/problems/unique-paths). 3 | -------------------------------------------------------------------------------- /courses/two_pointers/course_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::two_pointers", 3 | "name": "Two Pointers", 4 | "dependencies": [], 5 | "description": "Solve Leetcode problems related to the topic Two Pointers", 6 | "authors": [ 7 | "The Trane Project" 8 | ], 9 | "metadata": { 10 | "leetcode_topic": [ 11 | "Two Pointers" 12 | ] 13 | }, 14 | "course_material": null, 15 | "course_instructions": { 16 | "MarkdownAsset": { 17 | "path": "instructions.md" 18 | } 19 | }, 20 | "generator_config": null 21 | } 22 | -------------------------------------------------------------------------------- /courses/two_pointers/easy/lesson_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::two_pointers::easy", 3 | "dependencies": [], 4 | "course_id": "trane::leetcode::two_pointers", 5 | "name": "Two Pointers - easy", 6 | "description": null, 7 | "metadata": null, 8 | "lesson_material": null, 9 | "lesson_instructions": null 10 | } 11 | -------------------------------------------------------------------------------- /courses/two_pointers/easy/valid-palindrome/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/two_pointers/easy/valid-palindrome/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::two_pointers::easy::valid-palindrome", 3 | "lesson_id": "trane::leetcode::two_pointers::easy", 4 | "course_id": "trane::leetcode::two_pointers", 5 | "name": "Valid Palindrome", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/two_pointers/easy/valid-palindrome/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Valid Palindrome. 2 | The URL of the problem is [https://leetcode.com/problems/valid-palindrome](https://leetcode.com/problems/valid-palindrome). 3 | -------------------------------------------------------------------------------- /courses/two_pointers/hard/lesson_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::two_pointers::hard", 3 | "dependencies": [ 4 | "trane::leetcode::two_pointers::medium" 5 | ], 6 | "course_id": "trane::leetcode::two_pointers", 7 | "name": "Two Pointers - hard", 8 | "description": null, 9 | "metadata": null, 10 | "lesson_material": null, 11 | "lesson_instructions": null 12 | } 13 | -------------------------------------------------------------------------------- /courses/two_pointers/hard/trapping-rain-water/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/two_pointers/hard/trapping-rain-water/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::two_pointers::hard::trapping-rain-water", 3 | "lesson_id": "trane::leetcode::two_pointers::hard", 4 | "course_id": "trane::leetcode::two_pointers", 5 | "name": "Trapping Rain Water", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/two_pointers/hard/trapping-rain-water/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Trapping Rain Water. 2 | The URL of the problem is [https://leetcode.com/problems/trapping-rain-water](https://leetcode.com/problems/trapping-rain-water). 3 | -------------------------------------------------------------------------------- /courses/two_pointers/instructions.md: -------------------------------------------------------------------------------- 1 | Make progress in this course by solving the given Leetcode problems. 2 | 3 | What solving a problem means is open-ended. You could code the solution from 4 | scratch every time, or do it only the first time and just review the solution 5 | any subsequent time you are given the problem. 6 | 7 | You can find the video solutions to all the problems on 8 | [neetcode.io](neetcode.io). 9 | -------------------------------------------------------------------------------- /courses/two_pointers/medium/3sum/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/two_pointers/medium/3sum/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::two_pointers::medium::3sum", 3 | "lesson_id": "trane::leetcode::two_pointers::medium", 4 | "course_id": "trane::leetcode::two_pointers", 5 | "name": "3Sum", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/two_pointers/medium/3sum/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem 3Sum. 2 | The URL of the problem is [https://leetcode.com/problems/3sum](https://leetcode.com/problems/3sum). 3 | -------------------------------------------------------------------------------- /courses/two_pointers/medium/container-with-most-water/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/two_pointers/medium/container-with-most-water/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::two_pointers::medium::container-with-most-water", 3 | "lesson_id": "trane::leetcode::two_pointers::medium", 4 | "course_id": "trane::leetcode::two_pointers", 5 | "name": "Container With Most Water", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/two_pointers/medium/container-with-most-water/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Container With Most Water. 2 | The URL of the problem is [https://leetcode.com/problems/container-with-most-water](https://leetcode.com/problems/container-with-most-water). 3 | -------------------------------------------------------------------------------- /courses/two_pointers/medium/lesson_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::two_pointers::medium", 3 | "dependencies": [ 4 | "trane::leetcode::two_pointers::easy" 5 | ], 6 | "course_id": "trane::leetcode::two_pointers", 7 | "name": "Two Pointers - medium", 8 | "description": null, 9 | "metadata": null, 10 | "lesson_material": null, 11 | "lesson_instructions": null 12 | } 13 | -------------------------------------------------------------------------------- /courses/two_pointers/medium/two-sum-ii-input-array-is-sorted/back.md: -------------------------------------------------------------------------------- 1 | You can find a solution to the problem on [neetcode.io](neetcode.io). 2 | -------------------------------------------------------------------------------- /courses/two_pointers/medium/two-sum-ii-input-array-is-sorted/exercise_manifest.json: -------------------------------------------------------------------------------- 1 | { 2 | "id": "trane::leetcode::two_pointers::medium::two-sum-ii-input-array-is-sorted", 3 | "lesson_id": "trane::leetcode::two_pointers::medium", 4 | "course_id": "trane::leetcode::two_pointers", 5 | "name": "Two Sum II", 6 | "description": null, 7 | "exercise_type": "Procedural", 8 | "exercise_asset": { 9 | "FlashcardAsset": { 10 | "front_path": "front.md", 11 | "back_path": "back.md" 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /courses/two_pointers/medium/two-sum-ii-input-array-is-sorted/front.md: -------------------------------------------------------------------------------- 1 | Solve the Leetcode problem Two Sum II. 2 | The URL of the problem is [https://leetcode.com/problems/two-sum-ii-input-array-is-sorted](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted). 3 | --------------------------------------------------------------------------------