/** Given the head of a singly linked list, reverse the list, and return the reversed list. Example 1: Input:

/** Given an m x n 2D binary grid grid which represents a map of '1's (land) and '0 's (water), return the number of isl

/** You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stash

/** Given an array nums of size n, return the majority element. The majority element is the element that appears more

/** Given the heads of two singly linked-lists headA and headB, return the node at which the two lists intersect. If th

/** Design a stack that supports push, pop, top, and retrieving the minimum element in constant time. Implement the

/** Given an integer array nums, find a contiguous non-empty subarray within the array that has the largest product, an

/** Given the head of a linked list, return the list after sorting it in ascending order. Example 1: Input: he

/** Design a data structure that follows the constraints of a Least Recently Used ( LRU) cache. Implement the LRUCache

/** Given the head of a linked list, return the node where the cycle begins. If there is no cycle, return null. Ther

/** Given head, the head of a linked list, determine if the linked list has a cycle in it. There is a cycle in a lin

/** Given a string s and a dictionary of strings wordDict, return true if s can be segmented into a space-separated sequ