3241. Time Taken to Mark All Nodes
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
You are given an m x n binary matrix grid.
3239. Minimum Number of Flips to Make Binary Grid Palindromic I
You are given an m x n binary matrix grid.
3233. Find the Count of Numbers Which Are Not Special
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.
416. Partition Equal Subset Sum
Given an integer array nums, return true if you can partition the array into two subsets such that the sum of the elements in both subsets is equal or false otherwise.