Leetcode-problems

LeetCode Topics

Array

Problem Name	Difficulty
0001-two-sum	Easy
0051-n-queens	Hard
0053-maximum-subarray	Medium
0121-best-time-to-buy-and-sell-stock	Easy
0217-contains-duplicate	Easy
0283-move-zeroes	Easy
0628-maximum-product-of-three-numbers	Easy
1472-design-browser-history	Medium
1700-number-of-students-unable-to-eat-lunch	Easy

Hash Table

Problem Name	Difficulty
0001-two-sum	Easy
0141-linked-list-cycle	Easy
0160-intersection-of-two-linked-lists	Easy
0217-contains-duplicate	Easy

Divide and Conquer

Problem Name	Difficulty
0023-merge-k-sorted-lists	Hard
0053-maximum-subarray	Medium

Dynamic Programming

Problem Name	Difficulty
0022-generate-parentheses	Medium
0053-maximum-subarray	Medium
0121-best-time-to-buy-and-sell-stock	Easy

Stack

Problem Name	Difficulty
0225-implement-stack-using-queues	Easy
0232-implement-queue-using-stacks	Easy
0234-palindrome-linked-list	Easy
1472-design-browser-history	Medium
1700-number-of-students-unable-to-eat-lunch	Easy

Design

Problem Name	Difficulty
0225-implement-stack-using-queues	Easy
0232-implement-queue-using-stacks	Easy
0707-design-linked-list	Medium
0933-number-of-recent-calls	Easy
1472-design-browser-history	Medium

Queue

Problem Name	Difficulty
0225-implement-stack-using-queues	Easy
0232-implement-queue-using-stacks	Easy
0933-number-of-recent-calls	Easy
1700-number-of-students-unable-to-eat-lunch	Easy

Linked List

Problem Name	Difficulty
0021-merge-two-sorted-lists	Easy
0023-merge-k-sorted-lists	Hard
0025-reverse-nodes-in-k-group	Hard
0061-rotate-list	Medium
0141-linked-list-cycle	Easy
0160-intersection-of-two-linked-lists	Easy
0206-reverse-linked-list	Easy
0234-palindrome-linked-list	Easy
0237-delete-node-in-a-linked-list	Medium
0328-odd-even-linked-list	Medium
0430-flatten-a-multilevel-doubly-linked-list	Medium
0707-design-linked-list	Medium
0876-middle-of-the-linked-list	Easy
1472-design-browser-history	Medium

Two Pointers

Problem Name	Difficulty
0061-rotate-list	Medium
0141-linked-list-cycle	Easy
0160-intersection-of-two-linked-lists	Easy
0234-palindrome-linked-list	Easy
0283-move-zeroes	Easy
0876-middle-of-the-linked-list	Easy

Recursion

Problem Name	Difficulty
0021-merge-two-sorted-lists	Easy
0025-reverse-nodes-in-k-group	Hard
0206-reverse-linked-list	Easy
0234-palindrome-linked-list	Easy

Doubly-Linked List

Problem Name	Difficulty
0430-flatten-a-multilevel-doubly-linked-list	Medium
1472-design-browser-history	Medium

Data Stream

Problem Name	Difficulty
0933-number-of-recent-calls	Easy
1472-design-browser-history	Medium

Heap (Priority Queue)

Problem Name	Difficulty
0023-merge-k-sorted-lists	Hard

Merge Sort

Problem Name	Difficulty
0023-merge-k-sorted-lists	Hard

Depth-First Search

Problem Name	Difficulty
0430-flatten-a-multilevel-doubly-linked-list	Medium

Math

Problem Name	Difficulty
0628-maximum-product-of-three-numbers	Easy

Sorting

Problem Name	Difficulty
0217-contains-duplicate	Easy
0628-maximum-product-of-three-numbers	Easy

Simulation

Problem Name	Difficulty
1700-number-of-students-unable-to-eat-lunch	Easy

Backtracking

Problem Name	Difficulty
0022-generate-parentheses	Medium
0051-n-queens	Hard

String

Problem Name	Difficulty
0022-generate-parentheses	Medium