diff --git a/roadmaps/datastructures-and-algorithms/content/a-algorithm@AabJqPUwFVBVS02YPDPvL.md b/roadmaps/datastructures-and-algorithms/content/a-algorithm@AabJqPUwFVBVS02YPDPvL.md index d04e3fbcc..89f7e40fd 100644 --- a/roadmaps/datastructures-and-algorithms/content/a-algorithm@AabJqPUwFVBVS02YPDPvL.md +++ b/roadmaps/datastructures-and-algorithms/content/a-algorithm@AabJqPUwFVBVS02YPDPvL.md @@ -1,3 +1,3 @@ # A* Algorithm -A* is a pathfinding and graph traversal algorithm that finds the shortest path between two nodes. It combines the guarantees of Dijkstra's algorithm with a heuristic that estimates the remaining distance, guiding the search toward the goal and exploring far fewer nodes in practice. +A\* is a pathfinding and graph traversal algorithm that finds the shortest path between two nodes. It combines the guarantees of Dijkstra's algorithm with a heuristic that estimates the remaining distance, guiding the search toward the goal and exploring far fewer nodes in practice. \ No newline at end of file diff --git a/roadmaps/datastructures-and-algorithms/content/cyclic-sort@L1FIJAluyxG6CGaVLM20O.md b/roadmaps/datastructures-and-algorithms/content/cyclic-sort@L1FIJAluyxG6CGaVLM20O.md index 9f73528be..c4b6f0992 100644 --- a/roadmaps/datastructures-and-algorithms/content/cyclic-sort@L1FIJAluyxG6CGaVLM20O.md +++ b/roadmaps/datastructures-and-algorithms/content/cyclic-sort@L1FIJAluyxG6CGaVLM20O.md @@ -1,3 +1,3 @@ # Cyclic Sort -Cyclic sort is a sorting technique for arrays whose values fall in a known, contiguous range, typically `1` to `n`. Each element is swapped to the position matching its value, placing everything correctly in O(n) time and O(1) space — ideal as a building block for problems such as finding missing or duplicate numbers. +Cyclic sort is a sorting technique for arrays whose values fall in a known, contiguous range, typically `1` to `n`. Each element is swapped to the position matching its value, placing everything correctly in O(n) time and O(1) space — ideal as a building block for problems such as finding missing or duplicate numbers. \ No newline at end of file diff --git a/roadmaps/datastructures-and-algorithms/content/fast-and-slow-pointers@J_No8GTa92DcwPtua30wL.md b/roadmaps/datastructures-and-algorithms/content/fast-and-slow-pointers@J_No8GTa92DcwPtua30wL.md index 0e5862356..e8250e12d 100644 --- a/roadmaps/datastructures-and-algorithms/content/fast-and-slow-pointers@J_No8GTa92DcwPtua30wL.md +++ b/roadmaps/datastructures-and-algorithms/content/fast-and-slow-pointers@J_No8GTa92DcwPtua30wL.md @@ -1,3 +1,3 @@ # Fast and Slow Pointers -The fast and slow pointers pattern uses two pointers that traverse a data structure at different speeds. It is commonly used to detect cycles in linked lists, find the middle of a list, or locate the kth element from the end, running in O(n) time with constant space. +The fast and slow pointers pattern uses two pointers that traverse a data structure at different speeds. It is commonly used to detect cycles in linked lists, find the middle of a list, or locate the kth element from the end, running in O(n) time with constant space. \ No newline at end of file diff --git a/roadmaps/datastructures-and-algorithms/content/insertion-sort@liJfTV5ajAFZcfwBdVGpU.md b/roadmaps/datastructures-and-algorithms/content/insertion-sort@liJfTV5ajAFZcfwBdVGpU.md index b36e45dcb..bb18d973a 100644 --- a/roadmaps/datastructures-and-algorithms/content/insertion-sort@liJfTV5ajAFZcfwBdVGpU.md +++ b/roadmaps/datastructures-and-algorithms/content/insertion-sort@liJfTV5ajAFZcfwBdVGpU.md @@ -2,10 +2,10 @@ Insertion sort is a simple sorting algorithm that works by iteratively inserting each element of an unsorted list into its correct position in a sorted portion of the list. It is like sorting playing cards in your hands. You split the cards into two groups: the sorted cards and the unsorted cards. Then, you pick a card from the unsorted group and put it in the right place in the sorted group. -- Start with the second element as the first element is assumed to be sorted. -- Compare the second element with the first if the second is smaller then swap them. -- Move to the third element, compare it with the first two, and put it in its correct position -- Repeat until the entire array is sorted. +* Start with the second element as the first element is assumed to be sorted. +* Compare the second element with the first if the second is smaller then swap them. +* Move to the third element, compare it with the first two, and put it in its correct position +* Repeat until the entire array is sorted. Visit the following resources to learn more: diff --git a/roadmaps/datastructures-and-algorithms/content/island-traversal@q9qLI6HzOJ0vYaIVrZ5CU.md b/roadmaps/datastructures-and-algorithms/content/island-traversal@q9qLI6HzOJ0vYaIVrZ5CU.md index f1ef77c68..0ceb5c39d 100644 --- a/roadmaps/datastructures-and-algorithms/content/island-traversal@q9qLI6HzOJ0vYaIVrZ5CU.md +++ b/roadmaps/datastructures-and-algorithms/content/island-traversal@q9qLI6HzOJ0vYaIVrZ5CU.md @@ -1,3 +1,3 @@ # Island traversal -Island traversal is a grid-based technique used to find connected regions of cells that share a common value, typically `1`s in a binary matrix. It combines grid traversal with depth-first or breadth-first search — often with visited tracking — to count islands, measure their size, or analyze their shape. +Island traversal is a grid-based technique used to find connected regions of cells that share a common value, typically `1`s in a binary matrix. It combines grid traversal with depth-first or breadth-first search — often with visited tracking — to count islands, measure their size, or analyze their shape. \ No newline at end of file diff --git a/roadmaps/datastructures-and-algorithms/content/kth-element@JcchUF_U99zkFpXp3VT2R.md b/roadmaps/datastructures-and-algorithms/content/kth-element@JcchUF_U99zkFpXp3VT2R.md index a5d5f8540..040aec579 100644 --- a/roadmaps/datastructures-and-algorithms/content/kth-element@JcchUF_U99zkFpXp3VT2R.md +++ b/roadmaps/datastructures-and-algorithms/content/kth-element@JcchUF_U99zkFpXp3VT2R.md @@ -1,3 +1,3 @@ # Kth Element -Kth element problems ask you to find the kth smallest (or largest) element in a collection without fully sorting it. Common solutions include heaps, quickselect, or sorting, depending on the constraints — a pattern that also appears in questions about arrays, streams, and binary search trees. +Kth element problems ask you to find the kth smallest (or largest) element in a collection without fully sorting it. Common solutions include heaps, quickselect, or sorting, depending on the constraints — a pattern that also appears in questions about arrays, streams, and binary search trees. \ No newline at end of file diff --git a/roadmaps/datastructures-and-algorithms/content/merge-intervals@S2mBvlFTd673XcXxisD5P.md b/roadmaps/datastructures-and-algorithms/content/merge-intervals@S2mBvlFTd673XcXxisD5P.md index 40c9ad85b..b9fb10987 100644 --- a/roadmaps/datastructures-and-algorithms/content/merge-intervals@S2mBvlFTd673XcXxisD5P.md +++ b/roadmaps/datastructures-and-algorithms/content/merge-intervals@S2mBvlFTd673XcXxisD5P.md @@ -1,3 +1,3 @@ # Merge Intervals -The merge intervals pattern deals with overlapping ranges, typically merging a list of intervals that intersect. The standard approach sorts the intervals by start time and then folds them together in a single pass — a technique used in scheduling, availability, and range problems. +The merge intervals pattern deals with overlapping ranges, typically merging a list of intervals that intersect. The standard approach sorts the intervals by start time and then folds them together in a single pass — a technique used in scheduling, availability, and range problems. \ No newline at end of file diff --git a/roadmaps/datastructures-and-algorithms/content/multi-threaded@gaaRAL3HR48Qj9rz1CkDU.md b/roadmaps/datastructures-and-algorithms/content/multi-threaded@gaaRAL3HR48Qj9rz1CkDU.md index e7dfec16b..0e0222cf9 100644 --- a/roadmaps/datastructures-and-algorithms/content/multi-threaded@gaaRAL3HR48Qj9rz1CkDU.md +++ b/roadmaps/datastructures-and-algorithms/content/multi-threaded@gaaRAL3HR48Qj9rz1CkDU.md @@ -1,3 +1,3 @@ # Multi-threaded -Multi-threaded algorithms divide work across multiple threads to run faster on multi-core machines. Common patterns include parallel divide-and-conquer, thread-safe queues for producer-consumer flows, and careful synchronization to avoid race conditions — with quality often measured by speedup and scalability. +Multi-threaded algorithms divide work across multiple threads to run faster on multi-core machines. Common patterns include parallel divide-and-conquer, thread-safe queues for producer-consumer flows, and careful synchronization to avoid race conditions — with quality often measured by speedup and scalability. \ No newline at end of file