René's URL Explorer Experiment

Title: GitHub - web-jamil/LeetCode-in-TypeScript: TypeScript-based LeetCode algorithm problem solutions, regularly updated. · GitHub

Open Graph Title: GitHub - web-jamil/LeetCode-in-TypeScript: TypeScript-based LeetCode algorithm problem solutions, regularly updated.

X Title: GitHub - web-jamil/LeetCode-in-TypeScript: TypeScript-based LeetCode algorithm problem solutions, regularly updated.

Description: TypeScript-based LeetCode algorithm problem solutions, regularly updated. - web-jamil/LeetCode-in-TypeScript

Open Graph Description: TypeScript-based LeetCode algorithm problem solutions, regularly updated. - web-jamil/LeetCode-in-TypeScript

X Description: TypeScript-based LeetCode algorithm problem solutions, regularly updated. - web-jamil/LeetCode-in-TypeScript

Opengraph URL: https://github.com/web-jamil/LeetCode-in-TypeScript

X: @github

direct link

Domain: github.com

route-pattern	/:user_id/:repository
route-controller	files
route-action	disambiguate
fetch-nonce	v2:f7c128e5-6b74-aa68-a278-06d09e97e004
current-catalog-service-hash	f3abb0cc802f3d7b95fc8762b94bdcb13bf39634c40c357301c4aa1d67a256fb
request-id	8562:3985C:B2D18:ECB48:6A4D2EC1
html-safe-nonce	7adfe63b746327aa6194693c44bf4a199a240c462401e17c92ce4e7489c86025
visitor-payload	eyJyZWZlcnJlciI6IiIsInJlcXVlc3RfaWQiOiI4NTYyOjM5ODVDOkIyRDE4OkVDQjQ4OjZBNEQyRUMxIiwidmlzaXRvcl9pZCI6IjMyMDgyOTQ3NjE3NzQyNjQwMDEiLCJyZWdpb25fZWRnZSI6ImlhZCIsInJlZ2lvbl9yZW5kZXIiOiJpYWQifQ==
visitor-hmac	10b9931fb5e7345ad0bad74f71ff3069d77cc7cb4d4225377d56f09df1d9e60a
hovercard-subject-tag	repository:874903688
github-keyboard-shortcuts	repository,copilot
google-site-verification	Apib7-x98H0j5cPqHWwSMm6dNU4GmODRoqxLiDzdx9I
octolytics-url	https://collector.github.com/github/collect
analytics-location	//
fb:app_id	1401488693436528
apple-itunes-app	app-id=1477376905, app-argument=https://github.com/web-jamil/LeetCode-in-TypeScript
twitter:image	https://opengraph.githubassets.com/9eaa1f475ef4e5db3cbbfe19ffcc8cb89274c7e4fef2936ae1b0537db9b2e05f/web-jamil/LeetCode-in-TypeScript
twitter:card	summary_large_image
og:image	https://opengraph.githubassets.com/9eaa1f475ef4e5db3cbbfe19ffcc8cb89274c7e4fef2936ae1b0537db9b2e05f/web-jamil/LeetCode-in-TypeScript
og:image:alt	TypeScript-based LeetCode algorithm problem solutions, regularly updated. - web-jamil/LeetCode-in-TypeScript
og:image:width	1200
og:image:height	600
og:site_name	GitHub
og:type	object
hostname	github.com
expected-hostname	github.com
None	92571a8944142227b7e19cd10918b1ddd06e5066c1ad5bc7e4769cf6140a87e6
turbo-cache-control	no-cache
go-import	github.com/web-jamil/LeetCode-in-TypeScript git https://github.com/web-jamil/LeetCode-in-TypeScript.git
octolytics-dimension-user_id	168980492
octolytics-dimension-user_login	web-jamil
octolytics-dimension-repository_id	874903688
octolytics-dimension-repository_nwo	web-jamil/LeetCode-in-TypeScript
octolytics-dimension-repository_public	true
octolytics-dimension-repository_is_fork	true
octolytics-dimension-repository_parent_id	612079989
octolytics-dimension-repository_parent_nwo	LeetCode-in-TypeScript/LeetCode-in-TypeScript
octolytics-dimension-repository_network_root_id	612079989
octolytics-dimension-repository_network_root_nwo	LeetCode-in-TypeScript/LeetCode-in-TypeScript
turbo-body-classes	logged-out env-production page-responsive
disable-turbo	false
browser-stats-url	https://api.github.com/_private/browser/stats
browser-errors-url	https://api.github.com/_private/browser/errors
release	93f17a978ee60bc4668e1d7b90e6bd2d622261fd
ui-target	full
theme-color	#1e2327
color-scheme	light dark

Links:

Skip to content	https://github.com/web-jamil/LeetCode-in-TypeScript#start-of-content
	https://github.com/
