https://leetcode.com/problems/first-missing-positive/submissions/1788581429/

LeetCode-Practise-Problems

A collection of LeetCode questions to ace the coding interview! - Created using LeetHub v2

LeetCode Topics

Array

0001-two-sum
0011-container-with-most-water
0033-search-in-rotated-sorted-array
0034-find-first-and-last-position-of-element-in-sorted-array
0037-sudoku-solver
0041-first-missing-positive
0051-n-queens
0074-search-a-2d-matrix
0078-subsets
0105-construct-binary-tree-from-preorder-and-inorder-traversal
0162-find-peak-element
0268-missing-number
0287-find-the-duplicate-number
0303-range-sum-query-immutable
0442-find-all-duplicates-in-an-array
0448-find-all-numbers-disappeared-in-an-array
0645-set-mismatch
0745-find-smallest-letter-greater-than-target
0882-peak-index-in-a-mountain-array

Binary Search

0033-search-in-rotated-sorted-array
0034-find-first-and-last-position-of-element-in-sorted-array
0074-search-a-2d-matrix
0162-find-peak-element
0268-missing-number
0287-find-the-duplicate-number
0745-find-smallest-letter-greater-than-target
0882-peak-index-in-a-mountain-array

Hash Table

0001-two-sum
0017-letter-combinations-of-a-phone-number
0037-sudoku-solver
0041-first-missing-positive
0105-construct-binary-tree-from-preorder-and-inorder-traversal
0141-linked-list-cycle
0142-linked-list-cycle-ii
0268-missing-number
0442-find-all-duplicates-in-an-array
0448-find-all-numbers-disappeared-in-an-array
0645-set-mismatch

Two Pointers

0011-container-with-most-water
0141-linked-list-cycle
0142-linked-list-cycle-ii
0151-reverse-words-in-a-string
0287-find-the-duplicate-number
0345-reverse-vowels-of-a-string
0392-is-subsequence
0443-string-compression
0908-middle-of-the-linked-list

Greedy

0011-container-with-most-water
0957-minimum-add-to-make-parentheses-valid

String

0017-letter-combinations-of-a-phone-number
0020-valid-parentheses
0022-generate-parentheses
0151-reverse-words-in-a-string
0257-binary-tree-paths
0345-reverse-vowels-of-a-string
0392-is-subsequence
0443-string-compression
0957-minimum-add-to-make-parentheses-valid

Math

0009-palindrome-number
0268-missing-number
1013-fibonacci-number

Bit Manipulation

0078-subsets
0268-missing-number
0287-find-the-duplicate-number
0645-set-mismatch

Sorting

0268-missing-number
0645-set-mismatch

Dynamic Programming

0022-generate-parentheses
0392-is-subsequence
1013-fibonacci-number

Recursion

0021-merge-two-sorted-lists
1013-fibonacci-number

Memoization

1013-fibonacci-number

Backtracking

0017-letter-combinations-of-a-phone-number
0022-generate-parentheses
0037-sudoku-solver
0051-n-queens
0078-subsets
0113-path-sum-ii
0257-binary-tree-paths

Matrix

0037-sudoku-solver
0074-search-a-2d-matrix

Linked List

0021-merge-two-sorted-lists
0083-remove-duplicates-from-sorted-list
0114-flatten-binary-tree-to-linked-list
0116-populating-next-right-pointers-in-each-node
0141-linked-list-cycle
0142-linked-list-cycle-ii
0908-middle-of-the-linked-list

Stack

0020-valid-parentheses
0094-binary-tree-inorder-traversal
0114-flatten-binary-tree-to-linked-list
0155-min-stack
0232-implement-queue-using-stacks
0957-minimum-add-to-make-parentheses-valid

Design

0155-min-stack
0232-implement-queue-using-stacks
0303-range-sum-query-immutable

Queue

0232-implement-queue-using-stacks

Prefix Sum

0303-range-sum-query-immutable

Tree

0094-binary-tree-inorder-traversal
0101-symmetric-tree
0102-binary-tree-level-order-traversal
0103-binary-tree-zigzag-level-order-traversal
0104-maximum-depth-of-binary-tree
0105-construct-binary-tree-from-preorder-and-inorder-traversal
0107-binary-tree-level-order-traversal-ii
0112-path-sum
0113-path-sum-ii
0114-flatten-binary-tree-to-linked-list
0116-populating-next-right-pointers-in-each-node
0129-sum-root-to-leaf-numbers
0199-binary-tree-right-side-view
0226-invert-binary-tree
0230-kth-smallest-element-in-a-bst
0236-lowest-common-ancestor-of-a-binary-tree
0257-binary-tree-paths
0543-diameter-of-binary-tree
0637-average-of-levels-in-binary-tree
1035-cousins-in-binary-tree

Breadth-First Search

0101-symmetric-tree
0102-binary-tree-level-order-traversal
0103-binary-tree-zigzag-level-order-traversal
0104-maximum-depth-of-binary-tree
0107-binary-tree-level-order-traversal-ii
0112-path-sum
0116-populating-next-right-pointers-in-each-node
0199-binary-tree-right-side-view
0226-invert-binary-tree
0637-average-of-levels-in-binary-tree
1035-cousins-in-binary-tree

Binary Tree

0094-binary-tree-inorder-traversal
0101-symmetric-tree
0102-binary-tree-level-order-traversal
0103-binary-tree-zigzag-level-order-traversal
0104-maximum-depth-of-binary-tree
0105-construct-binary-tree-from-preorder-and-inorder-traversal
0107-binary-tree-level-order-traversal-ii
0112-path-sum
0113-path-sum-ii
0114-flatten-binary-tree-to-linked-list
0116-populating-next-right-pointers-in-each-node
0129-sum-root-to-leaf-numbers
0199-binary-tree-right-side-view
0226-invert-binary-tree
0230-kth-smallest-element-in-a-bst
0236-lowest-common-ancestor-of-a-binary-tree
0257-binary-tree-paths
0543-diameter-of-binary-tree
0637-average-of-levels-in-binary-tree
1035-cousins-in-binary-tree

Depth-First Search

0094-binary-tree-inorder-traversal
0101-symmetric-tree
0104-maximum-depth-of-binary-tree
0112-path-sum
0113-path-sum-ii
0114-flatten-binary-tree-to-linked-list
0116-populating-next-right-pointers-in-each-node
0129-sum-root-to-leaf-numbers
0199-binary-tree-right-side-view
0226-invert-binary-tree
0230-kth-smallest-element-in-a-bst
0236-lowest-common-ancestor-of-a-binary-tree
0257-binary-tree-paths
0543-diameter-of-binary-tree
0637-average-of-levels-in-binary-tree
1035-cousins-in-binary-tree

Binary Search Tree

0230-kth-smallest-element-in-a-bst

Divide and Conquer

0105-construct-binary-tree-from-preorder-and-inorder-traversal