Suppose an array of length n sorted in ascending order is rotated between 1 and n times. For example, the array nums = [0,1,4,4,5,6,7] might become:

[4,5,6,7,0,1,4] if it was rotated 4 times.
[0,1,4,4,5,6,7] if it was rotated 7 times.
Notice that rotating an array [a[0], a[1], a[2], ..., a[n-1]] 1 time results in the array [a[n-1], a[0], a[1], a[2], ..., a[n-2]].

Given the sorted rotated array nums that may contain duplicates, return the minimum element of this array.

 Find Minimum in Rotated Sorted Array II

Suppose an array of length n sorted in ascending order is rotated between 1 and n times. For example, the array nums = [0,1,2,4,5,6,7] might become:

[4,5,6,7,0,1,2] if it was rotated 4 times.
[0,1,2,4,5,6,7] if it was rotated 7 times.
Notice that rotating an array [a[0], a[1], a[2], ..., a[n-1]] 1 time results in the array [a[n-1], a[0], a[1], a[2], ..., a[n-2]].

Given the sorted rotated array nums of unique elements, return the minimum element of this array.

Find Minimum in Rotated Sorted Array

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

A word is defined as a sequence of non-space characters. The words in s will be separated by at least one space.

Return a string of the words in reverse order concatenated by a single space.

Note that s may contain leading or trailing spaces or multiple spaces between two words. The returned string should only have a single space separating the words. Do not include any extra spaces.

Reverse Words in a String

Write an efficient algorithm that searches for a value target in an m x n integer matrix matrix. This matrix has the following properties:

Integers in each row are sorted from left to right.
The first integer of each row is greater than the last integer of the previous row.

Search a 2D Matrix

You are given an array of non-overlapping intervals intervals where intervals[i] = [starti, endi] represent the start and the end of the ith interval and intervals is sorted in ascending order by starti. You are also given an interval newInterval = [start, end] that represents the start and end of another interval.

Insert newInterval into intervals such that intervals is still sorted in ascending order by starti and intervals still does not have any overlapping intervals (merge overlapping intervals if necessary).

Return intervals after the insertion.

Insert Interval

Given an array of intervals where intervals[i] = [starti, endi], merge all overlapping intervals, and return an array of the non-overlapping intervals that cover all the intervals in the input.

Merge Intervals

The n-queens puzzle is the problem of placing n queens on an n x n chessboard such that no two queens attack each other.

Given an integer n, return all distinct solutions to the n-queens puzzle. You may return the answer in any order.

Each solution contains a distinct board configuration of the n-queens' placement, where 'Q' and '.' both indicate a queen and an empty space, respectively.

N-Queens

Given two non-negative integers num1 and num2 represented as strings, return the product of num1 and num2, also represented as a string.

Multiply Strings

Given an array of integers nums sorted in non-decreasing order, find the starting and ending position of a given target value.

If target is not found in the array, return [-1, -1].


Find Range of Element in Sorted Array

Given a string containing just the characters '(' and ')', find the length of the longest valid (well-formed) parentheses substring.

Longest Valid Parentheses

You are given an integer array height of length n. There are n vertical lines drawn such that the two endpoints of the ith line are (i, 0) and (i, height[i]).

Find two lines that together with the x-axis form a container, such that the container contains the most water.

Return the maximum amount of water a container can store.

Notice that you may not slant the container.

 Container With Most Water

Given two sorted arrays nums1 and nums2 of size m and n respectively, return the median of the two sorted arrays.



Median of Two Sorted Arrays

Given a string s, find the length of the longest substring without repeating characters.



Longest Substring Without Repeating Characters

You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order, and each of their nodes contains a single digit. Add the two numbers and return the sum as a linked list.

 Add Two Numbers

Given a string s consisting of some words separated by some number of spaces, return the length of the last word in the string.

Length of Last Word

Given a sorted array of distinct integers and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.

Search Insert Position

Implement strStr().
Return the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.


Implement strStr()

Given an integer array nums and an integer val, remove all occurrences of val in nums in-place. The relative order of the elements may be changed.

Remove Element

Given an integer array nums sorted in non-decreasing order, remove the duplicates in-place such that each unique element appears only once. The relative order of the elements should be kept the same.

Remove Duplicates from Sorted Array

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

Valid Parentheses

Write a function to find the longest common prefix string amongst an array of strings.

Longest Common Prefix

Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M.
Given a roman numeral, convert it to an integer.

Roman to Integer

Given an integer x, return true if x is palindrome integer.
An integer is a palindrome when it reads the same backward as forward.
For example, 121 is a palindrome while 123 is not.


Palindrome Number

Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target

Name	Created	Tags
Find Minimum in Rotated Sorted Array II	2/28/2022
Find Minimum in Rotated Sorted Array	2/28/2022
Reverse Words in a String	2/28/2022
Search a 2D Matrix	2/28/2022
Insert Interval	2/28/2022
Merge Intervals	2/28/2022
N-Queens	2/28/2022
Multiply Strings	2/28/2022
Find Range of Element in Sorted Array	2/28/2022
Longest Valid Parentheses	2/28/2022
Container With Most Water	2/28/2022
Median of Two Sorted Arrays	2/28/2022
Longest Substring Without Repeating Characters	2/28/2022
Add Two Numbers	2/28/2022
Length of Last Word	2/18/2022
Search Insert Position	2/18/2022
Implement strStr()	2/18/2022
Remove Element	2/18/2022
Remove Duplicates from Sorted Array	2/18/2022
Valid Parentheses	2/18/2022
Longest Common Prefix	2/18/2022
Roman to Integer	2/18/2022
Palindrome Number	2/18/2022
Two Sums	2/17/2022	...

Ayush12527

Python

Coding Assistant