Sign in	https://github.com/login?return_to=https%3A%2F%2Fgithub.com%2Fweb-jamil%2FLeetCode-in-TypeScript
GitHub CopilotWrite better code with AI	https://github.com/features/copilot
GitHub Copilot appDirect agents from issue to merge	https://github.com/features/ai/github-app
MCP RegistryNewIntegrate external tools	https://github.com/mcp
ActionsAutomate any workflow	https://github.com/features/actions
CodespacesInstant dev environments	https://github.com/features/codespaces
IssuesPlan and track work	https://github.com/features/issues
Code ReviewManage code changes	https://github.com/features/code-review
GitHub Advanced SecurityFind and fix vulnerabilities	https://github.com/security/advanced-security
Code securitySecure your code as you build	https://github.com/security/advanced-security/code-security
Secret protectionStop leaks before they start	https://github.com/security/advanced-security/secret-protection
Why GitHub	https://github.com/why-github
Documentation	https://docs.github.com
Blog	https://github.blog
Changelog	https://github.blog/changelog
Marketplace	https://github.com/marketplace
View all features	https://github.com/features
Enterprises	https://github.com/enterprise
Small and medium teams	https://github.com/team
Startups	https://github.com/enterprise/startups
Nonprofits	https://github.com/solutions/industry/nonprofits
App Modernization	https://github.com/solutions/use-case/app-modernization
DevSecOps	https://github.com/solutions/use-case/devsecops
DevOps	https://github.com/solutions/use-case/devops
CI/CD	https://github.com/solutions/use-case/ci-cd
View all use cases	https://github.com/solutions/use-case
Healthcare	https://github.com/solutions/industry/healthcare
Financial services	https://github.com/solutions/industry/financial-services
Manufacturing	https://github.com/solutions/industry/manufacturing
Government	https://github.com/solutions/industry/government
View all industries	https://github.com/solutions/industry
View all solutions	https://github.com/solutions
AI	https://github.com/resources/articles?topic=ai
Software Development	https://github.com/resources/articles?topic=software-development
DevOps	https://github.com/resources/articles?topic=devops
Security	https://github.com/resources/articles?topic=security
View all topics	https://github.com/resources/articles
Customer stories	https://github.com/customer-stories
Events & webinars	https://github.com/resources/events
Ebooks & reports	https://github.com/resources/whitepapers
Business insights	https://github.com/solutions/executive-insights
GitHub Skills	https://skills.github.com
Documentation	https://docs.github.com
Customer support	https://support.github.com
Community forum	https://github.com/orgs/community/discussions
Trust center	https://github.com/trust-center
Partners	https://github.com/partners
View all resources	https://github.com/resources
GitHub SponsorsFund open source developers	https://github.com/sponsors
Security Lab	https://securitylab.github.com
Maintainer Community	https://maintainers.github.com
Accelerator	https://github.com/accelerator
GitHub Stars	https://stars.github.com
Archive Program	https://archiveprogram.github.com
Topics	https://github.com/topics
Trending	https://github.com/trending
Collections	https://github.com/collections
Enterprise platformAI-powered developer platform	https://github.com/enterprise
GitHub Advanced SecurityEnterprise-grade security features	https://github.com/security/advanced-security
Copilot for BusinessEnterprise-grade AI features	https://github.com/features/copilot/copilot-business
Premium SupportEnterprise-grade 24/7 support	https://github.com/premium-support
Pricing	https://github.com/pricing
Search syntax tips	https://docs.github.com/search-github/github-code-search/understanding-github-code-search-syntax
documentation	https://docs.github.com/search-github/github-code-search/understanding-github-code-search-syntax
Sign in	https://github.com/login?return_to=https%3A%2F%2Fgithub.com%2Fweb-jamil%2FLeetCode-in-TypeScript
Sign up	https://github.com/signup?ref_cta=Sign+up&ref_loc=header+logged+out&ref_page=%2F%3Cuser-name%3E%2F%3Crepo-name%3E&source=header-repo&source_repo=web-jamil%2FLeetCode-in-TypeScript
Reload	https://github.com/web-jamil/LeetCode-in-TypeScript
Reload	https://github.com/web-jamil/LeetCode-in-TypeScript
Reload	https://github.com/web-jamil/LeetCode-in-TypeScript
web-jamil	https://github.com/web-jamil
LeetCode-in-TypeScript	https://github.com/web-jamil/LeetCode-in-TypeScript
LeetCode-in-TypeScript/LeetCode-in-TypeScript	https://github.com/LeetCode-in-TypeScript/LeetCode-in-TypeScript
Notifications	https://github.com/login?return_to=%2Fweb-jamil%2FLeetCode-in-TypeScript
Fork 0	https://github.com/login?return_to=%2Fweb-jamil%2FLeetCode-in-TypeScript
Star 1	https://github.com/login?return_to=%2Fweb-jamil%2FLeetCode-in-TypeScript
Code	https://github.com/web-jamil/LeetCode-in-TypeScript
Pull requests 0	https://github.com/web-jamil/LeetCode-in-TypeScript/pulls
Actions	https://github.com/web-jamil/LeetCode-in-TypeScript/actions
Projects	https://github.com/web-jamil/LeetCode-in-TypeScript/projects
Security and quality 0	https://github.com/web-jamil/LeetCode-in-TypeScript/security
Insights	https://github.com/web-jamil/LeetCode-in-TypeScript/pulse
Code	https://github.com/web-jamil/LeetCode-in-TypeScript
Pull requests	https://github.com/web-jamil/LeetCode-in-TypeScript/pulls
Actions	https://github.com/web-jamil/LeetCode-in-TypeScript/actions
Projects	https://github.com/web-jamil/LeetCode-in-TypeScript/projects
Security and quality	https://github.com/web-jamil/LeetCode-in-TypeScript/security
Insights	https://github.com/web-jamil/LeetCode-in-TypeScript/pulse
	https://github.com/web-jamil/LeetCode-in-TypeScript
Branches	https://github.com/web-jamil/LeetCode-in-TypeScript/branches
Tags	https://github.com/web-jamil/LeetCode-in-TypeScript/tags
	https://github.com/web-jamil/LeetCode-in-TypeScript/branches
	https://github.com/web-jamil/LeetCode-in-TypeScript/tags
133 Commits	https://github.com/web-jamil/LeetCode-in-TypeScript/commits/main/
	https://github.com/web-jamil/LeetCode-in-TypeScript/commits/main/
