An open API service indexing awesome lists of open source software.

https://github.com/neetcode-gh/leetcode

Leetcode solutions
https://github.com/neetcode-gh/leetcode

Last synced: 8 months ago
JSON representation

Leetcode solutions

Awesome Lists containing this project

README

          

# Leetcode solutions for 🚀 [NeetCode.io](https://neetcode.io)

> This repo hosts the solutions found on [NeetCode.io](https://neetcode.io) including the solutions shown on the [NeetCode YouTube channel](https://www.youtube.com/c/neetcode). The site will periodically be updated with new solutions from this repo!


Solutions from these languages will be linked from [NeetCode.io](https://neetcode.io):

> Python, Java, JavaScript, C++, Go, Swift, C#, TypeScript, Rust, Kotlin, Ruby, C, Scala and Dart

Solutions are also welcome for any other _supported_ language on leetcode.com!

## Contributing

**Please read the [contributing guidlines](./CONTRIBUTING.md) before opening a PR**

To contribute, please fork this repo and open a PR adding a [missing solution](#missing-solutions) from the supported languages.

If you would like to have collaborator permissions on the repo to merge your own PRs or review others' PRs please let me know.

## Credits



## Missing Solutions

### Arrays & Hashing

Problem | articles | C | C++ | C# | Dart | GO | hints | Java | JS | Kotlin | Python | Ruby | Rust | Scala | Swift | TS
---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ----
[0217 - Contains Duplicate](https://leetcode.com/problems/contains-duplicate/) |

|
[✔️](c%2F0217-contains-duplicate.c)
|
[✔️](cpp%2F0217-contains-duplicate.cpp)
|
[✔️](csharp%2F0217-contains-duplicate.cs)
|
[✔️](dart%2F0217-contains-duplicate.dart)
|
[✔️](go%2F0217-contains-duplicate.go)
|
|
[✔️](java%2F0217-contains-duplicate.java)
|
[✔️](javascript%2F0217-contains-duplicate.js)
|
[✔️](kotlin%2F0217-contains-duplicate.kt)
|
[✔️](python%2F0217-contains-duplicate.py)
|
[✔️](ruby%2F0217-contains-duplicate.rb)
|
[✔️](rust%2F0217-contains-duplicate.rs)
|
[✔️](scala%2F0217-contains-duplicate.scala)
|
[✔️](swift%2F0217-contains-duplicate.swift)
|
[✔️](typescript%2F0217-contains-duplicate.ts)

[0242 - Valid Anagram](https://leetcode.com/problems/valid-anagram/) |
|
[✔️](c%2F0242-valid-anagram.c)
|
[✔️](cpp%2F0242-valid-anagram.cpp)
|
[✔️](csharp%2F0242-valid-anagram.cs)
|
[✔️](dart%2F0242-valid-anagram.dart)
|
[✔️](go%2F0242-valid-anagram.go)
|
|
[✔️](java%2F0242-valid-anagram.java)
|
[✔️](javascript%2F0242-valid-anagram.js)
|
[✔️](kotlin%2F0242-valid-anagram.kt)
|
[✔️](python%2F0242-valid-anagram.py)
|
[✔️](ruby%2F0242-valid-anagram.rb)
|
[✔️](rust%2F0242-valid-anagram.rs)
|
[✔️](scala%2F0242-valid-anagram.scala)
|
[✔️](swift%2F0242-valid-anagram.swift)
|
[✔️](typescript%2F0242-valid-anagram.ts)

[1929 - Concatenation of Array](https://leetcode.com/problems/concatenation-of-array/) |
|
[✔️](c%2F1929-concatenation-of-array.c)
|
[✔️](cpp%2F1929-concatenation-of-array.cpp)
|
[✔️](csharp%2F1929-concatenation-of-array.cs)
|
[✔️](dart%2F1929-concatenation-of-array.dart)
|
[✔️](go%2F1929-concatenation-of-array.go)
|
|
[✔️](java%2F1929-concatenation-of-array.java)
|
[✔️](javascript%2F1929-concatenation-of-array.js)
|
[✔️](kotlin%2F1929-concatenation-of-array.kt)
|
[✔️](python%2F1929-concatenation-of-array.py)
|
[✔️](ruby%2F1929-concatenation-of-array.rb)
|
[✔️](rust%2F1929-concatenation-of-array.rs)
|
[✔️](scala%2F1929-concatenation-of-array.scala)
|
[✔️](swift%2F1929-concatenation-of-array.swift)
|
[✔️](typescript%2F1929-concatenation-of-array.ts)

[1299 - Replace Elements With Greatest Element On Right Side](https://leetcode.com/problems/replace-elements-with-greatest-element-on-right-side/) |
|
[✔️](c%2F1299-Replace-Elements-With-Greatest-Element-On-Right-Side.c)
|
[✔️](cpp%2F1299-Replace-Elements-with-Greatest-Element-on-Right-Side.cpp)
|
[✔️](csharp%2F1299-Replace-Elements-With-Greatest-Element-On-Right-Side.cs)
|
[✔️](dart%2F1299-replace-elements-with-greatest-element-on-right-side.dart)
|
[✔️](go%2F1299-Replace-Elements-With-Greatest-Element-On-Right-Side.go)
|
|
[✔️](java%2F1299-Replace-Elements-With-Greatest-Element-On-Right-Side.java)
|
[✔️](javascript%2F1299-Replace-Elements-with-Greatest-Element-on-Right-Side.js)
|
[✔️](kotlin%2F1299-replace-elements-with-greatest-element-on-right-side.kt)
|
[✔️](python%2F1299-replace-elements-with-greatest-element-on-right-side.py)
|
[✔️](ruby%2F1299-replace-elements-with-greatest-element-on-right-side.rb)
|
[✔️](rust%2F1299-Replace-Elements-With-Greatest-Element-On-Right-Side.rs)
|
|
[✔️](swift%2F1299-replace-elements-with-greatest-element-on-right-side.swift)
|
[✔️](typescript%2F1299-Replace-Elements-With-Greatest-Element-On-Right-Side.ts)

[0392 - Is Subsequence](https://leetcode.com/problems/is-subsequence/) |
|
[✔️](c%2F0392-is-subsequence.c)
|
[✔️](cpp%2F0392-is-subsequence.cpp)
|
[✔️](csharp%2F0392-is-subsequence.cs)
|
[✔️](dart%2F0392-is-subsequence.dart)
|
[✔️](go%2F0392-is-subsequence.go)
|
|
[✔️](java%2F0392-is-subsequence.java)
|
[✔️](javascript%2F0392-is-subsequence.js)
|
[✔️](kotlin%2F0392-is-subsequence.kt)
|
[✔️](python%2F0392-is-subsequence.py)
|
[✔️](ruby%2F0392-is-subsequence.rb)
|
[✔️](rust%2F0392-is-subsequence.rs)
|
|
[✔️](swift%2F0392-is-subsequence.swift)
|
[✔️](typescript%2F0392-is-subsequence.ts)

[0058 - Length of Last Word](https://leetcode.com/problems/length-of-last-word/) |
|
[✔️](c%2F0058-length-of-last-word.c)
|
[✔️](cpp%2F0058-length-of-last-word.cpp)
|
[✔️](csharp%2F0058-length-of-last-word.cs)
|
[✔️](dart%2F0058-length-of-last-word.dart)
|
[✔️](go%2F0058-Length-of-Last-Word.go)
|
|
[✔️](java%2F0058-length-of-last-word.java)
|
[✔️](javascript%2F0058-length-of-last-word.js)
|
[✔️](kotlin%2F0058-length-of-last-word.kt)
|
[✔️](python%2F0058-length-of-last-word.py)
|
[✔️](ruby%2F0058-length-of-last-word.rb)
|
[✔️](rust%2F0058-length-of-last-word.rs)
|
[✔️](scala%2F0058-length-of-last-word.scala)
|
[✔️](swift%2F0058-Length-of-Last-Word.swift)
|
[✔️](typescript%2F0058-length-of-last-word.ts)

[0001 - Two Sum](https://leetcode.com/problems/two-sum/) |
|
[✔️](c%2F0001-two-sum.c)
|
[✔️](cpp%2F0001-two-sum.cpp)
|
[✔️](csharp%2F0001-two-sum.cs)
|
[✔️](dart%2F0001-two-sum.dart)
|
[✔️](go%2F0001-two-sum.go)
|
|
[✔️](java%2F0001-two-sum.java)
|
[✔️](javascript%2F0001-two-sum.js)
|
[✔️](kotlin%2F0001-two-sum.kt)
|
[✔️](python%2F0001-two-sum.py)
|
[✔️](ruby%2F0001-two-sum.rb)
|
[✔️](rust%2F0001-two-sum.rs)
|
[✔️](scala%2F0001-two-sum.scala)
|
[✔️](swift%2F0001-two-sum.swift)
|
[✔️](typescript%2F0001-two-sum.ts)

[0014 - Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix/) |
|
[✔️](c%2F0014-Longest-Common-Prefix.c)
|
[✔️](cpp%2F0014-longest-common-prefix.cpp)
|
[✔️](csharp%2F0014-longest-common-prefix.cs)
|
[✔️](dart%2F0014-longest-common-prefix.dart)
|
[✔️](go%2F0014-longest-common-prefix.go)
|
|
[✔️](java%2F0014-longest-common-prefix.java)
|
[✔️](javascript%2F0014-longest-common-prefix.js)
|
[✔️](kotlin%2F0014-longest-common-prefix.kt)
|
[✔️](python%2F0014-longest-common-prefix.py)
|
|
[✔️](rust%2F0014-longest-common-prefix.rs)
|
|
[✔️](swift%2F0014-longest-common-prefix.swift)
|
[✔️](typescript%2F0014-longest-common-prefix.ts)

[0049 - Group Anagrams](https://leetcode.com/problems/group-anagrams/) |
|
[✔️](c%2F0049-group-anagrams.c)
|
[✔️](cpp%2F0049-group-anagrams.cpp)
|
[✔️](csharp%2F0049-group-anagrams.cs)
|
[✔️](dart%2F0049-group-anagrams.dart)
|
[✔️](go%2F0049-group-anagrams.go)
|
|
[✔️](java%2F0049-group-anagrams.java)
|
[✔️](javascript%2F0049-group-anagrams.js)
|
[✔️](kotlin%2F0049-group-anagrams.kt)
|
[✔️](python%2F0049-group-anagrams.py)
|
[✔️](ruby%2F0049-group-anagrams.rb)
|
[✔️](rust%2F0049-group-anagrams.rs)
|
[✔️](scala%2F0049-group-anagrams.scala)
|
[✔️](swift%2F0049-group-anagrams.swift)
|
[✔️](typescript%2F0049-group-anagrams.ts)

[0118 - Pascals Triangle](https://leetcode.com/problems/pascals-triangle/) |
|
[✔️](c%2F0118-pascals-triangle.c)
|
[✔️](cpp%2F0118-pascals-triangle.cpp)
|
[✔️](csharp%2F0118-pascals-triangle.cs)
|
[✔️](dart%2F0118-pascals-triangle.dart)
|
[✔️](go%2F0118-pascals-triangle.go)
|
|
[✔️](java%2F0118-pascals-triangle.java)
|
[✔️](javascript%2F0118-pascals-triangle.js)
|
[✔️](kotlin%2F0118-pascals-triangle.kt)
|
[✔️](python%2F0118-pascals-triangle.py)
|
|
[✔️](rust%2F0118-pascals-triangle.rs)
|
|
|
[✔️](typescript%2F0118-pascals-triangle.ts)

[0027 - Remove Element](https://leetcode.com/problems/remove-element/) |
|
[✔️](c%2F0027-remove-element.c)
|
[✔️](cpp%2F0027-remove-element.cpp)
|
[✔️](csharp%2F0027-remove-element.cs)
|
[✔️](dart%2F0027-remove-element.dart)
|
[✔️](go%2F0027-remove-element.go)
|
|
[✔️](java%2F0027-remove-element.java)
|
[✔️](javascript%2F0027-remove-element.js)
|
[✔️](kotlin%2F0027-remove-element.kt)
|
[✔️](python%2F0027-remove-element.py)
|
|
[✔️](rust%2F0027-remove-element.rs)
|
|
[✔️](swift%2F0027-Remove-Element.swift)
|
[✔️](typescript%2F0027-remove-element.ts)

[0929 - Unique Email Addresses](https://leetcode.com/problems/unique-email-addresses/) |
|
[✔️](c%2F0929-unique-email-addresses.c)
|
[✔️](cpp%2F0929-unique-email-addresses.cpp)
|
[✔️](csharp%2F0929-unique-email-addresses.cs)
|
[✔️](dart%2F0929-unique-email-addresses.dart)
|
[✔️](go%2F0929-unique-email-addresses.go)
|
|
[✔️](java%2F0929-unique-email-addresses.java)
|
[✔️](javascript%2F0929-unique-email-addresses.js)
|
[✔️](kotlin%2F0929-unique-email-addresses.kt)
|
[✔️](python%2F0929-unique-email-addresses.py)
|
|
[✔️](rust%2F0929-unique-email-addresses.rs)
|
|
[✔️](swift%2F0929-unique-email-addresses.swift)
|
[✔️](typescript%2F0929-unique-email-addresses.ts)

[0205 - Isomorphic Strings](https://leetcode.com/problems/isomorphic-strings/) |
|
[✔️](c%2F0205-isomorphic-strings.c)
|
[✔️](cpp%2F0205-Isomorphic-Strings.cpp)
|
[✔️](csharp%2F0205-isomorphic-strings.cs)
|
|
[✔️](go%2F0205-isomorphic-strings.go)
|
|
[✔️](java%2F0205-isomorphic-strings.java)
|
[✔️](javascript%2F0205-isomorphic-strings.js)
|
[✔️](kotlin%2F0205-isomorphic-strings.kt)
|
[✔️](python%2F0205-isomorphic-strings.py)
|
|
[✔️](rust%2F0205-isomorphic-strings.rs)
|
|
[✔️](swift%2F0205-isomorphic-strings.swift)
|
[✔️](typescript%2F0205-isomorphic-strings.ts)

[0605 - Can Place Flowers](https://leetcode.com/problems/can-place-flowers/) |
|
[✔️](c%2F0605-can-place-flowers.c)
|
[✔️](cpp%2F0605-can-place-flowers.cpp)
|
[✔️](csharp%2F0605-can-place-flowers.cs)
|
|
[✔️](go%2F0605-can-place-flowers.go)
|
|
[✔️](java%2F0605-can-place-flowers.java)
|
[✔️](javascript%2F0605-can-place-flowers.js)
|
[✔️](kotlin%2F0605-can-place-flowers.kt)
|
[✔️](python%2F0605-can-place-flowers.py)
|
|
[✔️](rust%2F0605-can-place-flowers.rs)
|
|
[✔️](swift%2F0605-can-place-flowers.swift)
|
[✔️](typescript%2F0605-can-place-flowers.ts)

[0169 - Majority Element](https://leetcode.com/problems/majority-element/) |
|
[✔️](c%2F0169-majority-element.c)
|
[✔️](cpp%2F0169-majority-element.cpp)
|
[✔️](csharp%2F0169-majority-element.cs)
|
[✔️](dart%2F0169-majority-element.dart)
|
[✔️](go%2F0169-majority-element.go)
|
|
[✔️](java%2F0169-majority-element.java)
|
[✔️](javascript%2F0169-majority-element.js)
|
[✔️](kotlin%2F0169-majority-element.kt)
|
[✔️](python%2F0169-majority-element.py)
|
|
[✔️](rust%2F0169-majority-element.rs)
|
|
[✔️](swift%2F0169-majority-element.swift)
|
[✔️](typescript%2F0169-majority-element.ts)

[0496 - Next Greater Element I](https://leetcode.com/problems/next-greater-element-i/) |
|
[✔️](c%2F0496-next-greater-element-i.c)
|
[✔️](cpp%2F0496-next-greater-element-i.cpp)
|
[✔️](csharp%2F0496-next-greater-element-i.cs)
|
|
[✔️](go%2F0496-next-greater-element-i.go)
|
|
[✔️](java%2F0496-next-greater-element-i.java)
|
[✔️](javascript%2F0496-next-greater-element-i.js)
|
[✔️](kotlin%2F0496-next-greater-element-i.kt)
|
[✔️](python%2F0496-next-greater-element-i.py)
|
|
[✔️](rust%2F0496-next-greater-element-I.rs)
|
|
|
[✔️](typescript%2F0496-next-greater-element-i.ts)

[0724 - Find Pivot Index](https://leetcode.com/problems/find-pivot-index/) |
|
[✔️](c%2F0724-find-pivot-index.c)
|
[✔️](cpp%2F0724-find-pivot-index.cpp)
|
[✔️](csharp%2F0724-find-pivot-index.cs)
|
|
[✔️](go%2F0724-find-pivot-index.go)
|
|
[✔️](java%2F0724-find-pivot-index.java)
|
[✔️](javascript%2F0724-find-pivot-index.js)
|
[✔️](kotlin%2F0724-find-pivot-index.kt)
|
[✔️](python%2F0724-find-pivot-index.py)
|
|
[✔️](rust%2F0724-find-pivot-index.rs)
|
|
[✔️](swift%2F0724-find-pivot-index.swift)
|
[✔️](typescript%2F0724-find-pivot-index.ts)

[0303 - Range Sum Query - Immutable](https://leetcode.com/problems/range-sum-query-immutable/) |
|
[✔️](c%2F0303-range-sum-query-immutable.c)
|
[✔️](cpp%2F0303-range-sum-query-immutable.cpp)
|
[✔️](csharp%2F0303-range-sum-query-immutable.cs)
|
|
[✔️](go%2F0303-range-sum-query.go)
|
|
[✔️](java%2F0303-range-sum-query-immutable.java)
|
[✔️](javascript%2F0303-range-sum-query-immutable.js)
|
[✔️](kotlin%2F0303-range-sum-query-immutable.kt)
|
[✔️](python%2F0303-range-sum-query-immutable.py)
|
|
[✔️](rust%2F0303-range-sum-query-immutable.rs)
|
|
[✔️](swift%2F0303-range-sum-query-immutable.swift)
|
[✔️](typescript%2F0303-range-sum-query-immutable.ts)

[0448 - Find All Numbers Disappeared in An Array](https://leetcode.com/problems/find-all-numbers-disappeared-in-an-array/) |
|
[✔️](c%2F0448-Find-All-Numbers-Disappeared-in-an-Array.c)
|
[✔️](cpp%2F0448-find-all-numbers-disappeared-in-an-array.cpp)
|
[✔️](csharp%2F0448-find-all-numbers-disappeared-in-an-array.cs)
|
|
[✔️](go%2F0448-find-all-numbers-disappeared-in-an-array.go)
|
|
[✔️](java%2F0448-find-all-numbers-disappeared-in-an-array.java)
|
[✔️](javascript%2F0448-find-all-numbers-disappeared-in-an-array.js)
|
[✔️](kotlin%2F0448-find-all-numbers-disappeared-in-an-array.kt)
|
[✔️](python%2F0448-find-all-numbers-disappeared-in-an-array.py)
|
|
[✔️](rust%2F0448-find-all-numbers-disappeared-in-an-array.rs)
|
|
|
[✔️](typescript%2F0448-find-all-numbers-disappeared-in-an-array.ts)

[1189 - Maximum Number of Balloons](https://leetcode.com/problems/maximum-number-of-balloons/) |
|
[✔️](c%2F1189-Maximum-Number-of-Balloons.c)
|
[✔️](cpp%2F1189-maximum-number-of-balloons.cpp)
|
[✔️](csharp%2F1189-maximum-number-of-balloons.cs)
|
|
[✔️](go%2F1189-maximum-number-of-balloons.go)
|
|
[✔️](java%2F1189-maximum-number-of-balloons.java)
|
[✔️](javascript%2F1189-maximum-number-of-balloons.js)
|
[✔️](kotlin%2F1189-maximum-number-of-balloons.kt)
|
[✔️](python%2F1189-maximum-number-of-balloons.py)
|
|
[✔️](rust%2F1189-maximum-number-of-balloons.rs)
|
|
|
[✔️](typescript%2F1189-maximum-number-of-balloons.ts)

[0290 - Word Pattern](https://leetcode.com/problems/word-pattern/) |
|
[✔️](c%2F0290-Word-Pattern.c)
|
[✔️](cpp%2F0290-word-pattern.cpp)
|
[✔️](csharp%2F0290-word-pattern.cs)
|
|
[✔️](go%2F0290-word-pattern.go)
|
|
[✔️](java%2F0290-word-pattern.java)
|
[✔️](javascript%2F0290-word-pattern.js)
|
[✔️](kotlin%2F0290-word-pattern.kt)
|
[✔️](python%2F0290-word-pattern.py)
|
|
[✔️](rust%2F0290-word-pattern.rs)
|
|
|
[✔️](typescript%2F0290-word-pattern.ts)

[0705 - Design HashSet](https://leetcode.com/problems/design-hashset/) |
|
[✔️](c%2F0705-design-hashset.c)
|
[✔️](cpp%2F0705-design-hashset.cpp)
|
[✔️](csharp%2F0705-design-hashset.cs)
|
|
|
|
[✔️](java%2F0705-design-hashset.java)
|
[✔️](javascript%2F0705-design-hashset.js)
|
[✔️](kotlin%2F0705-design-hashset.kt)
|
[✔️](python%2F0705-design-hashset.py)
|
|
[✔️](rust%2F0705-design-hashset.rs)
|
|
[✔️](swift%2F0705-design-hashset.swift)
|
[✔️](typescript%2F0705-design-hashset.ts)

[0706 - Design HashMap](https://leetcode.com/problems/design-hashmap/) |
|
[✔️](c%2F0706-design-hashmap.c)
|
[✔️](cpp%2F0706-design-hashmap.cpp)
|
[✔️](csharp%2F0706-design-hashmap.cs)
|
|
[✔️](go%2F0706-design-hashmap.go)
|
|
[✔️](java%2F0706-design-hashmap.java)
|
[✔️](javascript%2F0706-design-hashmap.js)
|
[✔️](kotlin%2F0706-design-hashmap.kt)
|
[✔️](python%2F0706-design-hashmap.py)
|
|
[✔️](rust%2F0706-design-hashmap.rs)
|
|
[✔️](swift%2F0706-design-hashmap.swift)
|

[0912 - Sort an Array](https://leetcode.com/problems/sort-an-array/) |
|
[✔️](c%2F0912-sort-an-array.c)
|
[✔️](cpp%2F0912-sort-an-array.cpp)
|
[✔️](csharp%2F0912-sort-an-array.cs)
|
|
[✔️](go%2F0912-sort-an-array.go)
|
|
[✔️](java%2F0912-sort-an-array.java)
|
[✔️](javascript%2F0912-sort-an-array.js)
|
[✔️](kotlin%2F0912-sort-an-array.kt)
|
[✔️](python%2F0912-sort-an-array.py)
|
|
[✔️](rust%2F0912-sort-an-array.rs)
|
|
[✔️](swift%2F0912-sort-an-array.swift)
|

[0347 - Top K Frequent Elements](https://leetcode.com/problems/top-k-frequent-elements/) |
|
[✔️](c%2F0347-top-k-frequent-elements.c)
|
[✔️](cpp%2F0347-top-k-frequent-elements.cpp)
|
[✔️](csharp%2F0347-top-k-frequent-elements.cs)
|
[✔️](dart%2F0347-top-k-frequent-elements.dart)
|
[✔️](go%2F0347-top-k-frequent-elements.go)
|
|
[✔️](java%2F0347-top-k-frequent-elements.java)
|
[✔️](javascript%2F0347-top-k-frequent-elements.js)
|
[✔️](kotlin%2F0347-top-k-frequent-elements.kt)
|
[✔️](python%2F0347-top-k-frequent-elements.py)
|
[✔️](ruby%2F0347-top-k-frequent-elements.rb)
|
[✔️](rust%2F0347-top-k-frequent-elements.rs)
|
[✔️](scala%2F0347-top-k-frequent-elements.scala)
|
[✔️](swift%2F0347-top-k-frequent-elements.swift)
|
[✔️](typescript%2F0347-top-k-frequent-elements.ts)

[0238 - Product of Array Except Self](https://leetcode.com/problems/product-of-array-except-self/) |
|
[✔️](c%2F0238-product-of-array-except-self.c)
|
[✔️](cpp%2F0238-product-of-array-except-self.cpp)
|
[✔️](csharp%2F0238-product-of-array-except-self.cs)
|
|
[✔️](go%2F0238-product-of-array-except-self.go)
|
|
[✔️](java%2F0238-product-of-array-except-self.java)
|
[✔️](javascript%2F0238-product-of-array-except-self.js)
|
[✔️](kotlin%2F0238-product-of-array-except-self.kt)
|
[✔️](python%2F0238-product-of-array-except-self.py)
|
[✔️](ruby%2F0238-product-of-array-except-self.rb)
|
[✔️](rust%2F0238-product-of-array-except-self.rs)
|
|
[✔️](swift%2F0238-product-of-array-except-self.swift)
|
[✔️](typescript%2F0238-product-of-array-except-self.ts)

[0036 - Valid Sudoku](https://leetcode.com/problems/valid-sudoku/) |
|
[✔️](c%2F0036-valid-sudoku.c)
|
[✔️](cpp%2F0036-valid-sudoku.cpp)
|
[✔️](csharp%2F0036-valid-sudoku.cs)
|
[✔️](dart%2F0036-valid-sudoku.dart)
|
[✔️](go%2F0036-valid-sudoku.go)
|
|
[✔️](java%2F0036-valid-sudoku.java)
|
[✔️](javascript%2F0036-valid-sudoku.js)
|
[✔️](kotlin%2F0036-valid-sudoku.kt)
|
[✔️](python%2F0036-valid-sudoku.py)
|
[✔️](ruby%2F0036-valid-sudoku.rb)
|
[✔️](rust%2F0036-valid-sudoku.rs)
|
[✔️](scala%2F0036-valid-sudoku.scala)
|
|
[✔️](typescript%2F0036-valid-sudoku.ts)

[0271 - Encode and Decode Strings](https://leetcode.com/problems/encode-and-decode-strings/) |
|
|
[✔️](cpp%2F0271-encode-and-decode-strings.cpp)
|
[✔️](csharp%2F0271-encode-and-decode-strings.cs)
|
|
[✔️](go%2F0271-encode-and-decode-strings.go)
|
|
[✔️](java%2F0271-encode-and-decode-strings.java)
|
[✔️](javascript%2F0271-encode-and-decode-strings.js)
|
[✔️](kotlin%2F0271-encode-and-decode-strings.kt)
|
[✔️](python%2F0271-encode-and-decode-strings.py)
|
[✔️](ruby%2F0271-encode-and-decode-strings.rb)
|
[✔️](rust%2F0271-encode-and-decode-strings.rs)
|
|
[✔️](swift%2F0271-encode-and-decode-strings.swift)
|
[✔️](typescript%2F0271-encode-and-decode-strings.ts)

[0128 - Longest Consecutive Sequence](https://leetcode.com/problems/longest-consecutive-sequence/) |
|
[✔️](c%2F0128-longest-consecutive-sequence.c)
|
[✔️](cpp%2F0128-longest-consecutive-sequence.cpp)
|
[✔️](csharp%2F0128-longest-consecutive-sequence.cs)
|
|
[✔️](go%2F0128-longest-consecutive-sequence.go)
|
|
[✔️](java%2F0128-longest-consecutive-sequence.java)
|
[✔️](javascript%2F0128-longest-consecutive-sequence.js)
|
[✔️](kotlin%2F0128-longest-consecutive-sequence.kt)
|
[✔️](python%2F0128-longest-consecutive-sequence.py)
|
[✔️](ruby%2F0128-longest-consecutive-sequence.rb)
|
[✔️](rust%2F0128-longest-consecutive-sequence.rs)
|
|
[✔️](swift%2F0128-longest-consecutive-sequence.swift)
|
[✔️](typescript%2F0128-longest-consecutive-sequence.ts)

[0075 - Sort Colors](https://leetcode.com/problems/sort-colors/) |
|
[✔️](c%2F0075-sort-colors.c)
|
[✔️](cpp%2F0075-Sort-colors.cpp)
|
[✔️](csharp%2F0075-sort-colors.cs)
|
|
[✔️](go%2F0075-sort-colors.go)
|
|
[✔️](java%2F0075-sort-colors.java)
|
[✔️](javascript%2F0075-sort-colors.js)
|
[✔️](kotlin%2F0075-sort-colors.kt)
|
[✔️](python%2F0075-sort-colors.py)
|
|
[✔️](rust%2F0075-sort-colors.rs)
|
|
[✔️](swift%2F0075-sort-colors.swift)
|
[✔️](typescript%2F0075-sort-colors.ts)

[0535 - Encode and Decode TinyURL](https://leetcode.com/problems/encode-and-decode-tinyurl/) |
|
[✔️](c%2F0535-encode-and-decode-tinyurl.c)
|
[✔️](cpp%2F0535-encode-and-decode-tinyurl.cpp)
|
[✔️](csharp%2F0535-encode-and-decode-tinyurl.cs)
|
|
[✔️](go%2F0535-encode-and-decode-tinyurl.go)
|
|
[✔️](java%2F0535-encode-and-decode-tinyurl.java)
|
[✔️](javascript%2F0535-encode-and-decode-tinyurl.js)
|
[✔️](kotlin%2F0535-encode-and-decode-tinyurl.kt)
|
[✔️](python%2F0535-encode-and-decode-tinyurl.py)
|
|
[✔️](rust%2F0535-encode-and-decode-tinyURL.rs)
|
|
[✔️](swift%2F0535-Encode-and-Decode-TinyURL.Swift)
|
[✔️](typescript%2F0535-encode-and-decode-tinyurl.ts)

[0554 - Brick Wall](https://leetcode.com/problems/brick-wall/) |
|
[✔️](c%2F0554-Brick-Wall.c)
|
[✔️](cpp%2F0554-brick-wall.cpp)
|
[✔️](csharp%2F0554-brick-wall.cs)
|
|
[✔️](go%2F0554-brick-wall.go)
|
|
[✔️](java%2F0554-brick-wall.java)
|
[✔️](javascript%2F0554-brick-wall.js)
|
[✔️](kotlin%2F0554-brick-wall.kt)
|
[✔️](python%2F0554-brick-wall.py)
|
|
[✔️](rust%2F0554-brick-wall.rs)
|
|
|
[✔️](typescript%2F0554-brick-wall.ts)

[0122 - Best Time to Buy And Sell Stock II](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/) |
|
[✔️](c%2F0122-best-time-to-buy-and-sell-stock-ii.c)
|
[✔️](cpp%2F0122-best-time-to-buy-and-sell-stock-ii.cpp)
|
|
|
[✔️](go%2F0122-best-time-to-buy-and-sell-stock-ii.go)
|
|
[✔️](java%2F0122-best-time-to-buy-and-sell-stock-II.java)
|
[✔️](javascript%2F0122-best-time-to-buy-and-sell-stock-ii.js)
|
[✔️](kotlin%2F0122-best-time-to-buy-and-sell-stock-ii.kt)
|
[✔️](python%2F0122-best-time-to-buy-and-sell-stock-ii.py)
|
|
[✔️](rust%2F0122-best-time-to-buy-and-sell-stock-ii.rs)
|
|
|

[0560 - Subarray Sum Equals K](https://leetcode.com/problems/subarray-sum-equals-k/) |
|
[✔️](c%2F0560-subarray-sum-equals-k.c)
|
[✔️](cpp%2F0560-subarray-sum-equals-k.cpp)
|
[✔️](csharp%2F0560-subarray-sum-equals-k.cs)
|
|
[✔️](go%2F0560-subarray-sum-equals-k.go)
|
|
[✔️](java%2F0560-subarray-sum-equals-k.java)
|
[✔️](javascript%2F0560-subarray-sum-equals-k.js)
|
[✔️](kotlin%2F0560-subarray-sum-equals-k.kt)
|
[✔️](python%2F0560-subarray-sum-equals-k.py)
|
|
[✔️](rust%2F0560-subarray-sum-equals-k.rs)
|
|
[✔️](swift%2F0560-subarray-sum-equals-k.swift)
|
[✔️](typescript%2F0560-subarray-sum-equals-k.ts)

[1930 - Unique Length 3 Palindromic Subsequences](https://leetcode.com/problems/unique-length-3-palindromic-subsequences/) |
|
[✔️](c%2F1930-unique-length-3-palindromic-subsequences.c)
|
[✔️](cpp%2F1930-unique-length-3-palindromic-subsequences.cpp)
|
|
|
|
|
[✔️](java%2F1930-unique-length-3-palindromic-subsequences.java)
|
[✔️](javascript%2F1930-unique-length-3-palindromic-subsequences.js)
|
[✔️](kotlin%2F1930-unique-length-3-palindromic-subsequences.kt)
|
[✔️](python%2F1930-unique-length-3-palindromic-subsequences.py)
|
|
[✔️](rust%2F1930-unique-length-3-palindromic-subsequences.rs)
|
|
|
[✔️](typescript%2F1930-unique-length-3-palindromic-subsequences.ts)

[1963 - Minimum Number of Swaps to Make The String Balanced](https://leetcode.com/problems/minimum-number-of-swaps-to-make-the-string-balanced/) |
|
[✔️](c%2F1963-minimum-number-of-swaps-to-make-the-string-balanced.c)
|
[✔️](cpp%2F1963-minimum-number-of-swaps-to-make-the-string-balanced.cpp)
|
[✔️](csharp%2F1963-minimum-number-of-swaps-to-make-the-string-balanced.cs)
|
|
[✔️](go%2F1963-minimum-number-of-swaps-to-make-the-string-balanced.go)
|
|
[✔️](java%2F1963-minimum-number-of-swaps-to-make-the-string-balanced.java)
|
[✔️](javascript%2F1963-minimum-number-of-swaps-to-make-the-string-balanced.js)
|
[✔️](kotlin%2F1963-minimum-number-of-swaps-to-make-the-string-balanced.kt)
|
[✔️](python%2F1963-minimum-number-of-swaps-to-make-the-string-balanced.py)
|
|
[✔️](rust%2F1963-minimum-number-of-swaps-to-make-the-string-balanced.rs)
|
|
|

[2001 - Number of Pairs of Interchangeable Rectangles](https://leetcode.com/problems/number-of-pairs-of-interchangeable-rectangles/) |
|
[✔️](c%2F2001-number-of-pairs-of-interchangeable-rectangles.c)
|
[✔️](cpp%2F2001-number-of-pairs-of-interchangeable-rectangles.cpp)
|
|
|
|
|
[✔️](java%2F2001-number-of-pairs-of-interchangeable-rectangles.java)
|
[✔️](javascript%2F2001-number-of-pairs-of-interchangeable-rectangles.js)
|
[✔️](kotlin%2F2001-number-of-pairs-of-interchangeable-rectangles.kt)
|
[✔️](python%2F2001-number-of-pairs-of-interchangeable-rectangles.py)
|
|
[✔️](rust%2F2001-number-of-pairs-of-interchangeable-rectangles.rs)
|
|
|

[2002 - Maximum Product of The Length of Two Palindromic Subsequences](https://leetcode.com/problems/maximum-product-of-the-length-of-two-palindromic-subsequences/) |
|
[✔️](c%2F2002-maximum-product-of-the-length-of-two-palindromic-subsequences.c)
|
[✔️](cpp%2F2002-maximum-product-of-the-length-of-two-palindromic-subsequences.cpp)
|
[✔️](csharp%2F2002-maximum-product-of-the-length-of-two-palindromic-subsequences.cs)
|
|
[✔️](go%2F2002-maximum-product-of-the-length-of-two-palindromic-subsequences.go)
|
|
[✔️](java%2F2002-maximum-product-of-the-length-of-two-palindromic-subsequences.java)
|
[✔️](javascript%2F2002-maximum-product-of-the-length-of-two-palindromic-subsequences.js)
|
[✔️](kotlin%2F2002-maximum-product-of-the-length-of-two-palindromic-subsequences.kt)
|
[✔️](python%2F2002-maximum-product-of-the-length-of-two-palindromic-subsequences.py)
|
|
[✔️](rust%2F2002-maximum-product-of-the-length-of-two-palindromic-subsequences.rs)
|
|
|
[✔️](typescript%2F2002-maximum-product-of-the-length-of-two-palindromic-subsequences.ts)

[2017 - Grid Game](https://leetcode.com/problems/grid-game/) |
|
|
[✔️](cpp%2F2017-grid-game.cpp)
|
|
|
|
|
[✔️](java%2F2017-grid-game.java)
|
[✔️](javascript%2F2017-grid-game.js)
|
[✔️](kotlin%2F2017-grid-game.kt)
|
[✔️](python%2F2017-grid-game.py)
|
|
[✔️](rust%2F2017-grid-game.rs)
|
|
|

[0438 - Find All Anagrams in a String](https://leetcode.com/problems/find-all-anagrams-in-a-string/) |
|
[✔️](c%2F0438-find-all-anagrams-in-a-string.c)
|
[✔️](cpp%2F0438-find-all-anagrams-in-a-string.cpp)
|
[✔️](csharp%2F0438-find-all-anagrams-in-a-string.cs)
|
|
[✔️](go%2F0438-find-all-anagrams-in-a-string.go)
|
|
[✔️](java%2F0438-find-all-anagrams-in-a-string.java)
|
[✔️](javascript%2F0438-find-all-anagrams-in-a-string.js)
|
[✔️](kotlin%2F0438-find-all-anagrams-in-a-string.kt)
|
[✔️](python%2F0438-find-all-anagrams-in-a-string.py)
|
|
[✔️](rust%2F0438-find-all-anagrams-in-a-string.rs)
|
|
|
[✔️](typescript%2F0438-find-all-anagrams-in-a-string.ts)

[0028 - Find The Index of The First Occurrence in a String](https://leetcode.com/problems/find-the-index-of-the-first-occurrence-in-a-string/) |
|
[✔️](c%2F0028-find-the-index-of-the-first-occurrence-in-a-string.c)
|
[✔️](cpp%2F0028-find-the-index-of-the-first-occurrence-in-a-string.cpp)
|
[✔️](csharp%2F0028-find-the-index-of-the-first-occurrence-in-a-string.cs)
|
[✔️](dart%2F0028-find-the-index-of-the-first-occurrence-in-a-string.dart)
|
[✔️](go%2F0028-find-the-index-of-the-first-occurrence-in-a-string.go)
|
|
[✔️](java%2F0028-find-the-index-of-the-first-occurrence-in-a-string.java)
|
[✔️](javascript%2F0028-find-the-index-of-the-first-occurrence-in-a-string.js)
|
[✔️](kotlin%2F0028-find-the-index-of-the-first-occurrence-in-a-string.kt)
|
[✔️](python%2F0028-find-the-index-of-the-first-occurrence-in-a-string.py)
|
|
[✔️](rust%2F0028-find-the-index-of-the-first-occurrence-in-a-string.rs)
|
|
|

[0280 - Wiggle Sort](https://leetcode.com/problems/wiggle-sort/) |
|
|
[✔️](cpp%2F0280-wiggle-sort.cpp)
|
|
|
|
|
[✔️](java%2F0280-wiggle-sort.java)
|
|
[✔️](kotlin%2F0280-wiggle-sort.kt)
|
[✔️](python%2F0280-wiggle-sort.py)
|
|
|
|
|

[0179 - Largest Number](https://leetcode.com/problems/largest-number/) |
|
[✔️](c%2F0179-largest-number.c)
|
[✔️](cpp%2F0179-largest-number.cpp)
|
[✔️](csharp%2F0179-largest-number.cs)
|
|
[✔️](go%2F0179-largest-number.go)
|
|
[✔️](java%2F0179-largest-number.java)
|
[✔️](javascript%2F0179-largest-number.js)
|
[✔️](kotlin%2F0179-largest-number.kt)
|
[✔️](python%2F0179-largest-number.py)
|
[✔️](ruby%2F0179-largest-number.rb)
|
[✔️](rust%2F0179-largest-number.rs)
|
[✔️](scala%2F0179-largest-number.scala)
|
[✔️](swift%2F0179-largest-number.swift)
|
[✔️](typescript%2F0179-largest-number.ts)

[0523 - Continuous Subarray Sum](https://leetcode.com/problems/continuous-subarray-sum/) |
|
[✔️](c%2F0523-continuous-subarray-sum.c)
|
[✔️](cpp%2F0523-continuous-subarray-sum.cpp)
|
[✔️](csharp%2F0523-continuous-subarray-sum.cs)
|
|
|
|
[✔️](java%2F0523-continuous-subarray-sum.java)
|
[✔️](javascript%2F0523-continuous-subarray-sum.js)
|
[✔️](kotlin%2F0523-continuous-subarray-sum.kt)
|
[✔️](python%2F0523-continuous-subarray-sum.py)
|
|
[✔️](rust%2F0523-continuous-subarray-sum.rs)
|
|
|

[0838 - Push Dominoes](https://leetcode.com/problems/push-dominoes/) |
|
|
[✔️](cpp%2F0838-push-dominoes.cpp)
|
|
|
|
|
[✔️](java%2F0838-push-dominoes.java)
|
[✔️](javascript%2F0838-push-dominoes.js)
|
[✔️](kotlin%2F0838-push-dominoes.kt)
|
[✔️](python%2F0838-push-dominoes.py)
|
|
|
|
|
[✔️](typescript%2F0838-push-dominoes.ts)

[0187 - Repeated DNA Sequences](https://leetcode.com/problems/repeated-dna-sequences/) |
|
|
[✔️](cpp%2F0187-repeated-dna-sequences.cpp)
|
[✔️](csharp%2F0187-repeated-dna-sequences.cs)
|
|
[✔️](go%2F0187-repeated-dna-sequences.go)
|
|
[✔️](java%2F0187-repeated-dna-sequences.java)
|
[✔️](javascript%2F0187-repeated-dna-sequences.js)
|
[✔️](kotlin%2F0187-repeated-dna-sequences.kt)
|
[✔️](python%2F0187-repeated-dna-sequences.py)
|
|
|
|
|
[✔️](typescript%2F0187-repeated-dna-sequences.ts)

[0380 - Insert Delete Get Random O(1)](https://leetcode.com/problems/insert-delete-getrandom-o1/) |
|
|
[✔️](cpp%2F0380-insert-delete-getrandom-o1.cpp)
|
|
|
[✔️](go%2F0380-insert-delete-getrandom-o1.go)
|
|
[✔️](java%2F0380-insert-delete-getrandom-o1.java)
|
[✔️](javascript%2F0380-insert-delete-getrandom-o1.js)
|
[✔️](kotlin%2F0380-insert-delete-getrandom-o1.kt)
|
[✔️](python%2F0380-insert-delete-getrandom-o1.py)
|
|
[✔️](rust%2F0380-insert-delete-getrandom-o1.rs)
|
|
[✔️](swift%2F0380-insert-delete-getrandom-o1.swift)
|
[✔️](typescript%2F0380-insert-delete-getrandom-o1.ts)

[1461 - Check if a String Contains all Binary Codes of Size K](https://leetcode.com/problems/check-if-a-string-contains-all-binary-codes-of-size-k/) |
|
|
[✔️](cpp%2F1461-check-if-a-string-contains-all-binary-codes-of-size-k.cpp)
|
|
|
|
|
[✔️](java%2F1461-check-if-a-string-contains-all-binary-codes-of-size-k.java)
|
[✔️](javascript%2F1461-check-if-a-string-contains-all-binary-codes-of-size-k.js)
|
[✔️](kotlin%2F1461-check-if-a-string-contains-all-binary-codes-of-size-k.kt)
|
[✔️](python%2F1461-check-if-a-string-contains-all-binary-codes-of-size-k.py)
|
|
|
|
|

[0304 - Range Sum Query 2D Immutable](https://leetcode.com/problems/range-sum-query-2d-immutable/) |
|
|
[✔️](cpp%2F0304-range-sum-query-2d-immutable.cpp)
|
|
|
|
|
[✔️](java%2F0304-range-sum-query-2d-immutable.java)
|
[✔️](javascript%2F0304-range-sum-query-2d-immutable.js)
|
[✔️](kotlin%2F0304-range-sum-query-2d-immutable.kt)
|
[✔️](python%2F0304-range-sum-query-2d-immutable.py)
|
|
|
|
[✔️](swift%2F0304-range-sum-query-2d-immutable.swift)
|

[0665 - Non Decreasing Array](https://leetcode.com/problems/non-decreasing-array/) |
|
[✔️](c%2F0665-non-decreasing-array.c)
|
[✔️](cpp%2F0665-non-decreasing-array.cpp)
|
[✔️](csharp%2F0665-non-decreasing-array.cs)
|
|
[✔️](go%2F0665-non-decreasing-array.go)
|
|
[✔️](java%2F0665-non-decreasing-array.java)
|
[✔️](javascript%2F0665-non-decreasing-array.js)
|
[✔️](kotlin%2F0665-non-decreasing-array.kt)
|
[✔️](python%2F0665-non-decreasing-array.py)
|
|
|
[✔️](scala%2F0665-non-decreasing-array.scala)
|
|
[✔️](typescript%2F0665-non-decreasing-array.ts)

[0041 - First Missing Positive](https://leetcode.com/problems/first-missing-positive/) |
|
[✔️](c%2F0041-first-missing-positive.c)
|
[✔️](cpp%2F0041-first-missing-positive.cpp)
|
|
|
[✔️](go%2F0041-first-missing-positive.go)
|
|
[✔️](java%2F0041-first-missing-positive.java)
|
[✔️](javascript%2F0041-first-missing-positive.js)
|
[✔️](kotlin%2F0041-first-missing-positive.kt)
|
[✔️](python%2F0041-first-missing-positive.py)
|
|
|
|
|
[✔️](typescript%2F0041-first-missing-positive.ts)

[1822 - Sign of An Array](https://leetcode.com/problems/sign-of-the-product-of-an-array/) |
|
[✔️](c%2F1822-sign-of-the-product-of-an-array.c)
|
[✔️](cpp%2F1822-sign-of-the-product-of-an-array.cpp)
|
|
|
[✔️](go%2F1822-sign-of-the-product-of-an-array.go)
|
|
[✔️](java%2F1822-sign-of-the-product-of-an-array.java)
|
[✔️](javascript%2F1822-sign-of-the-product-of-an-array.js)
|
[✔️](kotlin%2F1822-sign-of-the-product-of-an-array.kt)
|
[✔️](python%2F1822-sign-of-the-product-of-an-array.py)
|
|
[✔️](rust%2F1822-sign-of-the-product-of-an-array.rs)
|
|
|
[✔️](typescript%2F1822-sign-of-the-product-of-an-array.ts)

[2215 - Find the Difference of Two Arrays](https://leetcode.com/problems/find-the-difference-of-two-arrays/) |
|
[✔️](c%2F2215-find-the-difference-of-two-arrays.c)
|
[✔️](cpp%2F2215-find-the-difference-of-two-arrays.cpp)
|
[✔️](csharp%2F2215-find-the-difference-of-two-arrays.cs)
|
|
|
|
[✔️](java%2F2215-find-the-difference-of-two-arrays.java)
|
[✔️](javascript%2F2215-find-the-difference-of-two-arrays.js)
|
[✔️](kotlin%2F2215-find-the-difference-of-two-arrays.kt)
|
[✔️](python%2F2215-find-the-difference-of-two-arrays.py)
|
|
|
|
|
[✔️](typescript%2F2215-find-the-difference-of-two-arrays.ts)

[1603 - Design Parking System](https://leetcode.com/problems/design-parking-system/) |
|
|
[✔️](cpp%2F1603-design-parking-system.cpp)
|
[✔️](csharp%2F1603-design-parking-system.cs)
|
|
|
|
[✔️](java%2F1603-design-parking-system.java)
|
[✔️](javascript%2F1603-design-parking-system.js)
|
[✔️](kotlin%2F1603-design-parking-system.kt)
|
[✔️](python%2F1603-design-parking-system.py)
|
|
|
|
|

[2348 - Number of Zero-Filled Subarrays](https://leetcode.com/problems/number-of-zero-filled-subarrays/) |
|
|
[✔️](cpp%2F2348-number-of-zero-filled-subarrays.cpp)
|
|
|
|
|
[✔️](java%2F2348-number-of-zero-filled-subarrays.java)
|
[✔️](javascript%2F2348-number-of-zero-filled-subarrays.js)
|
[✔️](kotlin%2F2348-number-of-zero-filled-subarrays.kt)
|
[✔️](python%2F2348-number-of-zero-filled-subarrays.py)
|
|
|
|
|

[2405 - Optimal Partition of String](https://leetcode.com/problems/optimal-partition-of-string/) |
|
|
[✔️](cpp%2F2405-optimal-partition-of-string.cpp)
|
|
|
|
|
[✔️](java%2F2405-optimal-partition-of-string.java)
|
|
[✔️](kotlin%2F2405-optimal-partition-of-string.kt)
|
[✔️](python%2F2405-optimal-partition-of-string.py)
|
|
|
|
|

[1396 - Design Underground System](https://leetcode.com/problems/design-underground-system/) |
|
|
|
[✔️](csharp%2F1396-design-underground-system.cs)
|
|
|
|
[✔️](java%2F1396-design-underground-system.java)
|
[✔️](javascript%2F1396-design-underground-system.js)
|
[✔️](kotlin%2F1396-design-underground-system.kt)
|
[✔️](python%2F1396-design-underground-system.py)
|
|
|
|
|

[2483 - Minimum Penalty for a Shop](https://leetcode.com/problems/minimum-penalty-for-a-shop/) |
|
|
[✔️](cpp%2F2483-minimum-penalty-for-a-shop.cpp)
|
|
|
|
|
[✔️](java%2F2483-minimum-penalty-for-a-shop.java)
|
|
[✔️](kotlin%2F2483-minimum-penalty-for-a-shop.kt)
|
[✔️](python%2F2483-minimum-penalty-for-a-shop.py)
|
|
|
|
|

[0068 - Text Justification](https://leetcode.com/problems/text-justification/) |
|
|
|
|
|
|
|
[✔️](java%2F0068-text-justification.java)
|
|
[✔️](kotlin%2F0068-text-justification.kt)
|
[✔️](python%2F0068-text-justification.py)
|
|
|
|
|

[2306 - Naming a Company](https://leetcode.com/problems/naming-a-company/) |
|
|
[✔️](cpp%2F2306-naming-a-company.cpp)
|
|
|
|
|
[✔️](java%2F2306-naming-a-company.java)
|
[✔️](javascript%2F2306-naming-a-company.js)
|
[✔️](kotlin%2F2306-naming-a-company.kt)
|
[✔️](python%2F2306-naming-a-company.py)
|
|
|
|
|

### Two Pointers

Problem | articles | C | C++ | C# | Dart | GO | hints | Java | JS | Kotlin | Python | Ruby | Rust | Scala | Swift | TS
---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ----
[0125 - Valid Palindrome](https://leetcode.com/problems/valid-palindrome/) |

|
[✔️](c%2F0125-valid-palindrome.c)
|
[✔️](cpp%2F0125-valid-palindrome.cpp)
|
[✔️](csharp%2F0125-valid-palindrome.cs)
|
[✔️](dart%2F0125-valid-palindrome.dart)
|
[✔️](go%2F0125-valid-palindrome.go)
|
|
[✔️](java%2F0125-valid-palindrome.java)
|
[✔️](javascript%2F0125-valid-palindrome.js)
|
[✔️](kotlin%2F0125-valid-palindrome.kt)
|
[✔️](python%2F0125-valid-palindrome.py)
|
[✔️](ruby%2F0125-valid-palindrome.rb)
|
[✔️](rust%2F0125-valid-palindrome.rs)
|
[✔️](scala%2F0125-valid-palindrome.scala)
|
[✔️](swift%2F0125-valid-palindrome.swift)
|
[✔️](typescript%2F0125-valid-palindrome.ts)

[0680 - Valid Palindrome II](https://leetcode.com/problems/valid-palindrome-ii/) |
|
[✔️](c%2F0680-valid-palindrome-ii.c)
|
[✔️](cpp%2F0680-valid-palindrome-ii.cpp)
|
[✔️](csharp%2F0680-valid-palindrome-ii.cs)
|
|
[✔️](go%2F0680-valid-palindrome-ii.go)
|
|
[✔️](java%2F0680-valid-palindrome-ii.java)
|
[✔️](javascript%2F0680-valid-palindrome-ii.js)
|
[✔️](kotlin%2F0680-valid-palindrome-ii.kt)
|
[✔️](python%2F0680-valid-palindrome-ii.py)
|
|
[✔️](rust%2F0680-valid-palindrome-II.rs)
|
|
|
[✔️](typescript%2F0680-valid-palindrome-ii.ts)

[1984 - Minimum Difference Between Highest And Lowest of K Scores](https://leetcode.com/problems/minimum-difference-between-highest-and-lowest-of-k-scores/) |
|
[✔️](c%2F1984-minimum-difference-between-highest-and-lowest-of-k-scores.c)
|
[✔️](cpp%2F1984-minimum-difference-between-highest-and-lowest-of-k-scores.cpp)
|
[✔️](csharp%2F1984-minimum-difference-between-highest-and-lowest-of-k-scores.cs)
|
|
[✔️](go%2F1984-minimum-difference-between-highest-and-lowest-of-k-scores.go)
|
|
[✔️](java%2F1984-minimum-difference-between-highest-and-lowest-of-k-scores.java)
|
[✔️](javascript%2F1984-Minimum-Difference-Between-Highest-and-Lowest-of-K-Scores.js)
|
[✔️](kotlin%2F1984-minimum-difference-between-highest-and-lowest-of-k-scores.kt)
|
[✔️](python%2F1984-minimum-difference-between-highest-and-lowest-of-k-scores.py)
|
|
[✔️](rust%2F1984-minimum-difference-between-highest-and-lowest-of-k-scores.rs)
|
|
|
[✔️](typescript%2F1984-minimum-difference-between-highest-and-lowest-of-k-scores.ts)

[1768 - Merge Strings Alternately](https://leetcode.com/problems/merge-strings-alternately/) |
|
|
[✔️](cpp%2F1768-merge-strings-alternately.cpp)
|
[✔️](csharp%2F1768-merge-strings-alternately.cs)
|
|
|
|
[✔️](java%2F1768-merge-strings-alternately.java)
|
[✔️](javascript%2F1768-merge-strings-alternately.js)
|
[✔️](kotlin%2F1768-merge-strings-alternately.kt)
|
[✔️](python%2F1768-merge-strings-alternately.py)
|
|
|
|
|
[✔️](typescript%2F1768-merge-strings-alternately.ts)

[0344 - Reverse String](https://leetcode.com/problems/reverse-string/) |
|
[✔️](c%2F0344-reverse-string.c)
|
[✔️](cpp%2F0344-Reverse-String.cpp)
|
[✔️](csharp%2F0344-reverse-string.cs)
|
[✔️](dart%2F0344-reverse-string.dart)
|
[✔️](go%2F0344-reverse-string.go)
|
|
[✔️](java%2F0344-reverse-string.java)
|
[✔️](javascript%2F0344-reverse-string.js)
|
[✔️](kotlin%2F0344-reverse-string.kt)
|
[✔️](python%2F0344-reverse-string.py)
|
|
[✔️](rust%2F0344-reverse-string.rs)
|
|
[✔️](swift%2F0344-reverse-string.swift)
|
[✔️](typescript%2F0344-reverse-string.ts)

[0088 - Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array/) |
|
[✔️](c%2F0088-merge-sorted-array.c)
|
[✔️](cpp%2F0088-Merge-sorted-array.cpp)
|
[✔️](csharp%2F0088-merge-sorted-array.cs)
|
|
[✔️](go%2F0088-merge-sorted-array.go)
|
|
[✔️](java%2F0088-merge-sorted-array.java)
|
[✔️](javascript%2F0088-merge-sorted-array.js)
|
[✔️](kotlin%2F0088-merge-sorted-array.kt)
|
[✔️](python%2F0088-merge-sorted-array.py)
|
|
[✔️](rust%2F0088-merge-sorted-array.rs)
|
|
|
[✔️](typescript%2F0088-merge-sorted-array.ts)

[0283 - Move Zeroes](https://leetcode.com/problems/move-zeroes/) |
|
[✔️](c%2F0283-move-zeroes.c)
|
[✔️](cpp%2F0283-move-zeroes.cpp)
|
[✔️](csharp%2F0283-move-zeroes.cs)
|
|
[✔️](go%2F0283-move-zeroes.go)
|
|
[✔️](java%2F0283-move-zeroes.java)
|
[✔️](javascript%2F0283-move-zeroes.js)
|
[✔️](kotlin%2F0283-move-zeroes.kt)
|
[✔️](python%2F0283-move-zeroes.py)
|
|
[✔️](rust%2F0283-move-zeroes.rs)
|
|
[✔️](swift%2F0283-Move-Zeroes.Swift)
|
[✔️](typescript%2F0283-move-zeroes.ts)

[0026 - Remove Duplicates From Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array/) |
|
[✔️](c%2F0026-remove-duplicates-from-sorted-array.c)
|
[✔️](cpp%2F0026-remove-duplicates-from-sorted-array.cpp)
|
[✔️](csharp%2F0026-remove-duplicates-from-sorted-array.cs)
|
|
[✔️](go%2F0026-remove-duplicates-from-sorted-array.go)
|
|
[✔️](java%2F0026-remove-duplicates-from-sorted-array.java)
|
[✔️](javascript%2F0026-remove-duplicates-from-sorted-array.js)
|
[✔️](kotlin%2F0026-remove-duplicates-from-sorted-array.kt)
|
[✔️](python%2F0026-remove-duplicates-from-sorted-array.py)
|
|
[✔️](rust%2F0026-remove-duplicates-from-sorted-array.rs)
|
|
[✔️](swift%2F0026-Remove-Duplicates-from-Sorted-Array.swift)
|
[✔️](typescript%2F0026-remove-duplicates-from-sorted-array.ts)

[0080 - Remove Duplicates From Sorted Array II](https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii/) |
|
[✔️](c%2F0080-remove-duplicates-from-sorted-array-ii.c)
|
[✔️](cpp%2F0080-remove-duplicates-from-sorted-array-ii.cpp)
|
[✔️](csharp%2F0080-remove-duplicates-from-sorted-array-ii.cs)
|
|
|
|
[✔️](java%2F0080-remove-duplicates-from-sorted-array-ii.java)
|
[✔️](javascript%2F0080-remove-duplicates-from-sorted-array-ii.js)
|
[✔️](kotlin%2F0080-remove-duplicates-from-sorted-array-ii.kt)
|
[✔️](python%2F0080-remove-duplicates-from-sorted-array-ii.py)
|
|
[✔️](rust%2F0080-remove-duplicates-from-sorted-array-ii.rs)
|
|
[✔️](swift%2F0080-remove-duplicates-from-sorted-array-ii.swift)
|

[0167 - Two Sum II Input Array Is Sorted](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/) |
|
[✔️](c%2F0167-two-sum-ii-input-array-is-sorted.c)
|
[✔️](cpp%2F0167-two-sum-ii-input-array-is-sorted.cpp)
|
[✔️](csharp%2F0167-two-sum-ii-input-array-is-sorted.cs)
|
|
[✔️](go%2F0167-two-sum-ii-input-array-is-sorted.go)
|
|
[✔️](java%2F0167-two-sum-ii-input-array-is-sorted.java)
|
[✔️](javascript%2F0167-two-sum-ii-input-array-is-sorted.js)
|
[✔️](kotlin%2F0167-two-sum-ii-input-array-is-sorted.kt)
|
[✔️](python%2F0167-two-sum-ii-input-array-is-sorted.py)
|
[✔️](ruby%2F0167-two-sum-ii-input-array-is-sorted.rb)
|
[✔️](rust%2F0167-two-sum-ii-input-array-is-sorted.rs)
|
[✔️](scala%2F0167-two-sum-ii-input-array-is-sorted.scala)
|
[✔️](swift%2F0167-two-sum-ii-input-array-is-sorted.swift)
|
[✔️](typescript%2F0167-two-sum-ii-input-array-is-sorted.ts)

[0015 - 3Sum](https://leetcode.com/problems/3sum/) |
|
[✔️](c%2F0015-3sum.c)
|
[✔️](cpp%2F0015-3sum.cpp)
|
[✔️](csharp%2F0015-3sum.cs)
|
[✔️](dart%2F0015-3sum.dart)
|
[✔️](go%2F0015-3sum.go)
|
|
[✔️](java%2F0015-3sum.java)
|
[✔️](javascript%2F0015-3sum.js)
|
[✔️](kotlin%2F0015-3sum.kt)
|
[✔️](python%2F0015-3sum.py)
|
[✔️](ruby%2F0015-3sum.rb)
|
[✔️](rust%2F0015-3sum.rs)
|
[✔️](scala%2F0015-3sum.scala)
|
[✔️](swift%2F0015-3sum.swift)
|
[✔️](typescript%2F0015-3sum.ts)

[0018 - 4Sum](https://leetcode.com/problems/4sum/) |
|
|
[✔️](cpp%2F0018-4sum.cpp)
|
|
|
[✔️](go%2F0018-4Sum.go)
|
|
[✔️](java%2F0018-4sum.java)
|
[✔️](javascript%2F0018-4sum.js)
|
[✔️](kotlin%2F0018-4sum.kt)
|
[✔️](python%2F0018-4sum.py)
|
|
|
|
[✔️](swift%2F0018-4sum.swift)
|
[✔️](typescript%2F0018-4sum.ts)

[0011 - Container With Most Water](https://leetcode.com/problems/container-with-most-water/) |
|
[✔️](c%2F0011-container-with-most-water.c)
|
[✔️](cpp%2F0011-container-with-most-water.cpp)
|
[✔️](csharp%2F0011-container-with-most-water.cs)
|
[✔️](dart%2F0011-container-with-most-water.dart)
|
[✔️](go%2F0011-container-with-most-water.go)
|
|
[✔️](java%2F0011-container-with-most-water.java)
|
[✔️](javascript%2F0011-container-with-most-water.js)
|
[✔️](kotlin%2F0011-container-with-most-water.kt)
|
[✔️](python%2F0011-container-with-most-water.py)
|
[✔️](ruby%2F0011-container-with-most-water.rb)
|
[✔️](rust%2F0011-container-with-most-water.rs)
|
[✔️](scala%2F0011-container-with-most-water.scala)
|
[✔️](swift%2F0011-container-with-most-water.swift)
|
[✔️](typescript%2F0011-container-with-most-water.ts)

[1498 - Number of Subsequences That Satisfy The Given Sum Condition](https://leetcode.com/problems/number-of-subsequences-that-satisfy-the-given-sum-condition/) |
|
|
[✔️](cpp%2F1498-number-of-subsequences-that-satisfy-the-given-sum-condition.cpp)
|
|
|
|
|
[✔️](java%2F1498-number-of-subsequences-that-satisfy-the-given-sum-condition.java)
|
|
[✔️](kotlin%2F1498-number-of-subsequences-that-satisfy-the-given-sum-condition.kt)
|
[✔️](python%2F1498-number-of-subsequences-that-satisfy-the-given-sum-condition.py)
|
|
|
|
|

[0189 - Rotate Array](https://leetcode.com/problems/rotate-array/) |
|
|
[✔️](cpp%2F0189-rotate-array.cpp)
|
|
|
[✔️](go%2F0189-rotate-array.go)
|
|
[✔️](java%2F0189-rotate-array.java)
|
[✔️](javascript%2F0189-rotate-array.js)
|
[✔️](kotlin%2F0189-rotate-array.kt)
|
[✔️](python%2F0189-rotate-array.py)
|
|
|
|
|
[✔️](typescript%2F0189-rotate-array.ts)

[1968 - Array With Elements Not Equal to Average of Neighbors](https://leetcode.com/problems/array-with-elements-not-equal-to-average-of-neighbors/) |
|
[✔️](c%2F1968-array-with-elements-not-equal-to-average-of-neighbors.c)
|
[✔️](cpp%2F1968-array-with-elements-not-equal-to-average-of-neighbors.cpp)
|
|
|
[✔️](go%2F1968-array-with-elements-not-equal-to-average-of-neighbors.go)
|
|
[✔️](java%2F1968-array-with-elements-not-equal-to-average-of-neighbors.java)
|
[✔️](javascript%2F1968-array-with-elements-not-equal-to-average-of-neighbors.js)
|
[✔️](kotlin%2F1968-array-with-elements-not-equal-to-average-of-neighbors.kt)
|
[✔️](python%2F1968-array-with-elements-not-equal-to-average-of-neighbors.py)
|
|
|
|
|

[0881 - Boats to Save People](https://leetcode.com/problems/boats-to-save-people/) |
|
[✔️](c%2F0881-boats-to-save-people.c)
|
[✔️](cpp%2F0881-boats-to-save-people.cpp)
|
|
|
[✔️](go%2F0881-boats-to-save-people.go)
|
|
[✔️](java%2F0881-boats-to-save-people.java)
|
[✔️](javascript%2F0881-boats-to-save-people.js)
|
[✔️](kotlin%2F0881-boats-to-save-people.kt)
|
[✔️](python%2F0881-boats-to-save-people.py)
|
|
|
|
[✔️](swift%2F0881-boats-to-save-people.swift)
|
[✔️](typescript%2F0881-boats-to-save-people.ts)

[0042 - Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water/) |
|
[✔️](c%2F0042-trapping-rain-water.c)
|
[✔️](cpp%2F0042-trapping-rain-water.cpp)
|
[✔️](csharp%2F0042-trapping-rain-water.cs)
|
[✔️](dart%2F0042-trapping-rain-water.dart)
|
[✔️](go%2F0042-trapping-rain-water.go)
|
|
[✔️](java%2F0042-trapping-rain-water.java)
|
[✔️](javascript%2F0042-trapping-rain-water.js)
|
[✔️](kotlin%2F0042-trapping-rain-water.kt)
|
[✔️](python%2F0042-trapping-rain-water.py)
|
[✔️](ruby%2F0042-trapping-rain-water.rb)
|
[✔️](rust%2F0042-trapping-rain-water.rs)
|
|
[✔️](swift%2F0042-trapping-rain-water.swift)
|
[✔️](typescript%2F0042-trapping-rain-water.ts)

### Sliding Window

Problem | articles | C | C++ | C# | Dart | GO | hints | Java | JS | Kotlin | Python | Ruby | Rust | Scala | Swift | TS
---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ---- | ----
[0121 - Best Time to Buy