diff --git a/Recursive/WaterJugProblem.js b/Recursive/WaterJugProblem.js
new file mode 100644
index 0000000000..348d9684f9
--- /dev/null
+++ b/Recursive/WaterJugProblem.js
@@ -0,0 +1,53 @@
+// WaterJugProblem.js
+
+export function canMeasureWater(jug1Capacity, jug2Capacity, targetAmount) {
+ // Input validation
+ if (jug1Capacity < 0 || jug2Capacity < 0) {
+ throw new Error("Invalid input: capacities must be non-negative.");
+ }
+ if (targetAmount < 0) {
+ throw new Error("Invalid input: target amount must be non-negative.");
+ }
+
+ // Base case: If the target amount is greater than the sum of both jugs, it's not possible.
+ if (targetAmount > jug1Capacity + jug2Capacity) return false;
+
+ // Use BFS to explore possible states.
+ let visited = new Set(); // To keep track of visited states.
+ let queue = [[0, 0]]; // Starting with both jugs empty.
+
+ while (queue.length > 0) {
+ let [jug1, jug2] = queue.shift();
+
+ // If we've reached the target amount in either jug.
+ if (
+ jug1 === targetAmount ||
+ jug2 === targetAmount ||
+ jug1 + jug2 === targetAmount
+ ) {
+ return true;
+ }
+
+ // If this state has been visited, skip it.
+ let state = `${jug1},${jug2}`;
+ if (visited.has(state)) continue;
+ visited.add(state);
+
+ // Add all possible next states to the queue:
+ queue.push([jug1Capacity, jug2]); // Fill Jug 1
+ queue.push([jug1, jug2Capacity]); // Fill Jug 2
+ queue.push([0, jug2]); // Empty Jug 1
+ queue.push([jug1, 0]); // Empty Jug 2
+ queue.push([
+ Math.max(0, jug1 - (jug2Capacity - jug2)),
+ Math.min(jug2Capacity, jug1 + jug2),
+ ]); // Pour Jug 1 into Jug 2
+ queue.push([
+ Math.min(jug1Capacity, jug1 + jug2),
+ Math.max(0, jug2 - (jug1Capacity - jug1)),
+ ]); // Pour Jug 2 into Jug 1
+ }
+
+ // If no solution is found
+ return false;
+}
diff --git a/Recursive/test/WaterJugProblem.test.js b/Recursive/test/WaterJugProblem.test.js
new file mode 100644
index 0000000000..7f068e4d40
--- /dev/null
+++ b/Recursive/test/WaterJugProblem.test.js
@@ -0,0 +1,36 @@
+// WaterJugProblem.test.js
+import { canMeasureWater } from "../WaterJugProblem"; // Adjust the path as necessary
+
+describe("Water Jug Problem", () => {
+ it("should return true for values jug1=3, jug2=5, target=4", () => {
+ expect(canMeasureWater(3, 5, 4)).toBe(true);
+ });
+
+ it("should return false for values jug1=2, jug2=6, target=5", () => {
+ expect(canMeasureWater(2, 6, 5)).toBe(false);
+ });
+
+ it("should return true for values jug1=5, jug2=3, target=5", () => {
+ expect(canMeasureWater(5, 3, 5)).toBe(true);
+ });
+
+ it("should return true for values jug1=3, jug2=5, target=0", () => {
+ expect(canMeasureWater(3, 5, 0)).toBe(true);
+ });
+
+ it("should return true for values jug1=3, jug2=5, target=8", () => {
+ expect(canMeasureWater(3, 5, 8)).toBe(true);
+ });
+
+ it("should throw an error for invalid input", () => {
+ expect(() => canMeasureWater(-1, 5, 3)).toThrow(
+ "Invalid input: capacities must be non-negative."
+ );
+ expect(() => canMeasureWater(3, -2, 1)).toThrow(
+ "Invalid input: capacities must be non-negative."
+ );
+ expect(() => canMeasureWater(3, 5, -1)).toThrow(
+ "Invalid input: target amount must be non-negative."
+ );
+ });
+});
pFad - Phonifier reborn
Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.
Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.
Alternative Proxies:
Alternative Proxy
pFad Proxy
pFad v3 Proxy
pFad v4 Proxy