.github/workflows	https://github.com/web-jamil/LeetCode-in-TypeScript/tree/main/.github/workflows
.github/workflows	https://github.com/web-jamil/LeetCode-in-TypeScript/tree/main/.github/workflows
src	https://github.com/web-jamil/LeetCode-in-TypeScript/tree/main/src
src	https://github.com/web-jamil/LeetCode-in-TypeScript/tree/main/src
.gitignore	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/.gitignore
.gitignore	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/.gitignore
.npmrc	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/.npmrc
.npmrc	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/.npmrc
.prettierrc.js	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/.prettierrc.js
.prettierrc.js	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/.prettierrc.js
LICENSE	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/LICENSE
LICENSE	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/LICENSE
README.md	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/README.md
README.md	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/README.md
SECURITY.md	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/SECURITY.md
SECURITY.md	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/SECURITY.md
cspell.json	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/cspell.json
cspell.json	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/cspell.json
package.json	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/package.json
package.json	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/package.json
sonar-project.properties	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/sonar-project.properties
sonar-project.properties	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/sonar-project.properties
tsconfig.json	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/tsconfig.json
tsconfig.json	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/tsconfig.json
tslint.json	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/tslint.json
tslint.json	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/tslint.json
vite.config.ts	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/vite.config.ts
vite.config.ts	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/vite.config.ts
README	https://github.com/web-jamil/LeetCode-in-TypeScript
License	https://github.com/web-jamil/LeetCode-in-TypeScript
Security	https://github.com/web-jamil/LeetCode-in-TypeScript
	https://github.com/web-jamil/LeetCode-in-TypeScript#leetcode-in-typescript
	https://www.npmjs.com/package/@javadev/leetcode-in-typescript
	https://github.com/LeetCode-in-TypeScript/LeetCode-in-TypeScript/blob/main/LICENSE
	https://github.com/LeetCode-in-TypeScript/LeetCode-in-TypeScript/actions/workflows/node.yml
	https://sonarcloud.io/summary/new_code?id=LeetCode-in-TypeScript
	https://github.com/LeetCode-in-TypeScript/LeetCode-in-TypeScript
	https://github.com/LeetCode-in-TypeScript/LeetCode-in-TypeScript/fork
