chore: sync content to repo (#9523)

Co-authored-by: kamranahmedse <4921183+kamranahmedse@users.noreply.github.com>

src/data/roadmaps/computer-science/content/a-algorithm@Yrk2PLUa-_FAPlhCkMl3e.md

@@ -7,4 +7,4 @@ Visit the following resources to learn more:
 - [@article@Introduction to the A* Algorithm - Red Blob Games](https://www.redblobgames.com/pathfinding/a-star/introduction.html)
 - [@article@A* Search Algorithm - Wikipedia](https://en.wikipedia.org/wiki/A*_search_algorithm)
 - [@video@A* Pathfinding (E01: algorithm explanation)](https://www.youtube.com/watch?v=-L-WgKMFuhE)
-- [@feed@Explore top posts about Data Science](https://app.daily.dev/tags/data-science?ref=roadmapsh)
+- [@feed@Explore top posts about Data Science](https://app.daily.dev/tags/data-science?ref=roadmapsh)

src/data/roadmaps/computer-science/content/c@n4IsklfYJXFIyF1rGWuEa.md

@@ -4,9 +4,9 @@ C is a general-purpose computer programming language. It was created in the 1970
 
 Visit the following resources to learn more:
 
+- [@book@Beej's Guide to C Programming](https://beej.us/guide/bgc/)
 - [@book@Beej's Guide to C Programming](https://beej.us/guide/bgc/)
 - [@article@Learn C - Tutorials Point](https://www.tutorialspoint.com/cprogramming/index.htm)
 - [@video@C Programming Tutorial for Beginners](https://www.youtube.com/watch?v=KJgsSFOSQv0)
 - [@video@Learn C Programming with Dr. Chuck](https://www.youtube.com/watch?v=j-_s8f5K30I)
-- [@video@C Programming Full Course 2025 (Bro Code)](https://youtu.be/xND0t1pr3KY?si=sy-Xzz7JHMqS6ruA)
-- [@book@Beej's Guide to C Programming](https://beej.us/guide/bgc/)
+- [@video@C Programming Full Course 2025 (Bro Code)](https://youtu.be/xND0t1pr3KY?si=sy-Xzz7JHMqS6ruA)

src/data/roadmaps/computer-science/content/probability@HZ3_xyphbjhBPwwQo_rHH.md

@@ -5,4 +5,4 @@ Probability is the study of how likely an event is to occur. It is a measure of
 Visit the following resources to learn more:
 
 - [@article@Probability - Khan Academy](https://www.khanacademy.org/math/statistics-probability/probability-library)
-- [@video@MIT 6.042J - Probability Introduction](https://www.youtube.com/watch?v=SmFwFdESMHI&index=18&list=PLB7540DEDD482705B)
+- [@video@MIT 6.042J - Probability Introduction](https://www.youtube.com/watch?v=SmFwFdESMHI&index=18&list=PLB7540DEDD482705B)

src/data/roadmaps/computer-science/content/small-o@2cg5PogENPhiYFXQnV9xC.md

@@ -0,0 +1,9 @@
+# Small O Notation
+
+Small o notation, denoted as o(g(n)), defines an upper bound on the growth of a function f(n) that is *not* asymptotically tight. In simpler terms, f(n) is o(g(n)) if, for any positive constant c, there exists a value n₀ such that f(n) is strictly less than c*g(n) for all n greater than n₀. This means that g(n) grows strictly faster than f(n) as n approaches infinity.
+
+Visit the following resources to learn more:
+
+- [@article@Little-o notation | Wikipedia](https://en.wikipedia.org/wiki/Big_O_notation#Little-o_notation)
+- [@article@Difference between Big-O and Little-o Notations](https://www.baeldung.com/cs/big-o-vs-little-o-notation)
+- [@video@The Little o Notation](https://www.youtube.com/watch?v=Hk_AWLNjGLs)

src/data/roadmaps/computer-science/content/small-omega@dUBRG_5aUYlICsjPbRlTf.md

@@ -0,0 +1,8 @@
+# Small Omega
+
+Small Omega (ω) notation is used to describe a lower bound on the growth rate of a function. Specifically, it indicates that a function *g(n)* grows strictly slower than another function *f(n)* as *n* approaches infinity. This means that for any constant *c > 0*, there exists a value *n₀* such that *g(n) < c*f(n)* for all *n > n₀*. In simpler terms, *f(n)* is a strict lower bound for *g(n)*.
+
+Visit the following resources to learn more:
+
+- [@article@Asymptotic Notations](https://learnxinyminutes.com/asymptotic-notation/)
+- [@video@The Little o Notation](https://www.youtube.com/watch?v=XkkZaWikZHU)