From 47215222b93e159cafdfb1104fcea0f5fcf68fdd Mon Sep 17 00:00:00 2001 From: "github-actions[bot]" <41898282+github-actions[bot]@users.noreply.github.com> Date: Wed, 22 Jul 2026 11:44:05 +0200 Subject: [PATCH] chore: sync content to repo (#10170) Co-authored-by: nilbuild <4921183+nilbuild@users.noreply.github.com> --- .../roadmaps/leetcode/content/c@IWmq4UFB5j6O3UJfarh1u.md | 3 ++- .../pacific-atlantic-water-flow@mhSb4eQV970bLlOfFg84p.md | 2 +- .../leetcode/content/scala@acgRMEuL4ZGGRHpZ7kXSo.md | 6 +++--- .../leetcode/content/trees@PQ31G4_7Y5K6D34hVRyRK.md | 5 +++-- .../leetcode/content/two-sum-ii@vTpv8AliKFv0Sf13PmVCo.md | 2 +- .../content/word-search-ii@46Y-wvaUJZwd32mRqrRix.md | 2 +- 6 files changed, 11 insertions(+), 9 deletions(-) diff --git a/src/data/roadmaps/leetcode/content/c@IWmq4UFB5j6O3UJfarh1u.md b/src/data/roadmaps/leetcode/content/c@IWmq4UFB5j6O3UJfarh1u.md index fb5f22a30..2fb6a029d 100644 --- a/src/data/roadmaps/leetcode/content/c@IWmq4UFB5j6O3UJfarh1u.md +++ b/src/data/roadmaps/leetcode/content/c@IWmq4UFB5j6O3UJfarh1u.md @@ -4,4 +4,5 @@ C++ is the language of choice for competitive programmers and is common in compa Visit the following resources to learn more: -- [@roadmap@Visit the Dedicated C++ Roadmap](https://roadmap.sh/cpp) \ No newline at end of file +- [@roadmap@Visit the Dedicated C++ Roadmap](https://roadmap.sh/cpp) +- [@article@Learn C++ – Skill up with our free tutorials](https://www.learncpp.com/) \ No newline at end of file diff --git a/src/data/roadmaps/leetcode/content/pacific-atlantic-water-flow@mhSb4eQV970bLlOfFg84p.md b/src/data/roadmaps/leetcode/content/pacific-atlantic-water-flow@mhSb4eQV970bLlOfFg84p.md index 973966874..c94a2df39 100644 --- a/src/data/roadmaps/leetcode/content/pacific-atlantic-water-flow@mhSb4eQV970bLlOfFg84p.md +++ b/src/data/roadmaps/leetcode/content/pacific-atlantic-water-flow@mhSb4eQV970bLlOfFg84p.md @@ -6,4 +6,4 @@ Visit the following resources to learn more: - [@article@Pacific Atlantic Water Flow](https://leetcode.com/problems/pacific-atlantic-water-flow/) - [@video@Pacific Atlantic Water Flow - Leetcode 417 - Graphs (Python)](https://www.youtube.com/watch?v=pDvvDvgHUKE) -- [@video@[Java] Leetcode 417. Pacific Atlantic Water Flow [Search #4]](https://www.youtube.com/watch?v=ZQp1oGp1y6s) \ No newline at end of file +- [@video@\[Java\] Leetcode 417. Pacific Atlantic Water Flow \[Search #4\]](https://www.youtube.com/watch?v=ZQp1oGp1y6s) \ No newline at end of file diff --git a/src/data/roadmaps/leetcode/content/scala@acgRMEuL4ZGGRHpZ7kXSo.md b/src/data/roadmaps/leetcode/content/scala@acgRMEuL4ZGGRHpZ7kXSo.md index 1cd6f14b0..b750d8d03 100644 --- a/src/data/roadmaps/leetcode/content/scala@acgRMEuL4ZGGRHpZ7kXSo.md +++ b/src/data/roadmaps/leetcode/content/scala@acgRMEuL4ZGGRHpZ7kXSo.md @@ -1,7 +1,7 @@ -# Scala +# C -Scala is a functional and object-oriented language that runs on the JVM and is popular in data engineering and distributed systems roles. Its expressive type system and functional abstractions like pattern matching and higher-order functions can make some algorithmic problems elegant to solve. However, Scala is rarely the expected language in general software engineering interviews, and LeetCode support for it is more limited. Choose Scala only if you are specifically targeting roles where it is the primary language and you are already fluent in it. +C is a general-purpose, procedural programming language that provides low-level access to system memory and efficient mapping to machine instructions. It is known for its minimalist design, which relies on a simple set of keywords and a straightforward syntax to perform tasks. C remains a foundational language for building operating systems, embedded systems, and high-performance applications where execution speed and resource efficiency are critical. Visit the following resources to learn more: -- [@roadmap@Visit the Dedicated Scala Roadmap](https://roadmap.sh/scala) \ No newline at end of file +- [@roadmap@Visit the Dedicated C Roadmap](https://roadmap.sh/c) \ No newline at end of file diff --git a/src/data/roadmaps/leetcode/content/trees@PQ31G4_7Y5K6D34hVRyRK.md b/src/data/roadmaps/leetcode/content/trees@PQ31G4_7Y5K6D34hVRyRK.md index b9f55450b..042aafc8d 100644 --- a/src/data/roadmaps/leetcode/content/trees@PQ31G4_7Y5K6D34hVRyRK.md +++ b/src/data/roadmaps/leetcode/content/trees@PQ31G4_7Y5K6D34hVRyRK.md @@ -1,9 +1,10 @@ # Trees -Trees are the data structure where recursion becomes natural. Most tree problems follow one of two patterns: DFS, where you go deep before backtracking, and BFS, where you process nodes level by level. DFS is usually implemented recursively and is good for path-based and structural problems. BFS uses a queue and is good for level-based problems and shortest-path questions on unweighted trees. The key habit to build here is thinking clearly about what a function returns versus what it records as a side effect, since many tree problems require tracking a global answer while the recursion handles local decisions. +Trees are the data structure where recursion becomes natural. Most tree problems follow DFS, going deep before backtracking, or BFS, processing level by level. DFS is usually recursive and suits path-based problems, while BFS uses a queue and suits level-based or shortest-path questions. A key habit is separating what a function returns from what it records as a side effect, since many problems need a global answer tracked alongside local recursive decisions. Segment trees and Fenwick trees extend these ideas to range queries over a mutable array, though they show up more in competitive programming than standard interviews. Visit the following resources to learn more: - [@article@Trees DSA](https://www.w3schools.com/dsa/dsa_theory_trees.php) -- [@article@Trees](https://www.programiz.com/dsa/trees) +- [@article@Segment Tree (cp-algorithms)](https://cp-algorithms.com/data_structures/segment_tree.html) +- [@article@Fenwick Tree / BIT (cp-algorithms)](https://cp-algorithms.com/data_structures/fenwick.html) - [@video@Tree data structures in 2 minutes 🌳](https://www.youtube.com/watch?v=Etpc_-br5rI&t=1s) \ No newline at end of file diff --git a/src/data/roadmaps/leetcode/content/two-sum-ii@vTpv8AliKFv0Sf13PmVCo.md b/src/data/roadmaps/leetcode/content/two-sum-ii@vTpv8AliKFv0Sf13PmVCo.md index 380c68f80..d2c4e32b4 100644 --- a/src/data/roadmaps/leetcode/content/two-sum-ii@vTpv8AliKFv0Sf13PmVCo.md +++ b/src/data/roadmaps/leetcode/content/two-sum-ii@vTpv8AliKFv0Sf13PmVCo.md @@ -6,4 +6,4 @@ Visit the following resources to learn more: - [@article@Two Sum II - Input Array Is Sorted - LeetCode](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/description/) - [@video@Two Sum II - Leetcode 167](https://www.youtube.com/watch?v=ciPrKYoOQkI) -- [@video@[Java] Leetcode 167. Two Sum II](https://www.youtube.com/watch?v=CWUnvUJ29zw) \ No newline at end of file +- [@video@\[Java\] Leetcode 167. Two Sum II](https://www.youtube.com/watch?v=CWUnvUJ29zw) \ No newline at end of file diff --git a/src/data/roadmaps/leetcode/content/word-search-ii@46Y-wvaUJZwd32mRqrRix.md b/src/data/roadmaps/leetcode/content/word-search-ii@46Y-wvaUJZwd32mRqrRix.md index 0b27a4d6e..9a8a2bee0 100644 --- a/src/data/roadmaps/leetcode/content/word-search-ii@46Y-wvaUJZwd32mRqrRix.md +++ b/src/data/roadmaps/leetcode/content/word-search-ii@46Y-wvaUJZwd32mRqrRix.md @@ -5,5 +5,5 @@ Given a board of characters and a list of words, return all words that exist in Visit the following resources to learn more: - [@article@Word Search II](https://leetcode.com/problems/word-search-ii/) -- [@video@[Java] Leetcode 212. Word Search II [Backtracking #12]](https://www.youtube.com/watch?v=IryjR5DteW4) +- [@video@\[Java\] Leetcode 212. Word Search II \[Backtracking #12\]](https://www.youtube.com/watch?v=IryjR5DteW4) - [@video@Word Search II | DFS + Map | DFS + TRIE | Leetcode #212](https://www.youtube.com/watch?v=EmvsBM7o-5k) \ No newline at end of file