@@ -0,0 +1,12 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<module type="JAVA_MODULE" version="4">
+  <component name="NewModuleRootManager" inherit-compiler-output="true">
+    <exclude-output />
+    <content url="file://$MODULE_DIR$">
+      <sourceFolder url="file://$MODULE_DIR$/src" isTestSource="false" />
+    </content>
+    <orderEntry type="inheritedJdk" />
+    <orderEntry type="sourceFolder" forTests="false" />
+  </component>
+</module>
+
@@ -0,0 +1,27 @@
+package com.company;
+
+import java.util.*;
+
+// https://www.geeksforgeeks.org/greedy-algorithm-to-find-minimum-number-of-coins/
+
+public class Main {
+
+    private int[] deno = { 1, 2, 5, 10, 20, 50, 100, 500, 1000 };
+    private int n = deno.length;
+
+    public void minimumCoins(int sum){
+
+        ArrayList<Integer> coins = new ArrayList<>();
+
+        for(int i=n-1;i>=0;i--){
+            if(sum > deno[i]){
+                coins.add(deno[i]);
+                sum -= deno[i];
+            }
+        }
+
+        for(int i=0;i<coins.size();i++)
+            System.out.print(coins.get(i)+" ");
+        
+    }
+}