Problem description:

You are given an m x n grid grid of values 0, 1, or 2, where:

Problem description:

Given two numbers, hour and minutes. Return the smaller angle (in degrees) formed between the hour and the minute hand.

Problem description:

You are given an integer num. You can swap two digits at most once to get the maximum valued number.

Problem description:

Given a string num that contains only digits and an integer target, return all possibilities to add the binary operators '+', '-', or '*' between the digits of num so that the resultant expression evaluates to the target value.

Problem description:

Given a positive integer n, find the smallest integer which has exactly the same digits existing in the integer n and is greater in value than n. If no such positive integer exists, return -1.

Problem description:

Given a circular integer array nums (i.e., the next element of nums[nums.length - 1] is nums[0]), return the next greater number for every element in nums.

Problem description:

The next greater element of some element x in an array is the first greater element that is to the right of x in the same array.

Problem description:

Given a Circular Linked List node, which is sorted in ascending order, write a function to insert a value insertVal into the list such that it remains a sorted circular list. The given node can be a reference to any single node in the list and may not necessarily be the smallest value in the circular list.

Problem description:

Given an input string s, reverse the order of the words.

Problem description:

Solution:

time complexity: $O()$
space complexity: $O()$
reference:
related problem: