Merge pull request neetcode-gh#2233 from vorenusCoA/main

Adding 0441-arranging-coins.java

Author: tahsintunan

README.md

@@ -143,7 +143,7 @@ If you would like to have collaborator permissions on the repo to merge your own
 <sub>[0704 - Binary Search](https://leetcode.com/problems/binary-search/)</sub> | <sub><div align='center'>[✔️](c%2F0704-binary-search.c)</div></sub> | <sub><div align='center'>[✔️](cpp%2F0704-binary-search.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F0704-binary-search.cs)</div></sub> | <sub><div align='center'>[✔️](dart%2F0704-binary-search.dart)</div></sub> | <sub><div align='center'>[✔️](go%2F0704-binary-search.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0704-binary-search.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0704-binary-search.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0704-binary-search.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0704-binary-search.py)</div></sub> | <sub><div align='center'>[✔️](ruby%2F0704-binary-search.rb)</div></sub> | <sub><div align='center'>[✔️](rust%2F0704-binary-search.rs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](swift%2F0704-binary-search.swift)</div></sub> | <sub><div align='center'>[✔️](typescript%2F0704-binary-search.ts)</div></sub>
 <sub>[0035 - Search Insert Position](https://leetcode.com/problems/search-insert-position/)</sub> | <sub><div align='center'>[✔️](c%2F0035-search-insert-position.c)</div></sub> | <sub><div align='center'>[✔️](cpp%2F0035-search-insert-position.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F0035-search-insert-position.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0035-search-insert-position.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0035-search-insert-position.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0035-search-insert-position.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0035-search-insert-position.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0035-search-insert-position.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](swift%2F0035-search-insert-position.swift)</div></sub> | <sub><div align='center'>❌</div></sub>
 <sub>[0374 - Guess Number Higher Or Lower](https://leetcode.com/problems/guess-number-higher-or-lower/)</sub> | <sub><div align='center'>[✔️](c%2F0374-guess-number-higher-or-lower.c)</div></sub> | <sub><div align='center'>[✔️](cpp%2F0374-guess-number-higher-or-lower.cpp)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0374-guess-number-higher-or-lower.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0374-guess-number-higher-or-lower.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0374-guess-number-higher-or-lower.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0374-guess-number-higher-or-lower.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0374-guess-number-higher-or-lower.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](swift%2F0374-guess-number-higher-or-lower.swift)</div></sub> | <sub><div align='center'>❌</div></sub>
-<sub>[0441 - Arranging Coins](https://leetcode.com/problems/arranging-coins/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](cpp%2F0441-arranging-coins.cpp)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0441-arranging-coins.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0441-arranging-coins.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub>
+<sub>[0441 - Arranging Coins](https://leetcode.com/problems/arranging-coins/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](cpp%2F0441-arranging-coins.cpp)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](java%2F0441-arranging-coins.java)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0441-arranging-coins.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0441-arranging-coins.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub>
 <sub>[0977 - Squares of a Sorted Array](https://leetcode.com/problems/squares-of-a-sorted-array/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](cpp%2F0977-squares-of-a-sorted-array.cpp)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0977-squares-of-a-sorted-array.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0977-squares-of-a-sorted-array.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0977-squares-of-a-sorted-array.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0977-squares-of-a-sorted-array.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0977-squares-of-a-sorted-array.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](typescript%2F0977-squares-of-a-sorted-array.ts)</div></sub>
 <sub>[0367 - Valid Perfect Square](https://leetcode.com/problems/valid-perfect-square/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](cpp%2F0367-valid-perfect-square.cpp)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](javascript%2F0367-valid-perfect-square.js)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](python%2F0367-valid-perfect-square.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](swift%2F0367-valid-perfect-square.swift)</div></sub> | <sub><div align='center'>❌</div></sub>
 <sub>[0074 - Search a 2D Matrix](https://leetcode.com/problems/search-a-2d-matrix/)</sub> | <sub><div align='center'>[✔️](c%2F0074-search-a-2d-matrix.c)</div></sub> | <sub><div align='center'>[✔️](cpp%2F0074-search-a-2d-matrix.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F0074-search-a-2d-matrix.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0074-search-a-2d-matrix.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0074-search-a-2d-matrix.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0074-search-a-2d-matrix.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0074-search-a-2d-matrix.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0074-search-a-2d-matrix.py)</div></sub> | <sub><div align='center'>[✔️](ruby%2F0074-search-a-2d-matrix.rb)</div></sub> | <sub><div align='center'>[✔️](rust%2F0074-search-a-2d-matrix.rs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](swift%2F0074-search-a-2d-matrix.swift)</div></sub> | <sub><div align='center'>[✔️](typescript%2F0074-search-a-2d-matrix.ts)</div></sub>

java/0441-arranging-coins.java

@@ -0,0 +1,22 @@
+class Solution {
+    public int arrangeCoins(int n) {
+        
+        int completedRows = 0;
+        long left = 1;
+        long right = n;
+        while (left <= right) {
+
+            int mid = (int) ((left + right) / 2);
+            long coins = (long) ((mid / 2.0) * (mid + 1));
+            if (coins > n) {
+                right = mid - 1;
+            } else {
+                completedRows = Math.max(completedRows, mid);
+                left = mid + 1;
+            }
+            
+        }
+
+        return completedRows;
+    }
+}