tatsuyax25

/**
 * @param {number[]} nums
 * @return {number}
 */
var maxAscendingSum = function(nums) {
    // Initialize maxSum with the first element of the array
    let maxSum = nums[0];
    // Initialize currentSum with the first element of the array
    let currentSum = nums[0];

tatsuyax25

/**
 * @param {number[]} nums
 * @return {number}
 */
var longestMonotonicSubarray = function(nums) {
     if (nums.length === 0) return 0;

    let maxLength = 1;
    let currentLength = 1;
    let increasing = null;

tatsuyax25

/**
 * @param {number[]} nums
 * @return {boolean}
 */
var check = function(nums) {
    // An empty array is considered sorted and rotated
    if (nums.length === 0) {
        return true;
    }

tatsuyax25

/**
 * @param {number[]} nums
 * @return {boolean}
 */
var isArraySpecial = function(nums) {
    // Loop through the array up to the second last element
    for (let i = 0; i < nums.length - 1; i++) {
        // Check if the current element and the next element have the same parity
        // Parity means being either both even or both odd
        if ((nums[i] % 2) === (nums[i + 1] % 2)) {

tatsuyax25

/**
 * @param {number[][]} grid
 * @return {number}
 */
var largestIsland = function(grid) {
    const n = grid.length;

    // Helper function to perform DFS and mark island cells with a unique island ID
    function dfs(x, y, islandId) {
        const stack = [[x, y]];

tatsuyax25

/**
 * @param {number} n
 * @param {number[][]} edges
 * @return {number}
 */
var magnificentSets = function(n, edges) {
   // Initialize Union-Find structure for connected components
    let uf = new UnionFind(n + 1);
    // Initialize adjacency list for the graph
    let graph = Array(n + 1).fill(0).map(() => []);

tatsuyax25

/**
 * @param {number[][]} edges
 * @return {number[]}
 */

class UnionFind {
    // Constructor to initialize parent and rank arrays.
    constructor(len) {
        // Create parent array where each node is its own parent initially.
        this.parent = Array.from({ length: len + 1 }, (_, i) => i);

tatsuyax25

/**
 * @param {number[][]} grid
 * @return {number}
 */
var findMaxFish = function(grid) {
     // Initialize the maximum fish count as 0
    let maxFish = 0;

    // Get the number of rows and columns in the grid
    const rows = grid.length; 

tatsuyax25

/**
 * @param {number} numCourses
 * @param {number[][]} prerequisites
 * @param {number[][]} queries
 * @return {boolean[]}
 */
function buildGraph(prerequisites) {
    // Initialize an adjacency list to store the graph
    const graph = {};
    for (let [a, b] of prerequisites) {

tatsuyax25

/**
 * @param {number[]} favorite
 * @return {number}
 */
var maximumInvitations = function(favorite) {
    const n = favorite.length;
    let longestCycle = 0; // Variable to track the longest cycle found
    const visit = Array.from({ length: n }, () => false); // Boolean array to track visited nodes
    const len2Cycles = []; // Array to track cycles of length 2