diff --git a/Dynamic-Programming/WeightedIntervalScheduling.js b/Dynamic-Programming/WeightedIntervalScheduling.js
new file mode 100644
index 0000000000..39f1624384
--- /dev/null
+++ b/Dynamic-Programming/WeightedIntervalScheduling.js
@@ -0,0 +1,68 @@
+/**
+ * Solves the Weighted Interval Scheduling problem.
+ *
+ * Given intervals with start time, end time, and profit,
+ * returns the maximum profit such that no intervals overlap.
+ *
+ * Uses Dynamic Programming + Binary Search.
+ *
+ * Time Complexity: O(n log n)
+ * Space Complexity: O(n)
+ *
+ * @param {{start:number, end:number, profit:number}[]} intervals
+ * @returns {number}
+ */
+
+const weightedIntervalScheduling = (intervals) => {
+  if (!Array.isArray(intervals)) {
+    throw new Error('Input must be an array of intervals')
+  }
+
+  if (intervals.length === 0) return 0
+
+  intervals.sort((a, b) => a.end - b.end)
+
+  const n = intervals.length
+  const dp = Array(n).fill(0)
+
+  dp[0] = intervals[0].profit
+
+  const findLastNonOverlapping = (index) => {
+    let left = 0
+    let right = index - 1
+
+    while (left <= right) {
+      const mid = Math.floor((left + right) / 2)
+
+      if (intervals[mid].end <= intervals[index].start) {
+        if (
+          mid + 1 <= right &&
+          intervals[mid + 1].end <= intervals[index].start
+        ) {
+          left = mid + 1
+        } else {
+          return mid
+        }
+      } else {
+        right = mid - 1
+      }
+    }
+
+    return -1
+  }
+
+  for (let i = 1; i < n; i++) {
+    let includeProfit = intervals[i].profit
+    const lastIndex = findLastNonOverlapping(i)
+
+    if (lastIndex !== -1) {
+      includeProfit += dp[lastIndex]
+    }
+
+    dp[i] = Math.max(dp[i - 1], includeProfit)
+  }
+
+  return dp[n - 1]
+}
+
+export { weightedIntervalScheduling }
diff --git a/Dynamic-Programming/tests/WeightedIntervalScheduling.test.js b/Dynamic-Programming/tests/WeightedIntervalScheduling.test.js
new file mode 100644
index 0000000000..4260522a53
--- /dev/null
+++ b/Dynamic-Programming/tests/WeightedIntervalScheduling.test.js
@@ -0,0 +1,30 @@
+import { weightedIntervalScheduling } from '../WeightedIntervalScheduling'
+
+test('basic weighted interval scheduling', () => {
+  const intervals = [
+    { start: 1, end: 3, profit: 5 },
+    { start: 2, end: 5, profit: 6 },
+    { start: 4, end: 6, profit: 5 },
+    { start: 6, end: 7, profit: 4 },
+    { start: 5, end: 8, profit: 11 },
+    { start: 7, end: 9, profit: 2 }
+  ]
+
+  expect(weightedIntervalScheduling(intervals)).toBe(17)
+})
+
+test('empty intervals', () => {
+  expect(weightedIntervalScheduling([])).toBe(0)
+})
+
+test('single interval', () => {
+  expect(weightedIntervalScheduling([{ start: 1, end: 2, profit: 10 }])).toBe(
+    10
+  )
+})
+
+test('throws error for invalid input', () => {
+  expect(() => weightedIntervalScheduling(null)).toThrow(
+    'Input must be an array of intervals'
+  )
+})