LeetCode

This repository contains solutions and problem descriptions for various LeetCode problems.

Repository Structure

Each problem is organized in its own directory with the following naming convention: [problem-number]-[problem-name-in-kebab-case]/

Each directory contains:

README.md: Standardized problem description with difficulty badge and link to original problem
Solution files in various programming languages

README Format Standard

All README.md files follow a consistent format with:

Problem title as a clickable link to LeetCode
Color-coded difficulty badge (🟢 Easy, 🟠 Medium, 🔴 Hard)
Clean HTML structure for optimal readability

For detailed information about the README structure standard, see README_STRUCTURE_STANDARD.md.

Recent Updates

✅ Standardized all 193 README files with consistent formatting
✅ Implemented color-coded difficulty badges
✅ Cleaned up HTML structure across all problem descriptions
✅ Documented the new standard format

Name		Name	Last commit message	Last commit date
Latest commit History 668 Commits
0005-longest-palindromic-substring		0005-longest-palindromic-substring
0007-reverse-integer		0007-reverse-integer
0011-container-with-most-water		0011-container-with-most-water
0035-search-insert-position		0035-search-insert-position
0049-group-anagrams		0049-group-anagrams
0104-maximum-depth-of-binary-tree		0104-maximum-depth-of-binary-tree
0110-balanced-binary-tree		0110-balanced-binary-tree
0111-minimum-depth-of-binary-tree		0111-minimum-depth-of-binary-tree
0136-single-number		0136-single-number
0144-binary-tree-preorder-traversal		0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal		0145-binary-tree-postorder-traversal
0171-excel-sheet-column-number		0171-excel-sheet-column-number
0175-combine-two-tables		0175-combine-two-tables
0176-second-highest-salary		0176-second-highest-salary
0177-nth-highest-salary		0177-nth-highest-salary
0178-rank-scores		0178-rank-scores
0180-consecutive-numbers		0180-consecutive-numbers
0181-employees-earning-more-than-their-managers		0181-employees-earning-more-than-their-managers
0182-duplicate-emails		0182-duplicate-emails
0183-customers-who-never-order		0183-customers-who-never-order
0184-department-highest-salary		0184-department-highest-salary
0185-department-top-three-salaries		0185-department-top-three-salaries
0197-rising-temperature		0197-rising-temperature
0226-invert-binary-tree		0226-invert-binary-tree
0257-binary-tree-paths		0257-binary-tree-paths
0258-add-digits		0258-add-digits
0283-move-zeroes		0283-move-zeroes
0389-find-the-difference		0389-find-the-difference
0401-binary-watch		0401-binary-watch
0404-sum-of-left-leaves		0404-sum-of-left-leaves
0511-game-play-analysis-i		0511-game-play-analysis-i
0530-minimum-absolute-difference-in-bst		0530-minimum-absolute-difference-in-bst
0543-diameter-of-binary-tree		0543-diameter-of-binary-tree
0559-maximum-depth-of-n-ary-tree		0559-maximum-depth-of-n-ary-tree
0563-binary-tree-tilt		0563-binary-tree-tilt
0566-reshape-the-matrix		0566-reshape-the-matrix
0575-distribute-candies		0575-distribute-candies
0586-customer-placing-the-largest-number-of-orders		0586-customer-placing-the-largest-number-of-orders
0589-n-ary-tree-preorder-traversal		0589-n-ary-tree-preorder-traversal
0590-n-ary-tree-postorder-traversal		0590-n-ary-tree-postorder-traversal
0596-classes-more-than-5-students		0596-classes-more-than-5-students
0601-human-traffic-of-stadium		0601-human-traffic-of-stadium
0606-construct-string-from-binary-tree		0606-construct-string-from-binary-tree
0607-sales-person		0607-sales-person
0617-merge-two-binary-trees		0617-merge-two-binary-trees
0620-not-boring-movies		0620-not-boring-movies
0626-exchange-seats		0626-exchange-seats
0628-maximum-product-of-three-numbers		0628-maximum-product-of-three-numbers
0637-average-of-levels-in-binary-tree		0637-average-of-levels-in-binary-tree
0643-maximum-average-subarray-i		0643-maximum-average-subarray-i
0645-set-mismatch		0645-set-mismatch
0657-robot-return-to-origin		0657-robot-return-to-origin
0671-second-minimum-node-in-a-binary-tree		0671-second-minimum-node-in-a-binary-tree
0674-longest-continuous-increasing-subsequence		0674-longest-continuous-increasing-subsequence
0700-search-in-a-binary-search-tree		0700-search-in-a-binary-search-tree
0709-to-lower-case		0709-to-lower-case
0783-minimum-distance-between-bst-nodes		0783-minimum-distance-between-bst-nodes
0872-leaf-similar-trees		0872-leaf-similar-trees
0884-uncommon-words-from-two-sentences		0884-uncommon-words-from-two-sentences
0888-fair-candy-swap		0888-fair-candy-swap
0897-increasing-order-search-tree		0897-increasing-order-search-tree
0938-range-sum-of-bst		0938-range-sum-of-bst
0953-verifying-an-alien-dictionary		0953-verifying-an-alien-dictionary
0965-univalued-binary-tree		0965-univalued-binary-tree
0993-cousins-in-binary-tree		0993-cousins-in-binary-tree
101-symmetric-tree		101-symmetric-tree
1019-squares-of-a-sorted-array		1019-squares-of-a-sorted-array
1022-sum-of-root-to-leaf-binary-numbers		1022-sum-of-root-to-leaf-binary-numbers
1047-remove-all-adjacent-duplicates-in-string		1047-remove-all-adjacent-duplicates-in-string
1050-actors-and-directors-who-cooperated-at-least-three-times		1050-actors-and-directors-who-cooperated-at-least-three-times
1084-sales-analysis-iii		1084-sales-analysis-iii
1137-height-checker		1137-height-checker
1141-user-activity-for-the-past-30-days-i		1141-user-activity-for-the-past-30-days-i
1148-article-views-i		1148-article-views-i
1153-product-sales-analysis-i		1153-product-sales-analysis-i
1158-market-analysis-i		1158-market-analysis-i
1161-project-employees-i		1161-project-employees-i
1168-duplicate-zeros		1168-duplicate-zeros
1179-reformat-department-table		1179-reformat-department-table
1195-distribute-candies-to-people		1195-distribute-candies-to-people
1256-rank-transform-of-an-array		1256-rank-transform-of-an-array
1267-remove-zero-sum-consecutive-nodes-from-linked-list		1267-remove-zero-sum-consecutive-nodes-from-linked-list
1274-number-of-days-between-two-dates		1274-number-of-days-between-two-dates
1278-product-price-at-a-given-date		1278-product-price-at-a-given-date
1295-find-numbers-with-even-number-of-digits		1295-find-numbers-with-even-number-of-digits
1299-replace-elements-with-greatest-element-on-right-side		1299-replace-elements-with-greatest-element-on-right-side
13-roman-to-integer		13-roman-to-integer
1309-decrypt-string-from-alphabet-to-integer-mapping		1309-decrypt-string-from-alphabet-to-integer-mapping
1313-decompress-run-length-encoded-list		1313-decompress-run-length-encoded-list
1379-find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree		1379-find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree
1393-capital-gain-loss		1393-capital-gain-loss
1407-top-travellers		1407-top-travellers
1462-list-the-products-ordered-in-a-period		1462-list-the-products-ordered-in-a-period
1472-increasing-decreasing-string		1472-increasing-decreasing-string
1482-how-many-numbers-are-smaller-than-the-current-number		1482-how-many-numbers-are-smaller-than-the-current-number
1486-find-the-distance-value-between-two-arrays		1486-find-the-distance-value-between-two-arrays
1490-generate-a-string-with-characters-that-have-odd-counts		1490-generate-a-string-with-characters-that-have-odd-counts
1507-reformat-date		1507-reformat-date
1509-replace-employee-id-with-the-unique-identifier		1509-replace-employee-id-with-the-unique-identifier
1510-find-lucky-integer-in-an-array		1510-find-lucky-integer-in-an-array

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Uh oh!

Repository files navigation

LeetCode

Repository Structure

README Format Standard

Recent Updates

About

Uh oh!

Releases

Packages

Contributors 2

Uh oh!

Languages

Aryan7Sharma/LeetCode

Folders and files

Latest commit

History

Repository files navigation

LeetCode

Repository Structure

README Format Standard

Recent Updates

About

Resources

Uh oh!

Stars

Watchers

Forks

Releases

Packages 0

Contributors 2

Uh oh!

Languages

Packages