Skip to content

A collection of solutions to various LeetCode problems, implemented in Java. Each solution includes optimized algorithms, along with comments to explain the logic and approach. This repository is continually updated as I tackle more challenges and improve my skills in data structures and algorithms.

Notifications You must be signed in to change notification settings

DhanushEr/LeetCode

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

82 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

LeetCode

LeetCode Topics

Math

0069-sqrtx
0070-climbing-stairs
0268-missing-number
0367-valid-perfect-square
0633-sum-of-square-numbers

Dynamic Programming

0070-climbing-stairs

Memoization

0070-climbing-stairs

Stack

0094-binary-tree-inorder-traversal
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
2800-minimum-string-length-after-removing-substrings

Tree

0094-binary-tree-inorder-traversal
0098-validate-binary-search-tree
0100-same-tree
0101-symmetric-tree
0104-maximum-depth-of-binary-tree
0108-convert-sorted-array-to-binary-search-tree
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal

Depth-First Search

0094-binary-tree-inorder-traversal
0098-validate-binary-search-tree
0100-same-tree
0101-symmetric-tree
0104-maximum-depth-of-binary-tree
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal

Binary Tree

0094-binary-tree-inorder-traversal
0098-validate-binary-search-tree
0100-same-tree
0101-symmetric-tree
0104-maximum-depth-of-binary-tree
0108-convert-sorted-array-to-binary-search-tree
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal

Breadth-First Search

0100-same-tree
0101-symmetric-tree
0104-maximum-depth-of-binary-tree

Array

0108-convert-sorted-array-to-binary-search-tree
0136-single-number
0219-contains-duplicate-ii
0268-missing-number
0283-move-zeroes
1528-kids-with-the-greatest-number-of-candies

Divide and Conquer

0108-convert-sorted-array-to-binary-search-tree

Binary Search Tree

0069-sqrtx
0098-validate-binary-search-tree
0108-convert-sorted-array-to-binary-search-tree
0268-missing-number
0367-valid-perfect-square
0633-sum-of-square-numbers

Two Pointers

0283-move-zeroes
0633-sum-of-square-numbers

Hash Table

0219-contains-duplicate-ii
0268-missing-number

Sliding Window

0219-contains-duplicate-ii

Bit Manipulation

0136-single-number
0268-missing-number

Sorting

0268-missing-number

String

2800-minimum-string-length-after-removing-substrings
3312-number-of-changing-keys

Simulation

2800-minimum-string-length-after-removing-substrings

About

A collection of solutions to various LeetCode problems, implemented in Java. Each solution includes optimized algorithms, along with comments to explain the logic and approach. This repository is continually updated as I tackle more challenges and improve my skills in data structures and algorithms.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages