From 6e07cdb282fa622e15935fcf91b4392653ae7620 Mon Sep 17 00:00:00 2001
From: "github-actions[bot]"
 <41898282+github-actions[bot]@users.noreply.github.com>
Date: Thu, 16 Apr 2026 12:24:42 +0200
Subject: [PATCH] chore: sync content to repo (#9860)

Co-authored-by: kamranahmedse <4921183+kamranahmedse@users.noreply.github.com>
---
 .../leetcode/content/two-sum@XbfUbWaGtpcEGa31QyrXN.md      | 7 +++++++
 1 file changed, 7 insertions(+)
 create mode 100644 src/data/roadmaps/leetcode/content/two-sum@XbfUbWaGtpcEGa31QyrXN.md

diff --git a/src/data/roadmaps/leetcode/content/two-sum@XbfUbWaGtpcEGa31QyrXN.md b/src/data/roadmaps/leetcode/content/two-sum@XbfUbWaGtpcEGa31QyrXN.md
new file mode 100644
index 000000000..c5bc6a643
--- /dev/null
+++ b/src/data/roadmaps/leetcode/content/two-sum@XbfUbWaGtpcEGa31QyrXN.md
@@ -0,0 +1,7 @@
+# Two Sum
+
+The Two Sum problem asks you to find two numbers within an array that, when added together, equal a specific target value. You are typically given an array of integers and a target integer. The goal is to return the indices of the two numbers that sum up to the target. It's often assumed that each input array will have exactly one solution, and you cannot use the same element twice.
+
+Visit the following resources to learn more:
+
+- [@official@Two Sum](https://leetcode.com/problems/two-sum/description/)
\ No newline at end of file