Question

Microsoft | OA Coding Questions and Solutions | Set - 97 | 2022

Answer 1

 

I am expecting answer in java 8.

 

class Solution {
    public String[] solution(int[] A) {
        // write your code in Java SE 8
    }
}

Answer 2

public static void main(String[] args) {

        int[] arr = {1, 2, 3, 4};
        List<String> list = new ArrayList<>();
        dfs(list, new ArrayList<>(), arr, 0, 3);

        for(String x : list)
            System.out.println(x);
    }

    static void dfs(List<String> list, List<Integer> sub, int[] arr, int ind, int k) {
        if(sub.size() == k) {
            StringBuilder sb = new StringBuilder();
            for(int x : sub) sb.append(x);
            list.add(sb.toString());
            return;
        }
        for(int i = ind; i < arr.length; i++) {
            sub.add(arr[i]);
            dfs(list,sub, arr, i+1, k);
            sub.remove(sub.size()-1);
        }
    }

Answer 3

Similar to this https://leetcode.com/problems/combinations/