diff --git a/Program-28/Bin Packing Problem.cpp b/Program-28/Bin Packing Problem.cpp
new file mode 100644
index 00000000..8f59d0cb
--- /dev/null
+++ b/Program-28/Bin Packing Problem.cpp	
@@ -0,0 +1,36 @@
+// C++ program to find number of bins required using
+// next fit algorithm.
+#include <bits/stdc++.h>
+using namespace std;
+
+// Returns number of bins required using next fit
+// online algorithm
+int nextFit(int weight[], int n, int c)
+{
+	// Initialize result (Count of bins) and remaining
+	// capacity in current bin.
+	int res = 0, bin_rem = c;
+
+	// Place items one by one
+	for (int i = 0; i < n; i++) {
+		// If this item can't fit in current bin
+		if (weight[i] > bin_rem) {
+			res++; // Use a new bin
+			bin_rem = c - weight[i];
+		}
+		else
+			bin_rem -= weight[i];
+	}
+	return res;
+}
+
+// Driver program
+int main()
+{
+	int weight[] = { 2, 5, 4, 7, 1, 3, 8 };
+	int c = 10;
+	int n = sizeof(weight) / sizeof(weight[0]);
+	cout << "Number of bins required in Next Fit : "
+		<< nextFit(weight, n, c);
+	return 0;
+}
diff --git a/Program-28/Readme.md b/Program-28/Readme.md
new file mode 100644
index 00000000..33513f47
--- /dev/null
+++ b/Program-28/Readme.md
@@ -0,0 +1,18 @@
+Given n items of different weights and bins each of capacity c, assign each item to a bin such that number of total used bins is minimized. It may be assumed that all items have weights smaller than bin capacity.
+
+
+Example:
+Input:  weight[]       = {4, 8, 1, 4, 2, 1}
+        Bin Capacity c = 10
+Output: 2
+We need minimum 2 bins to accommodate all items
+First bin contains {4, 4, 2} and second bin {8, 1, 1}
+
+Input:  weight[]       = {9, 8, 2, 2, 5, 4}
+        Bin Capacity c = 10
+Output: 4
+We need minimum 4 bins to accommodate all items.  
+
+Input:  weight[]       = {2, 5, 4, 7, 1, 3, 8}; 
+        Bin Capacity c = 10
+Output: 3
\ No newline at end of file
diff --git a/Python/Program-36/Program-36.py b/Python/Program-36/Program-36.py
new file mode 100644
index 00000000..4b2d10dd
--- /dev/null
+++ b/Python/Program-36/Program-36.py
@@ -0,0 +1,36 @@
+#WAP TO REVERSING A LIST IN PYTHON
+
+#METHOD-01:
+
+# Reversing a list using reversed()
+def Reverse(lst):
+    return [ele for ele in reversed(lst)]
+      
+# Driver Code
+lst = [10, 11, 12, 13, 14, 15]
+print(Reverse(lst))
+
+
+#METHOD-02:
+
+# Reversing a list using reverse()
+def Reverse(lst):
+    lst.reverse()
+    return lst
+      
+lst = [10, 11, 12, 13, 14, 15]
+print(Reverse(lst))
+
+
+METHOD-03:
+
+# Reversing a list using slicing technique
+def Reverse(lst):
+    new_lst = lst[::-1]
+    return new_lst
+      
+lst = [10, 11, 12, 13, 14, 15]
+print(Reverse(lst))
+
+
+#END
diff --git a/Python/Program-36/README.md b/Python/Program-36/README.md
new file mode 100644
index 00000000..bd3e7e73
--- /dev/null
+++ b/Python/Program-36/README.md
@@ -0,0 +1 @@
+THIS IS THE PYTHON BASED CODES WHICH HELPS YOU TO REVERSE A LIST FROM 3 DIFFERENT METHODS
diff --git a/Python/README.md b/Python/README.md
index b7e94009..e44831be 100644
--- a/Python/README.md
+++ b/Python/README.md
@@ -37,7 +37,7 @@
 | [Program-33](https://github.com/swaaz/basicprograms/blob/814a1e60ae23d81158d8174666f23c9b7419e15e/Python/Program33/Program33.py) | Program to find HCF
 | [Program-34](https://github.com/swaaz/basicprograms/blob/814a1e60ae23d81158d8174666f23c9b7419e15e/Python/Program34/Program34.py) |  Program to display calender
 | [Program-35](https://github.com/swaaz/basicprograms/blob/814a1e60ae23d81158d8174666f23c9b7419e15e/Python/Program%2035/Program35.py) | Program to search an element in a Circular Linked List
-| Program-36 | - |
+| [Program-36](https://github.com/swaaz/basicprograms/blob/814a1e60ae23d81158d8174666f23c9b7419e15e/Python/Program-36/Program-36.py) | Program to Reverse a list
 | Program-37 | - |
 | Program-38 | - |
 | Program-39 | - |