Ecosyste.ms: Awesome

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

Awesome Lists | Featured Topics | Projects

https://github.com/alexprut/leetcode

🍒 Solution to LeetCode problems
https://github.com/alexprut/leetcode

algorithm algorithms competitive-programming data-structures leetcode leetcode-solutions

Last synced: 3 months ago
JSON representation

🍒 Solution to LeetCode problems

Awesome Lists containing this project

README 

        





[![Solutions](https://img.shields.io/badge/solutions-162%2F3073-green.svg?style=flat-square)](https://github.com/alexprut/LeetCode#table-of-contents)

[![Languages](https://img.shields.io/badge/languages-c%2B%2B%2Cjava%2Chaskell-yellow.svg)](https://github.com/alexprut/LeetCode#table-of-contents)

[![Author](https://img.shields.io/badge/author-alexprut-brightgreen.svg?style=flat-square)](https://leetcode.com/alexprut/)

[![MIT](https://img.shields.io/dub/l/vibe-d.svg?style=flat-square)](https://github.com/alexprut/LeetCode/blob/master/LICENSE)










### Disclaimer



  

    

      

        

      

    

    

      Most of the problems are solved by using the Algo library.

     

  

  

      

        

          

        

      

      

        Solutions to HackerRank problems.

      

    

    

        

          

            

          

        

        

          Solutions to InterviewBit problems.

        

      



The problem solutions and implementations are entirely provided by [Alex Prut](https://leetcode.com/alexprut/).

The code is not refactored, no coding style is followed, the only purpose of the written code is to pass all the

platform tests of a given problem.



## Problems

|Number|Title|Difficulty|Solution|

|-|-|-|-|

|1|[Two Sum](https://leetcode.com/problems/two-sum)|Easy|[Solution.java](Problems/1/Solution.java)|

|2|[Add Two Numbers](https://leetcode.com/problems/add-two-numbers)|Medium|[Solution.java](Problems/2/Solution.java)|

|3|[Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters)|Medium|[Solution.java](Problems/3/Solution.java)|

|11|[Container With Most Water](https://leetcode.com/problems/container-with-most-water/)|Medium|[Solution.java](Problems/11/Solution.java)|

|14|[Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix)|Easy|[Solution.java](Problems/14/Solution.java)|

|20|[Valid Parentheses](https://leetcode.com/problems/valid-parentheses)|Easy|[Solution.java](Problems/20/Solution.java)|

|21|[Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists/)|Easy|[Solution.java](Problems/21/Solution.java)|

|23|[Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists/)|Hard|[Solution.java](Problems/23/Solution.java)|

|27|[Remove Element](https://leetcode.com/problems/remove-element/description/)|Easy|[Solution.java](Problems/27/Solution.java)|

|34|[Find First and Last Position of Element in Sorted Array](https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array/)|Medium|[Solution.java](Problems/34/Solution.java)|

|39|[Combination Sum](https://leetcode.com/problems/combination-sum/)|Medium|[Solution.java](Problems/39/Solution.java)|

|46|[Permutations](https://leetcode.com/problems/permutations)|Medium|[Solution.java](Problems/46/Solution.java)|

|47|[Permutations II](https://leetcode.com/problems/permutations-ii)|Medium|[Solution.java](Problems/47/Solution.java)|

|49|[Group Anagrams](https://leetcode.com/problems/group-anagrams)|Medium|[Solution.java](Problems/49/Solution.java)|

|53|[Maximum Subarray](https://leetcode.com/problems/maximum-subarray)|Medium|[Solution.java](Problems/53/Solution.java)|

|56|[Merge Intervals](https://leetcode.com/problems/merge-intervals)|Medium|[Solution.java](Problems/56/Solution.java)|

|61|[Rotate List](https://leetcode.com/problems/rotate-list/)|Medium|[Solution.java](Problems/61/Solution.java)|

|62|Unique Paths](https://leetcode.com/problems/unique-paths/)|Medium|[Solution.java](Problems/62/Solution.java)|

|64|Minimum Path Sum](https://leetcode.com/problems/minimum-path-sum/)|Medium|[Solution.java](Problems/64/Solution.java)|

|70|[Climbing Stairs](https://leetcode.com/problems/climbing-stairs/)|Easy|[Solution.java](Problems/70/Solution.java)|

|72|[Edit Distance](https://leetcode.com/problems/edit-distance/)|Medium|[Solution.java](Problems/72/Solution.java)|

|73|[Set Matrix Zeroes](https://leetcode.com/problems/set-matrix-zeroes)|Medium|[Solution.java](Problems/73/Solution.java)|

|77|[Combinations](https://leetcode.com/problems/combinations)|Medium|[Solution.java](Problems/77/Solution.java)|

|88|[Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array/)|Easy|[Solution.java](Problems/88/Solution.java)|

|92|[Reverse Linked List II](https://leetcode.com/problems/reverse-linked-list-ii/)|Medium|[Solution.java](Problems/92/Solution.java)|

|94|[Binary Tree Inorder Traversal](https://leetcode.com/problems/binary-tree-inorder-traversal)|Medium|[Solution.java](Problems/94/Solution.java)|

|98|[Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree/)|Medium|[Solution.java](Problems/98/Solution.java)|

|100|[Same Tree](https://leetcode.com/problems/same-tree/)|Easy|[Solution.java](Problems/100/Solution.java)|

|102|[Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal/)|Medium|[Solution.java](Problems/102/Solution.java)|

|103|[Binary Tree Zigzag Level Order Traversal](https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal)|Medium|[Solution.java](Problems/103/Solution.java)|

|104|[Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree)|Easy|[Solution.java](Problems/104/Solution.java)|

|108|[Convert Sorted Array to Binary Search Tree](https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree)|Easy|[Solution.java](Problems/108/Solution.java)|

|111|[Minimum Depth of Binary Tree](https://leetcode.com/problems/minimum-depth-of-binary-tree/)|Easy|[Solution.java](Problems/104/Solution.java)|

|114|[Flatten Binary Tree to Linked List](https://leetcode.com/problems/flatten-binary-tree-to-linked-list)|Medium|[Solution.java](Problems/114/Solution.java)|

|115|[Min Stack](https://leetcode.com/problems/min-stack)|Medium|[Solution.java](Problems/115/Solution.java)|

|129|[Sum Root to Leaf Numbers](https://leetcode.com/problems/sum-root-to-leaf-numbers)|Medium|[Solution.java](Problems/129/Solution.java)|

|130|[Surrounded Regions](https://leetcode.com/problems/surrounded-regions)|Medium|[Solution.java](Problems/130/Solution.java)|

|133|[Clone Graph](https://leetcode.com/problems/clone-graph)|Medium|[Solution.java](Problems/133/Solution.java)|

|136|[Single Number](https://leetcode.com/problems/single-number)|Easy|[Solution.java](Problems/136/Solution.java)|

|139|[Word Break](https://leetcode.com/problems/word-break/)|Medium|[Solution.java](Problems/139/Solution.java)|

|146|[LRU Cache](https://leetcode.com/problems/lru-cache/)|Medium|[Solution.java](Problems/146/Solution.java)|

|151|[Reverse Words in a String](https://leetcode.com/problems/reverse-words-in-a-string/)|Medium|[Solution.java](Problems/151/Solution.java)|

|162|[Find Peak Element](https://leetcode.com/problems/find-peak-element/)|Medium|[Solution.java](Problems/162/Solution.java)|

|167|[Two Sum II - Input Array Is Sorted](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted)|Medium|[Solution.java](Problems/167/Solution.java)|

|173|[Binary Search Tree Iterator](https://leetcode.com/problems/binary-search-tree-iterator/description/)|Medium|[Solution.java](Problems/173/Solution.java)|

|189|[Rotate Array](https://leetcode.com/problems/rotate-array/)|Medium|[Solution.java](Problems/189/Solution.java)|

|190|[Reverse Bits](https://leetcode.com/problems/reverse-bits/)|Easy|[Solution.java](Problems/190/Solution.java)|

|200|[Number of Islands](https://leetcode.com/problems/number-of-islands/)|Medium|[Solution.java](Problems/200/Solution.java)|

|211|[Design Add and Search Words Data Structure](https://leetcode.com/problems/design-add-and-search-words-data-structure/)|Medium|[Solution.java](Problems/211/Solution.java)|

|206|[Reverse Linked List](https://leetcode.com/problems/reverse-linked-list)|Easy|[Solution.java](Problems/206/Solution.java)|

|208|[Implement Trie (Prefix Tree)](https://leetcode.com/problems/implement-trie-prefix-tree)|Medium|[Solution.java](Problems/208/Solution.java)|

|209|[Minimum Size Subarray Sum](https://leetcode.com/problems/minimum-size-subarray-sum)|Medium|[Solution.java](Problems/209/Solution.java)|

|225|[Implement Stack using Queues](https://leetcode.com/problems/implement-stack-using-queues)|Easy|[Solution.java](Problems/225/Solution.java)|

|230|[Kth Smallest Element in a BST](https://leetcode.com/problems/kth-smallest-element-in-a-bst)|Medium|[Solution.java](Problems/230/Solution.java)|

|232|[Implement Queue using Stacks](https://leetcode.com/problems/implement-queue-using-stacks)|Easy|[Solution.java](Problems/232/Solution.java)|

|235|[Implement Stack using Queues](https://leetcode.com/problems/implement-stack-using-queues/)|Easy|[Solution.java](Problems/235/Solution.java)|

|236|[Lowest Common Ancestor of a Binary Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree)|Medium|[Solution.java](Problems/236/Solution.java)|

|237|[Delete Node in a Linked List](https://leetcode.com/problems/delete-node-in-a-linked-list)|Easy|[Solution.java](Problems/237/Solution.java)|

|240|[Search a 2D Matrix II](https://leetcode.com/problems/search-a-2d-matrix-ii)|Medium|[Solution.java](Problems/240/Solution.java)|

|274|[H-Index](https://leetcode.com/problems/h-index)|Medium|[Solution.java](Problems/274/Solution.java)|

|300|[Longest Increasing Subsequence](https://leetcode.com/problems/longest-increasing-subsequence)|Medium|[Solution.java](Problems/300/Solution.java)|

|344|[Reverse String](https://leetcode.com/problems/reverse-string)|Easy|[Solution.java](Problems/344/Solution.java)|

|412|[Fizz Buzz](https://leetcode.com/problems/fizz-buzz)|Easy|[Solution.java](Problems/412/Solution.java)|

|433|[Minimum Genetic Mutation](https://leetcode.com/problems/minimum-genetic-mutation/)|Medium|[Solution.java](Problems/433/Solution.java)|

|451|[Sort Characters By Frequency](https://leetcode.com/problems/sort-characters-by-frequency/)|Medium|[Solution.java](Problems/460/Solution.java)|

|460|[LFU Cache](https://leetcode.com/problems/lfu-cache/)|Hard|[Solution.java](Problems/460/Solution.java)|

|535|[Encode and Decode TinyURL](https://leetcode.com/problems/encode-and-decode-tinyurl)|Medium|[Solution.java](Problems/535/Solution.java)|

|538|[Convert BST to Greater Tree](https://leetcode.com/problems/convert-bst-to-greater-tree)|Medium|[Solution.java](Problems/538/Solution.java)|

|559|[Maximum Depth of N-ary Tree](https://leetcode.com/problems/maximum-depth-of-n-ary-tree)|Easy|[Solution.java](Problems/559/Solution.java)|

|566|[Reshape the Matrix](https://leetcode.com/problems/reshape-the-matrix)|Easy|[Solution.java](Problems/566/Solution.java)|

|567|[Permutation in String](https://leetcode.com/problems/permutation-in-string)|Medium|[Solution.java](Problems/567/Solution.java)|

|589|[N-ary Tree Preorder Traversal](https://leetcode.com/problems/n-ary-tree-preorder-traversal)|Easy|[Solution.java](Problems/589/Solution.java)|

|590|[N-ary Tree Postorder Traversal](https://leetcode.com/problems/n-ary-tree-postorder-traversal)|Easy|[Solution.java](Problems/590/Solution.java)|

|595|[Big Countries](https://leetcode.com/problems/big-countries)|Easy|[Solution.java](Problems/595/Solution.java)|

|620|[Not Boring Movies](https://leetcode.com/problems/not-boring-movies/)|Easy|[Solution.txt](Problems/617/Solution.txt)|

|617|[Merge Two Binary Trees](https://leetcode.com/problems/merge-two-binary-trees)|Easy|[Solution.java](Problems/617/Solution.java)|

|695|[Max Area of Island](https://leetcode.com/problems/max-area-of-island/)|Medium|[Solution.java](Problems/695/Solution.java)|

|700|[Search in a Binary Search Tree](https://leetcode.com/problems/search-in-a-binary-search-tree)|Easy|[Solution.java](Problems/700/Solution.java)|

|701|[Insert into a Binary Search Tree](https://leetcode.com/problems/insert-into-a-binary-search-tree)|Medium|[Solution.java](Problems/701/Solution.java)|

|705|[Design HashSet](https://leetcode.com/problems/design-hashset/)|Easy|[Solution.java](Problems/705/Solution.java)|

|706|[Design HashMap](https://leetcode.com/problems/design-hashmap/)|Easy|[Solution.java](Problems/706/Solution.java)|

|707|[Design Linked List](https://leetcode.com/problems/design-linked-list/)|Medium|[Solution.java](Problems/707/Solution.java)|

|709|[To Lower Case](https://leetcode.com/problems/to-lower-case)|Easy|[Solution.java](Problems/709/Solution.java)|

|763|[Partition Labels](https://leetcode.com/problems/partition-labels)|Medium|[Solution.java](Problems/763/Solution.java)|

|771|[Jewels and Stones](https://leetcode.com/problems/jewels-and-stones)|Easy|[Solution.java](Problems/771/Solution.java)|

|784|[Letter Case Permutation](https://leetcode.com/problems/letter-case-permutation)|Medium|[Solution.java](Problems/784/Solution.java)|

|797|[All Paths From Source to Target](https://leetcode.com/problems/all-paths-from-source-to-target)|Medium|[Solution.java](Problems/797/Solution.java)|

|804|[Unique Morse Code Words](https://leetcode.com/problems/unique-morse-code-words)|Easy|[Solution.java](Problems/804/Solution.java)|

|814|[Binary Tree Pruning](https://leetcode.com/problems/binary-tree-pruning)|Medium|[Solution.java](Problems/814/Solution.java)|

|832|[Flipping an Image](https://leetcode.com/problems/flipping-an-image)|Easy|[Solution.java](Problems/832/Solution.java)|

|867|[Transpose Matrix](https://leetcode.com/problems/transpose-matrix)|Easy|[Solution.java](Problems/867/Solution.java)|

|938|[Range Sum of BST](https://leetcode.com/problems/range-sum-of-bst)|Easy|[Solution.java](Problems/938/Solution.java)|

|946|[Validate Stack Sequences](https://leetcode.com/problems/validate-stack-sequences)|Medium|[Solution.java](Problems/946/Solution.java)|

|950|[Reveal Cards In Increasing Order](https://leetcode.com/problems/reveal-cards-in-increasing-order)|Medium|[Solution.java](Problems/950/Solution.java)|

|965|[Univalued Binary Tree](https://leetcode.com/problems/univalued-binary-tree)|Easy|[Solution.java](Problems/965/Solution.java)|

|1008|[Construct Binary Search Tree from Preorder Traversal](https://leetcode.com/problems/construct-binary-search-tree-from-preorder-traversal)|Medium|[Solution.java](Problems/1008/Solution.java)|

|1021|[Remove Outermost Parentheses](https://leetcode.com/problems/remove-outermost-parentheses)|Easy|[Solution.java](Problems/1021/Solution.java)|

|1038|[Binary Search Tree to Greater Sum Tree](https://leetcode.com/problems/binary-search-tree-to-greater-sum-tree)|Medium|[Solution.java](Problems/1038/Solution.java)|

|1091|[Shortest Path in Binary Matrix](https://leetcode.com/problems/shortest-path-in-binary-matrix)|Medium|[Solution.java](Problems/1091/Solution.java)|

|1108|[Defanging an IP Address](https://leetcode.com/problems/defanging-an-ip-address)|Easy|[Solution.java](Problems/1108/Solution.java)|

|1137|[N-th Tribonacci Number](https://leetcode.com/problems/n-th-tribonacci-number/)|Easy|[Solution.java](Problems/1137/Solution.java)|

|1143|[Longest Common Subsequence](https://leetcode.com/problems/longest-common-subsequence)|Medium|[Solution.java](Problems/1143/Solution.java)|

|1179|[Reformat Department Table](https://leetcode.com/problems/reformat-department-table)|Easy|[Solution.java](Problems/1179/Solution.java)|

|1206|[Design Skiplist](https://leetcode.com/problems/design-skiplist/)|Hard|[Solution.java](Problems/1206/Solution.java)|

|1221|[Split a String in Balanced Strings](https://leetcode.com/problems/split-a-string-in-balanced-strings)|Easy|[Solution.java](Problems/1221/Solution.java)|

|1252|[Cells with Odd Values in a Matrix](https://leetcode.com/problems/cells-with-odd-values-in-a-matrix)|Easy|[Solution.java](Problems/1252/Solution.java)|

|1266|[Minimum Time Visiting All Points](https://leetcode.com/problems/minimum-time-visiting-all-points)|Easy|[Solution.java](Problems/1266/Solution.java)|

|1268|[Search Suggestions System](https://leetcode.com/problems/search-suggestions-system/)|Medium|[Solution.java](Problems/1268/Solution.java)|

|1281|[Subtract the Product and Sum of Digits of an Integer](https://leetcode.com/problems/subtract-the-product-and-sum-of-digits-of-an-integer)|Easy|[Solution.java](Problems/1281/Solution.java)|

|1282|[Group the People Given the Group Size They Belong To](https://leetcode.com/problems/group-the-people-given-the-group-size-they-belong-to)|Medium|[Solution.java](Problems/1282/Solution.java)|

|1290|[Convert Binary Number in a Linked List to Integer](https://leetcode.com/problems/convert-binary-number-in-a-linked-list-to-integer)|Easy|[Solution.java](Problems/1290/Solution.java)|

|1295|[Find Numbers with Even Number of Digits](https://leetcode.com/problems/find-numbers-with-even-number-of-digits)|Easy|[Solution.java](Problems/1295/Solution.java)|

|1299|[Replace Elements with Greatest Element on Right Side](https://leetcode.com/problems/replace-elements-with-greatest-element-on-right-side)|Easy|[Solution.java](Problems/1299/Solution.java)|

|1302|[Deepest Leaves Sum](https://leetcode.com/problems/deepest-leaves-sum)|Medium|[Solution.java](Problems/1302/Solution.java)|

|1304|[Find N Unique Integers Sum up to Zero](https://leetcode.com/problems/find-n-unique-integers-sum-up-to-zero)|Easy|[Solution.java](Problems/1304/Solution.java)|

|1305|[All Elements in Two Binary Search Trees](https://leetcode.com/problems/all-elements-in-two-binary-search-trees)|Medium|[Solution.java](Problems/1305/Solution.java)|

|1309|[Decrypt String from Alphabet to Integer Mapping](https://leetcode.com/problems/decrypt-string-from-alphabet-to-integer-mapping)|Easy|[Solution.java](Problems/1309/Solution.java)|

|1313|[Decompress Run-Length Encoded List](https://leetcode.com/problems/decompress-run-length-encoded-list)|Easy|[Solution.java](Problems/1313/Solution.java)|

|1315|[Sum of Nodes with Even-Valued Grandparent](https://leetcode.com/problems/sum-of-nodes-with-even-valued-grandparent)|Medium|[Solution.java](Problems/1315/Solution.java)|

|1323|[Maximum 69 Number](https://leetcode.com/problems/maximum-69-number)|Easy|[Solution.java](Problems/1323/Solution.java)|

|1329|[Sort the Matrix Diagonally](https://leetcode.com/problems/sort-the-matrix-diagonally)|Medium|[Solution.java](Problems/1329/Solution.java)|

|1337|[The K Weakest Rows in a Matrix](https://leetcode.com/problems/the-k-weakest-rows-in-a-matrix/)|Easy|[Solution.java](Problems/1337/Solution.java)|

|1342|[Number of Steps to Reduce a Number to Zero](https://leetcode.com/problems/number-of-steps-to-reduce-a-number-to-zero)|Easy|[Solution.java](Problems/1342/Solution.java)|

|1347|[Minimum Number of Steps to Make Two Strings Anagram](https://leetcode.com/problems/minimum-number-of-steps-to-make-two-strings-anagram)|Medium|[Solution.java](Problems/1347/Solution.java)|

|1351|[Count Negative Numbers in a Sorted Matrix](https://leetcode.com/problems/count-negative-numbers-in-a-sorted-matrix)|Easy|[Solution.java](Problems/1351/Solution.java)|

|1365|[How Many Numbers Are Smaller Than the Current Number](https://leetcode.com/problems/how-many-numbers-are-smaller-than-the-current-number)|Easy|[Solution.java](Problems/1365/Solution.java)|

|1370|[Increasing Decreasing String](https://leetcode.com/problems/increasing-decreasing-string)|Easy|[Solution.java](Problems/1370/Solution.java)|

|1374|[Generate a String With Characters That Have Odd Counts](https://leetcode.com/problems/generate-a-string-with-characters-that-have-odd-counts)|Easy|[Solution.java](Problems/1374/Solution.java)|

|1379|[Find a Corresponding Node of a Binary Tree in a Clone of That Tree](https://leetcode.com/problems/find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree)|Medium|[Solution.java](Problems/1379/Solution.java)|

|1380|[Lucky Numbers in a Matrix](https://leetcode.com/problems/lucky-numbers-in-a-matrix)|Easy|[Solution.java](Problems/1380/Solution.java)|

|1382|[Balance a Binary Search Tree](https://leetcode.com/problems/balance-a-binary-search-tree)|Medium|[Solution.java](Problems/1382/Solution.java)|

|1389|[Create Target Array in the Given Order](https://leetcode.com/problems/create-target-array-in-the-given-order)|Easy|[Solution.java](Problems/1389/Solution.java)|

|1395|[Count Number of Teams](https://leetcode.com/problems/count-number-of-teams)|Medium|[Solution.java](Problems/1395/Solution.java)|

|1408|[String Matching in an Array](https://leetcode.com/problems/string-matching-in-an-array/)|Easy|[Solution.java](Problems/1408/Solution.java)|

|1409|[Queries on a Permutation With Key](https://leetcode.com/problems/queries-on-a-permutation-with-key)|Medium|[Solution.java](Problems/1409/Solution.java)|

|1447|[Simplified Fractions](https://leetcode.com/problems/simplified-fractions)|Medium|[Solution.java](Problems/1447/Solution.java)|

|1450|[Number of Students Doing Homework at a Given Time](https://leetcode.com/problems/number-of-students-doing-homework-at-a-given-time)|Easy|[Solution.java](Problems/1450/Solution.java)|

|1464|[Maximum Product of Two Elements in an Array](https://leetcode.com/problems/maximum-product-of-two-elements-in-an-array/)|Easy|[Solution.java](Problems/1464/Solution.java)|

|1470|[Shuffle the Array](https://leetcode.com/problems/shuffle-the-array)|Easy|[Solution.java](Problems/1470/Solution.java)|

|1480|[Running Sum of 1d Array](https://leetcode.com/problems/running-sum-of-1d-array)|Easy|[Solution.java](Problems/1480/Solution.java)|

|1512|[Number of Good Pairs](https://leetcode.com/problems/number-of-good-pairs/)|Easy|[Solution.java](Problems/1512/Solution.java)|

|1534|[Count Good Triplets](https://leetcode.com/problems/count-good-triplets)|Easy|[Solution.java](Problems/1534/Solution.java)|

|1557|[Minimum Number of Vertices to Reach All Nodes](https://leetcode.com/problems/minimum-number-of-vertices-to-reach-all-nodes/)|Medium|[Solution.java](Problems/1557/Solution.java)|

|1588|[Sum of All Odd Length Subarrays](https://leetcode.com/problems/sum-of-all-odd-length-subarrays/)|Easy|[Solution.java](Problems/1588/Solution.java)|

|1603|[Design Parking System](https://leetcode.com/problems/design-parking-system/)|Easy|[Solution.java](Problems/1603/Solution.java)|

|1605|[Find Valid Matrix Given Row and Column Sums](https://leetcode.com/problems/find-valid-matrix-given-row-and-column-sums)|Medium|[Solution.java](Problems/1605/Solution.java)|

|1684|[Count the Number of Consistent Strings](https://leetcode.com/problems/count-the-number-of-consistent-strings/)|Easy|[Solution.java](Problems/1684/Solution.java)|

|1700|[Number of Students Unable to Eat Lunch](https://leetcode.com/problems/number-of-students-unable-to-eat-lunch/)|Easy|[Solution.java](Problems/1700/Solution.java)|

|1742|[Maximum Number of Balls in a Box](https://leetcode.com/problems/maximum-number-of-balls-in-a-box/)|Easy|[Solution.java](Problems/1742/Solution.java)|

|1784|[Check if Binary String Has at Most One Segment of Ones](https://leetcode.com/problems/check-if-binary-string-has-at-most-one-segment-of-ones/)|Easy|[Solution.java](Problems/1784/Solution.java)|

|1791|[Find Center of Star Graph](https://leetcode.com/problems/find-center-of-star-graph/)|Easy|[Solution.java](Problems/1791/Solution.java)|

|1817|[Finding the Users Active Minutes](https://leetcode.com/problems/finding-the-users-active-minutes)|Medium|[Solution.java](Problems/1817/Solution.java)|

|1829|[Maximum XOR for Each Query](https://leetcode.com/problems/maximum-xor-for-each-query/)|Medium|[Solution.java](Problems/1829/Solution.java)|

|1971|[Find if Path Exists in Graph](https://leetcode.com/problems/find-if-path-exists-in-graph/)|Easy|[Solution.java](Problems/1971/Solution.java)|

|2102|[Sequentially Ordinal Rank Tracker](https://leetcode.com/problems/sequentially-ordinal-rank-tracker/)|Hard|[Solution.java](Problems/2102/Solution.java)|

|2130|[Maximum Twin Sum of a Linked List](https://leetcode.com/problems/maximum-twin-sum-of-a-linked-list/)|Medium|[Solution.java](Problems/2130/Solution.java)|

|2181|[Merge Nodes in Between Zeros](https://leetcode.com/problems/merge-nodes-in-between-zeros/)|Medium|[Solution.java](Problems/2181/Solution.java)|

|2315|[Count Asterisks](https://leetcode.com/problems/count-asterisks/)|Easy|[Solution.java](Problems/2315/Solution.java)|

|2336|[Smallest Number in Infinite Set](https://leetcode.com/problems/smallest-number-in-infinite-set/)|Medium|[Solution.java](Problems/2336/Solution.java)|

|2363|[Merge Similar Items](https://leetcode.com/problems/merge-similar-items/)|Easy|[Solution.java](Problems/2363/Solution.java)|

|2427|[Number of Common Factors](https://leetcode.com/problems/number-of-common-factors/)|Easy|[Solution.java](Problems/2427/Solution.java)|

|2485|[Find the Pivot Integer](https://leetcode.com/problems/find-the-pivot-integer/)|Easy|[Solution.java](Problems/2485/Solution.java)|

|2545|[Sort the Students by Their Kth Score](https://leetcode.com/problems/sort-the-students-by-their-kth-score)|Medium|[Solution.java](Problems/2545/Solution.java)|



License

=======

Licensed under [MIT](LICENSE).