From a73a7f24ff5b9bfe4f02a3bdbb1ab19a7f50bab9 Mon Sep 17 00:00:00 2001
From: Anushree1291 <95995815+Anushree1291@users.noreply.github.com>
Date: Sun, 2 Oct 2022 00:43:00 +0530
Subject: [PATCH 1/2] Create FibonacciNumber

---
 FibonacciNumber | 28 ++++++++++++++++++++++++++++
 1 file changed, 28 insertions(+)
 create mode 100644 FibonacciNumber

diff --git a/FibonacciNumber b/FibonacciNumber
new file mode 100644
index 0000000000..2f214a66ad
--- /dev/null
+++ b/FibonacciNumber
@@ -0,0 +1,28 @@
+Leetcode Problem- 509. Fibonacci Number
+Dynamic Programming
+Recursion
+Memonization
+https://leetcode.com/problems/fibonacci-number/
+
+
+class Solution {
+    
+    public int fib(int n) {
+        if(n==0){
+            return 0;
+        }
+        int a[]=new int [n+1];
+        Arrays.fill(a,-1);
+        a[0]=0;
+        a[1]=1;
+        int x=traversal(a,n);
+        //System.out.println()
+        return x;
+    }
+    public int traversal(int[] a,int n){
+        if(a[n]==-1){
+            a[n]=traversal(a,n-1)+traversal(a,n-2);
+        }
+        return a[n];
+    }
+}

From f4a1748e01623783853a4b77395f904765041318 Mon Sep 17 00:00:00 2001
From: Anushree1291 <95995815+Anushree1291@users.noreply.github.com>
Date: Sun, 2 Oct 2022 00:45:26 +0530
Subject: [PATCH 2/2] Create Counting Bits

---
 Counting Bits | 14 ++++++++++++++
 1 file changed, 14 insertions(+)
 create mode 100644 Counting Bits

diff --git a/Counting Bits b/Counting Bits
new file mode 100644
index 0000000000..500d7cb64b
--- /dev/null
+++ b/Counting Bits	
@@ -0,0 +1,14 @@
+Leetcode 338. Counting Bits
+https://leetcode.com/problems/counting-bits/
+Dynamic Programming
+Bit Manipulation
+
+class Solution {
+    public int[] countBits(int n) {
+        int a[]=new int[n+1];
+        for(int i=0;i<=n;i++){
+            a[i]=Integer.bitCount(i);
+        }
+        return a;
+    }
+}