10000 GitHub - ador-25/leetcode-solutions: Collection of LeetCode questions to ace the coding interview! - Created using [LeetHub](https://github.com/QasimWani/LeetHub)
[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to content

Collection of LeetCode questions to ace the coding interview! - Created using [LeetHub](https://github.com/QasimWani/LeetHub)

Notifications You must be signed in to change notification settings

ador-25/leetcode-solutions

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

leetcode-dsa-solutions-java

Collection of LeetCode questions to ace the coding interview! - Created using LeetHub

LeetCode Topics

Array

0001-two-sum
0027-remove-element
0121-best-time-to-buy-and-sell-stock
0169-majority-element
0217-contains-duplicate
0283-move-zeroes
0605-can-place-flowers
2058-concatenation-of-array
2350-find-closest-number-to-zero

Hash Table

0001-two-sum
0169-majority-element
0217-contains-duplicate
0242-valid-anagram
0383-ransom-note
0782-jewels-and-stones

Sorting

0169-majority-element
0217-contains-duplicate
0242-valid-anagram

Two Pointers

0027-remove-element
0283-move-zeroes
0344-reverse-string
0392-is-subsequence
1894-merge-strings-alternately

String

0014-longest-common-prefix
0058-length-of-last-word
0242-valid-anagram
0344-reverse-string
0383-ransom-note
0392-is-subsequence
0782-jewels-and-stones
1894-merge-strings-alternately

Dynamic Programming

0121-best-time-to-buy-and-sell-stock
0392-is-subsequence

Trie

0014-longest-common-prefix

Simulation

2058-concatenation-of-array

Divide and Conquer

0169-majority-element

Counting

0169-majority-element
0383-ransom-note

Greedy

0605-can-place-flowers

Stack

0094-binary-tree-inorder-traversal
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal

Tree

0094-binary-tree-inorder-traversal
0100-same-tree
0104-maximum-depth-of-binary-tree
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal

Depth-First Search

0094-binary-tree-inorder-traversal
0100-same-tree
0104-maximum-depth-of-binary-tree
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal

Binary Tree

0094-binary-tree-inorder-traversal
0100-same-tree
0104-maximum-depth-of-binary-tree
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal

Breadth-First Search

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

Linked List

0206-reverse-linked-list

Recursion

0206-reverse-linked-list

About

Collection of LeetCode questions to ace the coding interview! - Created using [LeetHub](https://github.com/QasimWani/LeetHub)

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published
0