"For coding interview preparation, LeetCode is one of the best online resource providing a rich library of more than 300 real coding interview questions for you to practice from using one of the 7 supported languages - C, C++, Java, Python, C#, JavaScript, Ruby."	https://www.quora.com/How-effective-is-Leetcode-for-preparing-for-technical-interviews
Data Structure I	https://github.com/web-jamil/LeetCode-in-TypeScript#data-structure-i
Data Structure II	https://github.com/web-jamil/LeetCode-in-TypeScript#data-structure-ii
Algorithm I	https://github.com/web-jamil/LeetCode-in-TypeScript#algorithm-i
Algorithm II	https://github.com/web-jamil/LeetCode-in-TypeScript#algorithm-ii
Binary Search I	https://github.com/web-jamil/LeetCode-in-TypeScript#binary-search-i
Binary Search II	https://github.com/web-jamil/LeetCode-in-TypeScript#binary-search-ii
Dynamic Programming I	https://github.com/web-jamil/LeetCode-in-TypeScript#dynamic-programming-i
Programming Skills I	https://github.com/web-jamil/LeetCode-in-TypeScript#programming-skills-i
Programming Skills II	https://github.com/web-jamil/LeetCode-in-TypeScript#programming-skills-ii
Graph Theory I	https://github.com/web-jamil/LeetCode-in-TypeScript#graph-theory-i
SQL I	https://github.com/web-jamil/LeetCode-in-TypeScript#sql-i
Level 1	https://github.com/web-jamil/LeetCode-in-TypeScript#level-1
Level 2	https://github.com/web-jamil/LeetCode-in-TypeScript#level-2
Udemy	https://github.com/web-jamil/LeetCode-in-TypeScript#udemy
	https://github.com/web-jamil/LeetCode-in-TypeScript#data-structure-i
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-1-array
Maximum Subarray	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0053_maximum_subarray/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-2-array
Two Sum	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0001_two_sum/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-3-array
Best Time to Buy and Sell Stock	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0101_0200/s0121_best_time_to_buy_and_sell_stock/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-4-array
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-5-array
Search a 2D Matrix	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0074_search_a_2d_matrix/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-6-string
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-7-linked-list
Linked List Cycle	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0101_0200/s0141_linked_list_cycle/solution.ts
Merge Two Sorted Lists	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0021_merge_two_sorted_lists/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-8-linked-list
Reverse Linked List	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0201_0300/s0206_reverse_linked_list/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-9-stack-queue
Valid Parentheses	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0020_valid_parentheses/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-10-tree
Binary Tree Inorder Traversal	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0094_binary_tree_inorder_traversal/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-11-tree
Binary Tree Level Order Traversal	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0101_0200/s0102_binary_tree_level_order_traversal/solution.ts
Maximum Depth of Binary Tree	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0101_0200/s0104_maximum_depth_of_binary_tree/solution.ts
Symmetric Tree	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0101_0200/s0101_symmetric_tree/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-12-tree
Invert Binary Tree	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0201_0300/s0226_invert_binary_tree/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-13-tree
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-14-tree
Validate Binary Search Tree	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0098_validate_binary_search_tree/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#data-structure-ii
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-1-array-1
Single Number	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0101_0200/s0136_single_number/solution.ts
Majority Element	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0101_0200/s0169_majority_element/solution.ts
3Sum	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0015_3sum/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-2-array-1
Sort Colors	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0075_sort_colors/solution.ts
Merge Intervals	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0056_merge_intervals/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-3-array-1
Rotate Image	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0048_rotate_image/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-4-array-1
Search a 2D Matrix II	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0201_0300/s0240_search_a_2d_matrix_ii/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-5-array-1
Product of Array Except Self	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0201_0300/s0238_product_of_array_except_self/solution.ts
Subarray Sum Equals K	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0501_0600/s0560_subarray_sum_equals_k/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-6-string-1
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-7-string
Partition Labels	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0701_0800/s0763_partition_labels/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-8-string
Group Anagrams	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0049_group_anagrams/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-9-string
Longest Palindromic Substring	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0005_longest_palindromic_substring/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-10-linked-list
Add Two Numbers	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0002_add_two_numbers/solution.ts
Linked List Cycle II	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0101_0200/s0142_linked_list_cycle_ii/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-11-linked-list
Intersection of Two Linked Lists	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0101_0200/s0160_intersection_of_two_linked_lists/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-12-linked-list
Swap Nodes in Pairs	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0024_swap_nodes_in_pairs/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-13-linked-list
Reverse Nodes in k-Group	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0025_reverse_nodes_in_k_group/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-14-stack-queue
Min Stack	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0101_0200/s0155_min_stack/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-15-tree
Construct Binary Tree from Preorder and Inorder Traversal	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-16-tree
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-17-tree
Kth Smallest Element in a BST	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0201_0300/s0230_kth_smallest_element_in_a_bst/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-18-tree
Lowest Common Ancestor of a Binary Tree	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-19-graph
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-20-heap-priority-queue
Kth Largest Element in an Array	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0201_0300/s0215_kth_largest_element_in_an_array/solution.ts
Top K Frequent Elements	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0301_0400/s0347_top_k_frequent_elements/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-21-heap-priority-queue
	https://github.com/web-jamil/LeetCode-in-TypeScript#algorithm-i
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-1-binary-search
Search Insert Position	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0035_search_insert_position/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-2-two-pointers
Rotate Array	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0101_0200/s0189_rotate_array/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-3-two-pointers
Move Zeroes	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0201_0300/s0283_move_zeroes/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-4-two-pointers
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-5-two-pointers
Remove Nth Node From End of List	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0019_remove_nth_node_from_end_of_list/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-6-sliding-window
Longest Substring Without Repeating Characters	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0003_longest_substring_without_repeating_characters/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-7-breadth-first-search-depth-first-search
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-8-breadth-first-search-depth-first-search
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-9-breadth-first-search-depth-first-search
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-10-recursion-backtracking
Merge Two Sorted Lists	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0021_merge_two_sorted_lists/solution.ts
Reverse Linked List	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0201_0300/s0206_reverse_linked_list/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-11-recursion-backtracking
Permutations	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0046_permutations/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-12-dynamic-programming
Climbing Stairs	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0070_climbing_stairs/solution.ts
House Robber	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0101_0200/s0198_house_robber/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-13-bit-manipulation
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-14-bit-manipulation
Single Number	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0101_0200/s0136_single_number/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#algorithm-ii
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-1-binary-search-1
Find First and Last Position of Element in Sorted Array	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/solution.ts
Search in Rotated Sorted Array	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0033_search_in_rotated_sorted_array/solution.ts
Search a 2D Matrix	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0074_search_a_2d_matrix/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-2-binary-search
Find Minimum in Rotated Sorted Array	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-3-two-pointers-1
3Sum	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0015_3sum/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-4-two-pointers-1
Container With Most Water	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0011_container_with_most_water/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-5-sliding-window
Find All Anagrams in a String	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0401_0500/s0438_find_all_anagrams_in_a_string/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-6-breadth-first-search-depth-first-search
Number of Islands	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0101_0200/s0200_number_of_islands/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-7-breadth-first-search-depth-first-search-1
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-8-breadth-first-search-depth-first-search-1
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-9-recursion-backtracking
Subsets	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0078_subsets/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-10-recursion-backtracking-1
Combination Sum	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0039_combination_sum/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-11-recursion-backtracking-1
Letter Combinations of a Phone Number	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0017_letter_combinations_of_a_phone_number/solution.ts
Generate Parentheses	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0022_generate_parentheses/solution.ts
Word Search	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0079_word_search/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-12-dynamic-programming-1
Jump Game	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0055_jump_game/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-13-dynamic-programming
Jump Game II	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0045_jump_game_ii/solution.ts
Unique Paths	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0062_unique_paths/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-14-dynamic-programming
Longest Palindromic Substring	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0005_longest_palindromic_substring/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-15-dynamic-programming
Word Break	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0101_0200/s0139_word_break/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-16-dynamic-programming
Longest Increasing Subsequence	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0201_0300/s0300_longest_increasing_subsequence/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-17-dynamic-programming
Longest Common Subsequence	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g1101_1200/s1143_longest_common_subsequence/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-18-dynamic-programming
Edit Distance	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0072_edit_distance/solution.ts
Coin Change	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0301_0400/s0322_coin_change/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-19-bit-manipulation
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-20-others
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-21-others
	https://github.com/web-jamil/LeetCode-in-TypeScript#binary-search-i
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-1
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-2
Search Insert Position	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0035_search_insert_position/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-3
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-4
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-5
Find First and Last Position of Element in Sorted Array	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-6
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-7
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-8
Search a 2D Matrix	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0074_search_a_2d_matrix/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-9
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-10
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-11
Search in Rotated Sorted Array	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0033_search_in_rotated_sorted_array/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-12
Find Minimum in Rotated Sorted Array	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#binary-search-ii
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-1-1
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-2-1
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-3-1
Longest Increasing Subsequence	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0201_0300/s0300_longest_increasing_subsequence/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-4-1
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-5-1
Find the Duplicate Number	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0201_0300/s0287_find_the_duplicate_number/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-6-1
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-7-1
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-8-1
Search a 2D Matrix II	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0201_0300/s0240_search_a_2d_matrix_ii/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-9-1
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-10-1
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-11-1
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-12-1
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-13
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-14
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-15
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-16
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-17
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-18
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-19
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-20
	https://github.com/web-jamil/LeetCode-in-TypeScript#dynamic-programming-i
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-1-2
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-2-2
Climbing Stairs	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0070_climbing_stairs/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-3-2
House Robber	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0101_0200/s0198_house_robber/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-4-2
Jump Game	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0055_jump_game/solution.ts
Jump Game II	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0045_jump_game_ii/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-5-2
Maximum Subarray	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0053_maximum_subarray/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-6-2
Maximum Product Subarray	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0101_0200/s0152_maximum_product_subarray/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-7-2
Best Time to Buy and Sell Stock	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0101_0200/s0121_best_time_to_buy_and_sell_stock/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-8-2
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-9-2
Word Break	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0101_0200/s0139_word_break/solution.ts
Trapping Rain Water	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0042_trapping_rain_water/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-10-2
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-11-2
Unique Binary Search Trees	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0096_unique_binary_search_trees/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-12-2
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-13-1
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-14-1
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-15-1
Unique Paths	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0062_unique_paths/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-16-1
Minimum Path Sum	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0064_minimum_path_sum/solution.ts
Maximal Square	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0201_0300/s0221_maximal_square/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-17-1
Longest Palindromic Substring	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0005_longest_palindromic_substring/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-18-1
Longest Increasing Subsequence	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0201_0300/s0300_longest_increasing_subsequence/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-19-1
Longest Common Subsequence	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g1101_1200/s1143_longest_common_subsequence/solution.ts
Edit Distance	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0072_edit_distance/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-20-1
Coin Change	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0301_0400/s0322_coin_change/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-21
	https://github.com/web-jamil/LeetCode-in-TypeScript#programming-skills-i
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-1-basic-data-type
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-2-operator
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-3-conditional-statements
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-4-loop
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-5-function
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-6-array
Move Zeroes	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0201_0300/s0283_move_zeroes/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-7-array
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-8-string-1
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-9-string-1
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-10-linked-list-and-tree
Maximum Depth of Binary Tree	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0101_0200/s0104_maximum_depth_of_binary_tree/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-11-containers-and-libraries
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-12-class-and-object
	https://github.com/web-jamil/LeetCode-in-TypeScript#programming-skills-ii
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-1-3
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-2-3
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-3-3
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-4-3
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-5-3
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-6-3
Daily Temperatures	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0701_0800/s0739_daily_temperatures/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-7-3
Rotate Image	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0048_rotate_image/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-8-3
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-9-3
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-10-3
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-11-3
Group Anagrams	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0049_group_anagrams/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-12-3
Find All Anagrams in a String	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0401_0500/s0438_find_all_anagrams_in_a_string/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-13-2
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-14-2
Copy List with Random Pointer	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0101_0200/s0138_copy_list_with_random_pointer/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-15-2
Add Two Numbers	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0002_add_two_numbers/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-16-2
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-17-2
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-18-2
Min Stack	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0101_0200/s0155_min_stack/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-19-2
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-20-2
	https://github.com/web-jamil/LeetCode-in-TypeScript#graph-theory-i
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-1-matrix-related-problems
Number of Islands	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0101_0200/s0200_number_of_islands/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-2-matrix-related-problems
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-3-matrix-related-problems
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-4-matrix-related-problems
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-5-matrix-related-problems
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-6-matrix-related-problems
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-7-standard-traversal
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-8-standard-traversal
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-9-standard-traversal
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-10-standard-traversal
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-11-breadth-first-search
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-12-breadth-first-search
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-13-graph-theory
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-14-graph-theory
	https://github.com/web-jamil/LeetCode-in-TypeScript#sql-i
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-1-select
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-2-select-and-order
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-3-string-processing-functions
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-4-union-and-select
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-5-union
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-6-union
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-7-function
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-8-function
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-9-control-of-flow
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-10-where
	https://github.com/web-jamil/LeetCode-in-TypeScript#level-1
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-1-prefix-sum
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-2-string
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-3-linked-list
Merge Two Sorted Lists	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0021_merge_two_sorted_lists/solution.ts
Reverse Linked List	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0201_0300/s0206_reverse_linked_list/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-4-linked-list
Linked List Cycle II	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0101_0200/s0142_linked_list_cycle_ii/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-5-greedy
Best Time to Buy and Sell Stock	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0101_0200/s0121_best_time_to_buy_and_sell_stock/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-6-tree
Binary Tree Level Order Traversal	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0101_0200/s0102_binary_tree_level_order_traversal/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-7-binary-search
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-8-binary-search-tree
Validate Binary Search Tree	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0098_validate_binary_search_tree/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-9-graphbfsdfs
Number of Islands	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0101_0200/s0200_number_of_islands/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-10-dynamic-programming
Climbing Stairs	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0070_climbing_stairs/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-11-dynamic-programming
Unique Paths	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0062_unique_paths/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-12-sliding-windowtwo-pointer
Find All Anagrams in a String	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0401_0500/s0438_find_all_anagrams_in_a_string/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-13-hashmap
Two Sum	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0001_two_sum/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-14-stack
Decode String	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0301_0400/s0394_decode_string/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-15-heap
	https://github.com/web-jamil/LeetCode-in-TypeScript#level-2
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-1-implementationsimulation
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-2-string-1
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-3-linked-list-1
Remove Nth Node From End of List	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0019_remove_nth_node_from_end_of_list/solution.ts
Palindrome Linked List	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0201_0300/s0234_palindrome_linked_list/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-4-linked-list-1
Sort List	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0101_0200/s0148_sort_list/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-5-greedy-1
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-6-tree-1
Invert Binary Tree	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0201_0300/s0226_invert_binary_tree/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-7-tree
Diameter of Binary Tree	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0501_0600/s0543_diameter_of_binary_tree/solution.ts
Path Sum III	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0401_0500/s0437_path_sum_iii/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-8-binary-search
Search a 2D Matrix	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0074_search_a_2d_matrix/solution.ts
Search in Rotated Sorted Array	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0033_search_in_rotated_sorted_array/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-9-binary-search-tree
Kth Smallest Element in a BST	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0201_0300/s0230_kth_smallest_element_in_a_bst/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-10-graphbfsdfs
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-11-graphbfsdfs
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-12-dynamic-programming-2
House Robber	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0101_0200/s0198_house_robber/solution.ts
Coin Change	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0301_0400/s0322_coin_change/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-13-dynamic-programming-1
Partition Equal Subset Sum	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0401_0500/s0416_partition_equal_subset_sum/solution.ts
Maximum Product Subarray	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0101_0200/s0152_maximum_product_subarray/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-14-sliding-windowtwo-pointer
Longest Substring Without Repeating Characters	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0003_longest_substring_without_repeating_characters/solution.ts
Minimum Window Substring	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0076_minimum_window_substring/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-15-tree-1
Symmetric Tree	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0101_0200/s0101_symmetric_tree/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-16-design
Min Stack	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0101_0200/s0155_min_stack/solution.ts
Implement Trie (Prefix Tree)	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0201_0300/s0208_implement_trie_prefix_tree/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-17-interval
Merge Intervals	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0056_merge_intervals/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-18-stack
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-19-union-find
	https://github.com/web-jamil/LeetCode-in-TypeScript#day-20-brute-forcebacktracking
