Compare two version numbers version1 and version2.If version1 > version2 return 1; if version1 < version2 return -1;otherwise return 0. You may ...

You are given two non-empty linked lists representing two non-negative integers. The most significant digit comes first and each of their nodes contai ...

Given a non-empty array of integers, return the k most frequent elements. ExampleNo.1Input: nums = [1,1,1,2,2,3], k = 2 Output: [1,2] No.2Input: nums ...

Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers. If such arrangement is not possib ...

Given a string s, partition s such that every substring of the partition is a palindrome. Return all possible palindrome partitioning of s. Example:In ...

Given a collection of integers that might contain duplicates, nums, return all possible subsets (the power set). NoteThe solution set must not contain ...

Given a set of distinct integers, nums, return all possible subsets (the power set). NoteThe solution set must not contain duplicate subsets. ExampleI ...

Given a collection of numbers that might contain duplicates, return all possible unique permutations. ExampleInput: [1,1,2] Output: 12345[ [1,1,2], ...

Given a collection of distinct integers, return all possible permutations. ExampleInput: [1,2,3] Output: 12345678[ [1,2,3], [1,3,2], [2,1,3], [2,3 ...

Design your implementation of the circular double-ended queue (deque). Your implementation should support following operations: MyCircularDeque(k): Co ...