{"id":20732244,"url":"https://github.com/gmershad/thedebugger","last_synced_at":"2025-09-03T08:17:42.890Z","repository":{"id":232342628,"uuid":"441832320","full_name":"gmershad/thedebugger","owner":"gmershad","description":"LeetCode Solution in python.","archived":false,"fork":false,"pushed_at":"2021-12-27T11:40:51.000Z","size":345,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-03-11T10:28:12.441Z","etag":null,"topics":["algorithms","datastructure","datastructures","datastructures-algorithms","leetcode","leetcode-solutions","python"],"latest_commit_sha":null,"homepage":"","language":"Python","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/gmershad.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}},"created_at":"2021-12-26T07:17:04.000Z","updated_at":"2021-12-27T11:40:53.000Z","dependencies_parsed_at":"2024-04-09T08:50:37.003Z","dependency_job_id":null,"html_url":"https://github.com/gmershad/thedebugger","commit_stats":null,"previous_names":["gmershad/thedebugger"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/gmershad/thedebugger","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/gmershad%2Fthedebugger","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/gmershad%2Fthedebugger/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/gmershad%2Fthedebugger/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/gmershad%2Fthedebugger/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/gmershad","download_url":"https://codeload.github.com/gmershad/thedebugger/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/gmershad%2Fthedebugger/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":273411209,"owners_count":25100715,"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","status":"online","status_checked_at":"2025-09-03T02:00:09.631Z","response_time":76,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"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":["algorithms","datastructure","datastructures","datastructures-algorithms","leetcode","leetcode-solutions","python"],"created_at":"2024-11-17T05:18:38.520Z","updated_at":"2025-09-03T08:17:42.855Z","avatar_url":"https://github.com/gmershad.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"# The Debugger - LeetCode\n\nSolution of LeetCode Problems\n\n## Description\n\nThis repository has solution of LeetCode problems.\n\n### Linked List\n\n| Title        \t\t\t\t\t\t\t\t\t\t   \t\t\t\t\t\t\t\t\t\t\t\t\t\t \t\t\t\t\t\t|\n| :-------------------------------------------------------------------------------------------------------------------------------- \t\t\t\t|\n| [2. Add Two Numbers](https://github.com/gmershad/thedebugger/blob/main/Linked%20List/addTwoNumbers.py)   \t \t\t\t\t\t \t| \n| [19. Remove Nth Node From End of List](https://github.com/gmershad/thedebugger/blob/main/Linked%20List/removeNthNodefromend.py)   \t \t\t\t|\n| [21. Merge Two Sorted Lists](https://github.com/gmershad/thedebugger/blob/main/Linked%20List/merteTwoSortedList.py)   \t \t\t\t\t|\n| [24. Swap Nodes in Pairs](https://github.com/gmershad/thedebugger/blob/main/Linked%20List/swapNodesInPairs.py)   \t \t\t\t\t\t|\n| [61. Rotate List](https://github.com/gmershad/thedebugger/blob/main/Linked%20List/rotateList.py)   \t \t\t\t\t\t\t\t|\n| [82. Remove Duplicates from Sorted List II](https://github.com/gmershad/thedebugger/blob/main/Linked%20List/deleteDuplicates.py)   \t \t\t\t|\n| [83. Remove Duplicates from Sorted List](https://github.com/gmershad/thedebugger/blob/main/Linked%20List/deleteDuplicatess.py)   \t \t\t\t|\n| [86. Partition List](https://github.com/gmershad/thedebugger/blob/main/Linked%20List/partitionList.py)   \t \t\t\t\t\t\t|\n| [92. Reverse Linked List II](https://github.com/gmershad/thedebugger/blob/main/Linked%20List/reverseBetween.py)   \t \t\t\t\t\t|\n| [109. Convert Sorted List to Binary Search Tree](https://github.com/gmershad/thedebugger/blob/main/Linked%20List/sortedListToBST.py)   \t \t\t|\n| [114. Flatten Binary Tree to Linked List](https://github.com/gmershad/thedebugger/blob/main/Linked%20List/flatten.py)   \t \t\t\t        |\n| [138. Copy List with Random Pointer](https://github.com/gmershad/thedebugger/blob/main/Linked%20List/copyRandomList.py)   \t \t\t\t        |\n| [141. Linked List Cycle](https://github.com/gmershad/thedebugger/blob/main/Linked%20List/hasCycle.py)   \t \t\t\t        \t\t|\n| [142. Linked List Cycle II](https://github.com/gmershad/thedebugger/blob/main/Linked%20List/detectCycle.py)   \t \t\t\t        \t|\n| [143. Reorder List](https://github.com/gmershad/thedebugger/blob/main/Linked%20List/reorderList.py)   \t \t\t\t        \t\t|\n| [147. Insertion Sort List](https://github.com/gmershad/thedebugger/blob/main/Linked%20List/insertionSortList.py)   \t \t\t\t        \t|\n| [148. Sort List](https://github.com/gmershad/thedebugger/blob/main/Linked%20List/sortList.py)   \t \t\t\t        \t\t\t|\n| [160. Intersection of Two Linked Lists](https://github.com/gmershad/thedebugger/blob/main/Linked%20List/getIntersectionNode.py)   \t \t\t\t|\n| [203. Remove Linked List Elements](https://github.com/gmershad/thedebugger/blob/main/Linked%20List/removeElements.py)   \t \t\t\t\t|\n| [206. Reverse Linked List](https://github.com/gmershad/thedebugger/blob/main/Linked%20List/reverseList.py)   \t \t\t\t\t\t\t|\n| [234. Palindrome Linked List](https://github.com/gmershad/thedebugger/blob/main/Linked%20List/isPalindrome.py)   \t \t\t\t\t\t|\n| [237. Delete Node in a Linked List](https://github.com/gmershad/thedebugger/blob/main/Linked%20List/deleteNode.py)   \t \t\t\t\t\t|\n| [328. Odd Even Linked List](https://github.com/gmershad/thedebugger/blob/main/Linked%20List/oddEvenList.py)   \t \t\t\t\t\t|\n| [355. Design Twitter](https://github.com/gmershad/thedebugger/blob/main/Linked%20List/twitter.py)   \t \t\t\t\t\t\t\t|\n| [382. Linked List Random Node](https://github.com/gmershad/thedebugger/blob/main/Linked%20List/getRandom.py)   \t \t\t\t\t\t|\n| [430. Flatten a Multilevel Doubly Linked List](https://github.com/gmershad/thedebugger/blob/main/Linked%20List/flatten430.py)   \t \t\t\t|\n| [445. Add Two Numbers II](https://github.com/gmershad/thedebugger/blob/main/Linked%20List/addTwoNumbersII.py)   \t \t\t\t\t\t|\n| [622. Design Circular Queue](https://github.com/gmershad/thedebugger/blob/main/Linked%20List/MyCircularQueue.py)   \t \t\t\t\t\t|\n| [705. Design HashSet](https://github.com/gmershad/thedebugger/blob/main/Linked%20List/MyHashSet.py)   \t \t\t\t\t\t\t|\n| [707. Design Linked List](https://github.com/gmershad/thedebugger/blob/main/Linked%20List/myLinkedList.py)   \t \t\t\t\t\t\t|\n| [876. Middle of the Linked List](https://github.com/gmershad/thedebugger/blob/main/Linked%20List/middleNode.py)   \t \t\t\t\t\t|\n| [1290. Convert Binary Number in a Linked List to Integer](https://github.com/gmershad/thedebugger/blob/main/Linked%20List/getDecimalValue.py)   \t \t|\n| [1367. Linked List in Binary Tree](https://github.com/gmershad/thedebugger/blob/main/Linked%20List/isSubPath.py)   \t \t\t\t\t\t|\n| [1472. Design Browser History](https://github.com/gmershad/thedebugger/blob/main/Linked%20List/browserHistory.py)   \t \t\t\t\t\t|\n| [1669. Merge In Between Linked Lists](https://github.com/gmershad/thedebugger/blob/main/Linked%20List/mergeInBetween.py)   \t \t\t\t\t|\n| [1721. Swapping Nodes in a Linked List](https://github.com/gmershad/thedebugger/blob/main/Linked%20List/swapNodes.py)   \t \t\t\t\t|\n\n### Stack\n\n| Title        \t\t\t\t\t\t\t\t\t\t   \t\t\t\t\t\t\t\t\t\t\t\t\t\t \t\t\t\t\t\t|\n| :-------------------------------------------------------------------------------------------------------------------------------- \t\t\t\t|\n| [20. Valid Parentheses](https://github.com/gmershad/thedebugger/blob/main/Stack/validParentheses.py)   \t \t\t\t\t\t \t|\n| [32. Longest Valid Parentheses](https://github.com/gmershad/thedebugger/blob/main/Stack/longestValidParentheses.py)   \t \t\t\t\t|\n| [42. Trapping Rain Water](https://github.com/gmershad/thedebugger/blob/main/Stack/trap.py)   \t \t\t\t\t\t\t\t\t|\n| [94. Binary Tree Inorder Traversal](https://github.com/gmershad/thedebugger/blob/main/Stack/inorderTraversal.py)   \t \t\t\t\t\t|\n| [114. Flatten Binary Tree to Linked List](https://github.com/gmershad/thedebugger/blob/main/Stack/flatten.py)   \t \t\t\t\t\t|\n| [143. Reorder List](https://github.com/gmershad/thedebugger/blob/main/Stack/reorderList.py)   \t \t\t\t\t\t\t\t|\n| [144. Binary Tree Preorder Traversal](https://github.com/gmershad/thedebugger/blob/main/Stack/preorderTraversal.py)   \t \t\t\t\t|\n| [145. Binary Tree Postorder Traversal](https://github.com/gmershad/thedebugger/blob/main/Stack/postorderTraversal.py)   \t \t\t\t\t|\n| [150. Evaluate Reverse Polish Notation](https://github.com/gmershad/thedebugger/blob/main/Stack/evalRPN.py)   \t \t\t\t\t\t|\n| [155. Min Stack](https://github.com/gmershad/thedebugger/blob/main/Stack/minStack.py)   \t \t\t\t\t\t\t\t\t|\n| [173. Binary Search Tree Iterator](https://github.com/gmershad/thedebugger/blob/main/Stack/BSTIterator.py)   \t \t\t\t\t\t\t|\n| [225. Implement Stack using Queues](https://github.com/gmershad/thedebugger/blob/main/Stack/myStack.py)   \t \t\t\t\t\t\t|\n| [232. Implement Queue using Stacks](https://github.com/gmershad/thedebugger/blob/main/Stack/myQueue.py)   \t \t\t\t\t\t\t|\n| [234. Palindrome Linked List](https://github.com/gmershad/thedebugger/blob/main/Stack/isPalindrome.py)   \t \t\t\t\t\t\t|\n| [316. Remove Duplicate Letters](https://github.com/gmershad/thedebugger/blob/main/Stack/removeDuplicateLetters.py)   \t \t\t\t\t\t|\n| [402. Remove K Digits](https://github.com/gmershad/thedebugger/blob/main/Stack/removeKdigits.py)   \t \t\t\t\t\t\t\t|\n| [445. Add Two Numbers II](https://github.com/gmershad/thedebugger/blob/main/Stack/addTwoNumbers.py)   \t \t\t\t\t\t\t|\n| [456. 132 Pattern](https://github.com/gmershad/thedebugger/blob/main/Stack/find132pattern.py)   \t \t\t\t\t\t\t\t|\n| [589. N-ary Tree Preorder Traversal](https://github.com/gmershad/thedebugger/blob/main/Stack/preorder.py)   \t \t\t\t\t\t\t|\n| [590. N-ary Tree Postorder Traversal](https://github.com/gmershad/thedebugger/blob/main/Stack/postorder.py)   \t \t\t\t\t\t|\n| [654. Maximum Binary Tree](https://github.com/gmershad/thedebugger/blob/main/Stack/constructMaximumBinaryTree.py)   \t \t\t\t\t\t|\n| [678. Valid Parenthesis String](https://github.com/gmershad/thedebugger/blob/main/Stack/checkValidString.py)   \t \t\t\t\t\t|\n| [682. Baseball Game](https://github.com/gmershad/thedebugger/blob/main/Stack/calPoints.py)   \t \t\t\t\t\t\t\t\t|\n| [735. Asteroid Collision](https://github.com/gmershad/thedebugger/blob/main/Stack/asteroidCollision.py)   \t \t\t\t\t\t\t|\n| [739. Daily Temperatures](https://github.com/gmershad/thedebugger/blob/main/Stack/dailyTemperatures.py)   \t \t\t\t\t\t\t|\n| [844. Backspace String Compare](https://github.com/gmershad/thedebugger/blob/main/Stack/backspaceCompare.py)   \t \t\t\t\t\t|\n| [897. Increasing Order Search Tree](https://github.com/gmershad/thedebugger/blob/main/Stack/increasingBST.py)   \t \t\t\t\t\t|\n| [1008. Construct Binary Search Tree from Preorder Traversal](https://github.com/gmershad/thedebugger/blob/main/Stack/bstFromPreorder.py)   \t \t\t|\n| [1021. Remove Outermost Parentheses](https://github.com/gmershad/thedebugger/blob/main/Stack/removeOuterParentheses.py)   \t \t\t\t\t|\n| [1047. Remove All Adjacent Duplicates In String](https://github.com/gmershad/thedebugger/blob/main/Stack/removeDuplicates.py)   \t \t\t\t|\n| [1441. Build an Array With Stack Operations](https://github.com/gmershad/thedebugger/blob/main/Stack/buildArray.py)   \t \t\t\t\t|\n| [1472. Design Browser History](https://github.com/gmershad/thedebugger/blob/main/Stack/browserHistory.py)   \t \t\t\t\t\t\t|\n| [1598. Crawler Log Folder](https://github.com/gmershad/thedebugger/blob/main/Stack/minOperations.py)   \t \t\t\t\t\t\t|\n| [1700. Number of Students Unable to Eat Lunch](https://github.com/gmershad/thedebugger/blob/main/Stack/countStudents.py)   \t \t\t\t\t|\n\n### Queue\n\n| Title        \t\t\t\t\t\t\t\t\t\t   \t\t\t\t\t\t\t\t\t\t\t\t\t\t \t\t\t\t\t\t|\n| :-------------------------------------------------------------------------------------------------------------------------------- \t\t\t\t|\n| [225. Implement Stack using Queues](https://github.com/gmershad/thedebugger/blob/main/Queue/myStack.py)   \t \t\t\t\t\t \t|\n| [232. Implement Queue using Stacks](https://github.com/gmershad/thedebugger/blob/main/Queue/myQueue.py)   \t \t\t\t\t\t \t|\n| [387. First Unique Character in a String](https://github.com/gmershad/thedebugger/blob/main/Queue/firstUniqChar.py)   \t \t\t\t\t|\n| [622. Design Circular Queue](https://github.com/gmershad/thedebugger/blob/main/Queue/myCircularQueue.py)   \t \t\t\t\t\t\t|\n| [1352. Product of the Last K Numbers](https://github.com/gmershad/thedebugger/blob/main/Queue/productOfNumbers.py)   \t \t\t\t\t\t|\n| [1438. Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit](https://github.com/gmershad/thedebugger/blob/main/Queue/longestSubarray.py)|\n| [1700. Number of Students Unable to Eat Lunch](https://github.com/gmershad/thedebugger/blob/main/Queue/countStudents.py)\t\t\t\t\t|\n\n### Tree/Binary Tree\n\n| Title        \t\t\t\t\t\t\t\t\t\t   \t\t\t\t\t\t\t\t\t\t\t\t\t\t \t\t\t\t\t\t|\n| :-------------------------------------------------------------------------------------------------------------------------------- \t\t\t\t|\n| [94. Binary Tree Inorder Traversal](https://github.com/gmershad/thedebugger/blob/main/Tree/inorderTraversal.py)   \t \t\t\t\t\t|\n| [96. Unique Binary Search Trees](https://github.com/gmershad/thedebugger/blob/main/Tree/numTrees.py)   \t \t\t\t\t\t\t|\n| [98. Validate Binary Search Tree](https://github.com/gmershad/thedebugger/blob/main/Tree/isValidBST.py)   \t \t\t\t\t\t\t|\n| [99. Recover Binary Search Tree](https://github.com/gmershad/thedebugger/blob/main/Tree/recoverTree.py)   \t \t\t\t\t\t\t|\n| [100. Same Tree](https://github.com/gmershad/thedebugger/blob/main/Tree/isSameTree.py)   \t \t\t\t\t\t\t\t\t|\n| [101. Symmetric Tree](https://github.com/gmershad/thedebugger/blob/main/Tree/isSymmetric.py)   \t \t\t\t\t\t\t\t|\n| [102. Binary Tree Level Order Traversal](https://github.com/gmershad/thedebugger/blob/main/Tree/levelOrder.py)   \t \t\t\t\t\t|\n| [104. Maximum Depth of Binary Tree](https://github.com/gmershad/thedebugger/blob/main/Tree/maxDepth.py)   \t \t\t\t\t\t\t|\n| [105. Construct Binary Tree from Preorder and Inorder Traversal](https://github.com/gmershad/thedebugger/blob/main/Tree/buildTree.py)   \t \t\t|\n| [106. Construct Binary Tree from Inorder and Postorder Traversal](https://github.com/gmershad/thedebugger/blob/main/Tree/buildTree1.py)   \t \t\t|\n| [108. Convert Sorted Array to Binary Search Tree](https://github.com/gmershad/thedebugger/blob/main/Tree/sortedArrayToBST.py)   \t \t\t\t|\n| [109. Convert Sorted List to Binary Search Tree](https://github.com/gmershad/thedebugger/blob/main/Tree/sortedArrayToBST.py)   \t \t\t\t|\n| [110. Balanced Binary Tree](https://github.com/gmershad/thedebugger/blob/main/Tree/isBalanced.py)   \t \t\t\t\t\t\t\t|\n| [111. Minimum Depth of Binary Tree](https://github.com/gmershad/thedebugger/blob/main/Tree/minDepth.py)   \t \t\t\t\t\t\t|\n| [112. Path Sum](https://github.com/gmershad/thedebugger/blob/main/Tree/hasPathSum.py)   \t \t\t\t\t\t\t\t\t|\n| [113. Path Sum II](https://github.com/gmershad/thedebugger/blob/main/Tree/pathSum.py)   \t \t\t\t\t\t\t\t\t|\n| [114. Flatten Binary Tree to Linked List](https://github.com/gmershad/thedebugger/blob/main/Tree/flatten.py)   \t \t\t\t\t\t|\n| [116. Populating Next Right Pointers in Each Node](https://github.com/gmershad/thedebugger/blob/main/Tree/connect.py)   \t \t\t\t\t|\n| [117. Populating Next Right Pointers in Each Node II](https://github.com/gmershad/thedebugger/blob/main/Tree/connect1.py)   \t \t\t\t\t|\n| [129. Sum Root to Leaf Numbers](https://github.com/gmershad/thedebugger/blob/main/Tree/sumNumbers.py)   \t \t\t\t\t\t\t|\n| [144. Binary Tree Preorder Traversal](https://github.com/gmershad/thedebugger/blob/main/Tree/preorderTraversal.py)   \t \t\t\t\t\t|\n| [145. Binary Tree Postorder Traversal](https://github.com/gmershad/thedebugger/blob/main/Tree/postorderTraversal.py)   \t \t\t\t\t|\n| [173. Binary Search Tree Iterator](https://github.com/gmershad/thedebugger/blob/main/Tree/BSTIterator.py)   \t \t\t\t\t\t\t|\n| [199. Binary Tree Right Side View](https://github.com/gmershad/thedebugger/blob/main/Tree/rightSideView.py)   \t \t\t\t\t\t|\n| [222. Count Complete Tree Nodes](https://github.com/gmershad/thedebugger/blob/main/Tree/countNodes.py)   \t \t\t\t\t\t\t|\n| [226. Invert Binary Tree](https://github.com/gmershad/thedebugger/blob/main/Tree/invertTree.py)   \t \t\t\t\t\t\t\t|\n| [230. Kth Smallest Element in a BST](https://github.com/gmershad/thedebugger/blob/main/Tree/kthSmallest.py)   \t \t\t\t\t\t|\n| [235. Lowest Common Ancestor of a Binary Search Tree](https://github.com/gmershad/thedebugger/blob/main/Tree/lowestCommonAncestor.py)   \t \t\t|\n| [257. Binary Tree Paths](https://github.com/gmershad/thedebugger/blob/main/Tree/binaryTreePaths.py)   \t \t\t\t\t\t\t|\n| [337. House Robber III](https://github.com/gmershad/thedebugger/blob/main/Tree/rob.py)   \t \t\t\t\t\t\t\t\t|\n| [404. Sum of Left Leaves](https://github.com/gmershad/thedebugger/blob/main/Tree/sumOfLeftLeaves.py)   \t \t\t\t\t\t\t|\n| [437. Path Sum III](https://github.com/gmershad/thedebugger/blob/main/Tree/pathSumIII.py)   \t \t\t\t\t\t\t\t\t|\n| [450. Delete Node in a BST](https://github.com/gmershad/thedebugger/blob/main/Tree/deleteNode.py)   \t \t\t\t\t\t\t\t|\n| [508. Most Frequent Subtree Sum](https://github.com/gmershad/thedebugger/blob/main/Tree/findFrequentTreeSum.py)   \t \t\t\t\t\t|\n| [513. Find Bottom Left Tree Value](https://github.com/gmershad/thedebugger/blob/main/Tree/findBottomLeftValue.py)   \t \t\t\t\t\t|\n| [515. Find Largest Value in Each Tree Row](https://github.com/gmershad/thedebugger/blob/main/Tree/largestValues.py)   \t \t\t\t\t|\n| [530. Minimum Absolute Difference in BST](https://github.com/gmershad/thedebugger/blob/main/Tree/getMinimumDifference.py)   \t \t\t\t\t|\n| [543. Diameter of Binary Tree](https://github.com/gmershad/thedebugger/blob/main/Tree/diameterOfBinaryTree.py)   \t \t\t\t\t\t|\n| [559. Maximum Depth of N-ary Tree](https://github.com/gmershad/thedebugger/blob/main/Tree/maxDepth1.py)   \t \t\t\t\t\t\t|\n| [563. Binary Tree Tilt](https://github.com/gmershad/thedebugger/blob/main/Tree/findTilt.py)   \t \t\t\t\t\t\t\t|\n| [572. Subtree of Another Tree](https://github.com/gmershad/thedebugger/blob/main/Tree/isSubtree.py)   \t \t\t\t\t\t\t|\n| [589. N-ary Tree Preorder Traversal](https://github.com/gmershad/thedebugger/blob/main/Tree/preorder.py)   \t \t\t\t\t\t\t|\n| [590. N-ary Tree Postorder Traversal](https://github.com/gmershad/thedebugger/blob/main/Tree/postorder.py)   \t \t\t\t\t\t\t|\n| [606. Construct String from Binary Tree](https://github.com/gmershad/thedebugger/blob/main/Tree/tree2str.py)   \t \t\t\t\t\t|\n| [617. Merge Two Binary Trees](https://github.com/gmershad/thedebugger/blob/main/Tree/mergeTrees.py)   \t \t\t\t\t\t\t|\n| [623. Add One Row to Tree](https://github.com/gmershad/thedebugger/blob/main/Tree/addOneRow.py)   \t \t\t\t\t\t\t\t|\n| [637. Average of Levels in Binary Tree](https://github.com/gmershad/thedebugger/blob/main/Tree/averageOfLevels.py)   \t \t\t\t\t\t|\n| [653. Two Sum IV - Input is a BST](https://github.com/gmershad/thedebugger/blob/main/Tree/findTarget.py)   \t \t\t\t\t\t\t|\n| [654. Maximum Binary Tree](https://github.com/gmershad/thedebugger/blob/main/Tree/constructMaximumBinaryTree.py)   \t \t\t\t\t\t|\n| [669. Trim a Binary Search Tree](https://github.com/gmershad/thedebugger/blob/main/Tree/trimBST.py)   \t \t\t\t\t\t\t|\n| [671. Second Minimum Node In a Binary Tree](https://github.com/gmershad/thedebugger/blob/main/Tree/findSecondMinimumValue.py)   \t \t\t\t|\n| [687. Longest Univalue Path](https://github.com/gmershad/thedebugger/blob/main/Tree/longestUnivaluePath.py)   \t \t\t\t\t\t|\n| [700. Search in a Binary Search Tree](https://github.com/gmershad/thedebugger/blob/main/Tree/searchBST.py)   \t \t\t\t\t\t\t|\n| [703. Kth Largest Element in a Stream](https://github.com/gmershad/thedebugger/blob/main/Tree/KthLargest.py)   \t \t\t\t\t\t|\n| [783. Minimum Distance Between BST Nodes](https://github.com/gmershad/thedebugger/blob/main/Tree/minDiffInBST.py)   \t \t\t\t\t\t|\n| [814. Binary Tree Pruning](https://github.com/gmershad/thedebugger/blob/main/Tree/pruneTree.py)   \t \t\t\t\t\t\t\t|\n| [865. Smallest Subtree with all the Deepest Nodes](https://github.com/gmershad/thedebugger/blob/main/Tree/subtreeWithAllDeepest.py)   \t \t\t|\n| [872. Leaf-Similar Trees](https://github.com/gmershad/thedebugger/blob/main/Tree/leafSimilar.py)   \t \t\t\t\t\t\t\t|\n| [889. Construct Binary Tree from Preorder and Postorder Traversal](https://github.com/gmershad/thedebugger/blob/main/Tree/constructFromPrePost.py)   \t \t|\n| [894. All Possible Full Binary Trees](https://github.com/gmershad/thedebugger/blob/main/Tree/allPossibleFBT.py)   \t \t\t\t\t\t|\n| [897. Increasing Order Search Tree](https://github.com/gmershad/thedebugger/blob/main/Tree/increasingBST.py)   \t \t\t\t\t\t|\n| [919. Complete Binary Tree Inserter](https://github.com/gmershad/thedebugger/blob/main/Tree/CBTInserter.py)   \t \t\t\t\t\t|\n| [938. Range Sum of BST](https://github.com/gmershad/thedebugger/blob/main/Tree/rangeSumBST.py)   \t \t\t\t\t\t\t\t|\n| [951. Flip Equivalent Binary Trees](https://github.com/gmershad/thedebugger/blob/main/Tree/flipEquiv.py)   \t \t\t\t\t\t\t|\n| [958. Check Completeness of a Binary Tree](https://github.com/gmershad/thedebugger/blob/main/Tree/isCompleteTree.py)   \t \t\t\t\t|\n| [965. Univalued Binary Tree](https://github.com/gmershad/thedebugger/blob/main/Tree/isUnivalTree.py)   \t \t\t\t\t\t\t|\n| [971. Flip Binary Tree To Match Preorder Traversal](https://github.com/gmershad/thedebugger/blob/main/Tree/flipMatchVoyage.py)   \t \t\t\t|\n| [979. Distribute Coins in Binary Tree](https://github.com/gmershad/thedebugger/blob/main/Tree/distributeCoins.py)   \t \t\t\t\t\t|\n| [988. Smallest String Starting From Leaf](https://github.com/gmershad/thedebugger/blob/main/Tree/smallestFromLeaf.py)   \t \t\t\t\t|\n| [1008. Construct Binary Search Tree from Preorder Traversal](https://github.com/gmershad/thedebugger/blob/main/Tree/bstFromPreorder.py)   \t \t\t|\n| [1022. Sum of Root To Leaf Binary Numbers](https://github.com/gmershad/thedebugger/blob/main/Tree/sumRootToLeaf.py)   \t \t\t\t\t|\n| [1026. Maximum Difference Between Node and Ancestor](https://github.com/gmershad/thedebugger/blob/main/Tree/maxAncestorDiff.py)   \t \t\t\t|\n| [1038. Binary Search Tree to Greater Sum Tree](https://github.com/gmershad/thedebugger/blob/main/Tree/bstToGst.py)   \t \t\t\t\t\t|\n| [1080. Insufficient Nodes in Root to Leaf Paths](https://github.com/gmershad/thedebugger/blob/main/Tree/sufficientSubset.py)   \t \t\t\t|\n| [1110. Delete Nodes And Return Forest](https://github.com/gmershad/thedebugger/blob/main/Tree/delNodes.py)   \t \t\t\t\t\t\t|\n| [1123. Lowest Common Ancestor of Deepest Leaves](https://github.com/gmershad/thedebugger/blob/main/Tree/lcaDeepestLeaves.py)   \t \t\t\t|\n| [1161. Maximum Level Sum of a Binary Tree](https://github.com/gmershad/thedebugger/blob/main/Tree/maxLevelSum.py)   \t \t\t\t\t\t|\n| [1261. Find Elements in a Contaminated Binary Tree](https://github.com/gmershad/thedebugger/blob/main/Tree/findElements.py)   \t \t\t\t|\n| [1302. Deepest Leaves Sum](https://github.com/gmershad/thedebugger/blob/main/Tree/deepestLeavesSum.py)   \t \t\t\t\t\t\t|\n| [1305. All Elements in Two Binary Search Trees](https://github.com/gmershad/thedebugger/blob/main/Tree/getAllElements.py)   \t \t\t\t\t|\n| [1315. Sum of Nodes with Even-Valued Grandparent](https://github.com/gmershad/thedebugger/blob/main/Tree/sumEvenGrandparent.py)   \t \t\t\t|\n| [1325. Delete Leaves With a Given Value](https://github.com/gmershad/thedebugger/blob/main/Tree/removeLeafNodes.py)   \t \t\t\t\t|\n| [1339. Maximum Product of Splitted Binary Tree](https://github.com/gmershad/thedebugger/blob/main/Tree/maxProduct.py)   \t \t\t\t\t|\n| [1367. Linked List in Binary Tree](https://github.com/gmershad/thedebugger/blob/main/Tree/isSubPath.py)   \t \t\t\t\t\t\t|\n| [1372. Longest ZigZag Path in a Binary Tree](https://github.com/gmershad/thedebugger/blob/main/Tree/longestZigZag.py)   \t \t\t\t\t|\n| [1379. Find a Corresponding Node of a Binary Tree in a Clone of That Tree](https://github.com/gmershad/thedebugger/blob/main/Tree/getTargetCopy.py)   \t|\n| [1382. Balance a Binary Search Tree](https://github.com/gmershad/thedebugger/blob/main/Tree/balanceBST.py)   \t\t\t\t\t\t\t|\n| [1448. Count Good Nodes in Binary Tree](https://github.com/gmershad/thedebugger/blob/main/Tree/goodNodes.py)   \t\t\t\t\t\t|\n\t\n\n## Authors\n\n[@Gul Ershad](https://mailtogulershad.medium.com/)\n\n\n## Acknowledgments\n\n* [LeetCode](https://leetcode.com/)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fgmershad%2Fthedebugger","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fgmershad%2Fthedebugger","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fgmershad%2Fthedebugger/lists"}