-
Notifications
You must be signed in to change notification settings - Fork 2
Expand file tree
/
Copy pathdsa.html
More file actions
374 lines (348 loc) · 17 KB
/
Copy pathdsa.html
File metadata and controls
374 lines (348 loc) · 17 KB
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
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
<!doctype html>
<html lang="en">
<head>
<meta charset="UTF-8" />
<link rel="icon" type="image/svg+xml" href="/vite.svg" />
<meta name="viewport" content="width=device-width, initial-scale=1.0" />
<title>DSA Hub | DSA Guide</title>
<link rel="stylesheet" href="https://cdnjs.cloudflare.com/ajax/libs/font-awesome/6.4.0/css/all.min.css" />
<link rel="stylesheet" href="https://cdnjs.cloudflare.com/ajax/libs/highlight.js/11.8.0/styles/atom-one-dark.min.css">
<script src="https://cdnjs.cloudflare.com/ajax/libs/highlight.js/11.8.0/highlight.min.js"></script>
<link rel="stylesheet" href="/style.css">
</head>
<body>
<header>
<div class="container">
<nav class="navbar">
<div class="logo">
<i class="fas fa-code"></i>
<span>DSA Hub</span>
</div>
<div class="nav-links">
<a href="index.html">Home</a>
<a href="projects.html">Projects</a>
<a href="dsa.html" class="active">DSA Guide</a>
<a href="index.html#contact">Contact</a>
</div>
<div class="nav-actions">
<button class="theme-toggle" aria-label="Toggle theme">
<i class="fas fa-moon"></i>
</button>
<button class="hamburger" aria-label="Toggle menu">
<i class="fas fa-bars"></i>
</button>
</div>
</nav>
</div>
</header>
<section class="page-header">
<div class="container">
<h1>DSA Learning Guide</h1>
<p>Master the fundamentals of data structures and algorithms</p>
<br>
<a href="https://github.com/OpenOct-Guild/DSA-Hub/tree/master/DSA" class="btn btn-outline dsa-details" data-id="arrays"><i class="fab fa-github"></i></a>
</div>
</section>
<section class="dsa-categories">
<div class="container">
<div class="category-tabs">
<button class="tab-btn active" data-category="all">All</button>
<button class="tab-btn" data-category="data-structures">Data Structures</button>
<button class="tab-btn" data-category="algorithms">Algorithms</button>
<button class="tab-btn" data-category="concepts">Core Concepts</button>
</div>
<div class="dsa-grid" id="dsa-grid">
<!-- Data Structures -->
<!-- -- Array --- -->
<div class="dsa-card" data-category="data-structures">
<div class="dsa-card-header">
<h3>Arrays</h3>
<span class="difficulty easy">Easy</span>
</div>
<div class="dsa-card-body">
<p>A collection of elements stored at contiguous memory locations.</p>
<ul class="dsa-features">
<li><i class="fas fa-check"></i> Fast access with index O(1)</li>
<li><i class="fas fa-check"></i> Contiguous memory allocation</li>
<li><i class="fas fa-times"></i> Fixed size (in some languages)</li>
<li><i class="fas fa-times"></i> Insertion/deletion is O(n)</li>
</ul>
</div>
<div class="dsa-card-footer">
<a href="https://github.com/OpenOct-Guild/DSA-Hub/tree/master/DSA" class="btn btn-outline dsa-details" data-id="arrays">Learn More</a>
</div>
</div>
<!-- -- Liked Lists --- -->
<div class="dsa-card" data-category="data-structures">
<div class="dsa-card-header">
<h3>Linked Lists</h3>
<span class="difficulty easy">Easy</span>
</div>
<div class="dsa-card-body">
<p>Linear data structure where elements are not stored at contiguous locations.</p>
<ul class="dsa-features">
<li><i class="fas fa-check"></i> Dynamic size</li>
<li><i class="fas fa-check"></i> Efficient insertions/deletions</li>
<li><i class="fas fa-times"></i> Random access is O(n)</li>
<li><i class="fas fa-times"></i> Extra memory for pointers</li>
</ul>
</div>
<div class="dsa-card-footer">
<a href="https://github.com/OpenOct-Guild/DSA-Hub/tree/master/DSA" class="btn btn-outline dsa-details" data-id="linked-lists">Learn More</a>
</div>
</div>
<!-- -- stack --- -->
<div class="dsa-card" data-category="data-structures">
<div class="dsa-card-header">
<h3>Stack</h3>
<span class="difficulty easy">Easy</span>
</div>
<div class="dsa-card-body">
<p>Linear data structure that follows LIFO (Last In, First Out) principle.</p>
<ul class="dsa-features">
<li><i class="fas fa-check"></i>Dynamic size (in linked list implementation)</li>
<li><i class="fas fa-check"></i>Efficient insertions/deletions (O(1))</li>
<li><i class="fas fa-check"></i>Random access is O(n)</li>
<li><i class="fas fa-check"></i>No extra memory required for pointers (in array implementation)</li>
</ul>
</div>
<div class="dsa-card-footer">
<a href="https://github.com/OpenOct-Guild/DSA-Hub/tree/master/DSA" class="btn btn-outline dsa-details" data-id="linked-lists">Learn More</a>
</div>
</div>
<!-- Queue -->
<div class="dsa-card" data-category="data-structures">
<div class="dsa-card-header">
<h3>Queue</h3>
<span class="difficulty easy">Easy</span>
</div>
<div class="dsa-card-body">
<p>Linear data structure that follows FIFO (First In, First Out) principle.</p>
<ul class="dsa-features">
<li><i class="fas fa-check"></i>Dynamic size (in linked list implementation)</li>
<li><i class="fas fa-check"></i>Efficient insertions/deletions (O(1))</li>
<li><i class="fas fa-check"></i>Random access is O(n)</li>
<li><i class="fas fa-check"></i>Extra memory for pointers (in linked list implementation)</li>
</ul>
</div>
<div class="dsa-card-footer">
<a href="https://github.com/OpenOct-Guild/DSA-Hub/tree/master/DSA" class="btn btn-outline dsa-details" data-id="linked-lists">Learn More</a>
</div>
</div>
<!-- Deque -->
<div class="dsa-card" data-category="data-structures">
<div class="dsa-card-header">
<h3>Deque</h3>
<span class="difficulty easy">Easy</span>
</div>
<div class="dsa-card-body">
<p>Double-ended queue where insertion and deletion can be performed from both ends.</p>
<ul class="dsa-features">
<li><i class="fas fa-check"></i>Dynamic size</li>
<li><i class="fas fa-check"></i>Efficient insertions/deletions (O(1) at both ends)</li>
<li><i class="fas fa-times"></i>Random access is O(n)</li>
<li><i class="fas fa-times"></i>Extra memory for pointers (in linked list implementation)</li>
</ul>
</div>
<div class="dsa-card-footer">
<a href="https://github.com/OpenOct-Guild/DSA-Hub/tree/master/DSA" class="btn btn-outline dsa-details" data-id="hash-tables">Learn More</a>
</div>
</div>
<!-- Heap -->
<div class="dsa-card" data-category="data-structures">
<div class="dsa-card-header">
<h3>Heap</h3>
<span class="difficulty easy">Easy</span>
</div>
<div class="dsa-card-body">
<p>Complete binary tree used for priority-based operations.</p>
<ul class="dsa-features">
<li><i class="fas fa-check"></i>Dynamic size</li>
<li><i class="fas fa-check"></i>Efficient insertions/deletions (O(log n))</li>
<li><i class="fas fa-times"></i>Random access is O(n)</li>
<li><i class="fas fa-times"></i>Extra memory for pointers (in linked list-based implementation)</li>
</ul>
</div>
<div class="dsa-card-footer">
<a href="https://github.com/OpenOct-Guild/DSA-Hub/tree/master/DSA" class="btn btn-outline dsa-details" data-id="hash-tables">Learn More</a>
</div>
</div>
<!-- --- Trees -->
<div class="dsa-card" data-category="data-structures">
<div class="dsa-card-header">
<h3>Trees</h3>
<span class="difficulty medium">Medium</span>
</div>
<div class="dsa-card-body">
<p>Hierarchical data structure with a root value and subtrees of children.</p>
<ul class="dsa-features">
<li><i class="fas fa-check"></i> Hierarchical representation</li>
<li><i class="fas fa-check"></i> Fast search, insert, delete (BST)</li>
<li><i class="fas fa-times"></i> Complex implementation</li>
<li><i class="fas fa-times"></i> Balancing required for performance</li>
</ul>
</div>
<div class="dsa-card-footer">
<a href="https://github.com/OpenOct-Guild/DSA-Hub/tree/master/DSA" class="btn btn-outline dsa-details" data-id="trees">Learn More</a>
</div>
</div>
<!-- Algorithms Grid -->
<div class="dsa-card" data-category="algorithms">
<div class="dsa-card-header">
<h3>Sorting Algorithms</h3>
<span class="difficulty medium">Medium</span>
</div>
<div class="dsa-card-body">
<p>Algorithms that arrange elements in a certain order.</p>
<ul class="dsa-features">
<li><i class="fas fa-check"></i> Bubble Sort - O(n²)</li>
<li><i class="fas fa-check"></i> Merge Sort - O(n log n)</li>
<li><i class="fas fa-check"></i> Quick Sort - O(n log n)</li>
<li><i class="fas fa-check"></i> Heap Sort - O(n log n)</li>
</ul>
</div>
<div class="dsa-card-footer">
<a href="https://github.com/OpenOct-Guild/DSA-Hub/tree/master/DSA" class="btn btn-outline dsa-details" data-id="sorting">Learn More</a>
</div>
</div>
<div class="dsa-card" data-category="algorithms">
<div class="dsa-card-header">
<h3>Search Algorithms</h3>
<span class="difficulty easy">Easy</span>
</div>
<div class="dsa-card-body">
<p>Algorithms for finding an item with specified properties in a collection.</p>
<ul class="dsa-features">
<li><i class="fas fa-check"></i> Linear Search - O(n)</li>
<li><i class="fas fa-check"></i> Binary Search - O(log n)</li>
<li><i class="fas fa-check"></i> Depth-First Search</li>
<li><i class="fas fa-check"></i> Breadth-First Search</li>
</ul>
</div>
<div class="dsa-card-footer">
<a href="https://github.com/OpenOct-Guild/DSA-Hub/tree/master/DSA" class="btn btn-outline dsa-details" data-id="searching">Learn More</a>
</div>
</div>
<div class="dsa-card" data-category="algorithms">
<div class="dsa-card-header">
<h3>Graph Algorithms</h3>
<span class="difficulty hard">Hard</span>
</div>
<div class="dsa-card-body">
<p>Algorithms that operate on graphs to solve problems like shortest path.</p>
<ul class="dsa-features">
<li><i class="fas fa-check"></i> Dijkstra's Algorithm</li>
<li><i class="fas fa-check"></i> Bellman-Ford Algorithm</li>
<li><i class="fas fa-check"></i> Kruskal's Algorithm</li>
<li><i class="fas fa-check"></i> Prim's Algorithm</li>
</ul>
</div>
<div class="dsa-card-footer">
<a href="https://github.com/OpenOct-Guild/DSA-Hub/tree/master/DSA" class="btn btn-outline dsa-details" data-id="graph-algorithms">Learn More</a>
</div>
</div>
<!-- Core Concepts -->
<div class="dsa-card" data-category="concepts">
<div class="dsa-card-header">
<h3>Big O Notation</h3>
<span class="difficulty easy">Easy</span>
</div>
<div class="dsa-card-body">
<p>Mathematical notation that describes the limiting behavior of a function.</p>
<ul class="dsa-features">
<li><i class="fas fa-check"></i> Time complexity analysis</li>
<li><i class="fas fa-check"></i> Space complexity analysis</li>
<li><i class="fas fa-check"></i> Algorithm comparison</li>
<li><i class="fas fa-check"></i> Performance prediction</li>
</ul>
</div>
<div class="dsa-card-footer">
<a href="https://github.com/OpenOct-Guild/DSA-Hub/tree/master/DSA" class="btn btn-outline dsa-details" data-id="big-o">Learn More</a>
</div>
</div>
<div class="dsa-card" data-category="concepts">
<div class="dsa-card-header">
<h3>Recursion</h3>
<span class="difficulty medium">Medium</span>
</div>
<div class="dsa-card-body">
<p>A method where the solution depends on solutions to smaller instances of the same problem.</p>
<ul class="dsa-features">
<li><i class="fas fa-check"></i> Elegant solutions</li>
<li><i class="fas fa-check"></i> Divide and conquer approach</li>
<li><i class="fas fa-times"></i> Stack overflow risk</li>
<li><i class="fas fa-times"></i> Memory intensive</li>
</ul>
</div>
<div class="dsa-card-footer">
<a href="https://github.com/OpenOct-Guild/DSA-Hub/tree/master/DSA" class="btn btn-outline dsa-details" data-id="recursion">Learn More</a>
</div>
</div>
</div>
</div>
</section>
<!-- ---- -->
<section class="learning-path">
<div class="container">
<h2 class="section-title">Learning Path</h2>
<div class="timeline">
<div class="timeline-item">
<div class="timeline-dot"></div>
<div class="timeline-content">
<h3>Step 1: Fundamentals</h3>
<p>Learn basic data structures like arrays, linked lists, and stacks. Understand time and space complexity analysis.</p>
</div>
</div>
<div class="timeline-item">
<div class="timeline-dot"></div>
<div class="timeline-content">
<h3>Step 2: Intermediate Concepts</h3>
<p>Master trees, hash tables, and basic algorithms like sorting and searching.</p>
</div>
</div>
<div class="timeline-item">
<div class="timeline-dot"></div>
<div class="timeline-content">
<h3>Step 3: Advanced Topics</h3>
<p>Dive into graphs, dynamic programming, and advanced algorithm design techniques.</p>
</div>
</div>
<div class="timeline-item">
<div class="timeline-dot"></div>
<div class="timeline-content">
<h3>Step 4: Practice & Application</h3>
<p>Solve problems on platforms like LeetCode, HackerRank, and apply concepts to real-world projects.</p>
</div>
</div>
</div>
</div>
</section>
<footer>
<div class="container">
<div class="footer-content">
<p>© 2025 DSA Hub. All rights reserved.</p>
<div class="social-links">
<a href="https://github.com/OpenOct-Guild/DSA-Hub" target="_blank" aria-label="GitHub"><i class="fab fa-github"></i></a>
<a href="https://twitter.com" target="_blank" aria-label="Twitter"><i class="fab fa-twitter"></i></a>
<a href="https://linkedin.com" target="_blank" aria-label="LinkedIn"><i class="fab fa-linkedin"></i></a>
</div>
</div>
</div>
</footer>
<div class="modal-overlay" id="dsa-modal-overlay">
<div class="modal">
<div class="modal-header">
<h3 class="modal-title" id="dsa-modal-title">DSA Topic</h3>
<button class="modal-close" id="dsa-modal-close" aria-label="Close modal">×</button>
</div>
<div class="modal-body" id="dsa-modal-body">
<!-- Modal content will be rendered here -->
</div>
<div class="modal-footer">
<button class="btn btn-primary" id="dsa-modal-close-btn">Close</button>
</div>
</div>
</div>
<script type="module" src="/dsa.js"></script>
</body>
</html>