DP_demo | Demonstrations of Directed Percolation

def solution(n: int = 1000) -> int:
    """
    Return the product of a,b,c which are Pythagorean Triplet that satisfies
    the following:
      1. a < b < c
      2. a**2 + b**2 = c**2
      3. a + b + c = n

    >>> solution(36)
  

def triplet_sum2(arr: list[int], target: int) -> tuple[int, int, int]:
    """
    Returns a triplet in the array with sum equal to target,
    else (0, 0, 0).
    >>> triplet_sum2([13, 29, 7, 23, 5], 35)
    (5, 7, 23)
    >>> t  

public static int searchTriplet_2(int[] arr, int targetSum) {
        int closest = -1, preDiff = Integer.MAX_VALUE, len = arr.length;
        Arrays.sort(arr);
        for (int i = 0; i < len; i++) {
            int start = i + 1, end = len - 1;