Combination Sum	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0039_combination_sum/solution.ts
Permutations	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0046_permutations/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#udemy
	https://github.com/web-jamil/LeetCode-in-TypeScript#udemy-integers
Single Number	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0101_0200/s0136_single_number/solution.ts
Reverse Integer	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0007_reverse_integer/solution.ts
Palindrome Number	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0009_palindrome_number/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#udemy-strings
Longest Substring Without Repeating Characters	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0003_longest_substring_without_repeating_characters/solution.ts
Valid Parentheses	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0020_valid_parentheses/solution.ts
Longest Palindromic Substring	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0005_longest_palindromic_substring/solution.ts
Decode String	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0301_0400/s0394_decode_string/solution.ts
Group Anagrams	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0049_group_anagrams/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#udemy-binary-search
Search in Rotated Sorted Array	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0033_search_in_rotated_sorted_array/solution.ts
Find Minimum in Rotated Sorted Array	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#udemy-arrays
Best Time to Buy and Sell Stock	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0101_0200/s0121_best_time_to_buy_and_sell_stock/solution.ts
Move Zeroes	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0201_0300/s0283_move_zeroes/solution.ts
Two Sum	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0001_two_sum/solution.ts
Rotate Array	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0101_0200/s0189_rotate_array/solution.ts
Jump Game	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0055_jump_game/solution.ts
Sort Colors	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0075_sort_colors/solution.ts
Product of Array Except Self	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0201_0300/s0238_product_of_array_except_self/solution.ts
First Missing Positive	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0041_first_missing_positive/solution.ts
Sliding Window Maximum	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0201_0300/s0239_sliding_window_maximum/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#udemy-two-pointers
Trapping Rain Water	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0042_trapping_rain_water/solution.ts
3Sum	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0015_3sum/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#udemy-famous-algorithm
Maximum Subarray	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0053_maximum_subarray/solution.ts
Majority Element	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0101_0200/s0169_majority_element/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#udemy-sorting-algorithms
	https://github.com/web-jamil/LeetCode-in-TypeScript#udemy-2d-arraysmatrix
