LeetCode-Journey

KO | EN

gitlite — search

#framework #dotnet #cross-platform #shell #list #electron #mcp #go #react-native #web

LeetCode-Journey

(★ 9)

A collection of LeetCode questions to ace the coding interview!

File Explorer

ZIP Download

- 0001-two-sum.c
- README.md
- 0002-add-two-numbers.c
- README.md
- 0003-longest-substring-without-repeating-characters.java
- README.md
- 0006-zigzag-conversion.java
- README.md
- 0008-string-to-integer-atoi.java
- README.md
- 0010-regular-expression-matching.java
- README.md
- 0012-integer-to-roman.java
- README.md
- 0013-roman-to-integer.java
- README.md
- 0026-remove-duplicates-from-sorted-array.java
- README.md
- README.md
- 0028-find-the-index-of-the-first-occurrence-in-a-string.java
- README.md
- 0029-divide-two-integers.java
- README.md
- 0031-next-permutation.cpp
- README.md
- 0035-search-insert-position.java
- README.md
- 0042-trapping-rain-water.java
- README.md
- 0070-climbing-stairs.java
- README.md
- 0088-merge-sorted-array.java
- README.md
- 0100-same-tree.cpp
- README.md
- 0118-pascals-triangle.java
- README.md
- 0121-best-time-to-buy-and-sell-stock.java
- README.md
- 0125-valid-palindrome.java
- README.md
- 0133-clone-graph.java
- README.md
- 0160-intersection-of-two-linked-lists.java
- README.md
- 0169-majority-element.java
- README.md
- 0190-reverse-bits.java
- README.md
- 0191-number-of-1-bits.java
- README.md
- 0202-happy-number.java
- README.md
- 0205-isomorphic-strings.java
- README.md
- 0217-contains-duplicate.java
- README.md
- 0258-add-digits.java
- README.md
- 0263-ugly-number.java
- README.md
- 0268-missing-number.java
- README.md
- 0290-word-pattern.java
- README.md
- 0344-reverse-string.java
- README.md
- 0345-reverse-vowels-of-a-string.cpp
- README.md
- 0414-third-maximum-number.java
- README.md
- 0628-maximum-product-of-three-numbers.java
- README.md
- 0709-to-lower-case.java
- README.md
- 0796-rotate-string.java
- README.md
- 1189-maximum-number-of-balloons.java
- README.md
- 1331-rank-transform-of-an-array.cpp
- README.md
- 1732-find-the-highest-altitude.java
- README.md
- 1967-number-of-strings-that-appear-as-substrings-in-word.java
- README.md
- 1971-find-if-path-exists-in-graph.java
- README.md
- 1979-find-greatest-common-divisor-of-array.java
- README.md
- 2833-furthest-point-from-origin.java
- README.md
- 3014-minimum-number-of-pushes-to-type-word-i.java
- README.md
- 3536-maximum-product-of-two-digits.java
- README.md
- 3622-check-divisibility-by-digit-sum-and-product.java
- README.md
- 3658-gcd-of-odd-and-even-sums.cpp
- 3658-gcd-of-odd-and-even-sums.java
- README.md
- 3702-longest-subsequence-with-non-zero-bitwise-xor.java
- README.md
- 3718-smallest-missing-multiple-of-k.cpp
- README.md
- 3731-find-missing-elements.java
- README.md
- 3754-concatenate-non-zero-digits-and-multiply-by-sum-i.java
- README.md
- 3783-mirror-distance-of-an-integer.java
- README.md
- 3838-weighted-word-mapping.java
- README.md
- 3875-construct-uniform-parity-array-i.java
- README.md
- 3876-construct-uniform-parity-array-ii.java
- README.md
- 3898-find-the-degree-of-each-vertex.java
- README.md
- 3903-smallest-stable-index-i.java
- README.md
README.md
stats.json

# Use via CDN

jsDelivr

jsDelivr serves any public GitHub repository as a CDN with zero setup. Pick a version and a file to get a ready-to-paste link and snippet.

Version

File

Link

Example

// repository documentation

Was this content helpful?

★ 0 (0 ratings)

