Skip to content

Latest commit

 

History

History
218 lines (172 loc) · 15.8 KB

README.md

File metadata and controls

218 lines (172 loc) · 15.8 KB

Algorithms & Data Structures

Data Structures

Introduction

Big-O notation and design

Data Structures

Stack

Queues

Linked Lists

Trees

Graphs

Algorithms

Coding Interviews

Build the the foundation by learning the fundamental algorithms and data structures:

  • Fundamental Algorithms
    • Sorting: merge, quick, bucket, heap, counting
    • Searching: Binary Search, Depth First Search, Breadth First Search
    • Dynamic Programming
    • String / Array: reverse
    • Linked list: insertion, deletion
  • Fundamental Data Structures
  • Complexity
    • Space complexity for all algorithms / data structures
    • Runtime complexity for all algorithms / data structures
    • Make comparisons between algorithms and data structures

Preparation

Big O Notation

System Design

Interview

Platforms to learn

Competitive Programming

Computer Science

Computing

Theory

Courses

License

MIT © TK