+
+ {% if page.layout == 'cheatsheet-index' %}
+
+
{{ page.title }}
+
{{ page.description | default: site.description }}
+
+ {% endif %}
+
+
+ {{ content }}
+
+
diff --git a/doc/cheatsheet/priority_queue.md b/doc/cheatsheet/priority_queue.md
index e30642a3a..36ee6448c 100644
--- a/doc/cheatsheet/priority_queue.md
+++ b/doc/cheatsheet/priority_queue.md
@@ -1,3 +1,16 @@
+---
+layout: cheatsheet
+title: "Priority Queue"
+description: "Abstract data type for priority-based element processing"
+category: "Data Structure"
+difficulty: "Medium"
+tags: ["priority-queue", "heap", "priority-based", "queue"]
+patterns:
+ - Priority-based processing
+ - Heap implementation
+ - Task scheduling
+---
+
# Priority Queue (PQ) Data Structure
## Overview
@@ -159,7 +172,7 @@ public int[] mergeKSortedArrays(int[][] arrays) {
// Initialize PQ with first element from each array
for (int i = 0; i < arrays.length; i++) {
if (arrays[i].length > 0) {
- pq.offer(new int[]{arrays[i][0], i, 0});
+ pq.offer(new int[]{% raw %}{arrays[i][0], i, 0}{% endraw %});
totalSize += arrays[i].length;
}
}
@@ -356,7 +369,7 @@ public int dijkstra(Map
diff --git a/doc/cheatsheet/quick_find.md b/doc/cheatsheet/quick_find.md
index ddf87b44b..ad599e328 100644
--- a/doc/cheatsheet/quick_find.md
+++ b/doc/cheatsheet/quick_find.md
@@ -1,3 +1,16 @@
+---
+layout: cheatsheet
+title: "Quick Find"
+description: "Union-find data structure with quick find operations"
+category: "Data Structure"
+difficulty: "Medium"
+tags: ["union-find", "quick-find", "disjoint-set", "connectivity"]
+patterns:
+ - Union-find operations
+ - Connectivity queries
+ - Disjoint set management
+---
+
# Quick Find
## 0) Concept
diff --git a/doc/cheatsheet/recursion.md b/doc/cheatsheet/recursion.md
index e6dc814c6..22d35b718 100644
--- a/doc/cheatsheet/recursion.md
+++ b/doc/cheatsheet/recursion.md
@@ -1,3 +1,16 @@
+---
+layout: cheatsheet
+title: "Recursion"
+description: "Problem-solving technique using self-calling functions"
+category: "Algorithm"
+difficulty: "Medium"
+tags: ["recursion", "divide-and-conquer", "base-case", "recursive-call"]
+patterns:
+ - Base case definition
+ - Recursive case breakdown
+ - Function call stack
+---
+
# Recursion
For a problem, if there exists a recursive solution, we can follow the guidelines below to implement it.
diff --git a/doc/cheatsheet/recursion_and_dp.md b/doc/cheatsheet/recursion_and_dp.md
index 5b2582330..8600fce86 100644
--- a/doc/cheatsheet/recursion_and_dp.md
+++ b/doc/cheatsheet/recursion_and_dp.md
@@ -1,3 +1,16 @@
+---
+layout: cheatsheet
+title: "Recursion and Dynamic Programming"
+description: "Relationship between recursion and dynamic programming optimization"
+category: "Algorithm"
+difficulty: "Hard"
+tags: ["recursion", "dp", "dynamic-programming", "optimization"]
+patterns:
+ - Recursive to DP conversion
+ - Memoization techniques
+ - Bottom-up optimization
+---
+
# Dynamic Programming
## 0) Concept
diff --git a/doc/cheatsheet/scanning_line.md b/doc/cheatsheet/scanning_line.md
index deee6be8a..b1aed2714 100644
--- a/doc/cheatsheet/scanning_line.md
+++ b/doc/cheatsheet/scanning_line.md
@@ -1,3 +1,16 @@
+---
+layout: cheatsheet
+title: "Scanning Line (Line Sweep)"
+description: "Algorithmic paradigm for processing geometric objects with sweep line technique"
+category: "Algorithm"
+difficulty: "Hard"
+tags: ["scanning-line", "line-sweep", "geometric", "intervals"]
+patterns:
+ - Event-based processing
+ - Geometric problem solving
+ - Interval processing
+---
+
# Scanning Line (Line Sweep) Algorithm
## Overview
@@ -117,8 +130,8 @@ public int maxOverlap(int[][] intervals) {
// Create events
for (int[] interval : intervals) {
- events.add(new int[]{interval[0], 1}); // Start
- events.add(new int[]{interval[1], -1}); // End
+ events.add(new int[]{% raw %}{interval[0], 1}{% endraw %}); // Start
+ events.add(new int[]{% raw %}{interval[1], -1}{% endraw %}); // End
}
// Sort events
@@ -248,8 +261,8 @@ public List
diff --git a/doc/cheatsheet/stack.md b/doc/cheatsheet/stack.md
index 621f2481a..bc89a5e03 100644
--- a/doc/cheatsheet/stack.md
+++ b/doc/cheatsheet/stack.md
@@ -1,3 +1,16 @@
+---
+layout: cheatsheet
+title: "Stack"
+description: "Linear data structure following LIFO (Last In First Out) principle"
+category: "Data Structure"
+difficulty: "Easy"
+tags: ["stack", "lifo", "linear", "push", "pop"]
+patterns:
+ - LIFO processing
+ - Function call management
+ - Expression evaluation
+---
+
# Stack
@@ -263,7 +276,7 @@ class MyQueue_3{
public int[] nextGreaterElement(int[] nums1, int[] nums2) {
if (nums1.length == 1 && nums2.length == 1){
- return new int[]{-1};
+ return new int[]{% raw %}{-1}{% endraw %};
}
/**
@@ -503,7 +516,7 @@ class Solution(object):
public int[] nextGreaterElement(int[] nums1, int[] nums2) {
if (nums1.length == 1 && nums2.length == 1){
- return new int[]{-1};
+ return new int[]{% raw %}{-1}{% endraw %};
}
/**
diff --git a/doc/cheatsheet/strategy.md b/doc/cheatsheet/strategy.md
index c462ed3d9..a7f5d92e5 100644
--- a/doc/cheatsheet/strategy.md
+++ b/doc/cheatsheet/strategy.md
@@ -1,3 +1,16 @@
+---
+layout: cheatsheet
+title: "LeetCode Strategy"
+description: "Strategic approach to solving LeetCode problems effectively"
+category: "Interview"
+difficulty: "Easy"
+tags: ["strategy", "leetcode", "problem-solving", "interview"]
+patterns:
+ - Problem classification
+ - Solution strategies
+ - Time/space optimization
+---
+
## LC Strategy
### Part 1 : (Top Down)(Input data structure)
diff --git a/doc/cheatsheet/string.md b/doc/cheatsheet/string.md
index e3793df58..c2a667e51 100644
--- a/doc/cheatsheet/string.md
+++ b/doc/cheatsheet/string.md
@@ -1,3 +1,16 @@
+---
+layout: cheatsheet
+title: "String Algorithms"
+description: "Techniques for processing, searching, and manipulating text data"
+category: "Algorithm"
+difficulty: "Medium"
+tags: ["string", "text-processing", "pattern-matching", "manipulation"]
+patterns:
+ - Pattern matching
+ - String transformation
+ - Text parsing
+---
+
# String Algorithms & Manipulation
## Overview
diff --git a/doc/cheatsheet/topology_sorting.md b/doc/cheatsheet/topology_sorting.md
index f434b976b..bde1d478d 100644
--- a/doc/cheatsheet/topology_sorting.md
+++ b/doc/cheatsheet/topology_sorting.md
@@ -1,3 +1,16 @@
+---
+layout: cheatsheet
+title: "Topological Sorting"
+description: "Linear ordering algorithm for directed acyclic graphs (DAGs)"
+category: "Algorithm"
+difficulty: "Medium"
+tags: ["topological-sort", "dag", "dependency", "ordering"]
+patterns:
+ - Dependency resolution
+ - DAG processing
+ - Linear ordering
+---
+
# Topological Sorting - Complete Guide
## Overview
@@ -583,14 +596,14 @@ public class CourseSchedule2 {
// ref : https://github.com/yennanliu/CS_basics/blob/master/leetcode_java/src/main/java/AlgorithmJava/TopologicalSortV2.java
public int[] findOrder(int numCourses, int[][] prerequisites) {
if (numCourses == 1) {
- return new int[]{0};
+ return new int[]{% raw %}{0}{% endraw %};
}
// topologic ordering
List