• algorithms 27
• backtracking 1
• bfs 1
• big-o 1
• bit-manipulation 1
• bst 1
• canada 1
• data-structures 4
• dfs 1
• divide-and-conquer 2
• dynamic-programming 2
• graphs 4
• greedy 1
• hashing 1
• heaps 1
• heuristic 1
• investing 1
• java 31
• java11 5
• java17 6
• java21 9
• java25 5
• java8 6
• linked-lists 1
• literature 2
• memoization 1
• pathfinding 1
• personal-finances 1
• programming 58
• punjabi 2
• queues 1
• recursion 1
• searching 1
• shortest-path 1
• sliding-window 1
• sorting 5
• stacks 1
• strings 1
• tabulation 1
• tax-saving 1
• tfsa 1
• trees 3
• trie 1
• two-pointer 1

algorithms

• Tries (Prefix Trees)
• A* Search Algorithm
• Bit Manipulation
• Recursion Patterns — Base Cases & Unwinding
• Backtracking
• Greedy Algorithms
• Dynamic Programming — Tabulation
• Dynamic Programming — Memoization
• Dijkstra's Shortest Path
• Depth-First Search (DFS) & Applications
• Graph Representation & BFS
• Heaps & Priority Queues
• Binary Search Trees (BST)
• Binary Trees — Traversals & Operations
• Linked Lists — Singly, Doubly & Circular
• Hash Tables & Hashing
• Stacks & Queues — Core Operations
• Sliding Window Technique
• Two Pointer Technique
• Linear Search & Binary Search
• Counting Sort, Radix Sort & Bucket Sort
• Quick Sort — The Versatile Performer
• Merge Sort — Divide and Conquer
• Selection Sort & Insertion Sort
• Bubble Sort — The Simplest Sort
• Introduction to Algorithms & Big-O Notation
• Algorithms & Data Structures — Complete Guide

backtracking

• Backtracking

bfs

• Graph Representation & BFS

big-o

• Introduction to Algorithms & Big-O Notation

bit-manipulation

• Bit Manipulation

bst

• Binary Search Trees (BST)

canada

• The Ultimate Guide to Canadian TFSA: Limits, Rules, and Strategies for 2026

data-structures

• Heaps & Priority Queues
• Linked Lists — Singly, Doubly & Circular
• Hash Tables & Hashing
• Stacks & Queues — Core Operations

dfs

• Depth-First Search (DFS) & Applications

divide-and-conquer

• Quick Sort — The Versatile Performer
• Merge Sort — Divide and Conquer

dynamic-programming

• Dynamic Programming — Tabulation
• Dynamic Programming — Memoization

graphs

• A* Search Algorithm
• Dijkstra's Shortest Path
• Depth-First Search (DFS) & Applications
• Graph Representation & BFS

greedy

• Greedy Algorithms

hashing

• Hash Tables & Hashing

heaps

• Heaps & Priority Queues

heuristic

• A* Search Algorithm

investing

• The Ultimate Guide to Canadian TFSA: Limits, Rules, and Strategies for 2026

java

• The New Date/Time API (Java 8)
• The Optional API (Java 8)
• The Streams API (Java 8)
• Functional Interfaces & Default Methods (Java 8)
• Lambda Expressions (Java 8)
• Java 8 Features
• Predicate::not and More Enhancements (Java 11)
• Local-Variable Syntax for Lambda Parameters (Java 11)
• String & Files API Enhancements (Java 11)
• Standard HTTP Client API (Java 11)
• Java 11 Features
• Enhanced Pseudo-Random Number Generators (Java 17)
• Records (Java 17)
• Text Blocks (Java 17)
• Pattern Matching for instanceof (Java 17)
• Sealed Classes (Java 17)
• Java 17 Features
• Primitive Types in Patterns (Java 25)
• Module Import Declarations (Java 25)
• Flexible Constructor Bodies (Java 25)
• Compact Source Files (Java 25)
• Java 25 Features
• Unnamed Patterns & Variables (Java 21)
• Structured Concurrency (Java 21)
• Unnamed Classes & Instance Main Methods (Java 21)
• Pattern Matching for switch (Java 21)
• Record Patterns (Java 21)
• Sequenced Collections (Java 21)
• Virtual Threads (Java 21)
• String Templates (Java 21)
• Java 21 Features

java11

• Predicate::not and More Enhancements (Java 11)
• Local-Variable Syntax for Lambda Parameters (Java 11)
• String & Files API Enhancements (Java 11)
• Standard HTTP Client API (Java 11)
• Java 11 Features

java17

• Enhanced Pseudo-Random Number Generators (Java 17)
• Records (Java 17)
• Text Blocks (Java 17)
• Pattern Matching for instanceof (Java 17)
• Sealed Classes (Java 17)
• Java 17 Features

java21

• Unnamed Patterns & Variables (Java 21)
• Structured Concurrency (Java 21)
• Unnamed Classes & Instance Main Methods (Java 21)
• Pattern Matching for switch (Java 21)
• Record Patterns (Java 21)
• Sequenced Collections (Java 21)
• Virtual Threads (Java 21)
• String Templates (Java 21)
• Java 21 Features

java25

• Primitive Types in Patterns (Java 25)
• Module Import Declarations (Java 25)
• Flexible Constructor Bodies (Java 25)
• Compact Source Files (Java 25)
• Java 25 Features

java8

• The New Date/Time API (Java 8)
• The Optional API (Java 8)
• The Streams API (Java 8)
• Functional Interfaces & Default Methods (Java 8)
• Lambda Expressions (Java 8)
• Java 8 Features

linked-lists

• Linked Lists — Singly, Doubly & Circular

literature

• U$A ਕੈਫੇਟੇਰੀਆ
• ਮੁੜਦੇ ਪਰਿੰਦੇ

memoization

• Dynamic Programming — Memoization

pathfinding

• A* Search Algorithm

personal-finances

• The Ultimate Guide to Canadian TFSA: Limits, Rules, and Strategies for 2026

programming

• Tries (Prefix Trees)
• A* Search Algorithm
• Bit Manipulation
• Recursion Patterns — Base Cases & Unwinding
• Backtracking
• Greedy Algorithms
• Dynamic Programming — Tabulation
• Dynamic Programming — Memoization
• Dijkstra's Shortest Path
• Depth-First Search (DFS) & Applications
• Graph Representation & BFS
• Heaps & Priority Queues
• Binary Search Trees (BST)
• Binary Trees — Traversals & Operations
• Linked Lists — Singly, Doubly & Circular
• Hash Tables & Hashing
• Stacks & Queues — Core Operations
• Sliding Window Technique
• Two Pointer Technique
• Linear Search & Binary Search
• Counting Sort, Radix Sort & Bucket Sort
• Quick Sort — The Versatile Performer
• Merge Sort — Divide and Conquer
• Selection Sort & Insertion Sort
• Bubble Sort — The Simplest Sort
• Introduction to Algorithms & Big-O Notation
• Algorithms & Data Structures — Complete Guide
• The New Date/Time API (Java 8)
• The Optional API (Java 8)
• The Streams API (Java 8)
• Functional Interfaces & Default Methods (Java 8)
• Lambda Expressions (Java 8)
• Java 8 Features
• Predicate::not and More Enhancements (Java 11)
• Local-Variable Syntax for Lambda Parameters (Java 11)
• String & Files API Enhancements (Java 11)
• Standard HTTP Client API (Java 11)
• Java 11 Features
• Enhanced Pseudo-Random Number Generators (Java 17)
• Records (Java 17)
• Text Blocks (Java 17)
• Pattern Matching for instanceof (Java 17)
• Sealed Classes (Java 17)
• Java 17 Features
• Primitive Types in Patterns (Java 25)
• Module Import Declarations (Java 25)
• Flexible Constructor Bodies (Java 25)
• Compact Source Files (Java 25)
• Java 25 Features
• Unnamed Patterns & Variables (Java 21)
• Structured Concurrency (Java 21)
• Unnamed Classes & Instance Main Methods (Java 21)
• Pattern Matching for switch (Java 21)
• Record Patterns (Java 21)
• Sequenced Collections (Java 21)
• Virtual Threads (Java 21)
• String Templates (Java 21)
• Java 21 Features

punjabi

• U$A ਕੈਫੇਟੇਰੀਆ
• ਮੁੜਦੇ ਪਰਿੰਦੇ

queues

• Stacks & Queues — Core Operations

recursion

• Recursion Patterns — Base Cases & Unwinding

searching

• Linear Search & Binary Search

shortest-path

• Dijkstra's Shortest Path

sliding-window

• Sliding Window Technique

sorting

• Counting Sort, Radix Sort & Bucket Sort
• Quick Sort — The Versatile Performer
• Merge Sort — Divide and Conquer
• Selection Sort & Insertion Sort
• Bubble Sort — The Simplest Sort

stacks

• Stacks & Queues — Core Operations

strings

• Tries (Prefix Trees)

tabulation

• Dynamic Programming — Tabulation

tax-saving

• The Ultimate Guide to Canadian TFSA: Limits, Rules, and Strategies for 2026

tfsa

• The Ultimate Guide to Canadian TFSA: Limits, Rules, and Strategies for 2026

trees

• Tries (Prefix Trees)
• Binary Search Trees (BST)
• Binary Trees — Traversals & Operations

trie

• Tries (Prefix Trees)

two-pointer

• Two Pointer Technique