TOPICS

Below is the classification of problems based on topics, useful while cementing any particular data structure, algorithm or topic.

Array

• 1. Two Sum
• 135. Candy
• 2226. Maximum Candies Allocated to K Children
• 407. Trapping Rain Water II
• 42. Trapping Rain Water
• 746. Min Cost Climbing Stairs

Binary Search

• 2226. Maximum Candies Allocated to K Children
• 374. Guess Number Higher or Lower

Binary Search Tree

• 703. Kth Largest Element in a Stream

Binary Tree

• 703. Kth Largest Element in a Stream

Breadth-First Search

• 407. Trapping Rain Water II

Data Stream

• 703. Kth Largest Element in a Stream

Design

• 703. Kth Largest Element in a Stream

Dynamic Programming

• 42. Trapping Rain Water
• 746. Min Cost Climbing Stairs

Greedy

• 135. Candy

Grind 169

• 1. Two Sum
• 2226. Maximum Candies Allocated to K Children

Hash Table

• 1. Two Sum

Heap (Priority Queue)

• 407. Trapping Rain Water II
• 703. Kth Largest Element in a Stream

Interactive

• 374. Guess Number Higher or Lower

LP

• 3. Composing flight crews

Linked List

• 19. Remove Nth Node From End of List
• 2. Add Two Numbers

MIP

• 1. Mixed Integer Programming
• 3. Composing flight crews

Math

• 2. Add Two Numbers

Matrix

• 407. Trapping Rain Water II

Monotonic Stack

• 42. Trapping Rain Water

Recursion

• 2. Add Two Numbers

Stack

• 20. Valid Parentheses
• 42. Trapping Rain Water

String

• 20. Valid Parentheses

Tree

• 703. Kth Largest Element in a Stream

Two Pointers

• 19. Remove Nth Node From End of List
• 42. Trapping Rain Water