Lunski's Clutter

Given a string s containing just the characters ‘(‘, ‘)’, ‘{‘, ‘}’, ‘[‘ and ‘]’, determine if the input string is valid.

An input string is valid if:

Open brackets must be closed by the same type of brackets.
Open brackets must be closed in the correct order.

Example 1:

1
2

Input: s = "()"
Output: true

Example 2:

1
2

Input: s = "()[]{}"
Output: true

Example 3:

1
2

Input: s = "(]"
Output: false

Example 4:

1
2

Input: s = "([)]"
Output: false

Example 5:

1
2

Input: s = "{[]}"
Output: true

Given an array nums of n integers, are there elements a, b, c in nums such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero.

Notice that the solution set must not contain duplicate triplets.

Example 1:

1
2

Input: nums = [-1,0,1,2,-1,-4]
Output: [[-1,-1,2],[-1,0,1]]

Example 2:

1
2

Input: nums = []
Output: []

Example 3:

1
2

Input: nums = [0]
Output: []

Given the head of a linked list, remove the nth node from the end of the list and return its head.

Follow up: Could you do this in one pass?

Example 1:

1
2

Input: head = [1,2,3,4,5], n = 2
Output: [1,2,3,5]

Example 2:

1
2

Input: head = [1], n = 1
Output: []

Example 3:

1
2

Input: head = [1,2], n = 1
Output: [1]

Given n non-negative integers a1, a2, …, an , where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of the line i is at (i, ai) and (i, 0). Find two lines, which, together with the x-axis forms a container, such that the container contains the most water.

Example 1:

1
2
3

Input: height = [1,8,6,2,5,4,8,3,7]
Output: 49
Explanation: The above vertical lines are represented by array [1,8,6,2,5,4,8,3,7]. In this case, the max area of water (blue section) the container can contain is 49.

Example 2:

1
2

Input: height = [1,1]
Output: 1

Example 3:

1
2

Input: height = [4,3,2,1,4]
Output: 16

Example 4:

1
2

Input: height = [1,2,1]
Output: 2

Given two strings s and t, return true if s is a subsequence of t, or false otherwise.

A subsequence of a string is a new string that is formed from the original string by deleting some (can be none) of the characters without disturbing the relative positions of the remaining characters. (i.e., “ace” is a subsequence of “abcde” while “aec” is not).

Example 1:

1
2

Input: s = "abc", t = "ahbgdc"
Output: true

Example 2:

1
2

Input: s = "axc", t = "ahbgdc"
Output: false