| # | Title | Solutions | Video | Difficulty | Tag

|------|---------------------------------------------------------------------------------------------------------------------------------------------------------------------|-----------------------------------------------------------------------------------------------------------------------------------|-------------------------------------------------------------------------------|------------|----------------------------------------------------------------------

| 3239|[Minimum Number of Flips to Make Binary Grid Palindromic I](https://leetcode.com/problems/minimum-number-of-flips-to-make-binary-grid-palindromic-i/)|[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3239.java)|| Easy|

| 3238|[Find the Number of Winning Players](https://leetcode.com/problems/find-the-number-of-winning-players/)|[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3238.java)|| Easy|

| 3237|[Alt and Tab Simulation](https://leetcode.com/problems/alt-and-tab-simulation/)|[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3237.java)|| Medium|

| 3234 |[Count the Number of Substrings With Dominant Ones](https://leetcode.com/problems/count-the-number-of-substrings-with-dominant-ones/) |[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3234.java) | | Medium | Sliding Window

packagecom.fishercoder.solutions.fourththousand;

publicclass_3239 {

publicstaticclassSolution1 {

publicintminFlips(int[][]grid) {

intm =grid.length;

intn =grid[0].length;

intans =m *n;

intflips =0;

for (inti =0;i <m;i++) {

for (intleft =0,right =n -1;left <right;left++,right--) {

if (grid[i][left] !=grid[i][right]) {

flips++;

}

}

}

ans =Math.min(ans,flips);

flips =0;

for (intj =0;j <n;j++) {

for (inttop =0,bottom =m -1;top <bottom;top++,bottom--) {

if (grid[top][j] !=grid[bottom][j]) {

flips++;

}

}

}

ans =Math.min(flips,ans);

returnans;

}

}

}