Lunski's Clutter

There is an integer array nums sorted in ascending order (with distinct values).

Prior to being passed to your function, nums is rotated at an unknown pivot index k (0 <= k < nums.length) such that the resulting array is [nums[k], nums[k+1], …, nums[n-1], nums[0], nums[1], …, nums[k-1]] (0-indexed). For example, [0,1,2,4,5,6,7] might be rotated at pivot index 3 and become [4,5,6,7,0,1,2].

Given the array nums after the rotation and an integer target, return the index of target if it is in nums, or -1 if it is not in nums.

Example 1:

1
2

Input: nums = [4,5,6,7,0,1,2], target = 0
Output: 4

Example 2:

1
2

Input: nums = [4,5,6,7,0,1,2], target = 3
Output: -1

Example 3:

1
2

Input: nums = [1], target = 0
Output: -1

You are given an array of k linked-lists lists, each linked-list is sorted in ascending order.

Merge all the linked-lists into one sorted linked-list and return it.

Example 1:

1
2
3
4
5
6
7
8
9
10

Input: lists = [[1,4,5],[1,3,4],[2,6]]
Output: [1,1,2,3,4,4,5,6]
Explanation: The linked-lists are:
[
  1->4->5,
  1->3->4,
  2->6
]
merging them into one sorted list:
1->1->2->3->4->4->5->6

Example 2:

1
2
3
4
5
6

Input: lists = []
Output: []
Example 3:

Input: lists = [[]]
Output: []

Merge two sorted linked lists and return it as a sorted list. The list should be made by splicing together the nodes of the first two lists.

Example 1:

1
2

Input: l1 = [1,2,4], l2 = [1,3,4]
Output: [1,1,2,3,4,4]

Example 2:

1
2

Input: l1 = [], l2 = []
Output: []

Example 3:

1
2

Input: l1 = [], l2 = [0]
Output: [0]

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: []