Algorithms in 60 Days
Home
Dashboard
Blog
Forum
About
Log In
Sign Up
U
Profile
Log Out
HOME
DASHBOARD
BLOG
FORUM
ABOUT
CHALLENGES
Day 1: Introduction
Day 2: Algorithmic Thinking and Pseudocode
Day 3: Introduction to Time Complexity
Day 4: Introduction to Arrays
Day 5: Multi-dimensional Arrays and Sorting
Day 6: Advanced Sorting (Insertion & Merge)
Day 7: Introduction to Linked Lists
Day 8: Singly Linked Lists
Day 9: Doubly Linked Lists
Day 10: Advanced Linked List Operations
Day 11: Stacks
Day 12: Queues
Day 13: Trees Introduction
Day 14: Binary Trees
Day 15: Binary Search Trees
Day 16: Tree Traversals
Day 17: Heaps
Day 18: Graphs Introduction
Day 19: Graph Representations
Day 20: Graph Traversals
Day 21: Shortest Path Algorithms
Day 22: Minimum Spanning Trees
Day 23: Hash Tables
Day 24: Sets
Day 25: Binary Search
Day 26: Quicksort
Day 27: Mergesort
Day 28: Heapsort
Day 29: Sorting Algorithm Comparison
Day 30: Dynamic Programming Introduction
Day 31: Fibonacci and DP
Day 32: Longest Common Subsequence
Day 33: Knapsack Problem
Day 34: Matrix Chain Multiplication
Day 35: Longest Increasing Subsequence
Day 36: Edit Distance
Day 37: Coin Change Problem
Day 38: Rod Cutting
Day 39: Palindrome Partitioning
Day 40: Greedy Algorithms Introduction
Day 41: Activity Selection
Day 42: Huffman Coding
Day 43: Dijkstra's Algorithm
Day 44: Prim's Algorithm
Day 45: Kruskal's Algorithm
Day 46: Floyd-Warshall Algorithm
Day 47: Bellman-Ford Algorithm
Day 48: Backtracking Introduction
Day 49: N-Queens Problem
Day 50: Sudoku Solver
Day 51: Hamiltonian Cycle
Day 52: Graph Coloring
Day 53: Bit Manipulation Techniques
Day 54: Power Set
Day 55: Counting Bits
Day 56: String Algorithms (KMP)
Day 57: Rabin-Karp Algorithm
Day 58: Tries
Day 59: Advanced Tree Structures
Day 60: Competitive Programming Techniques
Log In
Sign Up
Profile
Log Out
Resources
#
Re-enter Password
For security reasons, please enter your password to continue.
Cancel
Confirm
Confirm Action
Cancel
Confirm