NeetCode.io Logo
CoursesPracticeRoadmap
Pro

Menu

Coding Interviews
Problems
Company Tagged
Cheatsheets
Quizzes
System Design
Machine Learning NEW
Problems
Build Your GPT
Low Level Design
Databases

Algorithms & Data Structures for Beginners

Advanced Algorithms

Python for Coding Interviews

  • 📚 Core Skills
  • 🚀 NeetCode 150 
    🧠 Blind 75🚀 NeetCode 150🦄 NeetCode 250🌎 NeetCode All

  Implement common data structures and algorithms for coding interviews.

Easy0/4
Med0/12
Hard0/4
0/20Solved
  Algorithms   Data Structures

Implement Data Structures

Status
Problem
Difficulty
Design Dynamic Array (Resizable Array)   
Design Singly Linked List   
Design Double-ended Queue      
Design Binary Search Tree      
Design Hash Table      
Design Heap      
Design Graph      
Design Disjoint Set (Union-Find)      
Design Segment Tree      

Sorting

Status
Problem
Difficulty
Insertion Sort   
Merge Sort      
Quick Sort      

Graphs

Status
Problem
Difficulty
Matrix Depth-First Search      
Matrix Breadth-First Search      
Dijkstra's Algorithm   
Prim's Algorithm      
Kruskal's Algorithm      
Topological Sort      

Dynamic Programming

Status
Problem
Difficulty
0 / 1 Knapsack      
Unbounded Knapsack      
S
M
T
W
T
F
S

Links

  • Blind 75
  • NeetCode 150
  • NeetCode 250
  • How to use NeetCode Effectively

Social

  •  YouTube
  •  LinkedIn
  •  Twitter

Contact

  • support@neetcode.io

Legal

  • Privacy Policy
  • Terms of Service

Copyright © 2026 neetcode.io All rights reserved.