[LEET-3477] add 3477

Author: fishercoder1534

paginated_contents/algorithms/4th_thousand/README.md

@@ -2,6 +2,7 @@
 |------|---------------------------------------------------------------------------------------------------------------------------------------------------------------------|-----------------------------------------------------------------------------------------------------------------------------------|-------------------------------------------------------------------------------|------------|----------------------------------------------------------------------
 | 3502 | [Minimum Cost to Reach Every Position](https://leetcode.com/problems/minimum-cost-to-reach-every-position/)                                                               | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3502.java) |                                                                               | Easy       |
 | 3491 | [Phone Number Prefix](https://leetcode.com/problems/phone-number-prefix/)                                                               | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3491.java) |                                                                               | Easy       |
+| 3477 | [Fruits Into Baskets II](https://leetcode.com/problems/fruits-into-baskets-ii/)                                                               | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3477.java) |                                                                               | Easy       |
 | 3471 | [Find the Largest Almost Missing Integer](https://leetcode.com/problems/find-the-largest-almost-missing-integer/)                                                               | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3471.java) |                                                                               | Easy       |
 | 3402 | [Minimum Operations to Make Columns Strictly Increasing](https://leetcode.com/problems/minimum-operations-to-make-columns-strictly-increasing/)                                                               | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3402.java) |                                                                               | Easy       |
 | 3396 | [Minimum Number of Operations to Make Elements in Array Distinct](https://leetcode.com/problems/minimum-number-of-operations-to-make-elements-in-array-distinct/)                                                               | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3396.java) |                                                                               | Easy       |

src/main/java/com/fishercoder/solutions/fourththousand/_3477.java

@@ -0,0 +1,24 @@
+package com.fishercoder.solutions.fourththousand;
+
+public class _3477 {
+    public static class Solution1 {
+        public int numOfUnplacedFruits(int[] fruits, int[] baskets) {
+            for (int i = 0; i < fruits.length; i++) {
+                for (int j = 0; j < baskets.length; j++) {
+                    if (fruits[i] <= baskets[j]) {
+                        baskets[j] = -1;
+                        fruits[i] = -1;
+                        break;
+                    }
+                }
+            }
+            int count = 0;
+            for (int i = 0; i < fruits.length; i++) {
+                if (fruits[i] > -1) {
+                    count++;
+                }
+            }
+            return count;
+        }
+    }
+}