Bitwise AND of N binary strings

<script>

// Javascript implementation of the above approach

// Helper method: given two unequal sized
// bit strings, converts them to
// same length by adding leading 0s in the
// smaller string. Returns the new length
let s1, s2;

function makeEqualLength()
{
    let len_a = s1.length;
    let len_b = s2.length;

    let num_zeros = Math.abs(len_a - len_b);

    if (len_a < len_b)
    {
        for(let i = 0; i < num_zeros; i++)
        {
            s1 = '0' + s1;
        }
        
        // Return len_b which is highest.
        // No need to proceed further!
        return len_b;
    }
    else
    {
        for(let i = 0; i < num_zeros; i++)
        {
            s2 = '0' + s2;
        }
    }
    
    // Return len_a which is greater or
    // equal to len_b
    return len_a;
}

// The main function that performs AND
// operation of two-bit sequences
// and returns the resultant string
function andOperationBitwise()
{
    
    // Make both strings of same length with the
    // maximum length of s1 & s2.
    let length = makeEqualLength();

    // Initialize res as NULL string
    let res = "";

    // We start from left to right as we have
    // made both strings of same length.
    for(let i = 0 ; i<length; i++)
    {
        
        // Convert s1[i] and s2[i] to int
        // and perform bitwise AND operation,
        // append to "res" string
        res = res + String.fromCharCode((s1[i].charCodeAt() -
                                           '0'.charCodeAt() &
                                         s2[i].charCodeAt() - 
                                           '0'.charCodeAt()) + 
                                           '0'.charCodeAt());
    }
    return res;
}

// Driver code
let arr = [ "101", "110110", "111" ];
let n = arr.length;
let result;
 
// Check corner case: If there is just one
// binary string, then print it and return.
if (n < 2)
{
    document.write(arr[n - 1] + "</br>");
}
result = arr[0];
for(let i = 1; i<n; i++)
{
    s1 = result;
    s2 = arr[i];
    result = andOperationBitwise();
}
document.write(result);

// This code is contributed by vaibhavrabadiya3

</script>

<script>

    // JavaScript implementation of the above approach:
    
    // Function to find the bitwise AND of 
    // all the binary strings 
    function strBitwiseAND(arr, n) 
    { 
        let res = ""; 
      
        // To store the largest and the smallest 
        // string's size, We need this to add 
        // '0's in the resultant string 
        let smallest_size = Number.MAX_VALUE; 
        let largest_size = Number.MIN_VALUE; 
      
        // Reverse each string 
        // Since we need to perform AND operation 
        // on bits from Right to Left 
        let temp ="";
        for (let i = 0; i < n; i++)
        { 
              
              
            temp+=arr[i];
            arr[i] = reverse(temp);
      
            // Update the respective length values 
            smallest_size = Math.min(smallest_size, arr[i].length); 
            largest_size = Math.max(largest_size, arr[i].length); 
        } 
      
        // Traverse bits from 0 to smallest string's size 
        for (let i = 0; i < smallest_size; i++) 
        { 
            let all_ones = true; 
      
            for (let j = 0; j < n; j++) 
            { 
      
                // If at this bit position, there is a 0 
                // in any of the given strings then AND 
                // operation on current bit position 
                // will be 0 
                if (arr[j][i] == '0') 
                { 
      
                    all_ones = false; 
                    break; 
                } 
            } 
      
            // Add resultant bit to result 
            res += (all_ones ? '1' : '0'); 
        } 
      
        // Add 0's to the string. 
        for (let i = 0; i < largest_size - smallest_size; i++) 
            res += '0'; 
      
        // Reverse the string 
        // Since we started from LEFT to RIGHT 
        let temp1 = "";
        temp1+=res;
        res = reverse(temp1);
      
        // Return the resultant string 
        let temparray1 = res;
        let Temparray = "";
        for(let i = 6; i < temparray1.length; i++)
        {
            Temparray = Temparray + temparray1[i];
        }
        return Temparray;
    } 
      
    function reverse(input) 
    {
        let temparray = input.split('');
        let left, right = 0;
        right = temparray.length - 1;
  
        for (left = 0; left < right; left++, right--)
        {
            // Swap values of left and right 
            let temp = temparray[left];
            temparray[left] = temparray[right];
            temparray[right] = temp;
        }
        return temparray.join("");
    }
    
    let arr = [ "101", "110110", "111" ]; 
    let n = arr.length; 

    document.write(strBitwiseAND(arr, n));
    
</script>