{"id":22039187,"url":"https://github.com/shivanmathur/leetcode","last_synced_at":"2025-06-24T01:02:02.310Z","repository":{"id":248052897,"uuid":"827616671","full_name":"ShivanMathur/LeetCode","owner":"ShivanMathur","description":null,"archived":false,"fork":false,"pushed_at":"2025-05-01T20:41:54.000Z","size":352,"stargazers_count":0,"open_issues_count":0,"forks_count":1,"subscribers_count":2,"default_branch":"main","last_synced_at":"2025-05-01T21:37:08.417Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"Java","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/ShivanMathur.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,"zenodo":null}},"created_at":"2024-07-12T02:54:49.000Z","updated_at":"2025-05-01T20:41:57.000Z","dependencies_parsed_at":"2024-07-20T02:15:54.943Z","dependency_job_id":"a6474692-7e7c-4a0e-ab72-aacdf03b7cd2","html_url":"https://github.com/ShivanMathur/LeetCode","commit_stats":null,"previous_names":["shivan-mathur/leetcode","shivanmathur/leetcode"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/ShivanMathur/LeetCode","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ShivanMathur%2FLeetCode","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ShivanMathur%2FLeetCode/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ShivanMathur%2FLeetCode/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ShivanMathur%2FLeetCode/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/ShivanMathur","download_url":"https://codeload.github.com/ShivanMathur/LeetCode/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ShivanMathur%2FLeetCode/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":261583771,"owners_count":23180667,"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":[],"created_at":"2024-11-30T11:09:41.501Z","updated_at":"2025-06-24T01:02:02.251Z","avatar_url":"https://github.com/ShivanMathur.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"# LeetCode\n\n\u003ch2\u003eArrays\u003c/h2\u003e\n\n\u003ctable\u003e\n \u003ctr\u003e\n    \u003ctd\u003e Check if Array Is Sorted and Rotated \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/1752-check-if-array-is-sorted-and-rotated\"\u003e Check if Array Is Sorted and Rotated \u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e\n \u003ctr\u003e\n    \u003ctd\u003eContains Duplicate\u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0217-contains-duplicate\"\u003e Contains Duplicate \u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e\n\n   \u003ctr\u003e\n    \u003ctd\u003eMissing Number\u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0268-missing-number\"\u003e Missing Number \u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e\n\n   \u003ctr\u003e\n    \u003ctd\u003eFind All Numbers Disappeared in an Array\u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0448-find-all-numbers-disappeared-in-an-array\"\u003e Find All Numbers Disappeared in an Array \u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e\n\n   \u003ctr\u003e\n    \u003ctd\u003eSingle Number\u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0136-single-number\"\u003e Single Number \u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e\n\n   \u003ctr\u003e\n    \u003ctd\u003e Find All Duplicates in an Array \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0442-find-all-duplicates-in-an-array\"\u003e Find All Duplicates in an Array \u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e\n\n  \u003ctr\u003e\n    \u003ctd\u003e Longest Consecutive Sequence \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0128-longest-consecutive-sequence\"\u003e Longest Consecutive Sequence \u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e\n\n  \u003ctr\u003e\n    \u003ctd\u003e Merge Sorted Array \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0088-merge-sorted-array\"\u003e Merge Sorted Array \u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e\n\n  \u003ctr\u003e\n    \u003ctd\u003e Remove Element \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0027-remove-element\"\u003e Remove Element \u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e\n\n  \u003ctr\u003e\n    \u003ctd\u003e Remove Duplicates from Sorted Array \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0026-remove-duplicates-from-sorted-array\"\u003e Remove Duplicates from Sorted Array \u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e\n\n  \u003ctr\u003e\n    \u003ctd\u003e Remove Duplicates from Sorted Array II \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0080-remove-duplicates-from-sorted-array-ii\"\u003e Remove Duplicates from Sorted Array II \u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e\n\n  \u003ctr\u003e\n    \u003ctd\u003e Majority Element \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0169-majority-element\"\u003e Majority Element \u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e\n\n  \u003ctr\u003e\n    \u003ctd\u003e Rotate Array \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0189-rotate-array\"\u003e Rotate Array \u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e\n\n  \u003ctr\u003e\n    \u003ctd\u003e Best Time to Buy and Sell Stock \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0121-best-time-to-buy-and-sell-stock\"\u003e Best Time to Buy and Sell Stock \u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e\n\n  \u003ctr\u003e\n    \u003ctd\u003e Roman to Integer \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0013-roman-to-integer\"\u003e Roman to Integer \u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e\n\n  \u003ctr\u003e\n    \u003ctd\u003e Max Consecutive Ones \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0485-max-consecutive-ones\"\u003e Max Consecutive Ones \u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e\n \u003ctr\u003e\n\n  \u003c/table\u003e\n\n\n\n\n\n\n\n\n\n\n\n\n\n\u003ch2\u003eTwo Pointers\u003c/h2\u003e\n\n\u003ctable\u003e\n  \u003ctr\u003e\n    \u003ctd\u003e Two Sum \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0001-two-sum\"\u003e Two Sum \u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e\n\n  \u003ctr\u003e\n    \u003ctd\u003e Squares of a Sorted Array \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0977-squares-of-a-sorted-array\"\u003e Squares of a Sorted Array \u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e\n\n  \u003ctr\u003e\n    \u003ctd\u003e Move Zeroes \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0283-move-zeroes\"\u003e Move Zeroes \u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e  \n\n  \u003ctr\u003e\n    \u003ctd\u003e Is Subsequence \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0392-is-subsequence\"\u003e Is Subsequence \u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e\n\n  \u003ctr\u003e\n    \u003ctd\u003e 3Sum \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0015-3sum\"\u003e 3Sum \u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e\n\n  \u003ctr\u003e\n    \u003ctd\u003e 4Sum \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0018-4sum\"\u003e 4Sum \u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e\n\n  \u003ctr\u003e\n    \u003ctd\u003e Container With Most Water \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0011-container-with-most-water\"\u003e Container With Most Water \u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e\n\n  \u003ctr\u003e\n    \u003ctd\u003e Sort Colors \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0075-sort-colors\"\u003e Sort Colors \u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e\n\n  \u003ctr\u003e\n    \u003ctd\u003e Valid Palindrome \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0125-valid-palindrome\"\u003e Valid Palindrome \u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e\n\n  \u003ctr\u003e\n    \u003ctd\u003e Two Sum II - Input Array Is Sorted \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0167-two-sum-ii-input-array-is-sorted\"\u003e Two Sum II - Input Array Is Sorted \u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e\n\n  \u003ctr\u003e\n    \u003ctd\u003e Rearrange Array Elements by Sign \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/2149-rearrange-array-elements-by-sign\"\u003e Rearrange Array Elements by Sign \u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e\n\n  \u003ctr\u003e\n    \u003ctd\u003e Next Permutation \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0031-next-permutation\"\u003e Next Permutation \u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e\n\n  \u003ctr\u003e\n    \u003ctd\u003e Pascal's Triangle \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0118-pascals-triangle\"\u003e Pascal's Triangle \u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e\n\n  \u003ctr\u003e\n    \u003ctd\u003e Majority Element II \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0229-majority-element-ii\"\u003e Majority Element II \u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e\n \n\u003c/table\u003e\n\n\n\n\n\n\n\n\n\n\n\n\n\n\u003ch2\u003eSliding Window\u003c/h2\u003e\n\n\u003ctable\u003e\n  \u003ctr\u003e\n    \u003ctd \u003eMaximum Average Subarray I\u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/blob/main/0643-maximum-average-subarray-i\"\u003e Maximum Average Subarray I\u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e\n    \u003ctr\u003e\n    \u003ctd \u003e Minimum Size Subarray Sum \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/blob/main/0209-minimum-size-subarray-sum\"\u003e Minimum Size Subarray Sum \u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e\n   \u003ctr\u003e\n    \u003ctd \u003e Fruits in basket \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/blob/main/0904-fruit-into-baskets\"\u003e Fruits in basket\u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e\n \u003ctr\u003e\n    \u003ctd\u003eContains Duplicate II\u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/blob/main/0219-contains-duplicate-ii/0219-contains-duplicate-ii.java\"\u003e Contains Duplicate II \u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e\n   \u003ctr\u003e\n    \u003ctd \u003eLongest Substring Without Repeating Characters\u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/blob/main/0003-longest-substring-without-repeating-characters\"\u003e Longest Substring Without Repeating Characters \u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e\n\u003c/table\u003e\n\n\n\n\n\n\n\u003ch2\u003e Prefix Sum \u003c/h2\u003e\n\n\u003ctable\u003e\n  \u003ctr\u003e\n    \u003ctd\u003e Subarray Sum Equals K \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0560-subarray-sum-equals-k\"\u003e Subarray Sum Equals K \u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e\n\u003c/table\u003e\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\u003ch2\u003eMatrix\u003c/h2\u003e\n\n\u003ctable\u003e\n  \u003ctr\u003e\n    \u003ctd\u003e Set Matrix Zeroes \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0073-set-matrix-zeroes\"\u003e Set Matrix Zeroes \u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e\n\n  \u003ctr\u003e\n    \u003ctd\u003e Rotate Image \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0048-rotate-image\"\u003e Rotate Image \u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e\n\n  \u003ctr\u003e\n    \u003ctd\u003e Spiral Matrix \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0054-spiral-matrix\"\u003e Spiral Matrix \u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e\n  \n\u003c/table\u003e\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\u003ch2\u003e HashMap \u003c/h2\u003e\n\n\u003ctable\u003e\n \u003ctr\u003e\n    \u003ctd\u003e Isomorphic Strings \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0205-isomorphic-strings\"\u003e Isomorphic Strings \u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e\n\n  \u003ctr\u003e\n    \u003ctd\u003e Word Pattern \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0290-word-pattern\"\u003e Word Pattern \u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e\n\n  \u003ctr\u003e\n    \u003ctd\u003e Group Anagrams \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0049-group-anagrams\"\u003e Group Anagrams \u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e\n\n  \u003ctr\u003e\n    \u003ctd\u003e Ransom Note \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0383-ransom-note\"\u003e Ransom Note \u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e\n\u003c/table\u003e\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\u003ch2\u003e Intervals \u003c/h2\u003e\n\n\u003ctable\u003e\n \u003ctr\u003e\n    \u003ctd\u003e Merge Intervals \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0056-merge-intervals\"\u003e Merge Intervals \u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e\n\u003c/table\u003e\n\n\n\n\n\n\n\n\n\n\n\n\n\n\u003ch2\u003eLinked List \u003c/h2\u003e\n\n\u003ctable\u003e\n \u003ctr\u003e\n    \u003ctd\u003e Linked List Cycle \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0141-linked-list-cycle\"\u003e Linked List Cycle \u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e\n\n \u003ctr\u003e\n    \u003ctd\u003e Linked List Cycle II \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0142-linked-list-cycle-ii\"\u003e Linked List Cycle II \u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e\n\n  \u003ctr\u003e\n    \u003ctd\u003e Add Two Numbers \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0002-add-two-numbers\"\u003e Add Two Numbers \u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e\n\n  \u003ctr\u003e\n    \u003ctd\u003e Merge Two Sorted Lists \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0021-merge-two-sorted-lists\"\u003e Merge Two Sorted Lists \u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e\n\n  \u003ctr\u003e\n    \u003ctd\u003e Remove Nth Node From End of List \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0019-remove-nth-node-from-end-of-list\"\u003e Remove Nth Node From End of List \u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e\n\n  \u003ctr\u003e\n    \u003ctd\u003e Rotate List \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0061-rotate-list\"\u003e Rotate List \u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e\n\n  \u003ctr\u003e\n    \u003ctd\u003e  \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"\"\u003e I \u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e\n\n  \u003ctr\u003e\n    \u003ctd\u003e  \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"\"\u003e I \u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e\n  \n\u003c/table\u003e\n\n\n\n\n\n\n\n\u003ch2\u003eBinary Search \u003c/h2\u003e\n\u003ctable\u003e\n \u003ctr\u003e\n    \u003ctd\u003e Binary Search \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0704-binary-search\"\u003e Binary Search \u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e\n\n \u003ctr\u003e\n    \u003ctd\u003e Search Insert Position \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0035-search-insert-position\"\u003e Search Insert Position \u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e\n\n  \u003ctr\u003e\n    \u003ctd\u003e Find First and Last Position of Element in Sorted Array \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0034-find-first-and-last-position-of-element-in-sorted-array\"\u003e Find First and Last Position of Element in Sorted Array \u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e\n\n  \u003ctr\u003e\n    \u003ctd\u003e Peak Index in a Mountain Array \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0852-peak-index-in-a-mountain-array\"\u003e Peak Index in a Mountain Array \u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e\n  \n  \u003ctr\u003e\n    \u003ctd\u003e Search in Rotated Sorted Array \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0033-search-in-rotated-sorted-array\"\u003e Search in Rotated Sorted Array \u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e\n\n  \u003ctr\u003e\n    \u003ctd\u003e Search in Rotated Sorted Array II \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0081-search-in-rotated-sorted-array-ii\"\u003e Search in Rotated Sorted Array II \u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e\n\n  \u003ctr\u003e\n    \u003ctd\u003e Find Minimum in Rotated Sorted Array \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0153-find-minimum-in-rotated-sorted-array\"\u003e Find Minimum in Rotated Sorted Array \u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e\n  \u003ctr\u003e\n    \u003ctd\u003e Single Element in a Sorted Array \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0540-single-element-in-a-sorted-array\"\u003e Single Element in a Sorted Array \u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e\n\n  \u003ctr\u003e\n    \u003ctd\u003e Find Peak Element \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0162-find-peak-element\"\u003e Find Peak Element \u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e\n\n  \u003ctr\u003e\n    \u003ctd\u003e Koko Eating Bananas \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0875-koko-eating-bananas\"\u003e Koko Eating Bananas \u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e\n\n  \u003ctr\u003e\n    \u003ctd\u003e Minimum Number of Days to Make m Bouquets \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/1482-minimum-number-of-days-to-make-m-bouquets\"\u003e Minimum Number of Days to Make m Bouquets \u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e\n\n  \u003ctr\u003e\n    \u003ctd\u003e Find the Smallest Divisor Given a Threshold \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/1283-find-the-smallest-divisor-given-a-threshold\"\u003e Find the Smallest Divisor Given a Threshold \u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e\n\n  \u003ctr\u003e\n    \u003ctd\u003e Capacity To Ship Packages Within D Days \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/1011-capacity-to-ship-packages-within-d-days\"\u003e Capacity To Ship Packages Within D Days \u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e\n\n  \u003ctr\u003e\n    \u003ctd\u003e Kth Missing Positive Number \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/1539-kth-missing-positive-number\"\u003e Kth Missing Positive Number \u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e\n\n  \u003ctr\u003e\n    \u003ctd\u003e Split Array Largest Sum \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0410-split-array-largest-sum\"\u003e Split Array Largest Sum \u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e\n\n  \u003ctr\u003e\n    \u003ctd\u003e Median of Two Sorted Arrays \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0004-median-of-two-sorted-arrays\"\u003e Median of Two Sorted Arrays \u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e\n\n  \u003ctr\u003e\n    \u003ctd\u003e Search a 2D Matrix \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0074-search-a-2d-matrix\"\u003e Search a 2D Matrix \u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e\n\n  \u003ctr\u003e\n    \u003ctd\u003e Search a 2D Matrix II \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0240-search-a-2d-matrix-ii\"\u003e Search a 2D Matrix II \u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e\n\n  \u003ctr\u003e\n    \u003ctd\u003e Find a Peak Element II \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/1901-find-a-peak-element-ii\"\u003e Find a Peak Element II \u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e\n\n\u003c/table\u003e\n\n\u003ch2\u003eBinary Tree \u003c/h2\u003e\n\u003ctable\u003e\n \u003ctr\u003e\n    \u003ctd\u003e Binary Tree Preorder Traversal \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0144-binary-tree-preorder-traversal\"\u003e Binary Tree Preorder Traversal \u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e\n \n \u003ctr\u003e\n    \u003ctd\u003e Binary Tree Inorder Traversal \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0094-binary-tree-inorder-traversal\"\u003e Binary Tree Inorder Traversal \u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e\n\n  \u003ctr\u003e\n    \u003ctd\u003e Binary Tree Postorder Traversal \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0145-binary-tree-postorder-traversal\"\u003e Binary Tree Postorder Traversal \u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e\n\n  \u003ctr\u003e\n    \u003ctd\u003e Binary Tree Level Order Traversal \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0102-binary-tree-level-order-traversal\"\u003e Binary Tree Level Order Traversal \u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e\n\n  \u003ctr\u003e\n    \u003ctd\u003e Maximum Depth of Binary Tree \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0104-maximum-depth-of-binary-tree\"\u003e Maximum Depth of Binary Tree \u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e\n\n  \u003ctr\u003e\n    \u003ctd\u003e Balanced Binary Tree \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0110-balanced-binary-tree\"\u003e Balanced Binary Tree \u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e\n\n  \u003ctr\u003e\n    \u003ctd\u003e Diameter of Binary Tree \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0543-diameter-of-binary-tree\"\u003e Diameter of Binary Tree \u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e\n\n  \u003ctr\u003e\n    \u003ctd\u003e Binary Tree Maximum Path Sum \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0124-binary-tree-maximum-path-sum\"\u003e Binary Tree Maximum Path Sum \u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e\n\n  \u003ctr\u003e\n    \u003ctd\u003e Same Tree \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0100-same-tree\"\u003e Same Tree \u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e\n\n  \u003ctr\u003e\n    \u003ctd\u003e Invert Binary Tree \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0226-invert-binary-tree\"\u003e Invert Binary Tree \u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e\n\n  \u003ctr\u003e\n    \u003ctd\u003e Path Sum \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0112-path-sum\"\u003e Path Sum \u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e\n\n  \u003ctr\u003e\n    \u003ctd\u003e Binary Tree Zigzag Level Order Traversal \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0103-binary-tree-zigzag-level-order-traversal\"\u003e Binary Tree Zigzag Level Order Traversal \u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e\n\n  \u003ctr\u003e\n    \u003ctd\u003e Vertical Order Traversal of a Binary Tree \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0987-vertical-order-traversal-of-a-binary-tree\"\u003e Vertical Order Traversal of a Binary Tree \u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e\n\n  \u003ctr\u003e\n    \u003ctd\u003e Binary Tree Right Side View \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0199-binary-tree-right-side-view\"\u003e Binary Tree Right Side View \u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e\n\n  \u003ctr\u003e\n    \u003ctd\u003e Symmetric Tree \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0101-symmetric-tree\"\u003e Symmetric Tree \u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e\n\n  \u003ctr\u003e\n    \u003ctd\u003e Lowest Common Ancestor of a Binary Tree \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0236-lowest-common-ancestor-of-a-binary-tree\"\u003e Lowest Common Ancestor of a Binary Tree \u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e\n\n  \u003ctr\u003e\n    \u003ctd\u003e Maximum Width of Binary Tree \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0662-maximum-width-of-binary-tree\"\u003e Maximum Width of Binary Tree \u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e\n\n  \u003ctr\u003e\n    \u003ctd\u003e Average of Levels in Binary Tree \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0637-average-of-levels-in-binary-tree\"\u003e Average of Levels in Binary Tree \u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e\n\n  \u003ctr\u003e\n    \u003ctd\u003e All Nodes Distance K in Binary Tree \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0863-all-nodes-distance-k-in-binary-tree\"\u003e All Nodes Distance K in Binary Tree \u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e\n\n  \u003ctr\u003e\n    \u003ctd\u003e Count Complete Tree Nodes \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0222-count-complete-tree-nodes\"\u003e Count Complete Tree Nodes \u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e\n\n  \u003ctr\u003e\n    \u003ctd\u003e Construct Binary Tree from Preorder and Inorder Traversal \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0105-construct-binary-tree-from-preorder-and-inorder-traversal\"\u003e Construct Binary Tree from Preorder and Inorder Traversal \u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e\n\n  \u003ctr\u003e\n    \u003ctd\u003e Construct Binary Tree from Inorder and Postorder Traversal \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0106-construct-binary-tree-from-inorder-and-postorder-traversal\"\u003e Construct Binary Tree from Inorder and Postorder Traversal \u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e\n\n  \u003ctr\u003e\n    \u003ctd\u003e Serialize and Deserialize Binary Tree \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0297-serialize-and-deserialize-binary-tree\"\u003e Serialize and Deserialize Binary Tree \u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e\n\n  \u003ctr\u003e\n    \u003ctd\u003e Flatten Binary Tree to Linked List \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0114-flatten-binary-tree-to-linked-list\"\u003e Flatten Binary Tree to Linked List \u003c/a\u003e\u003c/td\u003e\n  \u003c/tr\u003e\n \n\u003c/table\u003e\n\n\u003ch2\u003eBinary Search Tree \u003c/h2\u003e\n\u003ctable\u003e\n \u003ctr\u003e\n    \u003ctd\u003e Search in a Binary Search Tree \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0700-search-in-a-binary-search-tree\"\u003e Search in a Binary Search Tree \u003c/a\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\n \u003ctr\u003e\n    \u003ctd\u003e Insert into a Binary Search Tree \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0701-insert-into-a-binary-search-tree\"\u003e Insert into a Binary Search Tree \u003c/a\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\n \u003ctr\u003e\n    \u003ctd\u003e Delete Node in a BST \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0450-delete-node-in-a-bst\"\u003e Delete Node in a BST \u003c/a\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\n \u003ctr\u003e\n    \u003ctd\u003e Kth Smallest Element in a BST \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0230-kth-smallest-element-in-a-bst\"\u003e Kth Smallest Element in a BST \u003c/a\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\n \u003ctr\u003e\n    \u003ctd\u003e Validate Binary Search Tree \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0098-validate-binary-search-tree\"\u003e Validate Binary Search Tree \u003c/a\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\n \u003ctr\u003e\n    \u003ctd\u003e Lowest Common Ancestor of a Binary Search Tree \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0235-lowest-common-ancestor-of-a-binary-search-tree\"\u003e Lowest Common Ancestor of a Binary Search Tree \u003c/a\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\n \u003ctr\u003e\n    \u003ctd\u003e Construct Binary Search Tree from Preorder Traversal \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/1008-construct-binary-search-tree-from-preorder-traversal\"\u003e Construct Binary Search Tree from Preorder Traversal \u003c/a\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\n \u003ctr\u003e\n    \u003ctd\u003e Binary Search Tree Iterator \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0173-binary-search-tree-iterator\"\u003e Binary Search Tree Iterator \u003c/a\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\n \u003ctr\u003e\n    \u003ctd\u003e  \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"\"\u003e  \u003c/a\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\n \u003ctr\u003e\n    \u003ctd\u003e  \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"\"\u003e  \u003c/a\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\n\u003c/table\u003e\n\n\u003ch2\u003e 1D Dynamic Programming \u003c/h2\u003e\n\u003ctable\u003e\n \u003ctr\u003e\n    \u003ctd\u003e Fibonacci Number \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0509-fibonacci-number\"\u003e Fibonacci Number \u003c/a\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\n \u003ctr\u003e\n    \u003ctd\u003e Climbing Stairs \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0070-climbing-stairs\"\u003e Climbing Stairs \u003c/a\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\n \u003ctr\u003e\n    \u003ctd\u003e House Robber \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0198-house-robber\"\u003e House Robber \u003c/a\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\n\n\u003c/table\u003e\n\n\u003ch2\u003e 2D/3D DP and DP on Grids \u003c/h2\u003e\n\u003ctable\u003e\n \u003ctr\u003e\n    \u003ctd\u003e Unique Paths \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0062-unique-paths\"\u003e Unique Paths \u003c/a\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\n \u003ctr\u003e\n    \u003ctd\u003e Unique Paths II \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0063-unique-paths-ii\"\u003e Unique Paths II \u003c/a\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\n \u003ctr\u003e\n    \u003ctd\u003e Minimum Path Sum \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0064-minimum-path-sum\"\u003e Minimum Path Sum \u003c/a\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\n \u003ctr\u003e\n    \u003ctd\u003e Triangle \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0120-triangle\"\u003e Triangle \u003c/a\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\n \u003ctr\u003e\n    \u003ctd\u003e Minimum Falling Path Sum \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0931-minimum-falling-path-sum\"\u003e Minimum Falling Path Sum \u003c/a\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\n \n\n\u003c/table\u003e\n\n\u003ch2\u003e DP on Subsequences \u003c/h2\u003e\n\u003ctable\u003e\n \u003ctr\u003e\n    \u003ctd\u003e Partition Equal Subset Sum \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0416-partition-equal-subset-sum\"\u003e Partition Equal Subset Sum \u003c/a\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\n \u003ctr\u003e\n    \u003ctd\u003e Assign Cookies \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0455-assign-cookies\"\u003e Assign Cookies \u003c/a\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\n \u003ctr\u003e\n    \u003ctd\u003e Coin Change \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0322-coin-change\"\u003e Coin Change \u003c/a\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\n \u003ctr\u003e\n    \u003ctd\u003e Target Sum \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"https://github.com/ShivanMathur/LeetCode/tree/main/0494-target-sum\"\u003e Target Sum \u003c/a\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\n \u003ctr\u003e\n    \u003ctd\u003e  \u003c/td\u003e\n    \u003ctd\u003e \u003ca href=\"\"\u003e  \u003c/a\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/table\u003e\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fshivanmathur%2Fleetcode","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fshivanmathur%2Fleetcode","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fshivanmathur%2Fleetcode/lists"}