{"id":20774250,"url":"https://github.com/kantuni/leetcode","last_synced_at":"2025-04-30T15:18:09.398Z","repository":{"id":63990829,"uuid":"185817733","full_name":"kantuni/LeetCode","owner":"kantuni","description":"Solutions to LeetCode Problems","archived":false,"fork":false,"pushed_at":"2024-11-11T14:26:55.000Z","size":844,"stargazers_count":4,"open_issues_count":0,"forks_count":4,"subscribers_count":1,"default_branch":"master","last_synced_at":"2024-11-11T15:26:43.015Z","etag":null,"topics":["competitive-programming","leetcode","solutions"],"latest_commit_sha":null,"homepage":"https://leetcode.com/kantuni/","language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/kantuni.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2019-05-09T14:41:01.000Z","updated_at":"2024-11-11T14:27:36.000Z","dependencies_parsed_at":"2024-11-11T15:22:44.308Z","dependency_job_id":"2ee24874-c69c-4402-a9b0-3f43e68f889b","html_url":"https://github.com/kantuni/LeetCode","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/kantuni%2FLeetCode","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/kantuni%2FLeetCode/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/kantuni%2FLeetCode/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/kantuni%2FLeetCode/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/kantuni","download_url":"https://codeload.github.com/kantuni/LeetCode/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":225037264,"owners_count":17411025,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["competitive-programming","leetcode","solutions"],"created_at":"2024-11-17T12:28:52.630Z","updated_at":"2025-04-30T15:18:09.391Z","avatar_url":"https://github.com/kantuni.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Solutions to [LeetCode](https://leetcode.com/) Problems\n\n| #  | Title |\n| :- | :---- |\n| 1 | [Two Sum](https://github.com/kantuni/LeetCode/tree/master/1) |\n| 2 | [Add Two Numbers](https://github.com/kantuni/LeetCode/tree/master/2) |\n| 3 | [Longest Substring Without Repeating Characters](https://github.com/kantuni/LeetCode/tree/master/3) |\n| 7 | [Reverse Integer](https://github.com/kantuni/LeetCode/tree/master/7) |\n| 9\t| [Palindrome Number](https://github.com/kantuni/LeetCode/tree/master/9) |\n| 11 | [Container With Most Water](https://github.com/kantuni/LeetCode/tree/master/11) |\n| 12 | [Integer to Roman](https://github.com/kantuni/LeetCode/tree/master/12) |\n| 13 | [Roman to Integer](https://github.com/kantuni/LeetCode/tree/master/13) |\n| 14 | [Longest Common Prefix](https://github.com/kantuni/LeetCode/tree/master/14) |\n| 20 | [Valid Parentheses](https://github.com/kantuni/LeetCode/tree/master/20) |\n| 21 | [Merge Two Sorted Lists](https://github.com/kantuni/LeetCode/tree/master/21) |\n| 24 | [Swap Nodes in Pairs](https://github.com/kantuni/LeetCode/tree/master/24) |\n| 26 | [Remove Duplicates from Sorted Array](https://github.com/kantuni/LeetCode/tree/master/26) |\n| 27 | [Remove Element](https://github.com/kantuni/LeetCode/tree/master/27) |\n| 28 | [Implement strStr()](https://github.com/kantuni/LeetCode/tree/master/28) |\n| 31 | [Next Permutation](https://github.com/kantuni/LeetCode/tree/master/31) |\n| 33 | [Search in Rotated Sorted Array](https://github.com/kantuni/LeetCode/tree/master/33) |\n| 35 | [Search Insert Position](https://github.com/kantuni/LeetCode/tree/master/35) |\n| 38 | [Count and Say](https://github.com/kantuni/LeetCode/tree/master/38) |\n| 41 | [First Missing Positive](https://github.com/kantuni/LeetCode/tree/master/41) |\n| 46 | [Permutations](https://github.com/kantuni/LeetCode/tree/master/46) |\n| 47 | [Permutations II](https://github.com/kantuni/LeetCode/tree/master/47) |\n| 49 | [Group Anagrams](https://github.com/kantuni/LeetCode/tree/master/49) |\n| 51 | [N-Queens](https://github.com/kantuni/LeetCode/tree/master/51) |\n| 52 | [N-Queens II](https://github.com/kantuni/LeetCode/tree/master/52) |\n| 53 | [Maximum Subarray](https://github.com/kantuni/LeetCode/tree/master/53) |\n| 54 | [Spiral Matrix](https://github.com/kantuni/LeetCode/tree/master/54) |\n| 55 | [Jump Game](https://github.com/kantuni/LeetCode/tree/master/55) |\n| 56 | [Merge Intervals](https://github.com/kantuni/LeetCode/tree/master/56) |\n| 58 | [Length of Last Word](https://github.com/kantuni/LeetCode/tree/master/58) |\n| 64 | [Minimum Path Sum](https://github.com/kantuni/LeetCode/tree/master/64) |\n| 66 | [Plus One](https://github.com/kantuni/LeetCode/tree/master/66) |\n| 67 | [Add Binary](https://github.com/kantuni/LeetCode/tree/master/67) |\n| 69 | [Sqrt(x)](https://github.com/kantuni/LeetCode/tree/master/69) |\n| 70 | [Climbing Stairs](https://github.com/kantuni/LeetCode/tree/master/70) |\n| 78 | [Subsets](https://github.com/kantuni/LeetCode/tree/master/78) |\n| 80 | [Remove Duplicates from Sorted Array II](https://github.com/kantuni/LeetCode/tree/master/80) |\n| 83 | [Remove Duplicates from Sorted List](https://github.com/kantuni/LeetCode/tree/master/83) |\n| 88 | [Merge Sorted Array](https://github.com/kantuni/LeetCode/tree/master/88) |\n| 89 | [Gray Code](https://github.com/kantuni/LeetCode/tree/master/89) |\n| 90 | [Subsets II](https://github.com/kantuni/LeetCode/tree/master/90) |\n| 94 | [Binary Tree Inorder Traversal](https://github.com/kantuni/LeetCode/tree/master/94) |\n| 100 | [Same Tree](https://github.com/kantuni/LeetCode/tree/master/100) |\n| 101 | [Symmetric Tree](https://github.com/kantuni/LeetCode/tree/master/101) |\n| 102 | [Binary Tree Level Order Traversal](https://github.com/kantuni/LeetCode/tree/master/102) |\n| 104 | [Maximum Depth of Binary Tree](https://github.com/kantuni/LeetCode/tree/master/104) |\n| 105 | [Construct Binary Tree from Preorder and Inorder Traversal](https://github.com/kantuni/LeetCode/tree/master/105) |\n| 106 | [Construct Binary Tree from Inorder and Postorder Traversal](https://github.com/kantuni/LeetCode/tree/master/106) |\n| 107 | [Binary Tree Level Order Traversal II](https://github.com/kantuni/LeetCode/tree/master/107) |\n| 108 | [Convert Sorted Array to Binary Search Tree](https://github.com/kantuni/LeetCode/tree/master/108) |\n| 110 | [Balanced Binary Tree](https://github.com/kantuni/LeetCode/tree/master/110) |\n| 111 | [Minimum Depth of Binary Tree](https://github.com/kantuni/LeetCode/tree/master/111) |\n| 112 | [Path Sum](https://github.com/kantuni/LeetCode/tree/master/112) |\n| 116 | [Populating Next Right Pointers in Each Node](https://github.com/kantuni/LeetCode/tree/master/116) |\n| 118 | [Pascal's Triangle](https://github.com/kantuni/LeetCode/tree/master/118) |\n| 119 | [Pascal's Triangle II](https://github.com/kantuni/LeetCode/tree/master/119) |\n| 121 | [Best Time to Buy and Sell Stock](https://github.com/kantuni/LeetCode/tree/master/121) |\n| 122 | [Best Time to Buy and Sell Stock II](https://github.com/kantuni/LeetCode/tree/master/122) |\n| 124 | [Binary Tree Maximum Path Sum](https://github.com/kantuni/LeetCode/tree/master/124) |\n| 125 | [Valid Palindrome](https://github.com/kantuni/LeetCode/tree/master/125) |\n| 127 | [Word Ladder](https://github.com/kantuni/LeetCode/tree/master/127) |\n| 136 | [Single Number](https://github.com/kantuni/LeetCode/tree/master/136) |\n| 139 | [Word Break](https://github.com/kantuni/LeetCode/tree/master/139) |\n| 141 | [Linked List Cycle](https://github.com/kantuni/LeetCode/tree/master/141) |\n| 144 | [Binary Tree Preorder Traversal](https://github.com/kantuni/LeetCode/tree/master/144) |\n| 145 | [Binary Tree Postorder Traversal](https://github.com/kantuni/LeetCode/tree/master/145) |\n| 146 | [LRU Cache](https://github.com/kantuni/LeetCode/tree/master/146) |\n| 150 | [Evaluate Reverse Polish Notation](https://github.com/kantuni/LeetCode/tree/master/150) |\n| 155 | [Min Stack](https://github.com/kantuni/LeetCode/tree/master/155) |\n| 153 | [Find Minimum in Rotated Sorted Array](https://github.com/kantuni/LeetCode/tree/master/153) |\n| 160 | [Intersection of Two Linked Lists](https://github.com/kantuni/LeetCode/tree/master/160) |\n| 167 | [Two Sum II - Input array is sorted](https://github.com/kantuni/LeetCode/tree/master/167) |\n| 168 | [Excel Sheet Column Title](https://github.com/kantuni/LeetCode/tree/master/168) |\n| 169 | [Majority Element](https://github.com/kantuni/LeetCode/tree/master/169) |\n| 171 | [Excel Sheet Column Number](https://github.com/kantuni/LeetCode/tree/master/171) |\n| 172 | [Factorial Trailing Zeroes](https://github.com/kantuni/LeetCode/tree/master/172) |\n| 189 | [Rotate Array](https://github.com/kantuni/LeetCode/tree/master/189) |\n| 190 | [Reverse Bits](https://github.com/kantuni/LeetCode/tree/master/190) |\n| 191 | [Number of 1 Bits](https://github.com/kantuni/LeetCode/tree/master/191) |\n| 198 | [House Robber](https://github.com/kantuni/LeetCode/tree/master/198) |\n| 200 | [Number of Islands](https://github.com/kantuni/LeetCode/tree/master/200) |\n| 201 | [Bitwise AND of Numbers Range](https://github.com/kantuni/LeetCode/tree/master/201) |\n| 202 | [Happy Number](https://github.com/kantuni/LeetCode/tree/master/202) |\n| 203 | [Remove Linked List Elements](https://github.com/kantuni/LeetCode/tree/master/203) |\n| 204 | [Count Primes](https://github.com/kantuni/LeetCode/tree/master/204) |\n| 205 | [Isomorphic Strings](https://github.com/kantuni/LeetCode/tree/master/205) |\n| 206 | [Reverse Linked List](https://github.com/kantuni/LeetCode/tree/master/206) |\n| 208 | [Implement Trie (Prefix Tree)](https://github.com/kantuni/LeetCode/tree/master/208) |\n| 217 | [Contains Duplicate](https://github.com/kantuni/LeetCode/tree/master/217) |\n| 219 | [Contains Duplicate II](https://github.com/kantuni/LeetCode/tree/master/219) |\n| 221 | [Maximal Square](https://github.com/kantuni/LeetCode/tree/master/221) |\n| 222 | [Count Complete Tree Nodes](https://github.com/kantuni/LeetCode/tree/master/222) |\n| 225 | [Implement Stack using Queues](https://github.com/kantuni/LeetCode/tree/master/225) |\n| 226 | [Invert Binary Tree](https://github.com/kantuni/LeetCode/tree/master/226) |\n| 228 | [Summary Ranges](https://github.com/kantuni/LeetCode/tree/master/228) |\n| 230 | [Kth Smallest Element in a BST](https://github.com/kantuni/LeetCode/tree/master/230) |\n| 231 | [Power of Two](https://github.com/kantuni/LeetCode/tree/master/231) |\n| 232 | [Implement Queue using Stacks](https://github.com/kantuni/LeetCode/tree/master/232) |\n| 234 | [Palindrome Linked List](https://github.com/kantuni/LeetCode/tree/master/234) |\n| 235 | [Lowest Common Ancestor of a Binary Search Tree](https://github.com/kantuni/LeetCode/tree/master/235) |\n| 237 | [Delete Node in a Linked List](https://github.com/kantuni/LeetCode/tree/master/237) |\n| 238 | [Product of Array Except Self](https://github.com/kantuni/LeetCode/tree/master/238) |\n| 242 | [Valid Anagram](https://github.com/kantuni/LeetCode/tree/master/242) |\n| 257 | [Binary Tree Paths](https://github.com/kantuni/LeetCode/tree/master/257) |\n| 258 | [Add Digits](https://github.com/kantuni/LeetCode/tree/master/258) |\n| 263 | [Ugly Number](https://github.com/kantuni/LeetCode/tree/master/263) |\n| 268 | [Missing Number](https://github.com/kantuni/LeetCode/tree/master/268) |\n| 274 | [H-Index](https://github.com/kantuni/LeetCode/tree/master/274) |\n| 278 | [First Bad Version](https://github.com/kantuni/LeetCode/tree/master/278) |\n| 283 | [Move Zeroes](https://github.com/kantuni/LeetCode/tree/master/283) |\n| 290 | [Word Pattern](https://github.com/kantuni/LeetCode/tree/master/290) |\n| 292 | [Nim Game](https://github.com/kantuni/LeetCode/tree/master/292) |\n| 299 | [Bulls and Cows](https://github.com/kantuni/LeetCode/tree/master/299) |\n| 303 | [Range Sum Query - Immutable](https://github.com/kantuni/LeetCode/tree/master/303) |\n| 309 | [Best Time to Buy and Sell Stock with Cooldown](https://github.com/kantuni/LeetCode/tree/master/309) |\n| 322 | [Coin Change](https://github.com/kantuni/LeetCode/tree/master/322) |\n| 326 | [Power of Three](https://github.com/kantuni/LeetCode/tree/master/326) |\n| 328 | [Odd Even Linked List](https://github.com/kantuni/LeetCode/tree/master/328) |\n| 338 | [Counting Bits](https://github.com/kantuni/LeetCode/tree/master/338) |\n| 342 | [Power of Four](https://github.com/kantuni/LeetCode/tree/master/342) |\n| 344 | [Reverse String](https://github.com/kantuni/LeetCode/tree/master/344) |\n| 345 | [Reverse Vowels of a String](https://github.com/kantuni/LeetCode/tree/master/345) |\n| 349 | [Intersection of Two Arrays](https://github.com/kantuni/LeetCode/tree/master/349) |\n| 350 | [Intersection of Two Arrays II](https://github.com/kantuni/LeetCode/tree/master/350) |\n| 354 | [Russian Doll Envelopes](https://github.com/kantuni/LeetCode/tree/master/354) |\n| 367 | [Valid Perfect Square](https://github.com/kantuni/LeetCode/tree/master/367) |\n| 374 | [Guess Number Higher or Lower](https://github.com/kantuni/LeetCode/tree/master/374) |\n| 376 | [Wiggle Subsequence](https://github.com/kantuni/LeetCode/tree/master/376) |\n| 383 | [Ransom Note](https://github.com/kantuni/LeetCode/tree/master/383) |\n| 387 | [First Unique Character in a String](https://github.com/kantuni/LeetCode/tree/master/387) |\n| 389 | [Find the Difference](https://github.com/kantuni/LeetCode/tree/master/389) |\n| 392 | [Is Subsequence](https://github.com/kantuni/LeetCode/tree/master/392) |\n| 394 | [Decode String](https://github.com/kantuni/LeetCode/tree/master/394) |\n| 402 | [Remove K Digits](https://github.com/kantuni/LeetCode/tree/master/402) |\n| 403 | [Frog Jump](https://github.com/kantuni/LeetCode/tree/master/403) |\n| 404 | [Sum of Left Leaves](https://github.com/kantuni/LeetCode/tree/master/404) |\n| 405 | [Convert a Number to Hexadecimal](https://github.com/kantuni/LeetCode/tree/master/405) |\n| 409 | [Longest Palindrome](https://github.com/kantuni/LeetCode/tree/master/409) |\n| 412 | [Fizz Buzz](https://github.com/kantuni/LeetCode/tree/master/412) |\n| 414 | [Third Maximum Number](https://github.com/kantuni/LeetCode/tree/master/414) |\n| 415 | [Add Strings](https://github.com/kantuni/LeetCode/tree/master/415) |\n| 416 | [Partition Equal Subset Sum](https://github.com/kantuni/LeetCode/tree/master/416) |\n| 417 | [Pacific Atlantic Water Flow](https://github.com/kantuni/LeetCode/tree/master/417) |\n| 423 | [Reconstruct Original Digits from English](https://github.com/kantuni/LeetCode/tree/master/423) |\n| 434 | [Number of Segments in a String](https://github.com/kantuni/LeetCode/tree/master/434) |\n| 438 | [Find All Anagrams in a String](https://github.com/kantuni/LeetCode/tree/master/438) |\n| 441 | [Arranging Coins](https://github.com/kantuni/LeetCode/tree/master/441) |\n| 448 | [Find All Numbers Disappeared in an Array](https://github.com/kantuni/LeetCode/tree/master/448) |\n| 451 | [Sort Characters By Frequency](https://github.com/kantuni/LeetCode/tree/master/451) |\n| 455 | [Assign Cookies](https://github.com/kantuni/LeetCode/tree/master/455) |\n| 459 | [Repeated Substring Pattern](https://github.com/kantuni/LeetCode/tree/master/459) |\n| 461 | [Hamming Distance](https://github.com/kantuni/LeetCode/tree/master/461) |\n| 463 | [Island Perimeter](https://github.com/kantuni/LeetCode/tree/master/463) |\n| 476 | [Number Complement](https://github.com/kantuni/LeetCode/tree/master/476) |\n| 478 | [Generate Random Point in a Circle](https://github.com/kantuni/LeetCode/tree/master/478) |\n| 482 | [License Key Formatting](https://github.com/kantuni/LeetCode/tree/master/482) |\n| 485 | [Max Consecutive Ones](https://github.com/kantuni/LeetCode/tree/master/485) |\n| 492 | [Construct the Rectangle](https://github.com/kantuni/LeetCode/tree/master/492) |\n| 495 | [Teemo Attacking](https://github.com/kantuni/LeetCode/tree/master/495) |\n| 498 | [Diagonal Traverse](https://github.com/kantuni/LeetCode/tree/master/498) |\n| 500 | [Keyboard Row](https://github.com/kantuni/LeetCode/tree/master/500) |\n| 504 | [Base 7](https://github.com/kantuni/LeetCode/tree/master/504) |\n| 506 | [Relative Ranks](https://github.com/kantuni/LeetCode/tree/master/506) |\n| 507 | [Perfect Number](https://github.com/kantuni/LeetCode/tree/master/507) |\n| 509 | [Fibonacci Number](https://github.com/kantuni/LeetCode/tree/master/509) |\n| 520 | [Detect Capital](https://github.com/kantuni/LeetCode/tree/master/520) |\n| 525 | [Contiguous Array](https://github.com/kantuni/LeetCode/tree/master/525) |\n| 535 | [Encode and Decode TinyURL](https://github.com/kantuni/LeetCode/tree/master/535) |\n| 540 | [Single Element in a Sorted Array](https://github.com/kantuni/LeetCode/tree/master/540) |\n| 543 | [Diameter of Binary Tree](https://github.com/kantuni/LeetCode/tree/master/543) |\n| 560 | [Subarray Sum Equals K](https://github.com/kantuni/LeetCode/tree/master/560) |\n| 561 | [Array Partition](https://github.com/kantuni/LeetCode/tree/master/561) |\n| 567 | [Permutation in String](https://github.com/kantuni/LeetCode/tree/master/567) |\n| 575 | [Distribute Candies](https://github.com/kantuni/LeetCode/tree/master/575) |\n| 623 | [Add One Row to Tree](https://github.com/kantuni/LeetCode/tree/master/623) |\n| 637 | [Average of Levels in Binary Tree](https://github.com/kantuni/LeetCode/tree/master/637) |\n| 643 | [Maximum Average Subarray I](https://github.com/kantuni/LeetCode/tree/master/643) |\n| 645 | [Set Mismatch](https://github.com/kantuni/LeetCode/tree/master/645) |\n| 647 | [Palindromic Substrings](https://github.com/kantuni/LeetCode/tree/master/647) |\n| 678 | [Valid Parenthesis String](https://github.com/kantuni/LeetCode/tree/master/678) |\n| 680 | [Valid Palindrome II](https://github.com/kantuni/LeetCode/tree/master/680) |\n| 682 | [Baseball Game](https://github.com/kantuni/LeetCode/tree/master/682) |\n| 697 | [Degree of an Array](https://github.com/kantuni/LeetCode/tree/master/697) |\n| 700 | [Search in a Binary Search Tree](https://github.com/kantuni/LeetCode/tree/master/700) |\n| 706 | [Design HashMap](https://github.com/kantuni/LeetCode/tree/master/706) |\n| 709 | [To Lower Case](https://github.com/kantuni/LeetCode/tree/master/709) |\n| 714 | [Best Time to Buy and Sell Stock with Transaction Fee](https://github.com/kantuni/LeetCode/tree/master/714) |\n| 721 | [Accounts Merge](https://github.com/kantuni/LeetCode/tree/master/721) |\n| 724 | [Find Pivot Index](https://github.com/kantuni/LeetCode/tree/master/724) |\n| 728 | [Self Dividing Numbers](https://github.com/kantuni/LeetCode/tree/master/728) |\n| 733 | [Flood Fill](https://github.com/kantuni/LeetCode/tree/master/733) |\n| 747 | [Largest Number At Least Twice of Others](https://github.com/kantuni/LeetCode/tree/master/747) |\n| 771 | [Jewels and Stones](https://github.com/kantuni/LeetCode/tree/master/771) |\n| 775 | [Global and Local Inversions](https://github.com/kantuni/LeetCode/tree/master/775) |\n| 820 | [Short Encoding of Words](https://github.com/kantuni/LeetCode/tree/master/820) |\n| 823 | [Binary Trees With Factors](https://github.com/kantuni/LeetCode/tree/master/823) |\n| 836 | [Rectangle Overlap](https://github.com/kantuni/LeetCode/tree/master/836) |\n| 841 | [Keys and Rooms](https://github.com/kantuni/LeetCode/tree/master/841) |\n| 844 | [Backspace String Compare](https://github.com/kantuni/LeetCode/tree/master/844) |\n| 869 | [Reordered Power of 2](https://github.com/kantuni/LeetCode/tree/master/869) |\n| 870 | [Advantage Shuffle](https://github.com/kantuni/LeetCode/tree/master/870) |\n| 876 | [Middle of the Linked List](https://github.com/kantuni/LeetCode/tree/master/876) |\n| 883 | [Projection Area of 3D Shapes](https://github.com/kantuni/LeetCode/tree/master/883) |\n| 884 | [Uncommon Words from Two Sentences](https://github.com/kantuni/LeetCode/tree/master/884) |\n| 886 | [Possible Bipartition](https://github.com/kantuni/LeetCode/tree/master/886) |\n| 901 | [Online Stock Span](https://github.com/kantuni/LeetCode/tree/master/901) |\n| 905 | [Sort Array By Parity](https://github.com/kantuni/LeetCode/tree/master/905) |\n| 912 | [Sort an Array](https://github.com/kantuni/LeetCode/tree/master/912) |\n| 916 | [Word Subsets](https://github.com/kantuni/LeetCode/tree/master/916) |\n| 918 | [Maximum Sum Circular Subarray](https://github.com/kantuni/LeetCode/tree/master/918) |\n| 923 | [3Sum With Multiplicity](https://github.com/kantuni/LeetCode/tree/master/923) |\n| 935 | [Knight Dialer](https://github.com/kantuni/LeetCode/tree/master/935) |\n| 938 | [Range Sum of BST](https://github.com/kantuni/LeetCode/tree/master/938) |\n| 941 | [Valid Mountain Array](https://github.com/kantuni/LeetCode/tree/master/941) |\n| 966 | [Vowel Spellchecker](https://github.com/kantuni/LeetCode/tree/master/966) |\n| 971 | [Flip Binary Tree To Match Preorder Traversal](https://github.com/kantuni/LeetCode/tree/master/971) |\n| 977 | [Squares of a Sorted Array](https://github.com/kantuni/LeetCode/tree/master/977) |\n| 979 | [Distribute Coins in Binary Tree](https://github.com/kantuni/LeetCode/tree/master/979) |\n| 984 | [String Without AAA or BBB](https://github.com/kantuni/LeetCode/tree/master/984) |\n| 993 | [Cousins in Binary Tree](https://github.com/kantuni/LeetCode/tree/master/993) |\n| 997 | [Find the Town Judge](https://github.com/kantuni/LeetCode/tree/master/997) |\n| 1008 | [Construct Binary Search Tree from Preorder Traversal](https://github.com/kantuni/LeetCode/tree/master/1008) |\n| 1009 | [Complement of Base 10 Integer](https://github.com/kantuni/LeetCode/tree/master/1009) |\n| 1046 | [Last Stone Weight](https://github.com/kantuni/LeetCode/tree/master/1046) |\n| 1089 | [Duplicate Zeros](https://github.com/kantuni/LeetCode/tree/master/1089) |\n| 1051 | [Height Checker](https://github.com/kantuni/LeetCode/tree/master/1051) |\n| 1143 | [Longest Common Subsequence](https://github.com/kantuni/LeetCode/tree/master/1143) |\n| 1207 | [Unique Number of Occurrences](https://github.com/kantuni/LeetCode/tree/master/1207) |\n| 1232 | [Check If It Is a Straight Line](https://github.com/kantuni/LeetCode/tree/master/1232) |\n| 1277 | [Count Square Submatrices with All Ones](https://github.com/kantuni/LeetCode/tree/master/1277) |\n| 1295 | [Find Numbers with Even Number of Digits](https://github.com/kantuni/LeetCode/tree/master/1295) |\n| 1332 | [Remove Palindromic Subsequences](https://github.com/kantuni/LeetCode/tree/master/1332) |\n| 1386 | [Cinema Seat Allocation](https://github.com/kantuni/LeetCode/tree/master/1386) |\n| 1394 | [Find Lucky Integer in an Array](https://github.com/kantuni/LeetCode/tree/master/1394) |\n| 1396 | [Design Underground System](https://github.com/kantuni/LeetCode/tree/master/1396) |\n| 1426 | [Counting Elements](https://github.com/kantuni/LeetCode/tree/master/1426) |\n| 1427 | [Perform String Shifts](https://github.com/kantuni/LeetCode/tree/master/1427) |\n| 1428 | [Leftmost Column with at Least a One](https://github.com/kantuni/LeetCode/tree/master/1428) |\n| 1429 | [First Unique Number](https://github.com/kantuni/LeetCode/tree/master/1429) |\n| 1430 | [Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree](https://github.com/kantuni/LeetCode/tree/master/1430) |\n| 1461 | [Check If a String Contains All Binary Codes of Size K](https://github.com/kantuni/LeetCode/tree/master/1461) |\n| 1572 | [Matrix Diagonal Sum](https://github.com/kantuni/LeetCode/tree/master/1572) |\n| 1672 | [Richest Customer Wealth](https://github.com/kantuni/LeetCode/tree/master/1672) |\n| 1721 | [Swapping Nodes in a Linked List](https://github.com/kantuni/LeetCode/tree/master/1721) |\n| 1807 | [Evaluate the Bracket Pairs of a String](https://github.com/kantuni/LeetCode/tree/master/1807) |\n| 1971 | [Find if Path Exists in Graph](https://github.com/kantuni/LeetCode/tree/master/1971) |\n| 2215 | [Find the Difference of Two Arrays](https://github.com/kantuni/LeetCode/tree/master/2215) |\n| 2225 | [Find Players With Zero or One Losses](https://github.com/kantuni/LeetCode/tree/master/2225) |\n\nProblems solved: **248**\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fkantuni%2Fleetcode","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fkantuni%2Fleetcode","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fkantuni%2Fleetcode/lists"}