Added question 17

rehan-akmal · rehan-akmal · commit c2a229c2eb0f · 2022-12-11T16:58:28.000Z
diff --git a/README.md b/README.md
@@ -154,5 +154,17 @@ Output:
 Explanation: This the only two sequences of balanced 
 parenthesis formed using 2 pair of balanced parenthesis. 
 ```
+17) Given an array arr of size N and an integer K. The task is to find the pair of integers such that their sum is maximum and but less than K 
+```sh
+Examples: 
+
+Input : arr = {30, 20, 50} , K = 70 
+Output : 30, 20 
+30 + 20 = 50, which is the maximum possible sum which is less than K
+ 
+
+Input : arr = {5, 20, 110, 100, 10}, K = 85 
+Output : 20, 10 
+```
 
 Feel free to make an addition or improvement in the questions and if you like the effort, do give a star to the repo :-) 
diff --git a/two_sum_less_than_k.rb b/two_sum_less_than_k.rb
@@ -0,0 +1,34 @@
+# Given an array arr of size N and an integer K. The task is to find the pair of integers such that their sum is maximum and but less than K
+
+# Examples: 
+
+# Input : arr = {30, 20, 50} , K = 70 
+# Output : 30, 20 
+# 30 + 20 = 50, which is the maximum possible sum which is less than K
+ 
+
+# Input : arr = {5, 20, 110, 100, 10}, K = 85 
+# Output : 20, 10 
+
+
+def two_sum(arr, k)
+    arr.sort!
+    l, r = 0, arr.length-1
+    max = 0
+    while l < r
+        puts "l = " + l.to_s + " , r = " + r.to_s
+        temp = arr[l] + arr[r]
+        if k > temp
+            l += 1
+        else
+            r -= 1
+        end
+    end
+    puts arr[l]
+    puts arr[r]
+end
+
+arr = [20, 10, 30, 100, 110]
+k = 85
+
+two_sum arr, k
