Note: The solution set must not contain duplicate quadruplets. Example: Given array nums = [1, 0, -1, 0, -2, 2], and target = 0. A solution…

Input: [-1, 2, 1, -4] Key = 1 Output: The sum that is closest to the target is 2. (-1 + 2 + 1 = 2) This problem is also known as three sum…

This question can also be called as “three sum”. Input = [-1, 0, 1, 2, -1, -4], Output: [ [-1, 0, 1], [-1, -1, 2] ] This problem can be solved…

Input: Array = [2,3,6,7], key = 7, Output: [ [7], [2,2,3] ] Example 2: Input: candidates = [2,3,5], target = 8, A solution set is: […

Problem description: Given n non-negative integers a1, a2, …, an , where each represents a point at coordinate (i, ai). n vertical lines…

Note: ‘.’ Matches any single character. ‘*’ Matches zero or more of the preceding element. Example 1: Input: Pattern:…

Given a string, find the longest palindromic string in that array. A palindromic string will give the same string when read reverse. Example:…

Problem Explanation: Given a string “prodevelopertutorial” and number of rows is 3. Write the string in a zigzag pattern. Example: Input:…

Problem Explanation: Roman numbers are represented by below characters: I 1 V 5 X 10 L 50 C 100 D 500 M 1000 IV 4 IX 9 XL 40 XC 100 CD 400 CM…

Problem Description: Given a positive integer array, find all the elements that have been repeated and display them. Example: Input: {1, 3, 2,…