translation: Add Python and Java code for EN version (#1345)

* Add the intial translation of code of all the languages

* test

* revert

* Remove

* Add Python and Java code for EN version

en/codes/python/chapter_backtracking/subset_sum_ii.py

@@ -0,0 +1,52 @@
+"""
+File: subset_sum_ii.py
+Created Time: 2023-06-17
+Author: krahets (krahets@163.com)
+"""
+
+
+def backtrack(
+    state: list[int], target: int, choices: list[int], start: int, res: list[list[int]]
+):
+    """Backtracking algorithm: Subset Sum II"""
+    # When the subset sum equals target, record the solution
+    if target == 0:
+        res.append(list(state))
+        return
+    # Traverse all choices
+    # Pruning two: start traversing from start to avoid generating duplicate subsets
+    # Pruning three: start traversing from start to avoid repeatedly selecting the same element
+    for i in range(start, len(choices)):
+        # Pruning one: if the subset sum exceeds target, end the loop immediately
+        # This is because the array is sorted, and later elements are larger, so the subset sum will definitely exceed target
+        if target - choices[i] < 0:
+            break
+        # Pruning four: if the element equals the left element, it indicates that the search branch is repeated, skip it
+        if i > start and choices[i] == choices[i - 1]:
+            continue
+        # Attempt: make a choice, update target, start
+        state.append(choices[i])
+        # Proceed to the next round of selection
+        backtrack(state, target - choices[i], choices, i + 1, res)
+        # Retract: undo the choice, restore to the previous state
+        state.pop()
+
+
+def subset_sum_ii(nums: list[int], target: int) -> list[list[int]]:
+    """Solve Subset Sum II"""
+    state = []  # State (subset)
+    nums.sort()  # Sort nums
+    start = 0  # Start point for traversal
+    res = []  # Result list (subset list)
+    backtrack(state, target, nums, start, res)
+    return res
+
+
+"""Driver Code"""
+if __name__ == "__main__":
+    nums = [4, 4, 5]
+    target = 9
+    res = subset_sum_ii(nums, target)
+
+    print(f"Input array nums = {nums}, target = {target}")
+    print(f"All subsets equal to {target} res = {res}")