Skip to content

deepakpathik/Leetcode_Questions

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

LeetCode Topics

Tree

0098-validate-binary-search-tree
0100-same-tree
0106-construct-binary-tree-from-inorder-and-postorder-traversal
0108-convert-sorted-array-to-binary-search-tree
0110-balanced-binary-tree
0112-path-sum
0114-flatten-binary-tree-to-linked-list
0116-populating-next-right-pointers-in-each-node
0124-binary-tree-maximum-path-sum

Depth-First Search

0098-validate-binary-search-tree
0100-same-tree
0110-balanced-binary-tree
0112-path-sum
0114-flatten-binary-tree-to-linked-list
0116-populating-next-right-pointers-in-each-node
0124-binary-tree-maximum-path-sum
0200-number-of-islands

Binary Search Tree

0098-validate-binary-search-tree
0108-convert-sorted-array-to-binary-search-tree
0300-longest-increasing-subsequence

Binary Tree

0098-validate-binary-search-tree
0100-same-tree
0106-construct-binary-tree-from-inorder-and-postorder-traversal
0108-convert-sorted-array-to-binary-search-tree
0110-balanced-binary-tree
0112-path-sum
0114-flatten-binary-tree-to-linked-list
0116-populating-next-right-pointers-in-each-node
0124-binary-tree-maximum-path-sum

Breadth-First Search

0100-same-tree
0112-path-sum
0116-populating-next-right-pointers-in-each-node
0200-number-of-islands
0322-coin-change

Array

0001-two-sum
0064-minimum-path-sum
0106-construct-binary-tree-from-inorder-and-postorder-traversal
0108-convert-sorted-array-to-binary-search-tree
0119-pascals-triangle-ii
0120-triangle
0121-best-time-to-buy-and-sell-stock
0200-number-of-islands
0300-longest-increasing-subsequence
0322-coin-change
1755-defuse-the-bomb

Hash Table

0001-two-sum
0106-construct-binary-tree-from-inorder-and-postorder-traversal

Divide and Conquer

0106-construct-binary-tree-from-inorder-and-postorder-traversal
0108-convert-sorted-array-to-binary-search-tree

Dynamic Programming

0064-minimum-path-sum
0119-pascals-triangle-ii
0120-triangle
0121-best-time-to-buy-and-sell-stock
0124-binary-tree-maximum-path-sum
0300-longest-increasing-subsequence
0322-coin-change

Matrix

0064-minimum-path-sum
0200-number-of-islands

Linked List

0114-flatten-binary-tree-to-linked-list
0116-populating-next-right-pointers-in-each-node

Stack

0114-flatten-binary-tree-to-linked-list

Two Pointers

0125-valid-palindrome

String

0125-valid-palindrome
1652-minimum-suffix-flips

Greedy

1652-minimum-suffix-flips

Sliding Window

1755-defuse-the-bomb

Union Find

0200-number-of-islands

About

A collection of LeetCode questions to ace the coding interview! - Created using [LeetHub v2](https://github.com/arunbhardwaj/LeetHub-2.0)

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published