Search a 2D Matrix	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0074_search_a_2d_matrix/solution.ts
Rotate Image	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0048_rotate_image/solution.ts
Set Matrix Zeroes	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0073_set_matrix_zeroes/solution.ts
Merge Intervals	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0056_merge_intervals/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#udemy-linked-list
Flatten Binary Tree to Linked List	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0101_0200/s0114_flatten_binary_tree_to_linked_list/solution.ts
Swap Nodes in Pairs	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0024_swap_nodes_in_pairs/solution.ts
Linked List Cycle II	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0101_0200/s0142_linked_list_cycle_ii/solution.ts
Linked List Cycle	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0101_0200/s0141_linked_list_cycle/solution.ts
Reverse Linked List	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0201_0300/s0206_reverse_linked_list/solution.ts
Merge Two Sorted Lists	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0021_merge_two_sorted_lists/solution.ts
Intersection of Two Linked Lists	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0101_0200/s0160_intersection_of_two_linked_lists/solution.ts
Palindrome Linked List	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0201_0300/s0234_palindrome_linked_list/solution.ts
Copy List with Random Pointer	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0101_0200/s0138_copy_list_with_random_pointer/solution.ts
Reverse Nodes in k-Group	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0025_reverse_nodes_in_k_group/solution.ts
LRU Cache	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0101_0200/s0146_lru_cache/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#udemy-tree-stack-queue
Binary Tree Inorder Traversal	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0094_binary_tree_inorder_traversal/solution.ts
Binary Tree Level Order Traversal	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0101_0200/s0102_binary_tree_level_order_traversal/solution.ts
Diameter of Binary Tree	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0501_0600/s0543_diameter_of_binary_tree/solution.ts
Invert Binary Tree	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0201_0300/s0226_invert_binary_tree/solution.ts
Maximum Depth of Binary Tree	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0101_0200/s0104_maximum_depth_of_binary_tree/solution.ts
Binary Tree Maximum Path Sum	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0101_0200/s0124_binary_tree_maximum_path_sum/solution.ts
Validate Binary Search Tree	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0098_validate_binary_search_tree/solution.ts
Lowest Common Ancestor of a Binary Tree	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#udemy-trie-and-heap
Implement Trie (Prefix Tree)	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0201_0300/s0208_implement_trie_prefix_tree/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#udemy-graph
Number of Islands	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0101_0200/s0200_number_of_islands/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#udemy-dynamic-programming
Word Break	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0101_0200/s0139_word_break/solution.ts
Maximum Product Subarray	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0101_0200/s0152_maximum_product_subarray/solution.ts
House Robber	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0101_0200/s0198_house_robber/solution.ts
Climbing Stairs	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0070_climbing_stairs/solution.ts
Minimum Path Sum	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0064_minimum_path_sum/solution.ts
Longest Increasing Subsequence	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0201_0300/s0300_longest_increasing_subsequence/solution.ts
Longest Common Subsequence	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g1101_1200/s1143_longest_common_subsequence/solution.ts
Edit Distance	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0072_edit_distance/solution.ts
Regular Expression Matching	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0010_regular_expression_matching/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#udemy-backtrackingrecursion
Generate Parentheses	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0022_generate_parentheses/solution.ts
Combination Sum	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0039_combination_sum/solution.ts
Subsets	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0078_subsets/solution.ts
Letter Combinations of a Phone Number	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0017_letter_combinations_of_a_phone_number/solution.ts
Permutations	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0046_permutations/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#udemy-bit-manipulation
Counting Bits	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0301_0400/s0338_counting_bits/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#udemy-design
Min Stack	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0101_0200/s0155_min_stack/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#algorithms
Longest Common Subsequence	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g1101_1200/s1143_longest_common_subsequence/solution.ts
Partition Labels	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0701_0800/s0763_partition_labels/solution.ts
Daily Temperatures	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0701_0800/s0739_daily_temperatures/solution.ts
Palindromic Substrings	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0601_0700/s0647_palindromic_substrings/solution.ts
Subarray Sum Equals K	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0501_0600/s0560_subarray_sum_equals_k/solution.ts
Diameter of Binary Tree	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0501_0600/s0543_diameter_of_binary_tree/solution.ts
Target Sum	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0401_0500/s0494_target_sum/solution.ts
Find All Anagrams in a String	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0401_0500/s0438_find_all_anagrams_in_a_string/solution.ts
Path Sum III	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0401_0500/s0437_path_sum_iii/solution.ts
Partition Equal Subset Sum	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0401_0500/s0416_partition_equal_subset_sum/solution.ts
Decode String	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0301_0400/s0394_decode_string/solution.ts
Top K Frequent Elements	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0301_0400/s0347_top_k_frequent_elements/solution.ts
Counting Bits	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0301_0400/s0338_counting_bits/solution.ts
Coin Change	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0301_0400/s0322_coin_change/solution.ts
Longest Increasing Subsequence	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0201_0300/s0300_longest_increasing_subsequence/solution.ts
Find Median from Data Stream	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0201_0300/s0295_find_median_from_data_stream/solution.ts
Find the Duplicate Number	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0201_0300/s0287_find_the_duplicate_number/solution.ts
Move Zeroes	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0201_0300/s0283_move_zeroes/solution.ts
Search a 2D Matrix II	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0201_0300/s0240_search_a_2d_matrix_ii/solution.ts
Sliding Window Maximum	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0201_0300/s0239_sliding_window_maximum/solution.ts
Product of Array Except Self	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0201_0300/s0238_product_of_array_except_self/solution.ts
Lowest Common Ancestor of a Binary Tree	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/solution.ts
Palindrome Linked List	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0201_0300/s0234_palindrome_linked_list/solution.ts
Kth Smallest Element in a BST	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0201_0300/s0230_kth_smallest_element_in_a_bst/solution.ts
Invert Binary Tree	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0201_0300/s0226_invert_binary_tree/solution.ts
Maximal Square	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0201_0300/s0221_maximal_square/solution.ts
Kth Largest Element in an Array	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0201_0300/s0215_kth_largest_element_in_an_array/solution.ts
Implement Trie (Prefix Tree)	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0201_0300/s0208_implement_trie_prefix_tree/solution.ts
Course Schedule	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0201_0300/s0207_course_schedule/solution.ts
Reverse Linked List	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0201_0300/s0206_reverse_linked_list/solution.ts
Number of Islands	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0101_0200/s0200_number_of_islands/solution.ts
House Robber	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0101_0200/s0198_house_robber/solution.ts
Rotate Array	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0101_0200/s0189_rotate_array/solution.ts
Majority Element	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0101_0200/s0169_majority_element/solution.ts
Intersection of Two Linked Lists	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0101_0200/s0160_intersection_of_two_linked_lists/solution.ts
Min Stack	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0101_0200/s0155_min_stack/solution.ts
Find Minimum in Rotated Sorted Array	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/solution.ts
Maximum Product Subarray	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0101_0200/s0152_maximum_product_subarray/solution.ts
Sort List	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0101_0200/s0148_sort_list/solution.ts
LRU Cache	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0101_0200/s0146_lru_cache/solution.ts
Linked List Cycle II	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0101_0200/s0142_linked_list_cycle_ii/solution.ts
Linked List Cycle	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0101_0200/s0141_linked_list_cycle/solution.ts
Word Break	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0101_0200/s0139_word_break/solution.ts
Copy List with Random Pointer	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0101_0200/s0138_copy_list_with_random_pointer/solution.ts
Single Number	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0101_0200/s0136_single_number/solution.ts
Palindrome Partitioning	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0101_0200/s0131_palindrome_partitioning/solution.ts
Longest Consecutive Sequence	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0101_0200/s0128_longest_consecutive_sequence/solution.ts
Binary Tree Maximum Path Sum	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0101_0200/s0124_binary_tree_maximum_path_sum/solution.ts
Best Time to Buy and Sell Stock	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0101_0200/s0121_best_time_to_buy_and_sell_stock/solution.ts
Flatten Binary Tree to Linked List	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0101_0200/s0114_flatten_binary_tree_to_linked_list/solution.ts
Construct Binary Tree from Preorder and Inorder Traversal	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/solution.ts
Maximum Depth of Binary Tree	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0101_0200/s0104_maximum_depth_of_binary_tree/solution.ts
Binary Tree Level Order Traversal	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0101_0200/s0102_binary_tree_level_order_traversal/solution.ts
Symmetric Tree	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0101_0200/s0101_symmetric_tree/solution.ts
Validate Binary Search Tree	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0098_validate_binary_search_tree/solution.ts
Unique Binary Search Trees	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0096_unique_binary_search_trees/solution.ts
Binary Tree Inorder Traversal	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0094_binary_tree_inorder_traversal/solution.ts
Largest Rectangle in Histogram	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0084_largest_rectangle_in_histogram/solution.ts
Word Search	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0079_word_search/solution.ts
Subsets	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0078_subsets/solution.ts
Minimum Window Substring	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0076_minimum_window_substring/solution.ts
Sort Colors	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0075_sort_colors/solution.ts
Search a 2D Matrix	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0074_search_a_2d_matrix/solution.ts
Set Matrix Zeroes	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0073_set_matrix_zeroes/solution.ts
Edit Distance	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0072_edit_distance/solution.ts
Climbing Stairs	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0070_climbing_stairs/solution.ts
Minimum Path Sum	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0064_minimum_path_sum/solution.ts
Unique Paths	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0062_unique_paths/solution.ts
Merge Intervals	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0056_merge_intervals/solution.ts
Jump Game	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0055_jump_game/solution.ts
Maximum Subarray	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0053_maximum_subarray/solution.ts
N-Queens	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0051_n_queens/solution.ts
Group Anagrams	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0049_group_anagrams/solution.ts
Rotate Image	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0048_rotate_image/solution.ts
Permutations	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0046_permutations/solution.ts
Jump Game II	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0045_jump_game_ii/solution.ts
Trapping Rain Water	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0042_trapping_rain_water/solution.ts
First Missing Positive	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0041_first_missing_positive/solution.ts
Combination Sum	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0039_combination_sum/solution.ts
Search Insert Position	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0035_search_insert_position/solution.ts
Find First and Last Position of Element in Sorted Array	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/solution.ts
Search in Rotated Sorted Array	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0033_search_in_rotated_sorted_array/solution.ts
Longest Valid Parentheses	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0032_longest_valid_parentheses/solution.ts
Next Permutation	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0031_next_permutation/solution.ts
Reverse Nodes in k-Group	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0025_reverse_nodes_in_k_group/solution.ts
Swap Nodes in Pairs	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0024_swap_nodes_in_pairs/solution.ts
Merge k Sorted Lists	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0023_merge_k_sorted_lists/solution.ts
Generate Parentheses	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0022_generate_parentheses/solution.ts
Merge Two Sorted Lists	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0021_merge_two_sorted_lists/solution.ts
Valid Parentheses	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0020_valid_parentheses/solution.ts
Remove Nth Node From End of List	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0019_remove_nth_node_from_end_of_list/solution.ts
Letter Combinations of a Phone Number	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0017_letter_combinations_of_a_phone_number/solution.ts
3Sum	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0015_3sum/solution.ts
Container With Most Water	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0011_container_with_most_water/solution.ts
Regular Expression Matching	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0010_regular_expression_matching/solution.ts
Palindrome Number	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0009_palindrome_number/solution.ts
String to Integer (atoi)	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0008_string_to_integer_atoi/solution.ts
Reverse Integer	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0007_reverse_integer/solution.ts
Zigzag Conversion	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0006_zigzag_conversion/solution.ts
Longest Palindromic Substring	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0005_longest_palindromic_substring/solution.ts
Median of Two Sorted Arrays	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0004_median_of_two_sorted_arrays/solution.ts
Longest Substring Without Repeating Characters	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0003_longest_substring_without_repeating_characters/solution.ts
Add Two Numbers	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0002_add_two_numbers/solution.ts
Two Sum	https://github.com/web-jamil/LeetCode-in-TypeScript/blob/main/src/main/ts/g0001_0100/s0001_two_sum/solution.ts
	https://github.com/web-jamil/LeetCode-in-TypeScript#contributing
