334. Increasing Triplet Subsequence

Given an integer array nums, return true if there exists a triple of indices (i, j, k) such that i < j < k and nums[i] < nums[j] < nums[k]. If no such indices exists, return false.

Example 1:

Input: nums =…

131. Palindrome Partitioning

Given a string s, partition s such that every

substring

of the partition is a

palindrome

. Return all possible palindrome partitioning of s.