diff --git a/src/problem1/README.md b/src/problem1/README.md
new file mode 100644
index 0000000000..22912055a4
--- /dev/null
+++ b/src/problem1/README.md
@@ -0,0 +1,39 @@
+# Problem 1: Sum to N
+
+This folder contains three unique JavaScript implementations of a function that calculates the summation of numbers from 1 to `n`.
+
+## Implementations
+
+### Implementation A: Iterative Approach
+- **Function:** `sum_to_n_a(n)`
+- **Logic:** Uses a simple `for` loop to iterate from 1 to `n`, cumulatively adding each number to a sum variable.
+- **Time Complexity:** O(n)
+- **Space Complexity:** O(1)
+
+### Implementation B: Mathematical Formula
+- **Function:** `sum_to_n_b(n)`
+- **Logic:** Uses the arithmetic progression sum formula `n * (n + 1) / 2` to compute the sum directly. This is the most optimal approach.
+- **Time Complexity:** O(1)
+- **Space Complexity:** O(1)
+
+### Implementation C: Recursive Approach
+- **Function:** `sum_to_n_c(n)`
+- **Logic:** Recursively adds the current `n` to the summation of numbers up to `n - 1`. It uses a base case of `n <= 1` to terminate the recursion.
+- **Time Complexity:** O(n)
+- **Space Complexity:** O(n) due to the call stack overhead.
+
+## How to Run
+
+You will need [Node.js](https://nodejs.org/) installed on your machine to execute the JavaScript file.
+
+1. Open your terminal.
+2. Navigate to this directory (`src/problem1`) if you aren't already there:
+ ```bash
+ cd src/problem1
+ ```
+3. Run the script using Node.js:
+ ```bash
+ node index.js
+ ```
+
+By default, the script will output the summation of numbers up to `10` for all three implementations (which is `55`). You can modify the `console.log()` statements at the bottom of `index.js` to test different values of `n`.
diff --git a/src/problem1/index.js b/src/problem1/index.js
new file mode 100644
index 0000000000..db4ecab3c3
--- /dev/null
+++ b/src/problem1/index.js
@@ -0,0 +1,38 @@
+/**
+ * Iterative approach using a loop
+ * Logic: Initializes a sum variable and adds every integer from 1 to n.
+ * Time Complexity: O(n), Space Complexity: O(1)
+ */
+var sum_to_n_a = function (n) {
+ let sum = 0;
+ for (let i = 1; i <= n; i++) {
+ sum += i;
+ }
+ return sum;
+};
+
+/**
+ * Mathematical formula approach
+ * Logic: Uses the arithmetic progression sum formula n * (n + 1) / 2.
+ * Time Complexity: O(1), Space Complexity: O(1)
+ */
+var sum_to_n_b = function(n) {
+ return (n * (n + 1)) / 2;
+};
+
+/**
+ * Recursive approach
+ * Logic: Recursively adds the current n to the sum of numbers up to n - 1.
+ * Time Complexity: O(n), Space Complexity: O(n) due to call stack
+ */
+var sum_to_n_c = function(n) {
+ if (n <= 1) {
+ return n; // Handles base case
+ }
+ return n + sum_to_n_c(n - 1);
+};
+
+
+console.log(sum_to_n_a(10));
+console.log(sum_to_n_b(10));
+console.log(sum_to_n_c(10));
diff --git a/src/problem1/task.md b/src/problem1/task.md
new file mode 100644
index 0000000000..2a78244ef3
--- /dev/null
+++ b/src/problem1/task.md
@@ -0,0 +1,23 @@
+# Task
+
+Provide 3 unique implementations of the following function in JavaScript.
+
+**Input**: `n` - any integer
+
+*Assuming this input will always produce a result lesser than `Number.MAX_SAFE_INTEGER`*.
+
+**Output**: `return` - summation to `n`, i.e. `sum_to_n(5) === 1 + 2 + 3 + 4 + 5 === 15`.
+
+```jsx
+var sum_to_n_a = function(n) {
+ // your code here
+};
+
+var sum_to_n_b = function(n) {
+ // your code here
+};
+
+var sum_to_n_c = function(n) {
+ // your code here
+};
+```
\ No newline at end of file
diff --git a/src/problem2/.gitignore b/src/problem2/.gitignore
new file mode 100644
index 0000000000..a547bf36d8
--- /dev/null
+++ b/src/problem2/.gitignore
@@ -0,0 +1,24 @@
+# Logs
+logs
+*.log
+npm-debug.log*
+yarn-debug.log*
+yarn-error.log*
+pnpm-debug.log*
+lerna-debug.log*
+
+node_modules
+dist
+dist-ssr
+*.local
+
+# Editor directories and files
+.vscode/*
+!.vscode/extensions.json
+.idea
+.DS_Store
+*.suo
+*.ntvs*
+*.njsproj
+*.sln
+*.sw?
diff --git a/src/problem2/README.md b/src/problem2/README.md
new file mode 100644
index 0000000000..240103d415
--- /dev/null
+++ b/src/problem2/README.md
@@ -0,0 +1,40 @@
+# Fancy Currency Swap Form
+
+A highly optimized, accessible, and responsive Currency Swap UI built with React, TypeScript, and Tailwind CSS.
+
+
+
+## Features
+
+- **Modern UI/UX**: Sleek, fully responsive design with Light/Dark mode support seamlessly adapting to system preferences.
+- **Glassmorphism Design**: Uses backdrop filters and transparent surfaces for a modern, premium aesthetic.
+- **Custom Accessible Dropdown**:
+ - Implements a custom `` component that acts like a native `