leetcode-in-typescript.github.io	https://leetcode-in-typescript.github.io
Readme	https://github.com/web-jamil/LeetCode-in-TypeScript#readme-ov-file
MIT license	https://github.com/web-jamil/LeetCode-in-TypeScript#MIT-1-ov-file
Please reload this page	https://github.com/web-jamil/LeetCode-in-TypeScript
Activity	https://github.com/web-jamil/LeetCode-in-TypeScript/activity
0 forks	https://github.com/web-jamil/LeetCode-in-TypeScript/forks
Report repository	https://github.com/contact/report-content?content_url=https%3A%2F%2Fgithub.com%2Fweb-jamil%2FLeetCode-in-TypeScript&report=web-jamil+%28user%29
Releases	https://github.com/web-jamil/LeetCode-in-TypeScript/releases
Packages 0	https://github.com/users/web-jamil/packages?repo_name=LeetCode-in-TypeScript
Please reload this page	https://github.com/web-jamil/LeetCode-in-TypeScript
Contributors	https://github.com/web-jamil/LeetCode-in-TypeScript/graphs/contributors
Please reload this page	https://github.com/web-jamil/LeetCode-in-TypeScript
	https://github.com
Terms	https://docs.github.com/site-policy/github-terms/github-terms-of-service
Privacy	https://docs.github.com/site-policy/privacy-policies/github-privacy-statement
Security	https://github.com/security
Status	https://www.githubstatus.com/
Community	https://github.community/
Docs	https://docs.github.com/
Contact	https://support.github.com?tags=dotcom-footer

Viewport: width=device-width

URLs of crawlers that visited me.