From 84177239e95da8cdbbaa65e5651d0f3e6d312ab8 Mon Sep 17 00:00:00 2001
From: Edmund Amankwah <edmund_amankwah@yahoo.com>
Date: Tue, 22 Jun 2021 16:48:27 -0400
Subject: [PATCH] renamed files in issues section

---
 algorithms/dynamic-programming/EDIST.java     | 2 +-
 algorithms/dynamic-programming/fibonacci.java | 2 +-
 2 files changed, 2 insertions(+), 2 deletions(-)

diff --git a/algorithms/dynamic-programming/EDIST.java b/algorithms/dynamic-programming/EDIST.java
index 24913b3..796e33d 100644
--- a/algorithms/dynamic-programming/EDIST.java
+++ b/algorithms/dynamic-programming/EDIST.java
@@ -1,7 +1,7 @@
 
 // A Naive recursive Java program to find minimum number 
 // operations to convert str1 to str2 
-class EDIST {
+class Edist {
     static int min(int x, int y, int z) {
         if (x <= y && x <= z)
             return x;
diff --git a/algorithms/dynamic-programming/fibonacci.java b/algorithms/dynamic-programming/fibonacci.java
index ab5ce49..9282962 100644
--- a/algorithms/dynamic-programming/fibonacci.java
+++ b/algorithms/dynamic-programming/fibonacci.java
@@ -1,6 +1,6 @@
 
 // Fibonacci Series using Dynamic Programming 
-class fibonacci {
+class Fibonacci {
     static int fib(int n) {
         /* Declare an array to store Fibonacci numbers. */
         int f[] = new int[n + 2]; // 1 extra to handle case, n = 0