leetcode

Solution to some Leetcode problems written in C++

git clone git://git.dimitrijedobrota.com/leetcode.git

commit	87740c85dacf580478a2d2d4f0b655cdd611a34f
parent	6a82a0c01cae763b371dfb9b2da74bc5f21d20e7
author	Dimitrije Dobrota <mail@dimitrijedobrota.com>
date	Mon, 5 Dec 2022 19:10:27 +0100

Put everything in a table for a nicer display

Diffstat:

README.md

+++++++++++++++++++++++++++++++++++++++++-----------------------------------------

1 files changed, 186 insertions(+), 182 deletions(-)

diff --git a/README.md b/README.md

@@ -8,189 +8,193 @@ if you have any questions.

## Problems

0001. (Easy) [Two Sum](Problems/0001.cpp)

0002. (Medium) [Add Two Numbers](Problems/0002.cpp)

0003. (Medium) [Longest Substring Without Repeating Characters](Problems/0003.cpp)

0012. (Medium) [Integer to Roman](Problems/0012.cpp)

0013. (Easy) [Roman to Integer](Problems/0013.cpp)

0014. (Easy) [Longest Common Prefix](Problems/0014.cpp)

0019. (Medium) [Remove Nth Node From the End of List](Problems/0019.cpp)

0020. (Easy) [Valid Parentheses](Problems/0020.cpp)

0021. (Easy) [Merge Two Sorted Lists](Problems/0021.cpp)

0024. (Medium) [Swap Nodes in Pairs](Problems/0024.cpp)

0026. (Easy) [Remove Duplicates from Sorted Array](Problems/0026.cpp)

0027. (Easy) [Remove Element](Problems/0027.cpp)

0028. (Medium) [Find the Index of the First Occurrence in a String](Problems/0028.cpp)

0036. (Medium) [Valid Sudoku](Problems/0036.cpp)

0043. (Medium) [Multiply Strings](Problems/0043.cpp)

0054. (Medium) [Spiral Matrix](Problems/0054.cpp)

0059. (Medium) [Spiral Matrix II](Problems/0059.cpp)

0061. (Medium) [Rotate List](Problems/0061.cpp)

0066. (Easy) [Plus One](Problems/0066.cpp)

0067. (Easy) [Add Binary](Problems/0067.cpp)

0070. (Easy) [Climbing Stairs](Problems/0070.cpp)

0083. (Easy) [Remove Duplicates from Sorted List](Problems/0083.cpp)

0088. (Easy) [Merge Sorted Array](Problems/0088.cpp)

0094. (Easy) [Binary Tree Inorder Traversal](Problems/0094.cpp)

0100. (Easy) [Same Tree](Problems/0100.cpp)

0101. (Easy) [Symmetric Tree](Problems/0101.cpp)

0102. (Medium) [Binary Tree Level Order Traversal](Problems/0102.cpp)

0103. (Medium) [Binary Tree Zigzag Level Order Traversal](Problems/0103.cpp)

0104. (Easy) [Maximum Depth of Binary Tree](Problems/0104.cpp)

0107. (Medium) [Binary Tree Level Order Traversal II](Problems/0107.cpp)

0111. (Easy) [Minimum Depth of Binary Tree](Problems/0111.cpp)

0112. (Easy) [Path Sum](Problems/0112.cpp)

0114. (Medium) [Flatten Binary Tree to Linked List](Problems/0114.cpp)

0116. (Medium) [Populating Next Right Pointers in Each Node](Problems/0116.cpp)

0117. (Medium) [Populating Next Right Pointers in Each Node II](Problems/0117.cpp)

