## Leaf Equivalent Trees

Given two binary trees root0 and root1, return whether the sequence of leaves left-to-right in both trees are the same.

Given two binary trees root0 and root1, return whether the sequence of leaves left-to-right in both trees are the same.

You are given a list of integers nums, representing the number of chess matches each person has won. Return a relative ranking (0-indexed) of each person. If...

Given an n by n matrix of letters matrix, return whether there are exactly n different letters that appear in the matrix and each letter appears exactly once...

Given a list of integers nums, write a function that returns the largest sum of non-adjacent numbers. Numbers can be 0 or negative.

You are given a list of integers nums and an integer k. Consider an operation where you pick an element in nums and negate it. Given that you must make exact...

Given a list of integers nums, return whether the largest number is bigger than the second-largest number by more than two times.

Given a list of integers nums, return the largest difference of two consecutive integers in the sorted version of nums.

You are given a two-dimensional list of integers matrix containing 1s and 0s. Return the number of elements in matrix such that:

Given a list of integers nums, sort the list in the following way:

Given a binary search tree root, and k return the kth (0-indexed) smallest value in root. It is guaranteed that the tree has at least k + 1 nodes.

Given a list of unsorted integers nums, and an integer k, return the kth (0-indexed) smallest element in the list.

Given a list of sorted unique integers nums and an integer k, return the kth (0-indexed) missing number from the first element of the list.