LeetCode

Table Of Contents

• LeetCode
  • Table Of Contents
  • About
  • Template
  • Support Me

About

Here I publish my LeetCode solutions

Officially this repository starts at the date 18th May, 2022.

The goal is to solve AT LEAST 2 problems, and AT MOST 3 problems, per day.

For guidance on what problems to solve, I will use the following guides on the dashboard of LeetCode.

These are my steps,

1. Finish all the study plans as outlined, SQL Study Plan, Binary Search Study Plan, 14 Days Study Plan To Crack Algo, and so on
2. Approach questions by TOPICS filtered by difficulty in DESCENDING order (starting from HARD problems)

Template

Please follow the steps and copy the following template to generate a folder for a new problem.

1. Create a folder with the following format, <PROBLEM_NUMBER>. <PROBLEM_NAME> (<PROBLEM_DIFFICULTY>)

2. Create a README.md in the folder

3. Fill the README.md with the following template for the content,

   # <PROBLEM_NUMBER>. <PROBLEM_NAME> (<PROBLEM_DIFFICULTY>)
   
   ## Table Of Contents
   
   - [<PROBLEM_NUMBER>. <PROBLEM_NAME> (<PROBLEM_DIFFICULTY>)](#problem_number-problem_name-problem_difficulty)
     - [Table Of Contents](#table-of-contents)
     - [Link](#link)
     - [Description](#description)
     - [Hints](#hints)
     - [Result Details](#result-details)
   
   ## Link
   
   Problem can be found [here](https://leetcode.com/study-plan/).
   
   ## Description
   
   ...
   
   ## Hints
   
   ...
   
   ## Result Details
   
   ...
   

4. Copy paste the material starting from <PROBLEM_NUMBER>. <PROBLEM_NAME> to Constraints in the description

   

5. Copy paste the Hint or Follow Up under Hints

6. After solving, share the output generated by LeetCode for time and space complexity under Result Details

7. Create a file called Solution.java in the respective folder, copy paste results

Support Me

If you like what I am doing, please star or fork. Thanks!

LeetCode Topics

String

0008-string-to-integer-atoi
0012-integer-to-roman
0013-roman-to-integer
0020-valid-parentheses
0030-substring-with-concatenation-of-all-words
0032-longest-valid-parentheses
0044-wildcard-matching
0058-length-of-last-word
0067-add-binary
0076-minimum-window-substring
0127-word-ladder
0165-compare-version-numbers
0166-fraction-to-recurring-decimal
0297-serialize-and-deserialize-binary-tree
1006-vowel-spellchecker
1264-maximum-number-of-words-you-can-type
1353-find-resultant-array-after-removing-anagrams
1781-check-if-two-string-arrays-are-equivalent
2184-check-if-an-original-string-exists-given-two-encoded-strings
2429-design-a-food-rating-system
2887-sort-vowels-in-a-string
3872-find-most-frequent-vowel-and-consonant

Tree

0297-serialize-and-deserialize-binary-tree

Depth-First Search

0297-serialize-and-deserialize-binary-tree
0329-longest-increasing-path-in-a-matrix
0417-pacific-atlantic-water-flow
0794-swim-in-rising-water
1753-path-with-minimum-effort

Breadth-First Search

0127-word-ladder
0297-serialize-and-deserialize-binary-tree
0329-longest-increasing-path-in-a-matrix
0417-pacific-atlantic-water-flow
0794-swim-in-rising-water
1753-path-with-minimum-effort

Design

0295-find-median-from-data-stream
0297-serialize-and-deserialize-binary-tree
2023-design-movie-rental-system
2429-design-a-food-rating-system
3678-design-task-manager
3827-implement-router

Binary Tree

0297-serialize-and-deserialize-binary-tree

Dynamic Programming

0032-longest-valid-parentheses
0042-trapping-rain-water
0044-wildcard-matching
0053-maximum-subarray
0085-maximal-rectangle
0118-pascals-triangle
0119-pascals-triangle-ii
0121-best-time-to-buy-and-sell-stock
0221-maximal-square
0329-longest-increasing-path-in-a-matrix
0769-largest-plus-sign
1111-minimum-score-triangulation-of-polygon
2184-check-if-an-original-string-exists-given-two-encoded-strings
3851-find-sum-of-array-product-of-magical-sequences

Stack

0020-valid-parentheses
0032-longest-valid-parentheses
0042-trapping-rain-water
0084-largest-rectangle-in-histogram
0085-maximal-rectangle
0150-evaluate-reverse-polish-notation
2307-replace-non-coprime-numbers-in-array

Greedy

0011-container-with-most-water
0044-wildcard-matching
0611-valid-triangle-number
1018-largest-perimeter-triangle
1612-avoid-flood-in-the-city
1917-maximum-average-pass-ratio
2661-smallest-missing-non-negative-integer-after-operations

Recursion

0025-reverse-nodes-in-k-group
0044-wildcard-matching

Hash Table

0012-integer-to-roman
0013-roman-to-integer
0030-substring-with-concatenation-of-all-words
0036-valid-sudoku
0037-sudoku-solver
0041-first-missing-positive
0076-minimum-window-substring
0127-word-ladder
0149-max-points-on-a-line
0166-fraction-to-recurring-decimal
0169-majority-element
1006-vowel-spellchecker
1264-maximum-number-of-words-you-can-type
1353-find-resultant-array-after-removing-anagrams
1612-avoid-flood-in-the-city
2023-design-movie-rental-system
2254-check-if-every-row-and-column-contains-all-numbers
2429-design-a-food-rating-system
2661-smallest-missing-non-negative-integer-after-operations
3242-count-elements-with-maximum-frequency
3678-design-task-manager
3827-implement-router
3872-find-most-frequent-vowel-and-consonant

Sliding Window

0030-substring-with-concatenation-of-all-words
0076-minimum-window-substring
3640-maximum-frequency-of-an-element-after-performing-operations-ii

Array

0011-container-with-most-water
0026-remove-duplicates-from-sorted-array
0027-remove-element
0036-valid-sudoku
0037-sudoku-solver
0041-first-missing-positive
0042-trapping-rain-water
0051-n-queens
0053-maximum-subarray
0066-plus-one
0084-largest-rectangle-in-histogram
0085-maximal-rectangle
0088-merge-sorted-array
0118-pascals-triangle
0119-pascals-triangle-ii
0121-best-time-to-buy-and-sell-stock
0149-max-points-on-a-line
0150-evaluate-reverse-polish-notation
0167-two-sum-ii-input-array-is-sorted
0169-majority-element
0189-rotate-array
0221-maximal-square
0315-count-of-smaller-numbers-after-self
0329-longest-increasing-path-in-a-matrix
0417-pacific-atlantic-water-flow
0611-valid-triangle-number
0769-largest-plus-sign
0794-swim-in-rising-water
0830-largest-triangle-area
1006-vowel-spellchecker
1018-largest-perimeter-triangle
1019-squares-of-a-sorted-array
1111-minimum-score-triangulation-of-polygon
1353-find-resultant-array-after-removing-anagrams
1426-find-n-unique-integers-sum-up-to-zero
1612-avoid-flood-in-the-city
1753-path-with-minimum-effort
1781-check-if-two-string-arrays-are-equivalent
1917-maximum-average-pass-ratio
2023-design-movie-rental-system
2254-check-if-every-row-and-column-contains-all-numbers
2307-replace-non-coprime-numbers-in-array
2324-find-triangular-sum-of-an-array
2392-successful-pairs-of-spells-and-potions
2429-design-a-food-rating-system
2454-largest-local-values-in-a-matrix
2661-smallest-missing-non-negative-integer-after-operations
3242-count-elements-with-maximum-frequency
3383-taking-maximum-energy-from-the-mystic-dungeon
3555-final-array-state-after-k-multiplication-operations-i
3619-adjacent-increasing-subarrays-detection-ii
3640-maximum-frequency-of-an-element-after-performing-operations-ii
3744-minimum-operations-to-make-array-elements-zero
3827-implement-router
3851-find-sum-of-array-product-of-magical-sequences

Graph

0329-longest-increasing-path-in-a-matrix

Topological Sort

0329-longest-increasing-path-in-a-matrix

Memoization

0329-longest-increasing-path-in-a-matrix

Matrix

0036-valid-sudoku
0037-sudoku-solver
0085-maximal-rectangle
0221-maximal-square
0329-longest-increasing-path-in-a-matrix
0417-pacific-atlantic-water-flow
0794-swim-in-rising-water
1753-path-with-minimum-effort
2254-check-if-every-row-and-column-contains-all-numbers
2454-largest-local-values-in-a-matrix

Math

0009-palindrome-number
0012-integer-to-roman
0013-roman-to-integer
0066-plus-one
0067-add-binary
0149-max-points-on-a-line
0150-evaluate-reverse-polish-notation
0166-fraction-to-recurring-decimal
0189-rotate-array
0830-largest-triangle-area
1018-largest-perimeter-triangle
1426-find-n-unique-integers-sum-up-to-zero
1642-water-bottles
2307-replace-non-coprime-numbers-in-array
2324-find-triangular-sum-of-an-array
2661-smallest-missing-non-negative-integer-after-operations
3555-final-array-state-after-k-multiplication-operations-i
3744-minimum-operations-to-make-array-elements-zero
3851-find-sum-of-array-product-of-magical-sequences

Geometry

0149-max-points-on-a-line
0830-largest-triangle-area

Heap (Priority Queue)

0023-merge-k-sorted-lists
0295-find-median-from-data-stream
0794-swim-in-rising-water
1612-avoid-flood-in-the-city
1753-path-with-minimum-effort
1917-maximum-average-pass-ratio
2023-design-movie-rental-system
2429-design-a-food-rating-system
3555-final-array-state-after-k-multiplication-operations-i
3678-design-task-manager

Simulation

0067-add-binary
1642-water-bottles
2324-find-triangular-sum-of-an-array
3555-final-array-state-after-k-multiplication-operations-i

Two Pointers

0011-container-with-most-water
0026-remove-duplicates-from-sorted-array
0027-remove-element
0042-trapping-rain-water
0088-merge-sorted-array
0165-compare-version-numbers
0167-two-sum-ii-input-array-is-sorted
0189-rotate-array
0295-find-median-from-data-stream
0611-valid-triangle-number
1019-squares-of-a-sorted-array
2392-successful-pairs-of-spells-and-potions

Monotonic Stack

0042-trapping-rain-water
0084-largest-rectangle-in-histogram
0085-maximal-rectangle

Binary Search

0167-two-sum-ii-input-array-is-sorted
0315-count-of-smaller-numbers-after-self
0611-valid-triangle-number
0794-swim-in-rising-water
1612-avoid-flood-in-the-city
1753-path-with-minimum-effort
2392-successful-pairs-of-spells-and-potions
3619-adjacent-increasing-subarrays-detection-ii
3640-maximum-frequency-of-an-element-after-performing-operations-ii
3827-implement-router

Divide and Conquer

0023-merge-k-sorted-lists
0053-maximum-subarray
0169-majority-element
0315-count-of-smaller-numbers-after-self

Binary Indexed Tree

0315-count-of-smaller-numbers-after-self

Segment Tree

0315-count-of-smaller-numbers-after-self

Merge Sort

0023-merge-k-sorted-lists
0315-count-of-smaller-numbers-after-self

Ordered Set

0315-count-of-smaller-numbers-after-self
2023-design-movie-rental-system
2429-design-a-food-rating-system
3678-design-task-manager
3827-implement-router

Linked List

0023-merge-k-sorted-lists
0025-reverse-nodes-in-k-group

Sorting

0088-merge-sorted-array
0169-majority-element
0295-find-median-from-data-stream
0611-valid-triangle-number
1018-largest-perimeter-triangle
1019-squares-of-a-sorted-array
1353-find-resultant-array-after-removing-anagrams
2392-successful-pairs-of-spells-and-potions
2887-sort-vowels-in-a-string
3640-maximum-frequency-of-an-element-after-performing-operations-ii

Data Stream

0295-find-median-from-data-stream

Backtracking

0037-sudoku-solver
0051-n-queens
0052-n-queens-ii

Combinatorics

2324-find-triangular-sum-of-an-array
3851-find-sum-of-array-product-of-magical-sequences

Bit Manipulation

0067-add-binary
3744-minimum-operations-to-make-array-elements-zero
3851-find-sum-of-array-product-of-magical-sequences

Database

0175-combine-two-tables
0181-employees-earning-more-than-their-managers

Counting

0169-majority-element
3242-count-elements-with-maximum-frequency
3872-find-most-frequent-vowel-and-consonant

Number Theory

2307-replace-non-coprime-numbers-in-array

Queue

3827-implement-router

Union Find

0794-swim-in-rising-water
1753-path-with-minimum-effort

Prefix Sum

3383-taking-maximum-energy-from-the-mystic-dungeon
3640-maximum-frequency-of-an-element-after-performing-operations-ii

Bitmask

3851-find-sum-of-array-product-of-magical-sequences