0118. (Easy) [Pascal's Triangle](Problems/0118.cpp)

0119. (Easy) [Pascal's Triangle II](Problems/0119.cpp)

0121. (Easy) [Best Time to Buy and Sell Stock](Problems/0121.cpp)

0133. (Medium) [Clone Graph](Problems/0133.cpp)

0138. (Medium) [Copy List with Random Pointer](Problems/0138.cpp)

0141. (Easy) [Linked List Cycle](Problems/0141.cpp)

0142. (Medium) [Linked List Cycle II](Problems/0142.cpp)

0144. (Medium) [Binary Tree Preorder Traversal](Problems/0144.cpp)

0145. (Easy) [Binary Tree Postorder Traversal](Problems/0145.cpp)

0150. (Medium) [Evaluate Reverse Polish Notation](Problems/0150.cpp)

0151. (Medium) [Reverse Words in a String](Problems/0151.cpp)

0160. (Easy) [Intersection of Two Linked Lists](Problems/0160.cpp)

0167. (Medium) [Two Sum II - Input Array Is Sorted](Problems/0167.cpp)

0189. (Medium) [Rotate Array](Problems/0189.cpp)

0199. (Medium) [Binary Tree Right Side View](Problems/0199.cpp)

0200. (Medium) [Number of Islands](Problems/0200.cpp)

0203. (Easy) [Remove Linked List Elements](Problems/0203.cpp)

0206. (Easy) [Reverse Linked List](Problems/0206.cpp)

0209. (Medium) [Minimum Size Subarray Sum](Problems/0209.cpp)

0222. (Medium) [Count Complete Tree Nodes](Problems/0222.cpp)

0223. (Medium) [Rectangle Area](Problems/0223.cpp)

0226. (Easy) [Invert Binary Tree](Problems/0226.cpp)

0234. (Easy) [Palindrome Linked List](Problems/0234.cpp)

0236. (Medium) [Lowest Common Ancestor of a Binary Tree](Problems/0236.cpp)

0237. (Medium) [Delete Node in a Linked List](Problems/0237.cpp)

0257. (Easy) [Binary Tree Paths](Problems/0257.cpp)

0263. (Easy) [Ugly Number](Problems/0263.cpp)

0279. (Medium) [Perfect Squares](Problems/0279.cpp)

0283. (Easy) [Move Zeroes](Problems/0283.cpp)

0328. (Medium) [Odd Even Linked List](Problems/0328.cpp)

0338. (Easy) [Counting Bits](Problems/0338.cpp)

0344. (Easy) [Reverse String](Problems/0344.cpp)

0345. (Easy) [Reverse Vowels of a String](Problems/0345.cpp)

0374. (Easy) [Guess Number Higher or Lower](Problems/0374.cpp)

0383. (Easy) [Ransom Note](Problems/0383.cpp)

0387. (Easy) [First Unique Character in a String](Problems/0387.cpp)

0392. (Easy) [Is Subsequence](Problems/0392.cpp)

0394. (Medium) [Decode String](Problems/0394.cpp)

0404. (Easy) [Sum of Left Leaves](Problems/0404.cpp)

0412. (Easy) [Fizz Buzz](Problems/0412.cpp)

0414. (Easy) [Third Maximum Number](Problems/0414.cpp)

0415. (Easy) [Add Strings](Problems/0415.cpp)

0429. (Medium) [N-ary Tree Level Order Traversal](Problems/0429.cpp)

0430. (Medium) [Flatten a Multilevel Doubly Linked list](Problems/0430.cpp)

0433. (Medium) [Minimum Genetic Mutation](Problems/0433.cpp)

0445. (Medium) [Add Two Numbers II](Problems/0445.cpp)

0448. (Easy) [Find All Numbers Disappeared in an Array](Problems/0448.cpp)

0485. (Easy) [Max Consecutive Ones](Problems/0485.cpp)

0496. (Medium) [Next Greater Element I](Problems/0496.cpp)

0498. (Medium) [Diagonal Traverse](Problems/0498.cpp)

0503. (Medium) [Next Greater Element II](Problems/0503.cpp)

0509. (Easy) [Fibonacci Number](Problems/0509.cpp)

0543. (Easy) [Diameter of Binary Tree](Problems/0543.cpp)

0547. (Medium) [Number of Provinces](Problems/0547.cpp)

0556. (Medium) [Next Greater Element III](Problems/0556.cpp)

0557. (Easy) [Reverse Words in a String III](Problems/0557.cpp)

0559. (Easy) [Maximum Depth of N-ary Tree](Problems/0559.cpp)

0561. (Easy) [Array Partition](Problems/0561.cpp)

0563. (Easy) [Binary Tree Tilt](Problems/0563.cpp)

0572. (Easy) [Subtree of Another Tree](Problems/0572.cpp)

0589. (Easy) [N-ary Tree Preorder Traversal](Problems/0589.cpp)

0590. (Easy) [N-ary Tree Postorder Traversal](Problems/0590.cpp)

0606. (Easy) [Construct String from Binary Tree ](Problems/0606.cpp)

0617. (Easy) [Merge Two Binary Trees](Problems/0617.cpp)

0637. (Easy) [Average of Levels in Binary Tree](Problems/0637.cpp)

0684. (Medium) [Redundant Connection](Problems/0684.cpp)

0707. (Medium) [Design Linked List](Problems/0707.cpp)

0724. (Easy) [Find Pivot Index](Problems/0724.cpp)

0733. (Easy) [Flood Fill](Problems/0733.cpp)

0739. (Medium) [Daily Temperatures](Problems/0739.cpp)

0746. (Easy) [Min Cost Climbing Stairs](Problems/0746.cpp)

0747. (Easy) [Largest Number At Least Twice of Others](Problems/0747.cpp)

0752. (Medium) [Open the Lock](Problems/0752.cpp)

0797. (Medium) [All Paths From Source to Target](Problems/0797.cpp)

0841. (Medium) [Keys and Rooms](Problems/0841.cpp)

0844. (Easy) [Backspace String Compare](Problems/0844.cpp)

0872. (Easy) [Leaf-Similar Trees](Problems/0872.cpp)

0876. (Easy) [Middle of the Linked List](Problems/0876.cpp)

0901. (Medium) [Online Stock Span](Problems/0901.cpp)

0905. (Easy) [Sort Array By Parity](Problems/0905.cpp)

0933. (Easy) [Number of Recent Calls](Problems/0933.cpp)

0941. (Easy) [Valid Mountain Array](Problems/0941.cpp)

0947. (Medium) [Most Stones Removed with Same Row or Column](Problems/0947.cpp)

0950. (Medium) [Reveal Cards In Increasing Order](Problems/0950.cpp)

0959. (Medium) [Regions Cut By Slashes](Problems/0959.cpp)

0965. (Easy) [Univalued Binary Tree](Problems/0965.cpp)

0977. (Easy) [Squares of a Sorted Array](Problems/0977.cpp)

0989. (Easy) [Add to Array-Form of Integer](Problems/0989.cpp)

0993. (Easy) [Cousins in Binary Tree](Problems/0993.cpp)

0997. (Easy) [Find the Town Judge](Problems/0997.cpp)

1019. (Medium) [Next Greater Node In Linked List](Problems/1019.cpp)

1022. (Easy) [Sum of Root To Leaf Binary Numbers](Problems/1022.cpp)

1047. (Easy) [Remove All Adjacent Duplicates In String](Problems/1047.cpp)

1051. (Easy) [Height Checker](Problems/1051.cpp)

1089. (Easy) [Duplicate Zeros](Problems/1089.cpp)

1095. (Easy) [Find Numbers with Even Number of Digits](Problems/1095.cpp)

1099. (Easy) [Replace Elements with Greatest Element on Right Side](Problems/1099.cpp)

1137. (Easy) [N-th Tribonacci Number](Problems/1137.cpp)

1209. (Medium) [Remove All Adjacent Duplicates in String II](Problems/1209.cpp)

1290. (Easy) [Convert Binary Number in a Linked List to Integer](Problems/1290.cpp)

1319. (Medium) [Number of Operations to Make Network Connected](Problems/1319.cpp)

1323. (Easy) [Maximum 69 Number](Problems/1323.cpp)

1337. (Easy) [The K Weakest Rows in a Matrix](Problems/1337.cpp)

1342. (Easy) [Number of Steps to Reduce a Number to Zero](Problems/1342.cpp)

1346. (Easy) [Check if N and Its Double Exist](Problems/1346.cpp)

1367. (Medium) [Linked List in Binary Tree ](Problems/1367.cpp)

1379. (Easy) [Find a Corresponding Node of a Binary Tree in a Clone of That Tree ](Problems/1379.cpp)

1466. (Medium) [Reorder Routes to Make All Paths Lead to the City Zero](Problems/1466.cpp)

1472. (Medium) [Design Browser History ](Problems/1472.cpp)

1480. (Easy) [Running Sum of 1d Array](Problems/1480.cpp)

1544. (Easy) [Make The String Great](Problems/1544.cpp)

1557. (Medium) [Minimum Number of Vertices to Reach All Nodes](Problems/1557.cpp)

1584. (Medium) [Min Cost to Connect All Points](Problems/1584.cpp)

1609. (Medium) [Even Odd Tree](Problems/1609.cpp)

1646. (Easy) [Get Maximum in Generated Array](Problems/1646.cpp)

1669. (Medium) [Merge In Between Linked Lists](Problems/1669.cpp)

1672. (Easy) [Richest Customer Wealth](Problems/1672.cpp)

1696. (Medium) [Jump Game VI](Problems/1696.cpp)

1700. (Easy) [Number of Students Unable to Eat Lunch](Problems/1700.cpp)

1704. (Easy) [Determine if String Halves Are Alike](Problems/1704.cpp)

1706. (Medium) [Where Will the Ball Fall](Problems/1706.cpp)

1791. (Easy) [Find Center of Star Graph](Problems/1791.cpp)

1823. (Medium) [Find the Winner of the Circular Game](Problems/1823.cpp)

1926. (Medium) [Nearest Exit from Entrance in Maze](Problems/1926.cpp)

1971. (Easy) [Find if Path Exists in Graph](Problems/1971.cpp)

2073. (Easy) [Time Needed to Buy Tickets](Problems/2073.cpp)

2095. (Medium) [Delete the Middle Node of a Linked List](Problems/2095.cpp)

2130. (Medium) [Maximum Twin Sum of a Linked List](Problems/2130.cpp)

2131. (Medium) [Longest Palindrome by Concatenating Two Letter Words](Problems/2131.cpp)

2181. (Medium) [Merge Nodes in Between Zeros](Problems/2181.cpp)

2235. (Easy) [Add Two Integers](Problems/2235.cpp)

2236. (Easy) [Root Equals Sum of Children](Problems/2236.cpp)

2285. (Medium) [Maximum Total Importance of Roads](Problems/2285.cpp)

2326. (Medium) [Spiral Matrix IV](Problems/2326.cpp)

2331. (Easy) [Evaluate Boolean Binary Tree](Problems/2331.cpp)

2390. (Medium) [Removing Stars From a String](Problems/2390.cpp)

2465. (Easy) [Number of Distinct Averages](Problems/2465.cpp)

2466. (Medium) [Count Ways To Build Good Strings](Problems/2466.cpp)

2467. (Medium) [Most Profitable Path in a Tree](Problems/2467.cpp)

2469. (Hard) [Find Median from Data Stream](Problems/0295.cpp)

| Number | Difficulty | Solution |

|:------:|:----------:|------------------------------------------------------------------------------------------|

| 0001 | Easy | [Two Sum](Problems/0001.cpp) |

| 0002 | Medium | [Add Two Numbers](Problems/0002.cpp) |

| 0003 | Medium | [Longest Substring Without Repeating Characters](Problems/0003.cpp) |

| 0012 | Medium | [Integer to Roman](Problems/0012.cpp) |

| 0013 | Easy | [Roman to Integer](Problems/0013.cpp) |

| 0014 | Easy | [Longest Common Prefix](Problems/0014.cpp) |

| 0019 | Medium | [Remove Nth Node From the End of List](Problems/0019.cpp) |

| 0020 | Easy | [Valid Parentheses](Problems/0020.cpp) |

| 0021 | Easy | [Merge Two Sorted Lists](Problems/0021.cpp) |

| 0024 | Medium | [Swap Nodes in Pairs](Problems/0024.cpp) |

| 0026 | Easy | [Remove Duplicates from Sorted Array](Problems/0026.cpp) |

| 0027 | Easy | [Remove Element](Problems/0027.cpp) |

| 0028 | Medium | [Find the Index of the First Occurrence in a String](Problems/0028.cpp) |

| 0036 | Medium | [Valid Sudoku](Problems/0036.cpp) |

| 0043 | Medium | [Multiply Strings](Problems/0043.cpp) |

| 0054 | Medium | [Spiral Matrix](Problems/0054.cpp) |

| 0059 | Medium | [Spiral Matrix II](Problems/0059.cpp) |

| 0061 | Medium | [Rotate List](Problems/0061.cpp) |

| 0066 | Easy | [Plus One](Problems/0066.cpp) |

| 0067 | Easy | [Add Binary](Problems/0067.cpp) |

| 0070 | Easy | [Climbing Stairs](Problems/0070.cpp) |

| 0083 | Easy | [Remove Duplicates from Sorted List](Problems/0083.cpp) |

| 0088 | Easy | [Merge Sorted Array](Problems/0088.cpp) |

| 0094 | Easy | [Binary Tree Inorder Traversal](Problems/0094.cpp) |

| 0100 | Easy | [Same Tree](Problems/0100.cpp) |

| 0101 | Easy | [Symmetric Tree](Problems/0101.cpp) |

| 0102 | Medium | [Binary Tree Level Order Traversal](Problems/0102.cpp) |

| 0103 | Medium | [Binary Tree Zigzag Level Order Traversal](Problems/0103.cpp) |

| 0104 | Easy | [Maximum Depth of Binary Tree](Problems/0104.cpp) |

| 0107 | Medium | [Binary Tree Level Order Traversal II](Problems/0107.cpp) |

| 0111 | Easy | [Minimum Depth of Binary Tree](Problems/0111.cpp) |

| 0112 | Easy | [Path Sum](Problems/0112.cpp) |

| 0114 | Medium | [Flatten Binary Tree to Linked List](Problems/0114.cpp) |

| 0116 | Medium | [Populating Next Right Pointers in Each Node](Problems/0116.cpp) |

| 0117 | Medium | [Populating Next Right Pointers in Each Node II](Problems/0117.cpp) |

| 0118 | Easy | [Pascal's Triangle](Problems/0118.cpp) |

| 0119 | Easy | [Pascal's Triangle II](Problems/0119.cpp) |

| 0121 | Easy | [Best Time to Buy and Sell Stock](Problems/0121.cpp) |

| 0133 | Medium | [Clone Graph](Problems/0133.cpp) |

| 0138 | Medium | [Copy List with Random Pointer](Problems/0138.cpp) |

| 0141 | Easy | [Linked List Cycle](Problems/0141.cpp) |

| 0142 | Medium | [Linked List Cycle II](Problems/0142.cpp) |

| 0144 | Medium | [Binary Tree Preorder Traversal](Problems/0144.cpp) |

| 0145 | Easy | [Binary Tree Postorder Traversal](Problems/0145.cpp) |

| 0150 | Medium | [Evaluate Reverse Polish Notation](Problems/0150.cpp) |

| 0151 | Medium | [Reverse Words in a String](Problems/0151.cpp) |

| 0160 | Easy | [Intersection of Two Linked Lists](Problems/0160.cpp) |

| 0167 | Medium | [Two Sum II - Input Array Is Sorted](Problems/0167.cpp) |

| 0189 | Medium | [Rotate Array](Problems/0189.cpp) |

| 0199 | Medium | [Binary Tree Right Side View](Problems/0199.cpp) |

| 0200 | Medium | [Number of Islands](Problems/0200.cpp) |

| 0203 | Easy | [Remove Linked List Elements](Problems/0203.cpp) |

| 0206 | Easy | [Reverse Linked List](Problems/0206.cpp) |

| 0209 | Medium | [Minimum Size Subarray Sum](Problems/0209.cpp) |

| 0222 | Medium | [Count Complete Tree Nodes](Problems/0222.cpp) |

| 0223 | Medium | [Rectangle Area](Problems/0223.cpp) |

| 0226 | Easy | [Invert Binary Tree](Problems/0226.cpp) |

| 0234 | Easy | [Palindrome Linked List](Problems/0234.cpp) |

| 0236 | Medium | [Lowest Common Ancestor of a Binary Tree](Problems/0236.cpp) |

| 0237 | Medium | [Delete Node in a Linked List](Problems/0237.cpp) |

| 0257 | Easy | [Binary Tree Paths](Problems/0257.cpp) |

| 0263 | Easy | [Ugly Number](Problems/0263.cpp) |

| 0279 | Medium | [Perfect Squares](Problems/0279.cpp) |

| 0283 | Easy | [Move Zeroes](Problems/0283.cpp) |

| 0328 | Medium | [Odd Even Linked List](Problems/0328.cpp) |

| 0338 | Easy | [Counting Bits](Problems/0338.cpp) |

| 0344 | Easy | [Reverse String](Problems/0344.cpp) |

| 0345 | Easy | [Reverse Vowels of a String](Problems/0345.cpp) |

| 0374 | Easy | [Guess Number Higher or Lower](Problems/0374.cpp) |

| 0383 | Easy | [Ransom Note](Problems/0383.cpp) |

| 0387 | Easy | [First Unique Character in a String](Problems/0387.cpp) |

| 0392 | Easy | [Is Subsequence](Problems/0392.cpp) |

| 0394 | Medium | [Decode String](Problems/0394.cpp) |

| 0404 | Easy | [Sum of Left Leaves](Problems/0404.cpp) |

| 0412 | Easy | [Fizz Buzz](Problems/0412.cpp) |

| 0414 | Easy | [Third Maximum Number](Problems/0414.cpp) |

| 0415 | Easy | [Add Strings](Problems/0415.cpp) |

| 0429 | Medium | [N-ary Tree Level Order Traversal](Problems/0429.cpp) |

| 0430 | Medium | [Flatten a Multilevel Doubly Linked list](Problems/0430.cpp) |

| 0433 | Medium | [Minimum Genetic Mutation](Problems/0433.cpp) |

| 0445 | Medium | [Add Two Numbers II](Problems/0445.cpp) |

| 0448 | Easy | [Find All Numbers Disappeared in an Array](Problems/0448.cpp) |

| 0485 | Easy | [Max Consecutive Ones](Problems/0485.cpp) |

| 0496 | Medium | [Next Greater Element I](Problems/0496.cpp) |

| 0498 | Medium | [Diagonal Traverse](Problems/0498.cpp) |

| 0503 | Medium | [Next Greater Element II](Problems/0503.cpp) |

| 0509 | Easy | [Fibonacci Number](Problems/0509.cpp) |

| 0543 | Easy | [Diameter of Binary Tree](Problems/0543.cpp) |

| 0547 | Medium | [Number of Provinces](Problems/0547.cpp) |

| 0556 | Medium | [Next Greater Element III](Problems/0556.cpp) |

| 0557 | Easy | [Reverse Words in a String III](Problems/0557.cpp) |

| 0559 | Easy | [Maximum Depth of N-ary Tree](Problems/0559.cpp) |

| 0561 | Easy | [Array Partition](Problems/0561.cpp) |

| 0563 | Easy | [Binary Tree Tilt](Problems/0563.cpp) |

| 0572 | Easy | [Subtree of Another Tree](Problems/0572.cpp) |

| 0589 | Easy | [N-ary Tree Preorder Traversal](Problems/0589.cpp) |

| 0590 | Easy | [N-ary Tree Postorder Traversal](Problems/0590.cpp) |

| 0606 | Easy | [Construct String from Binary Tree ](Problems/0606.cpp) |

| 0617 | Easy | [Merge Two Binary Trees](Problems/0617.cpp) |

| 0637 | Easy | [Average of Levels in Binary Tree](Problems/0637.cpp) |

| 0684 | Medium | [Redundant Connection](Problems/0684.cpp) |

| 0707 | Medium | [Design Linked List](Problems/0707.cpp) |

| 0724 | Easy | [Find Pivot Index](Problems/0724.cpp) |

| 0733 | Easy | [Flood Fill](Problems/0733.cpp) |

| 0739 | Medium | [Daily Temperatures](Problems/0739.cpp) |

| 0746 | Easy | [Min Cost Climbing Stairs](Problems/0746.cpp) |

| 0747 | Easy | [Largest Number At Least Twice of Others](Problems/0747.cpp) |

| 0752 | Medium | [Open the Lock](Problems/0752.cpp) |

| 0797 | Medium | [All Paths From Source to Target](Problems/0797.cpp) |

| 0841 | Medium | [Keys and Rooms](Problems/0841.cpp) |

| 0844 | Easy | [Backspace String Compare](Problems/0844.cpp) |

| 0872 | Easy | [Leaf-Similar Trees](Problems/0872.cpp) |

| 0876 | Easy | [Middle of the Linked List](Problems/0876.cpp) |

| 0901 | Medium | [Online Stock Span](Problems/0901.cpp) |

| 0905 | Easy | [Sort Array By Parity](Problems/0905.cpp) |

| 0933 | Easy | [Number of Recent Calls](Problems/0933.cpp) |

| 0941 | Easy | [Valid Mountain Array](Problems/0941.cpp) |

| 0947 | Medium | [Most Stones Removed with Same Row or Column](Problems/0947.cpp) |

| 0950 | Medium | [Reveal Cards In Increasing Order](Problems/0950.cpp) |

| 0959 | Medium | [Regions Cut By Slashes](Problems/0959.cpp) |

| 0965 | Easy | [Univalued Binary Tree](Problems/0965.cpp) |

| 0977 | Easy | [Squares of a Sorted Array](Problems/0977.cpp) |

| 0989 | Easy | [Add to Array-Form of Integer](Problems/0989.cpp) |

| 0993 | Easy | [Cousins in Binary Tree](Problems/0993.cpp) |

| 0997 | Easy | [Find the Town Judge](Problems/0997.cpp) |

| 1019 | Medium | [Next Greater Node In Linked List](Problems/1019.cpp) |

| 1022 | Easy | [Sum of Root To Leaf Binary Numbers](Problems/1022.cpp) |

| 1047 | Easy | [Remove All Adjacent Duplicates In String](Problems/1047.cpp) |

| 1051 | Easy | [Height Checker](Problems/1051.cpp) |

| 1089 | Easy | [Duplicate Zeros](Problems/1089.cpp) |

| 1095 | Easy | [Find Numbers with Even Number of Digits](Problems/1095.cpp) |

| 1099 | Easy | [Replace Elements with Greatest Element on Right Side](Problems/1099.cpp) |

| 1137 | Easy | [N-th Tribonacci Number](Problems/1137.cpp) |

| 1209 | Medium | [Remove All Adjacent Duplicates in String II](Problems/1209.cpp) |

| 1290 | Easy | [Convert Binary Number in a Linked List to Integer](Problems/1290.cpp) |

| 1319 | Medium | [Number of Operations to Make Network Connected](Problems/1319.cpp) |

| 1323 | Easy | [Maximum 69 Number](Problems/1323.cpp) |

| 1337 | Easy | [The K Weakest Rows in a Matrix](Problems/1337.cpp) |

| 1342 | Easy | [Number of Steps to Reduce a Number to Zero](Problems/1342.cpp) |

| 1346 | Easy | [Check if N and Its Double Exist](Problems/1346.cpp) |

| 1367 | Medium | [Linked List in Binary Tree ](Problems/1367.cpp) |

| 1379 | Easy | [Find a Corresponding Node of a Binary Tree in a Clone of That Tree ](Problems/1379.cpp) |

| 1466 | Medium | [Reorder Routes to Make All Paths Lead to the City Zero](Problems/1466.cpp) |

| 1472 | Medium | [Design Browser History ](Problems/1472.cpp) |

| 1480 | Easy | [Running Sum of 1d Array](Problems/1480.cpp) |

| 1544 | Easy | [Make The String Great](Problems/1544.cpp) |

| 1557 | Medium | [Minimum Number of Vertices to Reach All Nodes](Problems/1557.cpp) |

| 1584 | Medium | [Min Cost to Connect All Points](Problems/1584.cpp) |

| 1609 | Medium | [Even Odd Tree](Problems/1609.cpp) |

| 1646 | Easy | [Get Maximum in Generated Array](Problems/1646.cpp) |

| 1669 | Medium | [Merge In Between Linked Lists](Problems/1669.cpp) |

| 1672 | Easy | [Richest Customer Wealth](Problems/1672.cpp) |

| 1696 | Medium | [Jump Game VI](Problems/1696.cpp) |

| 1700 | Easy | [Number of Students Unable to Eat Lunch](Problems/1700.cpp) |

| 1704 | Easy | [Determine if String Halves Are Alike](Problems/1704.cpp) |

| 1706 | Medium | [Where Will the Ball Fall](Problems/1706.cpp) |

| 1791 | Easy | [Find Center of Star Graph](Problems/1791.cpp) |

| 1823 | Medium | [Find the Winner of the Circular Game](Problems/1823.cpp) |

| 1926 | Medium | [Nearest Exit from Entrance in Maze](Problems/1926.cpp) |

| 1971 | Easy | [Find if Path Exists in Graph](Problems/1971.cpp) |

| 2073 | Easy | [Time Needed to Buy Tickets](Problems/2073.cpp) |

| 2095 | Medium | [Delete the Middle Node of a Linked List](Problems/2095.cpp) |

| 2130 | Medium | [Maximum Twin Sum of a Linked List](Problems/2130.cpp) |

| 2131 | Medium | [Longest Palindrome by Concatenating Two Letter Words](Problems/2131.cpp) |

| 2181 | Medium | [Merge Nodes in Between Zeros](Problems/2181.cpp) |

| 2235 | Easy | [Add Two Integers](Problems/2235.cpp) |

| 2236 | Easy | [Root Equals Sum of Children](Problems/2236.cpp) |

| 2285 | Medium | [Maximum Total Importance of Roads](Problems/2285.cpp) |

| 2326 | Medium | [Spiral Matrix IV](Problems/2326.cpp) |

| 2331 | Easy | [Evaluate Boolean Binary Tree](Problems/2331.cpp) |

| 2390 | Medium | [Removing Stars From a String](Problems/2390.cpp) |

| 2465 | Easy | [Number of Distinct Averages](Problems/2465.cpp) |

| 2466 | Medium | [Count Ways To Build Good Strings](Problems/2466.cpp) |

| 2467 | Medium | [Most Profitable Path in a Tree](Problems/2467.cpp) |

| 2469 | Hard | [Find Median from Data Stream](Problems/0295.cpp) |

## DNF

0494. (Medium) [Target Sum](Problems/0494.cpp)

0402. (Medium) [Remove K Digits](Problems/0402.cpp)

0129. (Medium) [Sum Root to Leaf Numbers](Problems/0129.cpp)

0542. (Medium) [01 Matrix](Problems/0542.cpp)

0662. (Medium) [Maximum Width of Binary Tree](Problems/0662.cpp)

1438. (Medium) [Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit](Problems/0143.cpp)

2461. (Medium) [Maximum Sum of Distinct Subarrays With Length K](Problems/2461.cpp)

| Number | Difficulty | Solution |

|:------:|:----------:|-------------------------------------------------------------------------------------------------|

| 0494 | Medium | [Target Sum](Problems/0494.cpp) |

| 0402 | Medium | [Remove K Digits](Problems/0402.cpp) |

| 0129 | Medium | [Sum Root to Leaf Numbers](Problems/0129.cpp) |

| 0542 | Medium | [01 Matrix](Problems/0542.cpp) |

| 0662 | Medium | [Maximum Width of Binary Tree](Problems/0662.cpp) |

| 1438 | Medium | [Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit](Problems/0143.cpp) |

| 2461 | Medium | [Maximum Sum of Distinct Subarrays With Length K](Problems/2461.cpp) |