Add n binary strings Last Updated : 10 Dec, 2024 Summarize Suggest changes Share Like Article Like Report Given n binary strings, the task is to find their sum which is also a binary string.Examples: Input: arr[] = ["1101", "111"]Output: "10100"Explanation:Input : arr[] = ["1", "10", "11"]Output : "110" [Approach] Bit-by-bit addition with carryA simple idea is to initialise res = "0" and preform addition of each string with res one by one. The value of res after adding all binary strings is the final answer.For adding res and arr[i], we use the approach used in Add two binary strings. C++ //Driver Code Starts // C++ program to add n binary strings #include <iostream> #include <vector> #include <string> using namespace std; // Function to trim leading zeros from a binary string //Driver Code Ends string trimLeadingZeros(const string &s) { // Find the position of the first '1' size_t firstOne = s.find('1'); return (firstOne == string::npos) ? "0" : s.substr(firstOne); } // Function adds two binary strings string addTwoBinary(string &s1, string &s2) { // Trim leading zeros s1 = trimLeadingZeros(s1); s2 = trimLeadingZeros(s2); int n = s1.size(); int m = s2.size(); // swap the strings if s1 is of smaller length if (n < m) { return addTwoBinary(s2, s1); } int j = m - 1; int carry = 0; // Traverse both strings from the end for (int i = n - 1; i >= 0; i--) { // Current bit of s1 int bit1 = s1[i] - '0'; int sum = bit1 + carry; //Driver Code Starts // If there are remaining bits in s2, add them to the sum if (j >= 0) { // Current bit of s2 int bit2 = s2[j] - '0'; sum += bit2; j--; } // Calculate the result bit and update carry int bit = sum % 2; carry = sum / 2; // Update the current bit in s1 s1[i] = (char)(bit + '0'); } // If there's any carry left, update s1 if (carry > 0) { s1 = '1' + s1; } return s1; } // function to add n binary strings string addBinary(vector<string> &arr) { string res = "0"; for (int i = 0; i < arr.size(); i++) res = addTwoBinary(res, arr[i]); return res; } int main() { vector<string> arr = { "1", "10", "11" }; cout << addBinary(arr); return 0; } //Driver Code Ends Java // Java program to add n binary strings class GfG { // Function to trim leading zeros from a binary string static String trimLeadingZeros(String s) { // Find the position of the first '1' int firstOne = s.indexOf('1'); return (firstOne == -1) ? "0" : s.substring(firstOne); } // Function to add two binary strings static String addTwoBinary(String s1, String s2) { // Trim Leading Zeros s1 = trimLeadingZeros(s1); s2 = trimLeadingZeros(s2); int n = s1.length(); int m = s2.length(); // Swap the strings if s1 is of smaller length if (n < m) { return addTwoBinary(s2, s1); } int j = m - 1; int carry = 0; StringBuilder result = new StringBuilder(); // Traverse both strings from the end for (int i = n - 1; i >= 0; i--) { // Current bit of s1 int bit1 = s1.charAt(i) - '0'; int sum = bit1 + carry; // If there are remaining bits in s2, add them // to the sum if (j >= 0) { // Current bit of s2 int bit2 = s2.charAt(j) - '0'; sum += bit2; j--; } // Calculate the result bit and update carry int bit = sum % 2; carry = sum / 2; // Update the current bit in result result.append((char)(bit + '0')); } // If there's any carry left, update the result if (carry > 0) result.append('1'); return result.reverse().toString(); } // function to add n binary strings static String addBinary(String arr[]) { String res = "0"; for (int i = 0; i < arr.length; i++) { res = addTwoBinary(res, arr[i]); } return res; } public static void main(String[] args) { String arr[] = {"1", "10", "11"}; System.out.println(addBinary(arr)); } } Python # Python3 program to add n binary strings def trimLeadingZeros(s): # Find the position of the first '1' firstOne = s.find('1') return s[firstOne:] if firstOne != -1 else "0" # function to two binary strings def addTwoBinary(s1, s2): # Trim Leading Zeros s1 = trimLeadingZeros(s1) s2 = trimLeadingZeros(s2) n = len(s1) m = len(s2) # Swap the strings if s1 is of smaller length if n < m: s1, s2 = s2, s1 n, m = m, n j = m - 1 carry = 0 result = [] # Traverse both strings from the end for i in range(n - 1, -1, -1): # Current bit of s1 bit1 = int(s1[i]) bitSum = bit1 + carry # If there are remaining bits in s2 # add them to the bitSum if j >= 0: # Current bit of s2 bit2 = int(s2[j]) bitSum += bit2 j -= 1 # Calculate the result bit and update carry bit = bitSum % 2 carry = bitSum // 2 # Update the current bit in result result.append(str(bit)) # If there's any carry left, prepend it to the result if carry > 0: result.append('1') return ''.join(result[::-1]) # function to add n binary strings def addBinary(arr): res = "0"; for i in range(len(arr)): res = addTwoBinary(res, arr[i]); return res; if __name__ == '__main__': arr = ["1", "10", "11"]; n = len(arr); print(addBinary(arr)); C# // C# program to add n binary strings using System; class GfG { // Function to trim leading zeros from a binary string static string trimLeadingZeros(string s) { // Find the position of the first '1' int firstOne = s.IndexOf('1'); return (firstOne == -1) ? "0" : s.Substring(firstOne); } // function to add two binary strings static string addTwoBinary(string s1, string s2) { // Trim leading zeros s1 = trimLeadingZeros(s1); s2 = trimLeadingZeros(s2); int n = s1.Length; int m = s2.Length; // Swap the strings if s1 is of smaller length if (n < m) { return addTwoBinary(s2, s1); } int j = m - 1; int carry = 0; char[] result = new char[n]; // Traverse both strings from the end for (int i = n - 1; i >= 0; i--) { // Current bit of s1 int bit1 = s1[i] - '0'; int sum = bit1 + carry; // If there are remaining bits in s2, add them to the sum if (j >= 0) { // Current bit of s2 int bit2 = s2[j] - '0'; sum += bit2; j--; } // Calculate the result bit and update carry int bit = sum % 2; carry = sum / 2; // Update the current bit in result result[i] = (char)(bit + '0'); } // If there's any carry left, prepend it to the result if (carry > 0) { return '1' + new string(result); } return new string(result); } // function to add n binary strings static String addBinary(String []arr) { String res = "0"; for (int i = 0; i < arr.Length; i++) { res = addTwoBinary(res, arr[i]); } return res; } static void Main(String[] args) { String []arr = {"1", "10", "11"}; Console.WriteLine(addBinary(arr)); } } JavaScript // Javascript program to add n binary strings // Function to trim leading zeros from a binary string function trimLeadingZeros(s) { // Find the position of the first '1' let firstOne = s.indexOf('1'); return (firstOne === -1) ? "0" : s.substring(firstOne); } // Function to add two binary strings function addTwoBinary(s1, s2) { // Trim leading zeros s1 = trimLeadingZeros(s1); s2 = trimLeadingZeros(s2); let n = s1.length; let m = s2.length; // Swap the strings if s1 is of smaller length if (n < m) { return addTwoBinary(s2, s1); } let j = m - 1; let carry = 0; let result = []; // Traverse both strings from the end for (let i = n - 1; i >= 0; i--) { // Current bit of s1 let bit1 = s1[i] - '0'; let sum = bit1 + carry; // If there are remaining bits in s2, add them to the sum if (j >= 0) { // Current bit of s2 let bit2 = s2[j] - '0'; sum += bit2; j--; } // Calculate the result bit and update carry let bit = sum % 2; carry = Math.floor(sum / 2); // Update the current bit in result result.push(bit); } // If there's any carry left, prepend it to the result if (carry > 0) { result.push(1); } return result.reverse().join(''); } // Function to add n binary strings function addBinary(arr) { var res = "0"; for (var i = 0; i < arr.length; i++) res = addTwoBinary(res, arr[i]); return res; } // Driver program const arr = ["1", "10", "11"]; console.log( addBinary(arr)); Output110Time Complexity: O(n * maxLen), where n is the size of the array and maxLen is maximum length of any binary string.Auxiliary Space: O(maxLen), for result string. Advertise with us Next Article Applications, Advantages and Disadvantages of String A aganjali10 Follow Similar Reads String in Data Structure A string is a sequence of characters. The following facts make string an interesting data structure.Small set of elements. Unlike normal array, strings typically have smaller set of items. For example, lowercase English alphabet has only 26 characters. ASCII has only 256 characters.Strings are immut 2 min read Introduction to Strings - Data Structure and Algorithm Tutorials Strings are sequences of characters. The differences between a character array and a string are, a string is terminated with a special character ‘\0’ and strings are typically immutable in most of the programming languages like Java, Python and JavaScript. Below are some examples of strings:"geeks" 7 min read Applications, Advantages and Disadvantages of String The String data structure is the backbone of programming languages and the building blocks of communication. String data structures are one of the most fundamental and widely used tools in computer science and programming. They allow for the representation and manipulation of text and character sequ 6 min read Subsequence and Substring What is a Substring? A substring is a contiguous part of a string, i.e., a string inside another string. In general, for an string of size n, there are n*(n+1)/2 non-empty substrings. For example, Consider the string "geeks", There are 15 non-empty substrings. The subarrays are: g, ge, gee, geek, ge 6 min read Storage for Strings in C In C, a string can be referred to either using a character pointer or as a character array. Strings as character arrays C char str[4] = "GfG"; /*One extra for string terminator*/ /* OR */ char str[4] = {‘G’, ‘f’, ‘G’, '\0'}; /* '\0' is string terminator */ When strings are declared as character arra 5 min read Strings in different languageStrings in CA String in C programming is a sequence of characters terminated with a null character '\0'. The C String is work as an array of characters. The difference between a character array and a C string is that the string in C is terminated with a unique character '\0'.DeclarationDeclaring a string in C i 5 min read std::string class in C++C++ has in its definition a way to represent a sequence of characters as an object of the class. This class is called std:: string. The string class stores the characters as a sequence of bytes with the functionality of allowing access to the single-byte character.String vs Character ArrayStringChar 8 min read String Class in JavaA string is a sequence of characters. In Java, objects of the String class are immutable, which means they cannot be changed once created. In this article, we are going to learn about the String class in Java.Example of String Class in Java:Java// Java Program to Create a String import java.io.*; cl 7 min read Python StringA string is a sequence of characters. Python treats anything inside quotes as a string. This includes letters, numbers, and symbols. Python has no character data type so single character is a string of length 1.Pythons = "GfG" print(s[1]) # access 2nd char s1 = s + s[0] # update print(s1) # printOut 6 min read C# StringsIn C#, a string is a sequence of Unicode characters or an array of characters. The range of Unicode characters will be U+0000 to U+FFFF. The array of characters is also termed as the text. So the string is the representation of the text. A string is an important concept, and sometimes people get con 7 min read JavaScript String MethodsJavaScript strings are the sequence of characters. They are treated as Primitive data types. In JavaScript, strings are automatically converted to string objects when using string methods on them. This process is called auto-boxing. The following are methods that we can call on strings.slice() extra 11 min read PHP StringsIn PHP, strings are one of the most commonly used data types. A string is a sequence of characters used to represent text, such as words and sentences. Strings are enclosed in either single quotes (' ') or double quotes (" "). You can create a string using single quotes (' ') or double quotes (" "). 4 min read Basic operations on StringSearching For Characters and Substring in a String in JavaEfficient String manipulation is very important in Java programming especially when working with text-based data. In this article, we will explore essential methods like indexOf(), contains(), and startsWith() to search characters and substrings within strings in Java.Searching for a Character in a 5 min read Reverse a String – Complete TutorialGiven a string s, the task is to reverse the string. Reversing a string means rearranging the characters such that the first character becomes the last, the second character becomes second last and so on.Examples:Input: s = "GeeksforGeeks"Output: "skeeGrofskeeG"Explanation : The first character G mo 13 min read Left Rotation of a StringGiven a string s and an integer d, the task is to left rotate the string by d positions.Examples:Input: s = "GeeksforGeeks", d = 2Output: "eksforGeeksGe" Explanation: After the first rotation, string s becomes "eeksforGeeksG" and after the second rotation, it becomes "eksforGeeksGe".Input: s = "qwer 15+ min read Sort string of charactersGiven a string of lowercase characters from 'a' - 'z'. We need to write a program to print the characters of this string in sorted order.Examples: Input : "dcab" Output : "abcd"Input : "geeksforgeeks"Output : "eeeefggkkorss"Naive Approach - O(n Log n) TimeA simple approach is to use sorting algorith 5 min read Frequency of Characters in Alphabetical OrderGiven a string s, the task is to print the frequency of each of the characters of s in alphabetical order.Example: Input: s = "aabccccddd" Output: a2b1c4d3 Since it is already in alphabetical order, the frequency of the characters is returned for each character. Input: s = "geeksforgeeks" Output: e4 9 min read Swap characters in a StringGiven a String S of length N, two integers B and C, the task is to traverse characters starting from the beginning, swapping a character with the character after C places from it, i.e. swap characters at position i and (i + C)%N. Repeat this process B times, advancing one position at a time. Your ta 14 min read C Program to Find the Length of a StringThe length of a string is the number of characters in it without including the null character (‘\0’). In this article, we will learn how to find the length of a string in C.The easiest way to find the string length is by using strlen() function from the C strings library. Let's take a look at an exa 2 min read How to insert characters in a string at a certain position?Given a string str and an array of indices chars[] that describes the indices in the original string where the characters will be added. For this post, let the character to be inserted in star (*). Each star should be inserted before the character at the given index. Return the modified string after 7 min read Check if two strings are same or notGiven two strings, the task is to check if these two strings are identical(same) or not. Consider case sensitivity.Examples:Input: s1 = "abc", s2 = "abc" Output: Yes Input: s1 = "", s2 = "" Output: Yes Input: s1 = "GeeksforGeeks", s2 = "Geeks" Output: No Approach - By Using (==) in C++/Python/C#, eq 7 min read Concatenating Two Strings in CConcatenating two strings means appending one string at the end of another string. In this article, we will learn how to concatenate two strings in C.The most straightforward method to concatenate two strings is by using strcat() function. Let's take a look at an example:C#include <stdio.h> #i 2 min read Remove all occurrences of a character in a stringGiven a string and a character, remove all the occurrences of the character in the string.Examples: Input : s = "geeksforgeeks" c = 'e'Output : s = "gksforgks"Input : s = "geeksforgeeks" c = 'g'Output : s = "eeksforeeks"Input : s = "geeksforgeeks" c = 'k'Output : s = "geesforgees"Using Built-In Meth 2 min read Binary StringCheck if all bits can be made same by single flipGiven a binary string, find if it is possible to make all its digits equal (either all 0's or all 1's) by flipping exactly one bit. Input: 101Output: YeExplanation: In 101, the 0 can be flipped to make it all 1Input: 11Output: NoExplanation: No matter whichever digit you flip, you will not get the d 5 min read Number of flips to make binary string alternate | Set 1Given a binary string, that is it contains only 0s and 1s. We need to make this string a sequence of alternate characters by flipping some of the bits, our goal is to minimize the number of bits to be flipped. Examples : Input : str = “001†Output : 1 Minimum number of flips required = 1 We can flip 8 min read Binary representation of next numberGiven a binary string that represents binary representation of positive number n, the task is to find the binary representation of n+1. The binary input may or may not fit in an integer, so we need to return a string.Examples: Input: s = "10011"Output: "10100"Explanation: Here n = (19)10 = (10011)2n 6 min read Min flips of continuous characters to make all characters same in a stringGiven a string consisting only of 1's and 0's. In one flip we can change any continuous sequence of this string. Find this minimum number of flips so the string consist of same characters only.Examples: Input : 00011110001110Output : 2We need to convert 1's sequenceso string consist of all 0's.Input 8 min read Generate all binary strings without consecutive 1'sGiven an integer n, the task is to generate all binary strings of size n without consecutive 1's.Examples: Input : n = 4Output : 0000 0001 0010 0100 0101 1000 1001 1010Input : n = 3Output : 000 001 010 100 101Approach:The idea is to generate all binary strings of length n without consecutive 1's usi 6 min read K'th bit in a binary representation with n iterationsGiven a decimal number m. Consider its binary representation string and apply n iterations. In each iteration, replace the character 0 with the string 01, and 1 with 10. Find the kth (1-based indexing) character in the string after the nth iterationExamples: Input: m = 5, n = 2, k = 5Output: 0Explan 15+ min read Substring and SubsequenceAll substrings of a given StringGiven a string s, containing lowercase alphabetical characters. The task is to print all non-empty substrings of the given string.Examples : Input : s = "abc"Output : "a", "ab", "abc", "b", "bc", "c"Input : s = "ab"Output : "a", "ab", "b"Input : s = "a"Output : "a"[Expected Approach] - Using Iterati 8 min read Print all subsequences of a stringGiven a string, we have to find out all its subsequences of it. A String is said to be a subsequence of another String, if it can be obtained by deleting 0 or more character without changing its order.Examples: Input : abOutput : "", "a", "b", "ab"Input : abcOutput : "", "a", "b", "c", "ab", "ac", " 12 min read Count Distinct SubsequencesGiven a string str of length n, your task is to find the count of distinct subsequences of it.Examples: Input: str = "gfg"Output: 7Explanation: The seven distinct subsequences are "", "g", "f", "gf", "fg", "gg" and "gfg" Input: str = "ggg"Output: 4Explanation: The four distinct subsequences are "", 13 min read Count distinct occurrences as a subsequenceGiven two strings pat and txt, where pat is always shorter than txt, count the distinct occurrences of pat as a subsequence in txt.Examples: Input: txt = abba, pat = abaOutput: 2Explanation: pat appears in txt as below two subsequences.[abba], [abba]Input: txt = banana, pat = banOutput: 3Explanation 15+ min read Longest Common Subsequence (LCS)Given two strings, s1 and s2, the task is to find the length of the Longest Common Subsequence. If there is no common subsequence, return 0. A subsequence is a string generated from the original string by deleting 0 or more characters, without changing the relative order of the remaining characters. 15+ min read Shortest Superstring ProblemGiven a set of n strings arr[], find the smallest string that contains each string in the given set as substring. We may assume that no string in arr[] is substring of another string.Examples: Input: arr[] = {"geeks", "quiz", "for"}Output: geeksquizforExplanation: "geeksquizfor" contains all the thr 15+ min read Printing Shortest Common SupersequenceGiven two strings s1 and s2, find the shortest string which has both s1 and s2 as its sub-sequences. If multiple shortest super-sequence exists, print any one of them.Examples:Input: s1 = "geek", s2 = "eke"Output: geekeExplanation: String "geeke" has both string "geek" and "eke" as subsequences.Inpu 9 min read Shortest Common SupersequenceGiven two strings s1 and s2, the task is to find the length of the shortest string that has both s1 and s2 as subsequences.Examples: Input: s1 = "geek", s2 = "eke"Output: 5Explanation: String "geeke" has both string "geek" and "eke" as subsequences.Input: s1 = "AGGTAB", s2 = "GXTXAYB"Output: 9Explan 15+ min read Longest Repeating SubsequenceGiven a string s, the task is to find the length of the longest repeating subsequence, such that the two subsequences don't have the same string character at the same position, i.e. any ith character in the two subsequences shouldn't have the same index in the original string. Examples:Input: s= "ab 15+ min read Longest Palindromic Subsequence (LPS)Given a string s, find the length of the Longest Palindromic Subsequence in it. Note: The Longest Palindromic Subsequence (LPS) is the maximum-length subsequence of a given string that is also a Palindrome. Longest Palindromic SubsequenceExamples:Input: s = "bbabcbcab"Output: 7Explanation: Subsequen 15+ min read Longest Palindromic SubstringGiven a string s, the task is to find the longest substring which is a palindrome. If there are multiple answers, then return the first appearing substring.Examples:Input: s = "forgeeksskeegfor" Output: "geeksskeeg"Explanation: There are several possible palindromic substrings like "kssk", "ss", "ee 12 min read PalindromeC Program to Check for Palindrome StringA string is said to be palindrome if the reverse of the string is the same as the string. In this article, we will learn how to check whether the given string is palindrome or not using C program.The simplest method to check for palindrome string is to reverse the given string and store it in a temp 4 min read Check if a given string is a rotation of a palindromeGiven a string, check if it is a rotation of a palindrome. For example your function should return true for "aab" as it is a rotation of "aba". Examples: Input: str = "aaaad" Output: 1 // "aaaad" is a rotation of a palindrome "aadaa" Input: str = "abcd" Output: 0 // "abcd" is not a rotation of any p 15+ min read Check if characters of a given string can be rearranged to form a palindromeGiven a string, Check if the characters of the given string can be rearranged to form a palindrome. For example characters of "geeksogeeks" can be rearranged to form a palindrome "geeksoskeeg", but characters of "geeksforgeeks" cannot be rearranged to form a palindrome. Recommended PracticeAnagram P 14 min read Online algorithm for checking palindrome in a streamGiven a stream of characters (characters are received one by one), write a function that prints 'Yes' if a character makes the complete string palindrome, else prints 'No'. Examples:Input: str[] = "abcba"Output: a Yes // "a" is palindrome b No // "ab" is not palindrome c No // "abc" is not palindrom 15+ min read Print all Palindromic Partitions of a String using Bit ManipulationGiven a string, find all possible palindromic partitions of a given string. Note that this problem is different from Palindrome Partitioning Problem, there the task was to find the partitioning with minimum cuts in input string. Here we need to print all possible partitions. Example: Input: nitinOut 10 min read Minimum Characters to Add at Front for PalindromeGiven a string s, the task is to find the minimum number of characters to be added to the front of s to make it palindrome. A palindrome string is a sequence of characters that reads the same forward and backward. Examples: Input: s = "abc"Output: 2Explanation: We can make above string palindrome as 12 min read Make largest palindrome by changing at most K-digitsYou are given a string s consisting of digits (0-9) and an integer k. Convert the string into a palindrome by changing at most k digits. If multiple palindromes are possible, return the lexicographically largest one. If it's impossible to form a palindrome with k changes, return "Not Possible".Examp 14 min read Minimum Deletions to Make a String PalindromeGiven a string s of length n, the task is to remove or delete the minimum number of characters from the string so that the resultant string is a palindrome. Note: The order of characters should be maintained. Examples : Input : s = "aebcbda"Output : 2Explanation: Remove characters 'e' and 'd'. Resul 15+ min read Minimum insertions to form a palindrome with permutations allowedGiven a string of lowercase letters. Find minimum characters to be inserted in the string so that it can become palindrome. We can change the positions of characters in the string.Examples: Input: geeksforgeeksOutput: 2Explanation: geeksforgeeks can be changed as: geeksroforskeeg or geeksorfroskeeg 5 min read Article Tags : Misc Strings DSA binary-string Practice Tags : MiscStrings Like