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

LeetCode Topics

Array

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

Hash Table

0105-construct-binary-tree-from-preorder-and-inorder-traversal
0141-linked-list-cycle
0142-linked-list-cycle-ii

Divide and Conquer

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

Tree

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
0112-path-sum
0114-flatten-binary-tree-to-linked-list
0117-populating-next-right-pointers-in-each-node-ii
0124-binary-tree-maximum-path-sum
0129-sum-root-to-leaf-numbers
0199-binary-tree-right-side-view
0226-invert-binary-tree
1448-count-good-nodes-in-binary-tree

Binary Tree

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
0112-path-sum
0114-flatten-binary-tree-to-linked-list
0117-populating-next-right-pointers-in-each-node-ii
0124-binary-tree-maximum-path-sum
0129-sum-root-to-leaf-numbers
0199-binary-tree-right-side-view
0226-invert-binary-tree
1448-count-good-nodes-in-binary-tree

Depth-First Search

0101-symmetric-tree
0104-maximum-depth-of-binary-tree
0112-path-sum
0114-flatten-binary-tree-to-linked-list
0117-populating-next-right-pointers-in-each-node-ii
0124-binary-tree-maximum-path-sum
0129-sum-root-to-leaf-numbers
0199-binary-tree-right-side-view
0226-invert-binary-tree
1448-count-good-nodes-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
0112-path-sum
0117-populating-next-right-pointers-in-each-node-ii
0199-binary-tree-right-side-view
0226-invert-binary-tree
1448-count-good-nodes-in-binary-tree

Linked List

0019-remove-nth-node-from-end-of-list
0021-merge-two-sorted-lists
0025-reverse-nodes-in-k-group
0082-remove-duplicates-from-sorted-list-ii
0083-remove-duplicates-from-sorted-list
0092-reverse-linked-list-ii
0114-flatten-binary-tree-to-linked-list
0117-populating-next-right-pointers-in-each-node-ii
0141-linked-list-cycle
0142-linked-list-cycle-ii
0143-reorder-list
0206-reverse-linked-list
0234-palindrome-linked-list

Stack

0114-flatten-binary-tree-to-linked-list
0143-reorder-list
0234-palindrome-linked-list

Database

0584-find-customer-referee
0595-big-countries
1068-product-sales-analysis-i
1148-article-views-i
1378-replace-employee-id-with-the-unique-identifier
1683-invalid-tweets
1757-recyclable-and-low-fat-products

Dynamic Programming

0124-binary-tree-maximum-path-sum

Recursion

0021-merge-two-sorted-lists
0025-reverse-nodes-in-k-group
0143-reorder-list
0206-reverse-linked-list
0234-palindrome-linked-list

Two Pointers

0019-remove-nth-node-from-end-of-list
0082-remove-duplicates-from-sorted-list-ii
0141-linked-list-cycle
0142-linked-list-cycle-ii
0143-reorder-list
0234-palindrome-linked-list