/** Given an array of integers nums containing n + 1 integers where each integer is in the range [1, n] inclusive. T

/** Given an integer n, return the least number of perfect square numbers that sum to n. A perfect square is an inte

/** * Write an efficient algorithm that searches for a value target in an m x n * integer matrix matrix. This matrix h

import java.util.Comparator; import java.util.PriorityQueue; /** You are given an array of integers nums, there is a sl

/** Given an integer array nums, return an array answer such that answer[i] is equal to the product of all the elements

/** Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree. According to the defi

/** Given the head of a singly linked list, return true if it is a palindrome or false otherwise. Example 1: I

/** Given the root of a binary tree, invert the tree, and return its root. Example 1: Input: root = [4,2,7,1,3,

/** Given an m x n binary matrix filled with 0's and 1's, find the largest square containing only 1's and return its are

/** Given an integer array nums and an integer k, return the kᵗʰ largest element in the array. Note that it is the k

/** A trie (pronounced as "try") or prefix tree is a tree data structure used to efficiently store and retrieve keys in

/** * There are a total of numCourses courses you have to take, labeled from 0 to * numCourses - 1. You are given an a