A collection of LeetCode questions to ace the coding interview! - Created using [LeetHub v2](https://github.com/arunbhardwaj/LeetHub-2.0)

# LeetCode Topics
## Array
|  |
| ------- |
| [0001-two-sum](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0001-two-sum) |
| [0026-remove-duplicates-from-sorted-array](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0026-remove-duplicates-from-sorted-array) |
| [0031-next-permutation](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0031-next-permutation) |
| [0035-search-insert-position](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0035-search-insert-position) |
| [0042-trapping-rain-water](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0042-trapping-rain-water) |
| [0088-merge-sorted-array](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0088-merge-sorted-array) |
| [0118-pascals-triangle](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0118-pascals-triangle) |
| [0121-best-time-to-buy-and-sell-stock](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0121-best-time-to-buy-and-sell-stock) |
| [0169-majority-element](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0169-majority-element) |
| [0217-contains-duplicate](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0217-contains-duplicate) |
| [0268-missing-number](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0268-missing-number) |
| [0414-third-maximum-number](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0414-third-maximum-number) |
| [0628-maximum-product-of-three-numbers](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0628-maximum-product-of-three-numbers) |
| [1331-rank-transform-of-an-array](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/1331-rank-transform-of-an-array) |
| [1732-find-the-highest-altitude](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/1732-find-the-highest-altitude) |
| [1967-number-of-strings-that-appear-as-substrings-in-word](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/1967-number-of-strings-that-appear-as-substrings-in-word) |
| [1979-find-greatest-common-divisor-of-array](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/1979-find-greatest-common-divisor-of-array) |
| [3702-longest-subsequence-with-non-zero-bitwise-xor](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/3702-longest-subsequence-with-non-zero-bitwise-xor) |
| [3718-smallest-missing-multiple-of-k](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/3718-smallest-missing-multiple-of-k) |
| [3731-find-missing-elements](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/3731-find-missing-elements) |
| [3838-weighted-word-mapping](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/3838-weighted-word-mapping) |
| [3875-construct-uniform-parity-array-i](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/3875-construct-uniform-parity-array-i) |
| [3876-construct-uniform-parity-array-ii](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/3876-construct-uniform-parity-array-ii) |
| [3898-find-the-degree-of-each-vertex](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/3898-find-the-degree-of-each-vertex) |
| [3903-smallest-stable-index-i](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/3903-smallest-stable-index-i) |
## Hash Table
|  |
| ------- |
| [0001-two-sum](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0001-two-sum) |
| [0003-longest-substring-without-repeating-characters](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0003-longest-substring-without-repeating-characters) |
| [0012-integer-to-roman](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0012-integer-to-roman) |
| [0013-roman-to-integer](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0013-roman-to-integer) |
| [0133-clone-graph](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0133-clone-graph) |
| [0160-intersection-of-two-linked-lists](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0160-intersection-of-two-linked-lists) |
| [0169-majority-element](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0169-majority-element) |
| [0202-happy-number](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0202-happy-number) |
| [0205-isomorphic-strings](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0205-isomorphic-strings) |
| [0217-contains-duplicate](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0217-contains-duplicate) |
| [0268-missing-number](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0268-missing-number) |
| [0290-word-pattern](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0290-word-pattern) |
| [1189-maximum-number-of-balloons](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/1189-maximum-number-of-balloons) |
| [1331-rank-transform-of-an-array](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/1331-rank-transform-of-an-array) |
| [3718-smallest-missing-multiple-of-k](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/3718-smallest-missing-multiple-of-k) |
| [3731-find-missing-elements](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/3731-find-missing-elements) |
## String
|  |
| ------- |
| [0003-longest-substring-without-repeating-characters](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0003-longest-substring-without-repeating-characters) |
| [0006-zigzag-conversion](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0006-zigzag-conversion) |
| [0008-string-to-integer-atoi](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0008-string-to-integer-atoi) |
| [0010-regular-expression-matching](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0010-regular-expression-matching) |
| [0012-integer-to-roman](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0012-integer-to-roman) |
| [0013-roman-to-integer](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0013-roman-to-integer) |
| [0028-find-the-index-of-the-first-occurrence-in-a-string](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0028-find-the-index-of-the-first-occurrence-in-a-string) |
| [0125-valid-palindrome](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0125-valid-palindrome) |
| [0205-isomorphic-strings](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0205-isomorphic-strings) |
| [0290-word-pattern](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0290-word-pattern) |
| [0344-reverse-string](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0344-reverse-string) |
| [0345-reverse-vowels-of-a-string](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0345-reverse-vowels-of-a-string) |
| [0709-to-lower-case](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0709-to-lower-case) |
| [0796-rotate-string](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0796-rotate-string) |
| [1189-maximum-number-of-balloons](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/1189-maximum-number-of-balloons) |
| [1967-number-of-strings-that-appear-as-substrings-in-word](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/1967-number-of-strings-that-appear-as-substrings-in-word) |
| [2833-furthest-point-from-origin](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/2833-furthest-point-from-origin) |
| [3014-minimum-number-of-pushes-to-type-word-i](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/3014-minimum-number-of-pushes-to-type-word-i) |
| [3838-weighted-word-mapping](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/3838-weighted-word-mapping) |
## Sliding Window
|  |
| ------- |
| [0003-longest-substring-without-repeating-characters](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0003-longest-substring-without-repeating-characters) |
## Two Pointers
|  |
| ------- |
| [0026-remove-duplicates-from-sorted-array](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0026-remove-duplicates-from-sorted-array) |
| [0028-find-the-index-of-the-first-occurrence-in-a-string](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0028-find-the-index-of-the-first-occurrence-in-a-string) |
| [0031-next-permutation](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0031-next-permutation) |
| [0042-trapping-rain-water](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0042-trapping-rain-water) |
| [0088-merge-sorted-array](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0088-merge-sorted-array) |
| [0125-valid-palindrome](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0125-valid-palindrome) |
| [0160-intersection-of-two-linked-lists](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0160-intersection-of-two-linked-lists) |
| [0202-happy-number](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0202-happy-number) |
| [0344-reverse-string](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0344-reverse-string) |
| [0345-reverse-vowels-of-a-string](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0345-reverse-vowels-of-a-string) |
## Prefix Sum
|  |
| ------- |
| [1732-find-the-highest-altitude](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/1732-find-the-highest-altitude) |
| [3903-smallest-stable-index-i](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/3903-smallest-stable-index-i) |
## Math
|  |
| ------- |
| [0002-add-two-numbers](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0002-add-two-numbers) |
| [0012-integer-to-roman](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0012-integer-to-roman) |
| [0013-roman-to-integer](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0013-roman-to-integer) |
| [0029-divide-two-integers](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0029-divide-two-integers) |
| [0070-climbing-stairs](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0070-climbing-stairs) |
| [0202-happy-number](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0202-happy-number) |
| [0258-add-digits](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0258-add-digits) |
| [0263-ugly-number](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0263-ugly-number) |
| [0268-missing-number](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0268-missing-number) |
| [0628-maximum-product-of-three-numbers](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0628-maximum-product-of-three-numbers) |
| [1979-find-greatest-common-divisor-of-array](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/1979-find-greatest-common-divisor-of-array) |
| [3014-minimum-number-of-pushes-to-type-word-i](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/3014-minimum-number-of-pushes-to-type-word-i) |
| [3536-maximum-product-of-two-digits](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/3536-maximum-product-of-two-digits) |
| [3622-check-divisibility-by-digit-sum-and-product](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/3622-check-divisibility-by-digit-sum-and-product) |
| [3658-gcd-of-odd-and-even-sums](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/3658-gcd-of-odd-and-even-sums) |
| [3754-concatenate-non-zero-digits-and-multiply-by-sum-i](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/3754-concatenate-non-zero-digits-and-multiply-by-sum-i) |
| [3783-mirror-distance-of-an-integer](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/3783-mirror-distance-of-an-integer) |
| [3875-construct-uniform-parity-array-i](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/3875-construct-uniform-parity-array-i) |
| [3876-construct-uniform-parity-array-ii](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/3876-construct-uniform-parity-array-ii) |
## Depth-First Search
|  |
| ------- |
| [0100-same-tree](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0100-same-tree) |
| [0133-clone-graph](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0133-clone-graph) |
| [1971-find-if-path-exists-in-graph](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/1971-find-if-path-exists-in-graph) |
## Breadth-First Search
|  |
| ------- |
| [0100-same-tree](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0100-same-tree) |
| [0133-clone-graph](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0133-clone-graph) |
| [1971-find-if-path-exists-in-graph](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/1971-find-if-path-exists-in-graph) |
## Graph Theory
|  |
| ------- |
| [0133-clone-graph](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0133-clone-graph) |
| [1971-find-if-path-exists-in-graph](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/1971-find-if-path-exists-in-graph) |
| [3898-find-the-degree-of-each-vertex](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/3898-find-the-degree-of-each-vertex) |
## Dynamic Programming
|  |
| ------- |
| [0010-regular-expression-matching](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0010-regular-expression-matching) |
| [0042-trapping-rain-water](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0042-trapping-rain-water) |
| [0070-climbing-stairs](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0070-climbing-stairs) |
| [0118-pascals-triangle](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0118-pascals-triangle) |
| [0121-best-time-to-buy-and-sell-stock](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0121-best-time-to-buy-and-sell-stock) |
## Union-Find
|  |
| ------- |
| [1971-find-if-path-exists-in-graph](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/1971-find-if-path-exists-in-graph) |
## Matrix
|  |
| ------- |
| [3898-find-the-degree-of-each-vertex](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/3898-find-the-degree-of-each-vertex) |
## Recursion
|  |
| ------- |
| [0002-add-two-numbers](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0002-add-two-numbers) |
| [0010-regular-expression-matching](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0010-regular-expression-matching) |
## String Matching
|  |
| ------- |
| [0028-find-the-index-of-the-first-occurrence-in-a-string](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0028-find-the-index-of-the-first-occurrence-in-a-string) |
| [0796-rotate-string](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0796-rotate-string) |
## Binary Search
|  |
| ------- |
| [0035-search-insert-position](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0035-search-insert-position) |
| [0268-missing-number](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0268-missing-number) |
## Bit Manipulation
|  |
| ------- |
| [0029-divide-two-integers](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0029-divide-two-integers) |
| [0190-reverse-bits](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0190-reverse-bits) |
| [0191-number-of-1-bits](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0191-number-of-1-bits) |
| [0268-missing-number](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0268-missing-number) |
| [3702-longest-subsequence-with-non-zero-bitwise-xor](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/3702-longest-subsequence-with-non-zero-bitwise-xor) |
## Memoization
|  |
| ------- |
| [0070-climbing-stairs](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0070-climbing-stairs) |
## Sorting
|  |
| ------- |
| [0088-merge-sorted-array](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0088-merge-sorted-array) |
| [0169-majority-element](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0169-majority-element) |
| [0217-contains-duplicate](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0217-contains-duplicate) |
| [0268-missing-number](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0268-missing-number) |
| [0414-third-maximum-number](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0414-third-maximum-number) |
| [0628-maximum-product-of-three-numbers](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0628-maximum-product-of-three-numbers) |
| [1331-rank-transform-of-an-array](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/1331-rank-transform-of-an-array) |
| [3536-maximum-product-of-two-digits](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/3536-maximum-product-of-two-digits) |
| [3731-find-missing-elements](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/3731-find-missing-elements) |
## Divide and Conquer
|  |
| ------- |
| [0169-majority-element](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0169-majority-element) |
| [0190-reverse-bits](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0190-reverse-bits) |
| [0191-number-of-1-bits](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0191-number-of-1-bits) |
## Counting
|  |
| ------- |
| [0169-majority-element](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0169-majority-element) |
| [1189-maximum-number-of-balloons](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/1189-maximum-number-of-balloons) |
| [2833-furthest-point-from-origin](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/2833-furthest-point-from-origin) |
## Simulation
|  |
| ------- |
| [0258-add-digits](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0258-add-digits) |
| [3838-weighted-word-mapping](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/3838-weighted-word-mapping) |
## Linked List
|  |
| ------- |
| [0002-add-two-numbers](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0002-add-two-numbers) |
| [0160-intersection-of-two-linked-lists](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0160-intersection-of-two-linked-lists) |
## Number Theory
|  |
| ------- |
| [0258-add-digits](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0258-add-digits) |
| [1979-find-greatest-common-divisor-of-array](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/1979-find-greatest-common-divisor-of-array) |
| [3658-gcd-of-odd-and-even-sums](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/3658-gcd-of-odd-and-even-sums) |
## Tree
|  |
| ------- |
| [0100-same-tree](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0100-same-tree) |
## Binary Tree
|  |
| ------- |
| [0100-same-tree](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0100-same-tree) |
## Floyd's Cycle Finding Algorithm
|  |
| ------- |
| [0202-happy-number](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0202-happy-number) |
## Greedy
|  |
| ------- |
| [3014-minimum-number-of-pushes-to-type-word-i](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/3014-minimum-number-of-pushes-to-type-word-i) |
## Stack
|  |
| ------- |
| [0042-trapping-rain-water](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0042-trapping-rain-water) |
## Monotonic Stack
|  |
| ------- |
| [0042-trapping-rain-water](https://github.com/raghvendrasingh-01/LeetCode-Journey/tree/master/0042-trapping-rain-water) |

LeetCode-Journey

Owner Repos

File Explorer

# Use via CDN

Was this content helpful?

Recent Feedback

LeetCode-Journey

Owner Repos

File Explorer

# Use via CDN

Was this content helpful?

Recent Feedback

Download README