newsolutionNOW/dsaNotes.html at main · venkatesh-window/newsolutionNOW · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
<!DOCTYPE html>
<html>
<head>
  <title>DATA STRUCTURES AND ALGORITHMS NOTES</title>
  <style>
    body {
      font-family: Arial, sans-serif;
      background-color: #000;
      margin: 20px;
      padding: 0;
      color: #eee;
    }

    h1 {
      text-align: center;
      color: #f8f8f8;
    }

    h2 {
      color: #ddd;
      border-bottom: 2px solid #333;
      padding-bottom: 5px;
    }

    h3 {
      margin-bottom: 5px;
      color: #fff;
    }

    ul {
      list-style: none;
      padding: 0;
    }

    li {
      background: #1a1a1a;
      border: 1px solid #333;
      border-radius: 6px;
      padding: 12px;
      margin-bottom: 12px;
    }

    footer {
      text-align: center;
      margin-top: 20px;
      color: #aaa;
      font-size: 14px;
    }
  </style>
</head>
<body>

  <h1>DATA STRUCTURES AND ALGORITHMS QUEST</h1>
  <p style="text-align:center; color:#bbb;">Master DSA step by step with fun quests.</p>

  <h2>Levels</h2>
  <ul>
    <li><h3>Step 1: Learn the Basics</h3>
    <a href="l1.html">Click Here for Detailed Notes and Leetcode Problems</a></li>
    <li><h3>Step 2: Learn Important Sorting Techniques</h3><a href="l2.html">Click Here for Detailed Notes and Leetcode Problems</a>
    </li>
    <li><h3>Step 3: Solve Problems on Arrays [Easy → Medium → Hard]</h3><a href="l3.html">Click Here for Detailed Notes and Leetcode Problems</a>
    </li>
    <li><h3>Step 4: Binary Search [1D, 2D Arrays, Search Space]</h3>
    <a href="l4.html">Click Here for Detailed Notes and Leetcode Problems</a></li>
    <li><h3>Step 5: Strings [Basic and Medium]</h3>
    <a href="l5.html">Click Here for Detailed Notes and Leetcode Problems</a></li>
    <li><h3>Step 6: Learn LinkedList [Single LL, Double LL, Medium, Hard Problems]</h3>
    <a href="l6.html">Click Here for Detailed Notes and Leetcode Problems</a></li>
    <li><h3>Step 7: Recursion [PatternWise]</h3>
    <a href="l7.html">Click Here for Detailed Notes and Leetcode Problems</a></li>
    <li><h3>Step 8: Bit Manipulation [Concepts & Problems]</h3>
    <a href="l8.html">Click Here for Detailed Notes and Leetcode Problems</a></li>
    <li><h3>Step 9: Stack and Queues [Learning, Pre-In-Post-fix, Monotonic Stack, Implementation]</h3>
    <a href="l9.html">Click Here for Detailed Notes and Leetcode Problems</a></li>
    <li><h3>Step 10: Sliding Window & Two Pointer Combined Problems</h3>
    <a href="l10.html">Click Here for Detailed Notes and Leetcode Problems</a></li>
    <li><h3>Step 11: Heaps [Learning, Medium, Hard Problems]</h3>
    <a href="l11.html">Click Here for Detailed Notes and Leetcode Problems</a></li>
    <li><h3>Step 12: Greedy Algorithms [Easy, Medium/Hard]</h3>
    <a href="l12.html">Click Here for Detailed Notes and Leetcode Problems</a></li>
    <li><h3>Step 13: Binary Trees [Traversals, Medium and Hard Problems]</h3>
    <a href="l13.html">Click Here for Detailed Notes and Leetcode Problems</a></li>
    <li><h3>Step 14: Binary Search Trees [Concept and Problems]</h3>
    <a href="l14.html">Click Here for Detailed Notes and Leetcode Problems</a></li>
    <li><h3>Step 15: Graphs [Concepts & Problems]</h3>
    <a href="l15.html">Click Here for Detailed Notes and Leetcode Problems</a></li>
    <li><h3>Step 16: Dynamic Programming [Patterns and Problems]</h3>
    <a href="l16.html">Click Here for Detailed Notes and Leetcode Problems</a></li>
    <li><h3>Step 17: Tries</h3>
    <a href="l17.html">Click Here for Detailed Notes and Leetcode Problems</a></li>
    <li><h3>Step 18: Strings</h3>
    <a href="l18.html">Click Here for Detailed Notes and Leetcode Problems</a></li>
  </ul>

  <footer>
    ⭐ Ready to become a DSA Master? ⭐
  </footer>

</body>
</html>