From 5233cf8c032d4eef3e78f43d5a9117eb50036055 Mon Sep 17 00:00:00 2001 From: Elijah Melton Date: Tue, 11 Feb 2025 16:25:28 -0800 Subject: [PATCH] misc tags; --- algorithms/patterns/BFS.md | 13 +++++++++++++ algorithms/patterns/sliding-window.md | 7 +++++++ algorithms/practice/4.md | 7 +++++++ algorithms/problems/graphs-and-trees.md | 7 +++++++ cheatsheets/algorithms/divide-and-conquer.md | 7 +++++++ cheatsheets/algorithms/graphs.md | 7 +++++++ cheatsheets/algorithms/intervals.md | 7 +++++++ cheatsheets/circuits/components.md | 7 +++++++ cheatsheets/circuits/electricity.md | 7 +++++++ cheatsheets/java-spring-boot/reference.md | 7 +++++++ cheatsheets/java-spring-boot/running.md | 7 +++++++ 11 files changed, 83 insertions(+) diff --git a/algorithms/patterns/BFS.md b/algorithms/patterns/BFS.md index 03b17ebde..4070a6339 100644 --- a/algorithms/patterns/BFS.md +++ b/algorithms/patterns/BFS.md @@ -1,3 +1,16 @@ +--- +title: Spring Boot Quickstart Guide +category: software-engineering +tags: spring boot, quick start, spring web, rest repositories +description: A step-by-step guide to creating a Spring Boot application with Rest Repositories +--- +--- +title: Breadth First Search Pattern +category: algorithms +tags: breadth-first search, graph algorithms, graph traversal, shortest path +description: A technical exploration of the Breadth First Search algorithm, focusing on its key properties and applications in graph problems. +--- + # Breadth First Search BFS is an extremely versatile algorithm that comes up a lot in graph problems. The key property of BFS is that it explores vertices in order of the length of their shortest path from the starting vertex. Any time you're dealing with an unwieghted graph and need to find the shortest path between two vertices, BFS is a good place to start. Its usefulness doesn't end there though; BFS can be used to find connected components, detect cycles, and more. diff --git a/algorithms/patterns/sliding-window.md b/algorithms/patterns/sliding-window.md index 03e54dd7d..60e2b29b6 100644 --- a/algorithms/patterns/sliding-window.md +++ b/algorithms/patterns/sliding-window.md @@ -1,3 +1,10 @@ +--- +title: Sliding Window Pattern +category: algorithms +tags: sliding window, fixed size window, dynamic size window, streaming algorithms, array problems, contiguous subarray, linear data structure +description: A technical exploration of the sliding window pattern in algorithms, focusing on its applications and variations. +--- + # Sliding Window Sliding window is a useful pattern when you need to maintain a contiguous subarray of elements within a linear data structure. Problems typically fall into one of two categories: diff --git a/algorithms/practice/4.md b/algorithms/practice/4.md index 584fc3a83..33bd5815b 100644 --- a/algorithms/practice/4.md +++ b/algorithms/practice/4.md @@ -1,3 +1,10 @@ +--- +title: Interval Sum Counting Algorithm +category: algorithms +tags: interval sums, binary search, prefix sum, suffix sum +description: An algorithm for counting the number of interval sums between a given range in an array of intervals. +--- + # Problem Set 4 ## Problem 1 diff --git a/algorithms/problems/graphs-and-trees.md b/algorithms/problems/graphs-and-trees.md index 3ca6be8db..07b3e9cd2 100644 --- a/algorithms/problems/graphs-and-trees.md +++ b/algorithms/problems/graphs-and-trees.md @@ -1,3 +1,10 @@ +--- +title: Graphs and Trees +category: algorithms +tags: graphs, trees, induction, proof by contradiction, cycle detection +description: A technical exploration of graphs and trees focusing on the properties and proofs of these fundamental data structures. +--- + # Graphs and Trees ## Problem 1 diff --git a/cheatsheets/algorithms/divide-and-conquer.md b/cheatsheets/algorithms/divide-and-conquer.md index 2be1d21de..f3ddfa529 100644 --- a/cheatsheets/algorithms/divide-and-conquer.md +++ b/cheatsheets/algorithms/divide-and-conquer.md @@ -1,3 +1,10 @@ +--- +title: Divide and Conquer Algorithms +category: algorithms +tags: divide and conquer, master theorem, root finding, bisector algorithm, kth smallest element +description: A technical exploration of Divide and Conquer algorithms focusing on the Master Theorem, Root Finding, and kth Smallest Element problems. +--- + # Divide and Conquer ## Master Theorem diff --git a/cheatsheets/algorithms/graphs.md b/cheatsheets/algorithms/graphs.md index d1f790647..ef0e5315d 100644 --- a/cheatsheets/algorithms/graphs.md +++ b/cheatsheets/algorithms/graphs.md @@ -1,3 +1,10 @@ +--- +title: Graph Theory +category: algorithms +tags: Graphs, Trees, DFS, BFS, Topological Sort, Minimum Spanning Tree, Disjoint Sets +description: A comprehensive overview of graph theory, including concepts such as nodes, edges, trees, and minimum spanning trees, as well as algorithms like depth-first search and breadth-first search. +--- + # Graphs ## Undirected Graphs diff --git a/cheatsheets/algorithms/intervals.md b/cheatsheets/algorithms/intervals.md index 22b78a829..288a7a08d 100644 --- a/cheatsheets/algorithms/intervals.md +++ b/cheatsheets/algorithms/intervals.md @@ -1,3 +1,10 @@ +--- +title: Interval Scheduling/Partitioning +category: algorithms +tags: greedy algorithms, interval partitioning, scheduling, time complexity +description: A technical exploration of Interval Scheduling and Partitioning focusing on their greedy algorithm properties and structural analysis. +--- + # Interval Scheduling/Partitioning ## Scheduling the max number of intervals diff --git a/cheatsheets/circuits/components.md b/cheatsheets/circuits/components.md index 6879ddec5..adede0680 100644 --- a/cheatsheets/circuits/components.md +++ b/cheatsheets/circuits/components.md @@ -1,3 +1,10 @@ +--- +title: Electronic Components +category: hardware +tags: Transistors, Op-Amps, Filters, Amplifiers, Comparators +description: A comprehensive overview of electronic components used in electronics devices, including Transistors, Op-Amps, Filters, Amplifiers, and Comparators. +--- + # Component Dictionary ## DC Sources diff --git a/cheatsheets/circuits/electricity.md b/cheatsheets/circuits/electricity.md index 774871314..dcb449662 100644 --- a/cheatsheets/circuits/electricity.md +++ b/cheatsheets/circuits/electricity.md @@ -1,3 +1,10 @@ +--- +title: Electric Circuit Analysis +category: electrical-engineering +tags: Electrical Engineering,Circuits,Ohms Law,Kirchoffs Laws,Impedance,AC Circuits,DC Circuits,Power,Energy +description: In-depth analysis of electric circuits, including short and open circuits, Ohm's law, Kirchoff's laws, impedance, power, and energy. A comprehensive guide for electrical engineers and students. +--- + # Electricity Basics ## Flow of Electricity diff --git a/cheatsheets/java-spring-boot/reference.md b/cheatsheets/java-spring-boot/reference.md index b122371af..8973fd425 100644 --- a/cheatsheets/java-spring-boot/reference.md +++ b/cheatsheets/java-spring-boot/reference.md @@ -1,3 +1,10 @@ +--- +title: Spring Boot Annotations +category: software-engineering +tags: spring-boot, annotations, java, configuration +description: A documentation on the Spring Boot annotations used for configuration, auto-configuration, component scanning, and more. +--- + ### Annotations and their meanings diff --git a/cheatsheets/java-spring-boot/running.md b/cheatsheets/java-spring-boot/running.md index 31854d1f3..f6ebdc1d2 100644 --- a/cheatsheets/java-spring-boot/running.md +++ b/cheatsheets/java-spring-boot/running.md @@ -1,3 +1,10 @@ +--- +title: Spring Boot Quickstart Guide +category: software-engineering +tags: spring boot, quick start, spring web, rest repositories +description: A step-by-step guide to creating a Spring Boot application with Rest Repositories +--- + # Quickstart Create a zip file with (start.spring.io)[https://start.spring.io/] including the following dependencies: