Merge pull request #212 from dilroseR/dilroseR

added 4 new programs

Author: smv1999

Arrays/KLargestpairs.py

@@ -0,0 +1,62 @@
+# K Largest Pairs
+
+"""
+You are given two lists of integers nums0, nums1 and an integer k. 
+Find k largest sum pairs where each pair contains one integer in nums0 and another in nums1, 
+and return the sum of all of the pairs.
+
+Constraints
+
+0 ≤ n ≤ 100,000 where n is the length of nums0
+0 ≤ m ≤ 100,000 where m is the length of nums1
+0 ≤ k ≤ 100,000
+0 ≤ k ≤ n * m
+
+
+Example 1:
+
+Input:-
+nums0 = [5, 3, 9]
+nums1 = [1, 2, 4]
+k = 2
+
+Output:-
+24
+
+Explanation:-
+The 2 largest pairs are (9,2) and (9,4)..therefore the sum of the pairs would be 9+2+9+4=24
+"""
+
+
+def solve(nums0, nums1, k):
+    lst=[]
+    tot=0
+    for i in nums0:
+        for j in nums1:
+            sum=0
+            sum=i+j
+            lst.append(sum)
+    lst=sorted(lst,reverse=True)
+    for i in range(0,k):
+        tot=tot+lst[i]
+    return tot
+
+n1=int(input(("Enter no. of elements in num list1: ")))
+n2=int(input(("Enter no. of elements in num list2: ")))
+k=int(input("Enter no. of largest pairs that you need: "))
+list1=[]
+list2=[]
+print("Enter elements of list1 one by one: ")
+for i in range(0,n1):
+    
+    ele1=int(input())
+    list1.append(ele1)
+    
+print("Enter elements of list2 one by one: ")
+for j in range(0,n2):
+    
+    ele2=int(input())
+    list2.append(ele2)
+
+ans=solve(list1,list2,k)
+print("Sum of the largest " + str(k) + " pairs is",ans)

Arrays/ShortestContinuousSubarray.py

@@ -0,0 +1,44 @@
+# Shortest Unsorted Continuous Subarray
+
+"""
+Find one continuous subarray that if you only sort this subarray in ascending order, then the whole array will be sorted in ascending order.
+Return length of the shortest subarray.
+
+Example 1: nums = [2,6,4,8,10,9,15]
+o/p:- 5
+Explanation: You need to sort [6, 4, 8, 10, 9] in ascending order to make the whole array sorted in ascending order.
+
+Example 2: nums = [1,2,3,4]
+o/p:- 0
+"""
+
+def findUnsortedSubarray(nums):
+        res=[]
+        ans=[]
+        final=[]
+        for i in nums:
+            res.append(i)
+       
+        res.sort()
+        for i in range(0,len(nums)):
+            if nums[i]!=res[i]:
+                ans.append(i)
+          
+        if len(ans)==0:
+            return 0
+        else:
+            for i in range(ans[0],ans[len(ans)-1]+1):
+                final.append(nums[i])
+            
+            return len(final)
+
+nums=[]
+n=int(input("Enter the no. of elements: "))
+print("Enter the elements of the array one by one: ")
+for i in range(0,n):
+	
+	ele=int(input())
+	nums.append(ele)
+
+answer=findUnsortedSubarray(nums)
+print("The length of the shortest subarray:",answer)

Numbers/RomantoInteger.py

@@ -0,0 +1,36 @@
+# To convert Roman numeral to its equivalent integer
+
+def romanToInt(s): 
+        romanToNum={
+            'I':1,
+            'V':5,
+            'X':10,
+            'L':50,
+            'C':100,
+            'D':500,
+            'M':1000
+        }
+        
+        total=0
+        i=0                 # to iterate through each letter of the roman numeral
+        
+        while i<len(s):
+            index1=romanToNum[s[i]]
+            if(i+1<len(s)):
+                index2=romanToNum[s[i+1]]
+                if index1>=index2:
+                    total=total+index1
+                    i=i+1
+                else:
+                    total=total-index1
+                    i=i+1
+            
+            else:
+                total=total+index1
+                i=i+1
+        return total
+
+print("Enter the Roman Numeral")        
+s=input()
+st=romanToInt(s)
+print("The roman to integer of the given input is: ",st)

Strings/removePalindromicSubsequences.java

@@ -0,0 +1,44 @@
+import java.util.*;
+class Main{
+public static int removePalindromeSub(String s) {
+      
+        char[] c=new char[s.length()];
+        ArrayList<Character> al=new ArrayList<>();
+        ArrayList<Character> bl=new ArrayList<>();
+         
+        for(int i=0;i<s.length();i++)
+        {
+            char a=s.charAt(i);
+            al.add(a);
+            bl.add(a);
+            
+        }
+       
+        Collections.reverse(bl);
+        
+        if(al.size()==0)
+	{
+            return 0;
+	}
+        
+        else if(al.equals(bl))
+        	{
+           return 1;
+        	}
+        else
+	{
+            return 2;
+	}         
+}
+
+	public static void main(String args[])
+		{
+			Scanner sc=new Scanner(System.in);
+			System.out.println("Enter the string: ");
+			int ans=0;
+			String s=sc.next();
+			ans=removePalindromeSub(s);
+			System.out.println("Output: "+ans);
+
+		}
+	}