All Notes
Code

Code

⚠️
This section is still in development

This guide will help you navigate and make the best use of this website.

πŸ“š The Catalog

This section covers a wide range of Computer Science topics. Each topic includes theory and problems to help you understand and apply the concepts. Here are some of the topics we cover:

Arrays πŸ“Š
Arrays store items at contiguous memory locations.
Data Structure
 Linked List πŸ”—
Linked list is a linear data structure with separate objects.
Data Structure
 Greedy Algorithms πŸ“ˆ
Greedy algorithms make locally optimal choices for global optimum.
Algorithm
 Recursion πŸ”
Recursion solves a problem by solving smaller instances of it.
Algorithm
 Recursion and Backtracking βͺ
Backtracking solves problems by building a solution incrementally.
Algorithm
 Binary Search πŸ”
Binary search is a fast search algorithm with Ο(log n) complexity.
Algorithm
 Heap πŸ”οΈ
Heap is a Tree-based data structure for priority queues.
Data Structure
 Stack and Queue πŸ“š
Stack is LIFO and Queue is FIFO structure.
Data Structure
 String 🧡
A string is a sequence of characters.
Data Type
 Tree 🌳
A tree is a nonlinear data structure with a root node.
Data Structure
 Graph πŸ•ΈοΈ
A Graph is a non-linear data structure with nodes and edges.
Data Structure
 Dynamic Programming πŸ”„
Dynamic Programming optimizes over plain recursion.
Algorithm
 Trie πŸ“‘
Trie is an efficient information retrieval data structure.
Data Structure
 Number Theory πŸ”’
Number theory explores properties and relationships of numbers.
Mathematics
 Bit Manipulation βš™οΈ
Bit manipulation allows efficient processing of binary data.
Algorithm
 Combinatorics πŸ”’
Combinatorics studies ways to count, arrange, and structure objects.
Mathematics
 Advanced Mathematics πŸ“š
Higher-level mathematical concepts used in theoretical and applied sciences.
Mathematics
 Advanced Data Structures πŸ—οΈ
More complex data structures enabling efficient problem-solving.
Data Structure
 Graph Theory πŸ“Š
Graph theory analyzes relationships between nodes and edges.
Mathematics
 Geometry πŸ“
Geometry explores properties, shapes, and spaces in mathematics.
Mathematics
 Game Theory 🎲
Game theory studies strategic interactions between decision-makers.
Mathematics

🧭 How to Use This Website

Step 1 - Bookmarking πŸ“‘

Bookmark the pages you find most useful so you can easily return to them later.

Step 2 - Note-taking πŸ“

Take notes while you read. Writing things down helps reinforce what you’ve learned.

Step 3 - Practice πŸ’ͺ

Try solving problems after reading the theory. Applying concepts strengthens understanding.

Step 4 - Consistency πŸ—“οΈ

Make a schedule and stick to it. Consistent learning leads to better retention.

Step 5 - Sequential Learning 🎒

Start with the basics and gradually move to advanced topics to build a strong foundation.

Step 6 - Active Learning πŸ™‹β€β™€οΈ

Engage with the contentβ€”ask questions, discuss with peers, and explain concepts to others.

Step 7 - Revision πŸ”„

Regularly review the topics you’ve learned. Frequent revision improves long-term memory.

I hope you find my website helpful in your journey to learn Computer Science. Happy learning! πŸŽ“

RSS Feed
Last updated on