Skip to content
Algorithms in 60 Days
  • Curriculum
  • Interview Prep
  • Learn
    • Study Plans
    • Python Primer
    • Topics
    • Sorting Visualizer
    • Resources
  • Blog
  • Forum
  • About
Log In Sign Up
Profile
  • Home
  • Curriculum
  • Interview Prep
  • Learn
  • Study Plans
  • Python Primer
  • Topics
  • Sorting Visualizer
  • Resources
  • Blog
  • Forum
  • Dashboard
  • About
Log In Sign Up Profile

Navigation

  • Home
  • Curriculum
  • 60 Days Challenge
    • Day 1 Introduction to Algorithms
    • Day 2 Algorithmic Thinking and Pseudocode
    • Day 3 Introduction to Time Complexity
    • Day 4 Introduction to Arrays
    • Day 5 Multi-Dimensional Arrays and Sorting Algorithms
    • Day 6 Advanced Sorting Algorithms - Insertion Sort and Merge Sort
    • Day 7 Introduction to Linked Lists
    • Day 8 Singly Linked Lists - Implementation and Basic Operations
    • Day 9 Doubly Linked Lists - Implementation and Comparison
    • Day 10 Advanced Linked List Operations and Problems
    • Day 11 Introduction to Stacks
    • Day 12 Introduction to Queues
    • Day 13 Introduction to Trees
    • Day 14 Binary Trees
    • Day 15 Binary Search Trees
    • Day 16 Tree Traversals
    • Day 17 Heaps and Priority Queues
    • Day 18 Introduction to Graphs
    • Day 19 Graph Representations
    • Day 20 Graph Traversals - BFS and DFS
    • Day 21 Shortest Path Algorithms
    • Day 22 Minimum Spanning Trees
    • Day 23 Hash Tables
    • Day 24 Sets and Their Applications
    • Day 25 Binary Search and Its Variations
    • Day 26 Quicksort Algorithm
    • Day 27 Mergesort Algorithm
    • Day 28 Heapsort Algorithm
    • Day 29 Comparison of Sorting Algorithms
    • Day 30 Introduction to Dynamic Programming
    • Day 31 Fibonacci Sequence and Dynamic Programming
    • Day 32 Longest Common Subsequence
    • Day 33 The Knapsack Problem
    • Day 34 Matrix Chain Multiplication
    • Day 35 Longest Increasing Subsequence
    • Day 36 Edit Distance Problem
    • Day 37 Coin Change Problem
    • Day 38 Rod Cutting Problem
    • Day 39 Palindrome Partitioning
    • Day 40 Introduction to Greedy Algorithms
    • Day 41 Activity Selection Problem
    • 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 Introduction to Backtracking
    • 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 and Wrap-up
  • Interview Prep
  • Learn
    • Study Plans
    • Python Primer
    • Topics
    • Sorting Visualizer
    • Learning Resources
  • Blog
  • Forum
  • Dashboard
  • About
U

User

Loading...

Profile Information

Email Verification

Account Settings

Algorithms in 60 Days

Your structured path to coding excellence and interview success

Quick Links

  • Home
  • Curriculum
  • Dashboard
  • Blog
  • Forum

Resources

  • Start Learning
  • Interview Prep
  • Study Plans
  • Sorting Visualizers
  • Python Primer
  • Setup Guide
  • About Us

Stay Updated

Get the free 60-day algorithm study plan: one concept a day, in your inbox

Get the Study Plan →

© 2026 Algorithms in 60 Days. All rights reserved.

Privacy Policy Terms of Service Changelog Sitemap

Re-enter Password

For security reasons, please enter your password to continue.

Confirm Action