3251. Find the Count of Monotonic Pairs II
3251. Find the Count of Monotonic Pairs II
Description
You are given an array of positive integers nums of length n.
3250. Find the Count of Monotonic Pairs I
3250. Find the Count of Monotonic Pairs I
Description
You are given an array of positive integers nums of length n.
3249. Count the Number of Good Nodes
3249. Count the Number of Good Nodes
Description
There is an undirected tree with n nodes labeled from 0 to n - 1, and rooted at node 0. You are given a 2D integer array edges of length n - 1, where edges[i] = [ai, bi] indicates that there is an edge between nodes ai and bi in the tree.
3244. Shortest Distance After Road Addition Queries II
3244. Shortest Distance After Road Addition Queries II
Description
You are given an integer n and a 2D integer array queries.
3243. Shortest Distance After Road Addition Queries I
3243. Shortest Distance After Road Addition Queries I
Description
You are given an integer n and a 2D integer array queries.
3241. Time Taken to Mark All Nodes
3241. Time Taken to Mark All Nodes
Description
There exists an undirected tree with n nodes numbered 0 to n - 1. You are given a 2D integer array edges of length n - 1, where edges[i] = [ui, vi] indicates that there is an edge between nodes ui and vi in the tree.
3240. Minimum Number of Flips to Make Binary Grid Palindromic II
3240. Minimum Number of Flips to Make Binary Grid Palindromic II
Description
You are given an m x n binary matrix grid.
3239. Minimum Number of Flips to Make Binary Grid Palindromic I
3239. Minimum Number of Flips to Make Binary Grid Palindromic I
Description
You are given an m x n binary matrix grid.
3234. Count the Number of Substrings With Dominant Ones
3233. Find the Count of Numbers Which Are Not Special
3233. Find the Count of Numbers Which Are Not Special
Description
You are given 2 positive integers l and r. For any number x, all positive divisors of x except x are called the proper divisors of x.