File tree
1,422 files changed
+5864
-5416
lines changed- .github/workflows
- helper
- problems
- 1-bit-and-2-bit-characters
- 2-keys-keyboard
- 24-game
- 3sum
- 4-keys-keyboard
- accepted-candidates-from-the-interviews
- account-balance
- activity-participants
- actors-and-directors-who-cooperated-at-least-three-times
- ad-free-sessions
- add-bold-tag-in-string
- add-minimum-number-of-rungs
- add-one-row-to-tree
- add-to-array-form-of-integer
- add-two-polynomials-represented-as-linked-lists
- adding-two-negabinary-numbers
- advantage-shuffle
- airplane-seat-assignment-probability
- alert-using-same-key-card-three-or-more-times-in-a-one-hour-period
- alien-dictionary
- all-elements-in-two-binary-search-trees
- all-people-report-to-the-given-manager
- all-possible-full-binary-trees
- all-the-pairs-with-the-maximum-number-of-common-followers
- all-valid-triplets-that-can-represent-a-country
- alphabet-board-path
- angle-between-hands-of-a-clock
- apply-discount-every-n-orders
- arithmetic-slices
- arithmetic-slices-ii-subsequence
- arithmetic-subarrays
- arranging-coins
- array-nesting
- array-transformation
- array-with-elements-not-equal-to-average-of-neighbors
- article-views-i
- article-views-ii
- as-far-from-land-as-possible
- assign-cookies
- average-height-of-buildings-in-each-segment
- average-of-levels-in-binary-tree
- average-salary-departments-vs-company
- average-selling-price
- average-time-of-process-per-machine
- average-waiting-time
- avoid-flood-in-the-city
- backspace-string-compare
- balance-a-binary-search-tree
- balanced-binary-tree
- bank-account-summary
- bank-account-summary-ii
- beautiful-arrangement
- beautiful-array
- before-and-after-puzzle
- best-position-for-a-service-centre
- best-sightseeing-pair
- best-team-with-no-conflicts
- best-time-to-buy-and-sell-stock-ii
- best-time-to-buy-and-sell-stock-iii
- best-time-to-buy-and-sell-stock-iv
- best-time-to-buy-and-sell-stock-with-cooldown
- biggest-window-between-visits
- binary-prefix-divisible-by-5
- binary-search
- binary-search-tree-iterator-ii
- binary-searchable-numbers-in-an-unsorted-array
- binary-tree-coloring-game
- binary-tree-level-order-traversal-ii
- binary-tree-longest-consecutive-sequence
- binary-tree-longest-consecutive-sequence-ii
- binary-tree-paths
- binary-tree-vertical-order-traversal
- binary-watch
- bitwise-ors-of-subarrays
- bomb-enemy
- brace-expansion
- brace-expansion-ii
- break-a-palindrome
- brick-wall
- bricks-falling-when-hit
- brightest-position-on-street
- build-array-from-permutation
- build-array-where-you-can-find-the-maximum-exactly-k-comparisons
- build-binary-expression-tree-from-infix-expression
- building-boxes
- building-h2o
- buildings-with-an-ocean-view
- bulb-switcher-iv
- bus-routes
- calculate-money-in-leetcode-bank
- calculate-special-bonus
- can-convert-string-in-k-moves
- can-make-arithmetic-progression-from-sequence
- can-make-palindrome-from-substring
- can-place-flowers
- can-you-eat-your-favorite-candy-on-your-favorite-day
- capacity-to-ship-packages-within-d-days
- car-fleet-ii
- card-flipping-game
- cat-and-mouse-ii
- cells-with-odd-values-in-a-matrix
- chalkboard-xor-game
- change-minimum-characters-to-satisfy-one-of-three-conditions
- change-the-root-of-a-binary-tree
- check-array-formation-through-concatenation
- check-completeness-of-a-binary-tree
- check-if-a-string-can-break-another-string
- check-if-all-characters-have-equal-number-of-occurrences
- check-if-all-the-integers-in-a-range-are-covered
- check-if-an-original-string-exists-given-two-encoded-strings
- check-if-array-is-sorted-and-rotated
- check-if-array-pairs-are-divisible-by-k
- check-if-binary-string-has-at-most-one-segment-of-ones
- check-if-it-is-a-good-array
- check-if-move-is-legal
- check-if-number-is-a-sum-of-powers-of-three
- check-if-numbers-are-ascending-in-a-sentence
- check-if-one-string-swap-can-make-strings-equal
- check-if-string-is-a-prefix-of-array
- check-if-string-is-decomposable-into-value-equal-substrings
- check-if-string-is-transformable-with-substring-sort-operations
- check-if-the-sentence-is-pangram
- check-if-two-expression-trees-are-equivalent
- check-if-two-string-arrays-are-equivalent
- check-if-word-can-be-placed-in-crossword
- check-if-word-equals-summation-of-two-words
- check-whether-two-strings-are-almost-equivalent
- checking-existence-of-edge-length-limited-paths
- checking-existence-of-edge-length-limited-paths-ii
- cherry-pickup-ii
- cinema-seat-allocation
- circle-and-rectangle-overlapping
- circular-array-loop
- classes-more-than-5-students
- climbing-stairs
- clone-graph
- closest-binary-search-tree-value
- closest-dessert-cost
- closest-leaf-in-a-binary-tree
- closest-room
- closest-subsequence-sum
- clumsy-factorial
- coin-path
- coloring-a-border
- combination-sum-iii
- combinations
- combine-two-tables
- compare-strings-by-frequency-of-the-smallest-character
- compare-version-numbers
- complex-number-multiplication
- concatenation-of-array
- concatenation-of-consecutive-binary-numbers
- confirmation-rate
- confusing-number
- consecutive-numbers
- consecutive-numbers-sum
- constrained-subsequence-sum
- construct-binary-tree-from-preorder-and-inorder-traversal
- construct-k-palindrome-strings
- construct-quad-tree
- construct-string-from-binary-tree
- construct-target-array-with-multiple-sums
- construct-the-lexicographically-largest-valid-sequence
- contain-virus
- contains-duplicate
- contains-duplicate-iii
- convert-1d-array-into-2d-array
- convert-bst-to-greater-tree
- convert-date-format
- convert-integer-to-the-sum-of-two-no-zero-integers
- convert-sorted-array-to-binary-search-tree
- convert-to-base-2
- convex-polygon
- coordinate-with-maximum-network-quality
- correct-a-binary-tree
- count-all-possible-routes
- count-apples-and-oranges
- count-good-meals
- count-good-numbers
- count-good-triplets
- count-items-matching-a-rule
- count-largest-group
- count-negative-numbers-in-a-sorted-matrix
- count-nice-pairs-in-an-array
- count-nodes-equal-to-sum-of-descendants
- count-nodes-with-the-highest-score
- count-number-of-homogenous-substrings
- count-number-of-maximum-bitwise-or-subsets
- count-number-of-nice-subarrays
- count-number-of-pairs-with-absolute-difference-k
- count-number-of-special-subsequences
- count-numbers-with-unique-digits
- count-odd-numbers-in-an-interval-range
- count-of-matches-in-tournament
- count-pairs-in-two-arrays
- count-pairs-of-equal-substrings-with-minimum-difference
- count-pairs-of-nodes
- count-pairs-with-xor-in-a-range
- count-salary-categories
- count-servers-that-communicate
- count-sorted-vowel-strings
- count-special-quadruplets
- count-square-sum-triples
- count-sub-islands
- count-subarrays-with-more-ones-than-zeros
- count-submatrices-with-all-ones
- count-substrings-that-differ-by-one-character
- count-substrings-with-only-one-distinct-letter
- count-subtrees-with-max-distance-between-cities
- count-the-number-of-consistent-strings
- count-the-number-of-experiments
- count-triplets-that-can-form-two-arrays-of-equal-xor
- count-unhappy-friends
- count-vowel-substrings-of-a-string
- count-vowels-permutation
- count-ways-to-build-rooms-in-an-ant-colony
- count-ways-to-distribute-candies
- count-ways-to-make-array-with-product
- counting-elements
- countries-you-can-safely-invest-in
- course-schedule-ii
- course-schedule-iii
- course-schedule-iv
- cracking-the-safe
- crawler-log-folder
- create-maximum-number
- create-sorted-array-through-instructions
- customer-order-frequency
- customer-placing-the-largest-number-of-orders
- customer-who-visited-but-did-not-make-any-transactions
- customers-who-bought-products-a-and-b-but-not-c
- customers-who-never-order
- cutting-ribbons
- cyclically-rotating-a-grid
- daily-leads-and-partners
- daily-temperatures
- day-of-the-week
- decode-the-slanted-ciphertext
- decode-ways-ii
- decode-xored-array
- decode-xored-permutation
- decoded-string-at-index
- decompress-run-length-encoded-list
- decrease-elements-to-make-array-zigzag
- decrypt-string-from-alphabet-to-integer-mapping
- defanging-an-ip-address
- defuse-the-bomb
- delete-characters-to-make-fancy-string
- delete-duplicate-folders-in-system
- delete-leaves-with-a-given-value
- delete-node-in-a-linked-list
- delete-nodes-and-return-forest
- delete-tree-nodes
- delivering-boxes-from-storage-to-ports
- depth-of-bst-given-insertion-order
- describe-the-painting
- design-a-file-sharing-system
- design-a-leaderboard
- design-a-stack-with-increment-operation
- design-an-expression-tree-with-evaluate-function
- design-an-ordered-stream
- design-authentication-manager
- design-bounded-blocking-queue
- design-browser-history
- design-circular-deque
- design-circular-queue
- design-compressed-string-iterator
- design-front-middle-back-queue
- design-hit-counter
- design-in-memory-file-system
- design-log-storage-system
- design-most-recently-used-queue
- design-movie-rental-system
- design-parking-system
- design-phone-directory
- design-search-autocomplete-system
- design-skiplist
- design-underground-system
- destination-city
- detect-capital
- detect-cycles-in-2d-grid
- detect-pattern-of-length-m-repeated-k-or-more-times
- detect-squares
- determine-color-of-a-chessboard-square
- determine-if-string-halves-are-alike
- determine-if-two-strings-are-close
- determine-whether-matrix-can-be-obtained-by-rotation
- diagonal-traverse
- diagonal-traverse-ii
- diameter-of-n-ary-tree
- dice-roll-simulation
- diet-plan-performance
- different-ways-to-add-parentheses
- dinner-plate-stacks
Some content is hidden
Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.
1,422 files changed
+5864
-5416
lines changedDiff for: .github/workflows/go.yml
+2-2
Original file line number | Diff line number | Diff line change | |
---|---|---|---|
| |||
2 | 2 |
| |
3 | 3 |
| |
4 | 4 |
| |
5 |
| - | |
| 5 | + | |
6 | 6 |
| |
7 |
| - | |
| 7 | + | |
8 | 8 |
| |
9 | 9 |
| |
10 | 10 |
| |
|
Diff for: README.md
+63-55
Large diffs are not rendered by default.
Diff for: helper/README.md
+3-3
Original file line number | Diff line number | Diff line change | |
---|---|---|---|
| |||
1 | 1 |
| |
2 | 2 |
| |
3 |
| - | |
4 |
| - | |
5 |
| - | |
| 3 | + | |
| 4 | + | |
| 5 | + | |
6 | 6 |
| |
7 | 7 |
| |
8 | 8 |
| |
|
+3-3
Original file line number | Diff line number | Diff line change | |
---|---|---|---|
| |||
1 | 1 |
| |
2 | 2 |
| |
3 |
| - | |
4 |
| - | |
5 |
| - | |
| 3 | + | |
| 4 | + | |
| 5 | + | |
6 | 6 |
| |
7 | 7 |
| |
8 | 8 |
| |
|
Diff for: problems/2-keys-keyboard/README.md
+3-3
Original file line number | Diff line number | Diff line change | |
---|---|---|---|
| |||
1 | 1 |
| |
2 | 2 |
| |
3 |
| - | |
4 |
| - | |
5 |
| - | |
| 3 | + | |
| 4 | + | |
| 5 | + | |
6 | 6 |
| |
7 | 7 |
| |
8 | 8 |
| |
|
Diff for: problems/24-game/README.md
+3-3
Original file line number | Diff line number | Diff line change | |
---|---|---|---|
| |||
1 | 1 |
| |
2 | 2 |
| |
3 |
| - | |
4 |
| - | |
5 |
| - | |
| 3 | + | |
| 4 | + | |
| 5 | + | |
6 | 6 |
| |
7 | 7 |
| |
8 | 8 |
| |
|
Diff for: problems/3sum/README.md
+3-3
Original file line number | Diff line number | Diff line change | |
---|---|---|---|
| |||
1 | 1 |
| |
2 | 2 |
| |
3 |
| - | |
4 |
| - | |
5 |
| - | |
| 3 | + | |
| 4 | + | |
| 5 | + | |
6 | 6 |
| |
7 | 7 |
| |
8 | 8 |
| |
|
Diff for: problems/4-keys-keyboard/README.md
+3-3
Original file line number | Diff line number | Diff line change | |
---|---|---|---|
| |||
1 | 1 |
| |
2 | 2 |
| |
3 |
| - | |
4 |
| - | |
5 |
| - | |
| 3 | + | |
| 4 | + | |
| 5 | + | |
6 | 6 |
| |
7 | 7 |
| |
8 | 8 |
| |
|
Original file line number | Diff line number | Diff line change | |
---|---|---|---|
| |||
1 | 1 |
| |
2 | 2 |
| |
3 |
| - | |
4 |
| - | |
5 |
| - | |
| 3 | + | |
| 4 | + | |
| 5 | + | |
6 | 6 |
| |
7 | 7 |
| |
8 | 8 |
| |
|
Diff for: problems/account-balance/README.md
+3-3
Original file line number | Diff line number | Diff line change | |
---|---|---|---|
| |||
1 | 1 |
| |
2 | 2 |
| |
3 |
| - | |
4 |
| - | |
5 |
| - | |
| 3 | + | |
| 4 | + | |
| 5 | + | |
6 | 6 |
| |
7 | 7 |
| |
8 | 8 |
| |
|
+3-3
Original file line number | Diff line number | Diff line change | |
---|---|---|---|
| |||
1 | 1 |
| |
2 | 2 |
| |
3 |
| - | |
4 |
| - | |
5 |
| - | |
| 3 | + | |
| 4 | + | |
| 5 | + | |
6 | 6 |
| |
7 | 7 |
| |
8 | 8 |
| |
|
Original file line number | Diff line number | Diff line change | |
---|---|---|---|
| |||
1 | 1 |
| |
2 | 2 |
| |
3 |
| - | |
4 |
| - | |
5 |
| - | |
| 3 | + | |
| 4 | + | |
| 5 | + | |
6 | 6 |
| |
7 | 7 |
| |
8 | 8 |
| |
|
Diff for: problems/ad-free-sessions/README.md
+3-3
Original file line number | Diff line number | Diff line change | |
---|---|---|---|
| |||
1 | 1 |
| |
2 | 2 |
| |
3 |
| - | |
4 |
| - | |
5 |
| - | |
| 3 | + | |
| 4 | + | |
| 5 | + | |
6 | 6 |
| |
7 | 7 |
| |
8 | 8 |
| |
|
+3-3
Original file line number | Diff line number | Diff line change | |
---|---|---|---|
| |||
1 | 1 |
| |
2 | 2 |
| |
3 |
| - | |
4 |
| - | |
5 |
| - | |
| 3 | + | |
| 4 | + | |
| 5 | + | |
6 | 6 |
| |
7 | 7 |
| |
8 | 8 |
| |
|
+3-3
Original file line number | Diff line number | Diff line change | |
---|---|---|---|
| |||
1 | 1 |
| |
2 | 2 |
| |
3 |
| - | |
4 |
| - | |
5 |
| - | |
| 3 | + | |
| 4 | + | |
| 5 | + | |
6 | 6 |
| |
7 | 7 |
| |
8 | 8 |
| |
|
Diff for: problems/add-one-row-to-tree/README.md
+3-3
Original file line number | Diff line number | Diff line change | |
---|---|---|---|
| |||
1 | 1 |
| |
2 | 2 |
| |
3 |
| - | |
4 |
| - | |
5 |
| - | |
| 3 | + | |
| 4 | + | |
| 5 | + | |
6 | 6 |
| |
7 | 7 |
| |
8 | 8 |
| |
|
+3-3
Original file line number | Diff line number | Diff line change | |
---|---|---|---|
| |||
1 | 1 |
| |
2 | 2 |
| |
3 |
| - | |
4 |
| - | |
5 |
| - | |
| 3 | + | |
| 4 | + | |
| 5 | + | |
6 | 6 |
| |
7 | 7 |
| |
8 | 8 |
| |
|
Original file line number | Diff line number | Diff line change | |
---|---|---|---|
| |||
1 | 1 |
| |
2 | 2 |
| |
3 |
| - | |
4 |
| - | |
5 |
| - | |
| 3 | + | |
| 4 | + | |
| 5 | + | |
6 | 6 |
| |
7 | 7 |
| |
8 | 8 |
| |
|
+3-3
Original file line number | Diff line number | Diff line change | |
---|---|---|---|
| |||
1 | 1 |
| |
2 | 2 |
| |
3 |
| - | |
4 |
| - | |
5 |
| - | |
| 3 | + | |
| 4 | + | |
| 5 | + | |
6 | 6 |
| |
7 | 7 |
| |
8 | 8 |
| |
|
Diff for: problems/advantage-shuffle/README.md
+3-3
Original file line number | Diff line number | Diff line change | |
---|---|---|---|
| |||
1 | 1 |
| |
2 | 2 |
| |
3 |
| - | |
4 |
| - | |
5 |
| - | |
| 3 | + | |
| 4 | + | |
| 5 | + | |
6 | 6 |
| |
7 | 7 |
| |
8 | 8 |
| |
|
+3-3
Original file line number | Diff line number | Diff line change | |
---|---|---|---|
| |||
1 | 1 |
| |
2 | 2 |
| |
3 |
| - | |
4 |
| - | |
5 |
| - | |
| 3 | + | |
| 4 | + | |
| 5 | + | |
6 | 6 |
| |
7 | 7 |
| |
8 | 8 |
| |
|
Original file line number | Diff line number | Diff line change | |
---|---|---|---|
| |||
1 | 1 |
| |
2 | 2 |
| |
3 |
| - | |
4 |
| - | |
5 |
| - | |
| 3 | + | |
| 4 | + | |
| 5 | + | |
6 | 6 |
| |
7 | 7 |
| |
8 | 8 |
| |
|
Diff for: problems/alien-dictionary/README.md
+3-3
Original file line number | Diff line number | Diff line change | |
---|---|---|---|
| |||
1 | 1 |
| |
2 | 2 |
| |
3 |
| - | |
4 |
| - | |
5 |
| - | |
| 3 | + | |
| 4 | + | |
| 5 | + | |
6 | 6 |
| |
7 | 7 |
| |
8 | 8 |
| |
|
Original file line number | Diff line number | Diff line change | |
---|---|---|---|
| |||
1 | 1 |
| |
2 | 2 |
| |
3 |
| - | |
4 |
| - | |
5 |
| - | |
| 3 | + | |
| 4 | + | |
| 5 | + | |
6 | 6 |
| |
7 | 7 |
| |
8 | 8 |
| |
|
Original file line number | Diff line number | Diff line change | |
---|---|---|---|
| |||
1 | 1 |
| |
2 | 2 |
| |
3 |
| - | |
4 |
| - | |
5 |
| - | |
| 3 | + | |
| 4 | + | |
| 5 | + | |
6 | 6 |
| |
7 | 7 |
| |
8 | 8 |
| |
|
+3-3
Original file line number | Diff line number | Diff line change | |
---|---|---|---|
| |||
1 | 1 |
| |
2 | 2 |
| |
3 |
| - | |
4 |
| - | |
5 |
| - | |
| 3 | + | |
| 4 | + | |
| 5 | + | |
6 | 6 |
| |
7 | 7 |
| |
8 | 8 |
| |
|
0 commit comments