triplet sum - can be updated

Author: anmolpant

Diff for: Data Structures in Java/Level 1/Lecture 5 - Time and Space Complexity/TimeAndSpaceComplexityAnalysis_TripletSum.java

@@ -0,0 +1,27 @@
+
+public class TimeAndSpaceComplexityAnalysis_TripletSum {
+	
+	//inefficient asf. Time limit exceeded error in 2 test cases ;-;
+	
+	public static int tripletSum(int[] arr, int num) {
+		//Your code goes here
+        
+        int count = 0;
+        
+        for(int i = 0; i<arr.length; i++){
+            
+            for(int j = i+1; j<arr.length; j++){
+                
+                for (int k = j+1; k<arr.length; k++){
+                    
+                    if ((arr[i] + arr[j] + arr[k])==num){
+                        count++;
+                    }
+                }
+            }
+        }
+        
+        return count;
+	}
+
+}