Ecosyste.ms: Awesome

An open API service indexing awesome lists of open source software.
Awesome Lists | Featured Topics | Projects
https://github.com/kantuni/leetcode

Solutions to LeetCode Problems
https://github.com/kantuni/leetcode
competitive-programming leetcode solutions
Last synced: 2 months ago
JSON representation
Solutions to LeetCode Problems
Host: GitHub
URL: https://github.com/kantuni/leetcode
Owner: kantuni
Created: 2019-05-09T14:41:01.000Z (over 5 years ago)
Default Branch: master
Last Pushed: 2024-11-11T14:26:55.000Z (3 months ago)
Last Synced: 2024-11-11T15:26:43.015Z (3 months ago)
Topics: competitive-programming, leetcode, solutions
Language: C++
Homepage: https://leetcode.com/kantuni/
Size: 824 KB
Stars: 4
Watchers: 1
Forks: 4
Open Issues: 0
Metadata Files:
- Readme: README.md
Awesome Lists containing this project

README

        # Solutions to [LeetCode](https://leetcode.com/) Problems

| #  | Title |

| :- | :---- |

| 1 | [Two Sum](https://github.com/kantuni/LeetCode/tree/master/1) |

| 2 | [Add Two Numbers](https://github.com/kantuni/LeetCode/tree/master/2) |

| 3 | [Longest Substring Without Repeating Characters](https://github.com/kantuni/LeetCode/tree/master/3) |

| 7 | [Reverse Integer](https://github.com/kantuni/LeetCode/tree/master/7) |

| 9	| [Palindrome Number](https://github.com/kantuni/LeetCode/tree/master/9) |

| 11 | [Container With Most Water](https://github.com/kantuni/LeetCode/tree/master/11) |

| 12 | [Integer to Roman](https://github.com/kantuni/LeetCode/tree/master/12) |

| 13 | [Roman to Integer](https://github.com/kantuni/LeetCode/tree/master/13) |

| 14 | [Longest Common Prefix](https://github.com/kantuni/LeetCode/tree/master/14) |

| 20 | [Valid Parentheses](https://github.com/kantuni/LeetCode/tree/master/20) |

| 21 | [Merge Two Sorted Lists](https://github.com/kantuni/LeetCode/tree/master/21) |

| 24 | [Swap Nodes in Pairs](https://github.com/kantuni/LeetCode/tree/master/24) |

| 26 | [Remove Duplicates from Sorted Array](https://github.com/kantuni/LeetCode/tree/master/26) |

| 27 | [Remove Element](https://github.com/kantuni/LeetCode/tree/master/27) |

| 28 | [Implement strStr()](https://github.com/kantuni/LeetCode/tree/master/28) |

| 31 | [Next Permutation](https://github.com/kantuni/LeetCode/tree/master/31) |

| 33 | [Search in Rotated Sorted Array](https://github.com/kantuni/LeetCode/tree/master/33) |

| 35 | [Search Insert Position](https://github.com/kantuni/LeetCode/tree/master/35) |

| 38 | [Count and Say](https://github.com/kantuni/LeetCode/tree/master/38) |

| 41 | [First Missing Positive](https://github.com/kantuni/LeetCode/tree/master/41) |

| 46 | [Permutations](https://github.com/kantuni/LeetCode/tree/master/46) |

| 47 | [Permutations II](https://github.com/kantuni/LeetCode/tree/master/47) |

| 49 | [Group Anagrams](https://github.com/kantuni/LeetCode/tree/master/49) |

| 51 | [N-Queens](https://github.com/kantuni/LeetCode/tree/master/51) |

| 52 | [N-Queens II](https://github.com/kantuni/LeetCode/tree/master/52) |

| 53 | [Maximum Subarray](https://github.com/kantuni/LeetCode/tree/master/53) |

| 54 | [Spiral Matrix](https://github.com/kantuni/LeetCode/tree/master/54) |

| 55 | [Jump Game](https://github.com/kantuni/LeetCode/tree/master/55) |

| 56 | [Merge Intervals](https://github.com/kantuni/LeetCode/tree/master/56) |

| 58 | [Length of Last Word](https://github.com/kantuni/LeetCode/tree/master/58) |

| 64 | [Minimum Path Sum](https://github.com/kantuni/LeetCode/tree/master/64) |

| 66 | [Plus One](https://github.com/kantuni/LeetCode/tree/master/66) |

| 67 | [Add Binary](https://github.com/kantuni/LeetCode/tree/master/67) |

| 69 | [Sqrt(x)](https://github.com/kantuni/LeetCode/tree/master/69) |

| 70 | [Climbing Stairs](https://github.com/kantuni/LeetCode/tree/master/70) |

| 78 | [Subsets](https://github.com/kantuni/LeetCode/tree/master/78) |

| 80 | [Remove Duplicates from Sorted Array II](https://github.com/kantuni/LeetCode/tree/master/80) |

| 83 | [Remove Duplicates from Sorted List](https://github.com/kantuni/LeetCode/tree/master/83) |

| 88 | [Merge Sorted Array](https://github.com/kantuni/LeetCode/tree/master/88) |

| 89 | [Gray Code](https://github.com/kantuni/LeetCode/tree/master/89) |

| 90 | [Subsets II](https://github.com/kantuni/LeetCode/tree/master/90) |

| 94 | [Binary Tree Inorder Traversal](https://github.com/kantuni/LeetCode/tree/master/94) |

| 100 | [Same Tree](https://github.com/kantuni/LeetCode/tree/master/100) |

| 101 | [Symmetric Tree](https://github.com/kantuni/LeetCode/tree/master/101) |

| 102 | [Binary Tree Level Order Traversal](https://github.com/kantuni/LeetCode/tree/master/102) |

| 104 | [Maximum Depth of Binary Tree](https://github.com/kantuni/LeetCode/tree/master/104) |

| 105 | [Construct Binary Tree from Preorder and Inorder Traversal](https://github.com/kantuni/LeetCode/tree/master/105) |

| 106 | [Construct Binary Tree from Inorder and Postorder Traversal](https://github.com/kantuni/LeetCode/tree/master/106) |

| 107 | [Binary Tree Level Order Traversal II](https://github.com/kantuni/LeetCode/tree/master/107) |

| 108 | [Convert Sorted Array to Binary Search Tree](https://github.com/kantuni/LeetCode/tree/master/108) |

| 110 | [Balanced Binary Tree](https://github.com/kantuni/LeetCode/tree/master/110) |

| 111 | [Minimum Depth of Binary Tree](https://github.com/kantuni/LeetCode/tree/master/111) |

| 112 | [Path Sum](https://github.com/kantuni/LeetCode/tree/master/112) |

| 116 | [Populating Next Right Pointers in Each Node](https://github.com/kantuni/LeetCode/tree/master/116) |

| 118 | [Pascal's Triangle](https://github.com/kantuni/LeetCode/tree/master/118) |

| 119 | [Pascal's Triangle II](https://github.com/kantuni/LeetCode/tree/master/119) |

| 121 | [Best Time to Buy and Sell Stock](https://github.com/kantuni/LeetCode/tree/master/121) |

| 122 | [Best Time to Buy and Sell Stock II](https://github.com/kantuni/LeetCode/tree/master/122) |

| 124 | [Binary Tree Maximum Path Sum](https://github.com/kantuni/LeetCode/tree/master/124) |

| 125 | [Valid Palindrome](https://github.com/kantuni/LeetCode/tree/master/125) |

| 127 | [Word Ladder](https://github.com/kantuni/LeetCode/tree/master/127) |

| 136 | [Single Number](https://github.com/kantuni/LeetCode/tree/master/136) |

| 139 | [Word Break](https://github.com/kantuni/LeetCode/tree/master/139) |

| 141 | [Linked List Cycle](https://github.com/kantuni/LeetCode/tree/master/141) |

| 144 | [Binary Tree Preorder Traversal](https://github.com/kantuni/LeetCode/tree/master/144) |

| 145 | [Binary Tree Postorder Traversal](https://github.com/kantuni/LeetCode/tree/master/145) |

| 146 | [LRU Cache](https://github.com/kantuni/LeetCode/tree/master/146) |

| 150 | [Evaluate Reverse Polish Notation](https://github.com/kantuni/LeetCode/tree/master/150) |

| 155 | [Min Stack](https://github.com/kantuni/LeetCode/tree/master/155) |

| 153 | [Find Minimum in Rotated Sorted Array](https://github.com/kantuni/LeetCode/tree/master/153) |

| 160 | [Intersection of Two Linked Lists](https://github.com/kantuni/LeetCode/tree/master/160) |

| 167 | [Two Sum II - Input array is sorted](https://github.com/kantuni/LeetCode/tree/master/167) |

| 168 | [Excel Sheet Column Title](https://github.com/kantuni/LeetCode/tree/master/168) |

| 169 | [Majority Element](https://github.com/kantuni/LeetCode/tree/master/169) |

| 171 | [Excel Sheet Column Number](https://github.com/kantuni/LeetCode/tree/master/171) |

| 172 | [Factorial Trailing Zeroes](https://github.com/kantuni/LeetCode/tree/master/172) |

| 189 | [Rotate Array](https://github.com/kantuni/LeetCode/tree/master/189) |

| 190 | [Reverse Bits](https://github.com/kantuni/LeetCode/tree/master/190) |

| 191 | [Number of 1 Bits](https://github.com/kantuni/LeetCode/tree/master/191) |

| 198 | [House Robber](https://github.com/kantuni/LeetCode/tree/master/198) |

| 200 | [Number of Islands](https://github.com/kantuni/LeetCode/tree/master/200) |

| 201 | [Bitwise AND of Numbers Range](https://github.com/kantuni/LeetCode/tree/master/201) |

| 202 | [Happy Number](https://github.com/kantuni/LeetCode/tree/master/202) |

| 203 | [Remove Linked List Elements](https://github.com/kantuni/LeetCode/tree/master/203) |

| 204 | [Count Primes](https://github.com/kantuni/LeetCode/tree/master/204) |

| 205 | [Isomorphic Strings](https://github.com/kantuni/LeetCode/tree/master/205) |

| 206 | [Reverse Linked List](https://github.com/kantuni/LeetCode/tree/master/206) |

| 208 | [Implement Trie (Prefix Tree)](https://github.com/kantuni/LeetCode/tree/master/208) |

| 217 | [Contains Duplicate](https://github.com/kantuni/LeetCode/tree/master/217) |

| 219 | [Contains Duplicate II](https://github.com/kantuni/LeetCode/tree/master/219) |

| 221 | [Maximal Square](https://github.com/kantuni/LeetCode/tree/master/221) |

| 225 | [Implement Stack using Queues](https://github.com/kantuni/LeetCode/tree/master/225) |

| 226 | [Invert Binary Tree](https://github.com/kantuni/LeetCode/tree/master/226) |

| 228 | [Summary Ranges](https://github.com/kantuni/LeetCode/tree/master/228) |

| 230 | [Kth Smallest Element in a BST](https://github.com/kantuni/LeetCode/tree/master/230) |

| 231 | [Power of Two](https://github.com/kantuni/LeetCode/tree/master/231) |

| 232 | [Implement Queue using Stacks](https://github.com/kantuni/LeetCode/tree/master/232) |

| 234 | [Palindrome Linked List](https://github.com/kantuni/LeetCode/tree/master/234) |

| 235 | [Lowest Common Ancestor of a Binary Search Tree](https://github.com/kantuni/LeetCode/tree/master/235) |

| 237 | [Delete Node in a Linked List](https://github.com/kantuni/LeetCode/tree/master/237) |

| 238 | [Product of Array Except Self](https://github.com/kantuni/LeetCode/tree/master/238) |

| 242 | [Valid Anagram](https://github.com/kantuni/LeetCode/tree/master/242) |

| 257 | [Binary Tree Paths](https://github.com/kantuni/LeetCode/tree/master/257) |

| 258 | [Add Digits](https://github.com/kantuni/LeetCode/tree/master/258) |

| 263 | [Ugly Number](https://github.com/kantuni/LeetCode/tree/master/263) |

| 268 | [Missing Number](https://github.com/kantuni/LeetCode/tree/master/268) |

| 274 | [H-Index](https://github.com/kantuni/LeetCode/tree/master/274) |

| 278 | [First Bad Version](https://github.com/kantuni/LeetCode/tree/master/278) |

| 283 | [Move Zeroes](https://github.com/kantuni/LeetCode/tree/master/283) |

| 290 | [Word Pattern](https://github.com/kantuni/LeetCode/tree/master/290) |

| 292 | [Nim Game](https://github.com/kantuni/LeetCode/tree/master/292) |

| 299 | [Bulls and Cows](https://github.com/kantuni/LeetCode/tree/master/299) |

| 303 | [Range Sum Query - Immutable](https://github.com/kantuni/LeetCode/tree/master/303) |

| 309 | [Best Time to Buy and Sell Stock with Cooldown](https://github.com/kantuni/LeetCode/tree/master/309) |

| 322 | [Coin Change](https://github.com/kantuni/LeetCode/tree/master/322) |

| 326 | [Power of Three](https://github.com/kantuni/LeetCode/tree/master/326) |

| 328 | [Odd Even Linked List](https://github.com/kantuni/LeetCode/tree/master/328) |

| 338 | [Counting Bits](https://github.com/kantuni/LeetCode/tree/master/338) |

| 342 | [Power of Four](https://github.com/kantuni/LeetCode/tree/master/342) |

| 344 | [Reverse String](https://github.com/kantuni/LeetCode/tree/master/344) |

| 345 | [Reverse Vowels of a String](https://github.com/kantuni/LeetCode/tree/master/345) |

| 349 | [Intersection of Two Arrays](https://github.com/kantuni/LeetCode/tree/master/349) |

| 350 | [Intersection of Two Arrays II](https://github.com/kantuni/LeetCode/tree/master/350) |

| 354 | [Russian Doll Envelopes](https://github.com/kantuni/LeetCode/tree/master/354) |

| 367 | [Valid Perfect Square](https://github.com/kantuni/LeetCode/tree/master/367) |

| 374 | [Guess Number Higher or Lower](https://github.com/kantuni/LeetCode/tree/master/374) |

| 376 | [Wiggle Subsequence](https://github.com/kantuni/LeetCode/tree/master/376) |

| 383 | [Ransom Note](https://github.com/kantuni/LeetCode/tree/master/383) |

| 387 | [First Unique Character in a String](https://github.com/kantuni/LeetCode/tree/master/387) |

| 389 | [Find the Difference](https://github.com/kantuni/LeetCode/tree/master/389) |

| 392 | [Is Subsequence](https://github.com/kantuni/LeetCode/tree/master/392) |

| 394 | [Decode String](https://github.com/kantuni/LeetCode/tree/master/394) |

| 402 | [Remove K Digits](https://github.com/kantuni/LeetCode/tree/master/402) |

| 403 | [Frog Jump](https://github.com/kantuni/LeetCode/tree/master/403) |

| 404 | [Sum of Left Leaves](https://github.com/kantuni/LeetCode/tree/master/404) |

| 405 | [Convert a Number to Hexadecimal](https://github.com/kantuni/LeetCode/tree/master/405) |

| 409 | [Longest Palindrome](https://github.com/kantuni/LeetCode/tree/master/409) |

| 412 | [Fizz Buzz](https://github.com/kantuni/LeetCode/tree/master/412) |

| 414 | [Third Maximum Number](https://github.com/kantuni/LeetCode/tree/master/414) |

| 415 | [Add Strings](https://github.com/kantuni/LeetCode/tree/master/415) |

| 416 | [Partition Equal Subset Sum](https://github.com/kantuni/LeetCode/tree/master/416) |

| 417 | [Pacific Atlantic Water Flow](https://github.com/kantuni/LeetCode/tree/master/417) |

| 423 | [Reconstruct Original Digits from English](https://github.com/kantuni/LeetCode/tree/master/423) |

| 434 | [Number of Segments in a String](https://github.com/kantuni/LeetCode/tree/master/434) |

| 438 | [Find All Anagrams in a String](https://github.com/kantuni/LeetCode/tree/master/438) |

| 441 | [Arranging Coins](https://github.com/kantuni/LeetCode/tree/master/441) |

| 448 | [Find All Numbers Disappeared in an Array](https://github.com/kantuni/LeetCode/tree/master/448) |

| 451 | [Sort Characters By Frequency](https://github.com/kantuni/LeetCode/tree/master/451) |

| 455 | [Assign Cookies](https://github.com/kantuni/LeetCode/tree/master/455) |

| 459 | [Repeated Substring Pattern](https://github.com/kantuni/LeetCode/tree/master/459) |

| 461 | [Hamming Distance](https://github.com/kantuni/LeetCode/tree/master/461) |

| 463 | [Island Perimeter](https://github.com/kantuni/LeetCode/tree/master/463) |

| 476 | [Number Complement](https://github.com/kantuni/LeetCode/tree/master/476) |

| 478 | [Generate Random Point in a Circle](https://github.com/kantuni/LeetCode/tree/master/478) |

| 482 | [License Key Formatting](https://github.com/kantuni/LeetCode/tree/master/482) |

| 485 | [Max Consecutive Ones](https://github.com/kantuni/LeetCode/tree/master/485) |

| 492 | [Construct the Rectangle](https://github.com/kantuni/LeetCode/tree/master/492) |

| 495 | [Teemo Attacking](https://github.com/kantuni/LeetCode/tree/master/495) |

| 498 | [Diagonal Traverse](https://github.com/kantuni/LeetCode/tree/master/498) |

| 500 | [Keyboard Row](https://github.com/kantuni/LeetCode/tree/master/500) |

| 504 | [Base 7](https://github.com/kantuni/LeetCode/tree/master/504) |

| 506 | [Relative Ranks](https://github.com/kantuni/LeetCode/tree/master/506) |

| 507 | [Perfect Number](https://github.com/kantuni/LeetCode/tree/master/507) |

| 509 | [Fibonacci Number](https://github.com/kantuni/LeetCode/tree/master/509) |

| 520 | [Detect Capital](https://github.com/kantuni/LeetCode/tree/master/520) |

| 525 | [Contiguous Array](https://github.com/kantuni/LeetCode/tree/master/525) |

| 535 | [Encode and Decode TinyURL](https://github.com/kantuni/LeetCode/tree/master/535) |

| 540 | [Single Element in a Sorted Array](https://github.com/kantuni/LeetCode/tree/master/540) |

| 543 | [Diameter of Binary Tree](https://github.com/kantuni/LeetCode/tree/master/543) |

| 560 | [Subarray Sum Equals K](https://github.com/kantuni/LeetCode/tree/master/560) |

| 561 | [Array Partition](https://github.com/kantuni/LeetCode/tree/master/561) |

| 567 | [Permutation in String](https://github.com/kantuni/LeetCode/tree/master/567) |

| 575 | [Distribute Candies](https://github.com/kantuni/LeetCode/tree/master/575) |

| 623 | [Add One Row to Tree](https://github.com/kantuni/LeetCode/tree/master/623) |

| 637 | [Average of Levels in Binary Tree](https://github.com/kantuni/LeetCode/tree/master/637) |

| 643 | [Maximum Average Subarray I](https://github.com/kantuni/LeetCode/tree/master/643) |

| 645 | [Set Mismatch](https://github.com/kantuni/LeetCode/tree/master/645) |

| 647 | [Palindromic Substrings](https://github.com/kantuni/LeetCode/tree/master/647) |

| 678 | [Valid Parenthesis String](https://github.com/kantuni/LeetCode/tree/master/678) |

| 680 | [Valid Palindrome II](https://github.com/kantuni/LeetCode/tree/master/680) |

| 682 | [Baseball Game](https://github.com/kantuni/LeetCode/tree/master/682) |

| 697 | [Degree of an Array](https://github.com/kantuni/LeetCode/tree/master/697) |

| 700 | [Search in a Binary Search Tree](https://github.com/kantuni/LeetCode/tree/master/700) |

| 706 | [Design HashMap](https://github.com/kantuni/LeetCode/tree/master/706) |

| 709 | [To Lower Case](https://github.com/kantuni/LeetCode/tree/master/709) |

| 714 | [Best Time to Buy and Sell Stock with Transaction Fee](https://github.com/kantuni/LeetCode/tree/master/714) |

| 721 | [Accounts Merge](https://github.com/kantuni/LeetCode/tree/master/721) |

| 724 | [Find Pivot Index](https://github.com/kantuni/LeetCode/tree/master/724) |

| 728 | [Self Dividing Numbers](https://github.com/kantuni/LeetCode/tree/master/728) |

| 733 | [Flood Fill](https://github.com/kantuni/LeetCode/tree/master/733) |

| 747 | [Largest Number At Least Twice of Others](https://github.com/kantuni/LeetCode/tree/master/747) |

| 771 | [Jewels and Stones](https://github.com/kantuni/LeetCode/tree/master/771) |

| 775 | [Global and Local Inversions](https://github.com/kantuni/LeetCode/tree/master/775) |

| 820 | [Short Encoding of Words](https://github.com/kantuni/LeetCode/tree/master/820) |

| 823 | [Binary Trees With Factors](https://github.com/kantuni/LeetCode/tree/master/823) |

| 836 | [Rectangle Overlap](https://github.com/kantuni/LeetCode/tree/master/836) |

| 841 | [Keys and Rooms](https://github.com/kantuni/LeetCode/tree/master/841) |

| 844 | [Backspace String Compare](https://github.com/kantuni/LeetCode/tree/master/844) |

| 869 | [Reordered Power of 2](https://github.com/kantuni/LeetCode/tree/master/869) |

| 870 | [Advantage Shuffle](https://github.com/kantuni/LeetCode/tree/master/870) |

| 876 | [Middle of the Linked List](https://github.com/kantuni/LeetCode/tree/master/876) |

| 883 | [Projection Area of 3D Shapes](https://github.com/kantuni/LeetCode/tree/master/883) |

| 884 | [Uncommon Words from Two Sentences](https://github.com/kantuni/LeetCode/tree/master/884) |

| 886 | [Possible Bipartition](https://github.com/kantuni/LeetCode/tree/master/886) |

| 901 | [Online Stock Span](https://github.com/kantuni/LeetCode/tree/master/901) |

| 905 | [Sort Array By Parity](https://github.com/kantuni/LeetCode/tree/master/905) |

| 912 | [Sort an Array](https://github.com/kantuni/LeetCode/tree/master/912) |

| 916 | [Word Subsets](https://github.com/kantuni/LeetCode/tree/master/916) |

| 918 | [Maximum Sum Circular Subarray](https://github.com/kantuni/LeetCode/tree/master/918) |

| 923 | [3Sum With Multiplicity](https://github.com/kantuni/LeetCode/tree/master/923) |

| 935 | [Knight Dialer](https://github.com/kantuni/LeetCode/tree/master/935) |

| 938 | [Range Sum of BST](https://github.com/kantuni/LeetCode/tree/master/938) |

| 941 | [Valid Mountain Array](https://github.com/kantuni/LeetCode/tree/master/941) |

| 966 | [Vowel Spellchecker](https://github.com/kantuni/LeetCode/tree/master/966) |

| 971 | [Flip Binary Tree To Match Preorder Traversal](https://github.com/kantuni/LeetCode/tree/master/971) |

| 977 | [Squares of a Sorted Array](https://github.com/kantuni/LeetCode/tree/master/977) |

| 979 | [Distribute Coins in Binary Tree](https://github.com/kantuni/LeetCode/tree/master/979) |

| 984 | [String Without AAA or BBB](https://github.com/kantuni/LeetCode/tree/master/984) |

| 993 | [Cousins in Binary Tree](https://github.com/kantuni/LeetCode/tree/master/993) |

| 997 | [Find the Town Judge](https://github.com/kantuni/LeetCode/tree/master/997) |

| 1008 | [Construct Binary Search Tree from Preorder Traversal](https://github.com/kantuni/LeetCode/tree/master/1008) |

| 1009 | [Complement of Base 10 Integer](https://github.com/kantuni/LeetCode/tree/master/1009) |

| 1046 | [Last Stone Weight](https://github.com/kantuni/LeetCode/tree/master/1046) |

| 1089 | [Duplicate Zeros](https://github.com/kantuni/LeetCode/tree/master/1089) |

| 1051 | [Height Checker](https://github.com/kantuni/LeetCode/tree/master/1051) |

| 1143 | [Longest Common Subsequence](https://github.com/kantuni/LeetCode/tree/master/1143) |

| 1207 | [Unique Number of Occurrences](https://github.com/kantuni/LeetCode/tree/master/1207) |

| 1232 | [Check If It Is a Straight Line](https://github.com/kantuni/LeetCode/tree/master/1232) |

| 1277 | [Count Square Submatrices with All Ones](https://github.com/kantuni/LeetCode/tree/master/1277) |

| 1295 | [Find Numbers with Even Number of Digits](https://github.com/kantuni/LeetCode/tree/master/1295) |

| 1332 | [Remove Palindromic Subsequences](https://github.com/kantuni/LeetCode/tree/master/1332) |

| 1386 | [Cinema Seat Allocation](https://github.com/kantuni/LeetCode/tree/master/1386) |

| 1394 | [Find Lucky Integer in an Array](https://github.com/kantuni/LeetCode/tree/master/1394) |

| 1396 | [Design Underground System](https://github.com/kantuni/LeetCode/tree/master/1396) |

| 1426 | [Counting Elements](https://github.com/kantuni/LeetCode/tree/master/1426) |

| 1427 | [Perform String Shifts](https://github.com/kantuni/LeetCode/tree/master/1427) |

| 1428 | [Leftmost Column with at Least a One](https://github.com/kantuni/LeetCode/tree/master/1428) |

| 1429 | [First Unique Number](https://github.com/kantuni/LeetCode/tree/master/1429) |

| 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) |

| 1461 | [Check If a String Contains All Binary Codes of Size K](https://github.com/kantuni/LeetCode/tree/master/1461) |

| 1572 | [Matrix Diagonal Sum](https://github.com/kantuni/LeetCode/tree/master/1572) |

| 1672 | [Richest Customer Wealth](https://github.com/kantuni/LeetCode/tree/master/1672) |

| 1721 | [Swapping Nodes in a Linked List](https://github.com/kantuni/LeetCode/tree/master/1721) |

| 1807 | [Evaluate the Bracket Pairs of a String](https://github.com/kantuni/LeetCode/tree/master/1807) |

| 1971 | [Find if Path Exists in Graph](https://github.com/kantuni/LeetCode/tree/master/1971) |

| 2215 | [Find the Difference of Two Arrays](https://github.com/kantuni/LeetCode/tree/master/2215) |

| 2225 | [Find Players With Zero or One Losses](https://github.com/kantuni/LeetCode/tree/master/2225) |

Problems solved: **247**