951. Flip Equivalent Binary Trees
951. Flip Equivalent Binary Trees
Description
For a binary tree T , we can define a flip operation as follows: choose any node, and swap the left and right child subtrees.
100. Same Tree
1660. Correct a Binary Tree
3187. Peaks in Array
3185. Count Pairs That Form a Complete Day II
3185. Count Pairs That Form a Complete Day II
Description
Given an integer array hours representing times in hours , return an integer denoting the number of pairs i, j where i < j and hours[i] + hours[j] forms a complete day .
3184. Count Pairs That Form a Complete Day I
3184. Count Pairs That Form a Complete Day I
Description
Given an integer array hours representing times in hours , return an integer denoting the number of pairs i, j where i < j and hours[i] + hours[j] forms a complete day .