[Optimized the result]: Have implemented the program to find the complete arranging coins.

Author: rajgohil07

.idea/workspace.xml

@@ -22,19 +22,21 @@ public class ArrangingCoins {
     public static void main(String[] args) {
         // Initialization.
         int n = 5;
+        int temp=n;
         int incrementer = 1;
 
         // Logic.
         while (n > 0) {
             n = n - incrementer;
             incrementer++;
         }
-        incrementer--;
         if (n < 0) {
-            incrementer--;
+            incrementer -= 2;
+        } else {
+            incrementer -= 1;
         }
 
         // Display the result.
-        System.out.println("incrementer = " + incrementer);
+        System.out.println(incrementer + " perfect rows can be created with the " + temp + " coins.");
     }
 }