Leetcode-Problems/Find_Unique_Binary_String.java at main · Debojyoti1104/Leetcode-Problems · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
/*Given an array of strings nums containing n unique binary strings each of length n, return a binary string of length n that does not appear in nums. If there are multiple answers, you may return any of them.


Example 1:

Input: nums = ["01","10"]
Output: "11"
Explanation: "11" does not appear in nums. "00" would also be correct.
Example 2:

Input: nums = ["00","01"]
Output: "11"
Explanation: "11" does not appear in nums. "10" would also be correct.
Example 3:

Input: nums = ["111","011","001"]
Output: "101"
Explanation: "101" does not appear in nums. "000", "010", "100", and "110" would also be correct.
*/


class Solution {
    public String findDifferentBinaryString(String[] nums) {
        StringBuilder ans = new StringBuilder();

        for(int i =0;i<nums.length; i++)
        {
            char currentdig =  nums[i].charAt(i);// get the i-th character of i-th string i.e. 0index  of o indexed binary eg 10.11,10 so it takes 1 from 1st i.e oth index, 1 from 2nd i.e 1 index and 0 from 100 i.e 2 of 2 index
            if(currentdig == '0')
            {
                ans.append('1');
            }
            else
            {
                ans.append('0');
            }
        }

        return ans.toString();


    }
}