Add Fibonacci implementation with memoization

pradeepkumar24rk · pradeepkumar24rk · commit 7f98dfd8490f · 2026-03-21T12:13:15.000+05:30
diff --git a/DynamicProgramming/Fibnocci.java b/DynamicProgramming/Fibnocci.java
@@ -0,0 +1,26 @@
+package DynamicProgramming;
+
+import java.util.*;
+
+public class Fibnocci {
+    public static void main(String[] args) {
+        int n = 10;
+        HashMap<Integer, Integer> memo = new HashMap<>();
+        int result = fib(n, memo);
+        System.out.println("The " + n + "th Fibonacci number is: " + result);
+    }
+
+    public static int fib(int n, HashMap<Integer, Integer> memo) {
+        if (n <= 1)
+            return n;
+
+        if (memo.containsKey(n)) {
+            return memo.get(n);
+        }
+
+        int val = fib(n - 1, memo) + fib(n - 2, memo);
+        memo.put(n, val);
+
+        return val;
+    }
+}
