ProDeveloperTutorial.com

Example: Input: [1,1,2] Output: [ [1,1,2], [1,2,1], [2,1,1] ] In my pervious post we have discussed three solutions where the numbers are…

Example: Input: [1,2,3] Output: [ [1,2,3], [1,3,2], [2,1,3], [2,3,1], [3,1,2], [3,2,1] ] The solution for this problem can be solved in 2…

Example 1: Input: num1 = "2", num2 = "3" Output: "6" Example 2: Input: num1 = "123", num2 =…

Each number in candidates may only be used once in the combination. Note: • All numbers (including target) will be positive integers. • The…

Example: Input: [ 1->4->5, 1->3->4, 2->6 ] Output: 1->1->2->3->4->4->5->6 This problem can be solved by…

Problem explanation: Initial Sorted array: [0,1,2,4,5,6,7] After rotation it becomes [4,5,6,7,0,1,2]. Target = 0 Index = 4 [as array index…

If such arrangement is not possible, it must rearrange it as the lowest possible order (ie, sorted in ascending order). Examples: Input ->…

Return the quotient after dividing dividend by divisor. The integer division should truncate toward zero. Example 1: Input: dividend = 10,…

Given a linked list, swap every two adjacent nodes and return its head. Example: Given 1->2->3->4, you should return the list as…

Note:  1. Need merged elements in a new list, not in the existing list. Example: Input: 1->2->4, 1->3->4 Output:…