< Summary

Information
Class: LeetCode.Algorithms.FlipSquareSubmatrixVertically.FlipSquareSubmatrixVerticallySimulation
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\FlipSquareSubmatrixVertically\FlipSquareSubmatrixVerticallySimulation.cs
Line coverage
100%
Covered lines: 16
Uncovered lines: 0
Coverable lines: 16
Total lines: 47
Line coverage: 100%
Branch coverage
100%
Covered branches: 4
Total branches: 4
Branch coverage: 100%
Method coverage

Feature is only available for sponsors

Upgrade to PRO version

Metrics

MethodBranch coverage Crap Score Cyclomatic complexity Line coverage
ReverseSubmatrix(...)100%44100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\FlipSquareSubmatrixVertically\FlipSquareSubmatrixVerticallySimulation.cs

#LineLine coverage
 1// --------------------------------------------------------------------------------
 2// Copyright (C) 2026 Eugene Eremeev (also known as Yevhenii Yeriemeieiv).
 3// All Rights Reserved.
 4// --------------------------------------------------------------------------------
 5// This software is the confidential and proprietary information of Eugene Eremeev
 6// (also known as Yevhenii Yeriemeieiv) ("Confidential Information"). You shall not
 7// disclose such Confidential Information and shall use it only in accordance with
 8// the terms of the license agreement you entered into with Eugene Eremeev (also
 9// known as Yevhenii Yeriemeieiv).
 10// --------------------------------------------------------------------------------
 11
 12namespace LeetCode.Algorithms.FlipSquareSubmatrixVertically;
 13
 14/// <inheritdoc />
 15public sealed class FlipSquareSubmatrixVerticallySimulation : IFlipSquareSubmatrixVertically
 16{
 17    /// <summary>
 18    ///     Time complexity - O(k^2)
 19    ///     Space complexity - O(1)
 20    /// </summary>
 21    /// <param name="grid"></param>
 22    /// <param name="x"></param>
 23    /// <param name="y"></param>
 24    /// <param name="k"></param>
 25    /// <returns></returns>
 26    public int[][] ReverseSubmatrix(int[][] grid, int x, int y, int k)
 527    {
 528        var endRow = x + k - 1;
 529        var endColumn = y + k;
 30
 3231        for (var j = y; j < endColumn; j++)
 1132        {
 1133            var left = x;
 1134            var right = endRow;
 35
 2136            while (left < right)
 1037            {
 1038                (grid[left][j], grid[right][j]) = (grid[right][j], grid[left][j]);
 39
 1040                left++;
 1041                right--;
 1042            }
 1143        }
 44
 545        return grid;
 546    }
 47}