Given a sorted linked list, delete all duplicates such that each element appear only once. ExampleNo.1Input: 1->1->2 Output: 1->2 No.2Input: ...

Given a linked list, rotate the list to the right by k places, where k is non-negative. ExampleNo.1Input: 1->2->3->4->5->NULL, k = 2 Ou ...

Given a linked list, remove the nth node from the end of list and return its head. ExampleGiven linked list: 1->2->3->4->5, and n = 2. Aft ...

You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed. All houses at this place are ar ...

You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping yo ...

Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand. (i.e., [0,1,2,4,5,6,7] might become [4,5,6,7,0,1,2]). ...

Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand. (i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2). Find ...

Given a sorted array 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 or ...

Given an integer array nums, find the contiguous subarray within an array (containing at least one number) which has the largest product. ExampleNo.1I ...

Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum. ExampleInput: ...