hacktoberfest-accepted

Follow the simple method to make contribution on an even better solution (any language is welcomed)

• Have an Algorithm or Data Structure ?
• Clone the forked repository
• Create a branch
• In the folder /Solutions
• Have an Algorithm or Data Structure ?
  • find your language folder/ create a new one if not found.
  • create a new file with the format {solution-title}-{githubusername}
  • e.g even_no_digit-caesarsage.py
  • comment your thought/algorithmic process and complexity
• Add, Commit and Push
  • commit with a descriptive name
• Create a PR
• Await Review

100DaysOfDSA

• 100DaysOfDSA FROM Destiny Erhabor
  • Blind 75 leetcode problems
  • Contributing
  • Progress
    • How to learn DSA
    • Array Data Structure
    • Big O in Everyday Code
    • More on Array
    • Stack and Queues
    • Hash Tables
    • Trees
    • Tries
    • Graphs
    • Heaps
    • Sorting and Searching
    • Greedy Algorithm
    • DP
    • Divide and Conquer
    • Recursion
    • ODD
    • Design System
    • Concurrency
    • MORE QUESTIONS

This repository is used to document the journey on getting a better foundational knowledge of Data Structure and Algorithm, alongside solving problems.

The reason for documenting these days is so that others can take something from it and also hopefully enhance the resources and also improve oneself.

The goal is to take 100 days, 2 hour a day, to tackle over 20 areas of DSA to a foundational knowledge.

This will not cover all things DSA but it will cover the areas that I feel will benefit my learning and understanding overall.

Blind 75 leetcode problems

https://leetcode.com/discuss/general-discussion/460599/blind-75-leetcode-questions

Contributing

• [✔️] ♾️ 1 > How to contribute for a better solution

Progress

• [✔️] ♾️ 1 > Introduction

How to learn DSA

• [✔️] ♾️ 2 > What to do when learning DSA
• [✔️] ♾️ 3 > Choosing a language and platform for solving daily questions

Array Data Structure

• [✔️] ♾️ 4 > Array - 01
• [✔️] ♾️ 5 > Array -02
• [✔️] ♾️ 6 > Array -03
• [✔️] ♾️ 7 > Array - 04
• [✔️] ♾️ 8 > Array - 05
• [✔️] ♾️ 9 > Array - 06

Big O in Everyday Code

• [✔️] > Big O

More on Array

• [] ♾️ 11 >
• [] ♾️ 12 >
• [] ♾️ 13 >
• [] ♾️ 14 >
• [] ♾️ 15 >
• [] ♾️ 16 >
• [] ♾️ 17>

Stack and Queues

• [] ♾️ 18 >
• [] ♾️ 19 >
• [] ♾️ 20 >
• [] ♾️ 21 >
• [] ♾️ 22 >
• [] ♾️ 23 >
• [] ♾️ 24 >

Hash Tables

• [] ♾️ 25 >
• [] ♾️ 26 >
• [] ♾️ 27 >
• [] ♾️ 28 >
• [] ♾️ 29 >
• [] ♾️ 30 >
• [] ♾️ 32 >

Trees

• [] ♾️ 34 >
• [] ♾️ 35 >
• [] ♾️ 36 >
• [] ♾️ 37 >
• [] ♾️ 38 >
• [] ♾️ 38 >
• [] ♾️ 39 >

Tries

• [] ♾️ 40 >
• [] ♾️ 41 >
• [] ♾️ 42 >
• [] ♾️ 43 >
• [] ♾️ 44 >
• [] ♾️ 45 >
• [] ♾️ 46 >

Graphs

• [] ♾️ 47 >
• [] ♾️ 48 >
• [] ♾️ 49 >
• [] ♾️ 50 >
• [] ♾️ 51 >
• [] ♾️ 52 >
• [] ♾️ 53 >

Heaps

• [] ♾️ 5 >
• [] ♾️ 26 >
• [] ♾️ 27 >
• [] ♾️ 28 >
• [] ♾️ 29 >
• [] ♾️ 30 >
• [] ♾️ 32 >

Sorting and Searching

• [] ♾️ 33 >
• [] ♾️ 34 >
• [] ♾️ 35 >
• [] ♾️ 36 >
• [] ♾️ 37 >
• [] ♾️ 38 >
• [] ♾️ 39 >

Greedy Algorithm

• [] ♾️ 40 >
• [] ♾️ 41 >
• [] ♾️ 42 >
• [] ♾️ 43 >
• [] ♾️ 44 >
• [] ♾️ 45 >
• [] ♾️ 46 >

DP

• [] ♾️ 47 >
• [] ♾️ 48 >
• [] ♾️ 49 >
• [] ♾️ 50 >
• [] ♾️ 51 >
• [] ♾️ 52 >
• [] ♾️ 53 >

Divide and Conquer

• [] ♾️ 54 >
• [] ♾️ 55 >
• [] ♾️ 56 >
• [] ♾️ 57 >
• [] ♾️ 58 >
• [] ♾️ 59 >
• [] ♾️ 60 >
• [] ♾️ 61 >
• [] ♾️ 62 >
• [] ♾️ 63 >
• [] ♾️ 64 >
• [] ♾️ 65 >
• [] ♾️ 66 >
• [] ♾️ 67 >

Recursion

• [] ♾️ 68 >
• [] ♾️ 69 >
• [] ♾️ 70 >
• [] ♾️ 71 >
• [] ♾️ 72 >
• [] ♾️ 73 >
• [] ♾️ 74 >

ODD

• [] ♾️ 75 >
• [] ♾️ 76 >
• [] ♾️ 77 >
• [] ♾️ 78 >
• [] ♾️ 79 >
• [] ♾️ 80 >
• [] ♾️ 81 >

Design System

• [] ♾️ 82 >
• [] ♾️ 83 >
• [] ♾️ 84 >
• [] ♾️ 85 >
• [] ♾️ 86 >
• [] ♾️ 87 >
• [] ♾️ 88 >

Concurrency

• [] ♾️ 89 >
• [] ♾️ 90 >
• [] ♾️ 91 >
• [] ♾️ 92 >
• [] ♾️ 93 >
• [] ♾️ 94 >
• [] ♾️ 95 >

MORE QUESTIONS

• [] ♾️ 96 >
• [] ♾️ 97 >
• [] ♾️ 98 >
• [] ♾️ 99 >
• [] ♾️ 100 >
• [] ♾️ 101 >
• [] ♾️ 102 >