Skip to content
Related Articles

Related Articles

Improve Article

Given a binary string, count number of substrings that start and end with 1.

  • Difficulty Level : Easy
  • Last Updated : 28 Apr, 2021

Given a binary string, count number of substrings that start and end with 1. For example, if the input string is “00100101”, then there are three substrings “1001”, “100101” and “101”.
Source: Amazon Interview Experience | Set 162
Difficulty Level: Rookie
 

A Simple Solution is to run two loops. Outer loops picks every 1 as starting point and inner loop searches for ending 1 and increments count whenever it finds 1.
 

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.  To complete your preparation from learning a language to DS Algo and many more,  please refer Complete Interview Preparation Course.

In case you wish to attend live classes with experts, please refer DSA Live Classes for Working Professionals and Competitive Programming Live for Students.

C++




// A simple C++ program to count number of
// substrings starting and ending with 1
#include<iostream>
  
using namespace std;
 
int countSubStr(char str[])
{
int res = 0; // Initialize result
 
// Pick a starting point
for (int i=0; str[i] !='\0'; i++)
{
        if (str[i] == '1')
        {
            // Search for all possible ending point
            for (int j=i+1; str[j] !='\0'; j++)
            if (str[j] == '1')
                res++;
        }
}
return res;
}
 
// Driver program to test above function
int main()
{
char str[] = "00100101";
cout << countSubStr(str);
return 0;
}
Java



// A simple C++ program to count number of
//substrings starting and ending with 1
 
class CountSubString
{
    int countSubStr(char str[],int n)
    {
        int res = 0;  // Initialize result
 
        // Pick a starting point
        for (int i = 0; i<n; i++)
        {
            if (str[i] == '1')
            {
                // Search for all possible ending point
                for (int j = i + 1; j< n; j++)
                {
                    if (str[j] == '1')
                        res++;
                }
            }
        }
        return res;
    }
 
    // Driver program to test the above function
    public static void main(String[] args)
    {
        CountSubString count = new CountSubString();
        String string = "00100101";
        char str[] = string.toCharArray();
        int n = str.length;
        System.out.println(count.countSubStr(str,n));
    }
}
Python3



# A simple Python 3 program to count number of
# substrings starting and ending with 1
 
def countSubStr(st, n) :
     
    # Initialize result
    res = 0  
  
   # Pick a starting point
    for i in range(0, n) :
        if (st[i] == '1') :
 
            # Search for all possible ending point
            for j in range(i+1, n) :
                if (st[j] == '1') :
                    res = res + 1
         
    return res
     
  
# Driver program to test above function
st = "00100101";
list(st)
n= len(st)
print(countSubStr(st, n), end="")
 
 
# This code is contributed
# by Nikita Tiwari.
C#



// A simple C# program to count number of
// substrings starting and ending with 1
using System;
 
class GFG
{
public virtual int countSubStr(char[] str,
                               int n)
{
    int res = 0; // Initialize result
 
    // Pick a starting point
    for (int i = 0; i < n; i++)
    {
        if (str[i] == '1')
        {
            // Search for all possible
            // ending point
            for (int j = i + 1; j < n; j++)
            {
                if (str[j] == '1')
                {
                    res++;
                }
            }
        }
    }
    return res;
}
 
// Driver Code
public static void Main(string[] args)
{
    GFG count = new GFG();
    string s = "00100101";
    char[] str = s.ToCharArray();
    int n = str.Length;
    Console.WriteLine(count.countSubStr(str,n));
}
}
 
// This code is contributed by Shrikant13
PHP



<?php
// A simple PHP program to count number of
// substrings starting and ending with 1
 
function countSubStr($str)
{
    $res = 0; // Initialize result
 
    // Pick a starting point
    for ($i = 0; $i < strlen($str); $i++)
    {
            if ($str[$i] == '1')
            {
                // Search for all possible
                // ending point
                for ($j = $i + 1;
                     $j < strlen($str); $j++)
                if ($str[$j] == '1')
                    $res++;
            }
    }
    return $res;
}
 
// Driver Code
$str = "00100101";
echo countSubStr($str);
 
// This code is contributed by ita_c
?>
Javascript



<script>
 
// A simple javascript program to count number of
// substrings starting and ending with 1
     
    function countSubStr(str,n)
    {
        let res = 0;  // Initialize result
        // Pick a starting point
        for (let i = 0; i<n; i++)
        {
            if (str[i] == '1')
            {
                // Search for all possible ending point
                for (let j = i + 1; j< n; j++)
                {
                    if (str[j] == '1')
                        res++;
                }
            }
        }
        return res;
    }
     
    // Driver program to test the above function
    let string = "00100101";
    let n=string.length;
    document.write(countSubStr(string,n));
     
     
    // This code is contributed by rag2127
     
</script>
Output: 


3
Time Complexity of the above solution is O(n2). We can find count in O(n) using a single traversal of input string. Following are steps. 
a) Count the number of 1’s. Let the count of 1’s be m. 
b) Return m(m-1)/2 
The idea is to count total number of possible pairs of 1’s.
 
C++



// A O(n) C++ program to count number of
// substrings starting and ending with 1
#include<iostream>
 
using namespace std;
 
int countSubStr(char str[])
{
   int m = 0; // Count of 1's in input string
 
   // Traverse input string and count of 1's in it
   for (int i=0; str[i] !='\0'; i++)
   {
        if (str[i] == '1')
           m++;
   }
 
   // Return count of possible pairs among m 1's
   return m*(m-1)/2;
}
 
// Driver program to test above function
int main()
{
  char str[] = "00100101";
  cout << countSubStr(str);
  return 0;
}
Java



// A O(n) C++ program to count number of substrings
//starting and ending with 1
 
class CountSubString
{
    int countSubStr(char str[], int n)
    {
        int m = 0; // Count of 1's in input string
 
        // Traverse input string and count of 1's in it
        for (int i = 0; i < n; i++)
        {
            if (str[i] == '1')
                m++;
        }
 
        // Return count of possible pairs among m 1's
        return m * (m - 1) / 2;
    }
 
    // Driver program to test the above function
    public static void main(String[] args)
    {
        CountSubString count = new CountSubString();
        String string = "00100101";
        char str[] = string.toCharArray();
        int n = str.length;
        System.out.println(count.countSubStr(str, n));
    }
}
Python3



# A Python3 program to count number of
# substrings starting and ending with 1
 
def countSubStr(st, n) :
 
    # Count of 1's in input string
    m = 0 
  
    # Traverse input string and
    # count of 1's in it
    for i in range(0, n) :
        if (st[i] == '1') :
            m = m + 1
         
    # Return count of possible
    # pairs among m 1's
    return m * (m - 1) // 2
    
  
# Driver program to test above function
st = "00100101";
list(st)
n= len(st)
print(countSubStr(st, n), end="")
 
 
# This code is contributed
# by Nikita Tiwari.
C#



// A O(n) C# program to count
// number of substrings starting
// and ending with 1
using System;
 
class GFG
{
int countSubStr(char []str, int n)
{
    int m = 0; // Count of 1's in
               // input string
 
    // Traverse input string and
    // count of 1's in it
    for (int i = 0; i < n; i++)
    {
        if (str[i] == '1')
            m++;
    }
 
    // Return count of possible
    // pairs among m 1's
    return m * (m - 1) / 2;
}
 
// Driver Code
public static void Main(String[] args)
{
    GFG count = new GFG();
    String strings = "00100101";
    char []str = strings.ToCharArray();
    int n = str.Length;
    Console.Write(count.countSubStr(str, n));
}
}
 
// This code is contributed by princiraj
PHP



<?php
// A simple PHP program to count number of
// substrings starting and ending with 1
 
function countSubStr($str)
{
    $m = 0; // Initialize result
 
    // Pick a starting point
    for ($i = 0; $i < strlen($str); $i++)
    {
        if ($str[$i] == '1')
        {
            $m++;
        }
    }
     
    // Return count of possible
    // pairs among m 1's
    return $m * ($m - 1) / 2;
}
 
// Driver Code
$str = "00100101";
echo countSubStr($str);
 
// This code is contributed
// by Akanksha Rai
?>
Javascript



<script>
// A O(n) javascript program to count number of substrings
//starting and ending with 1
 
    function countSubStr(str,n)
    {
        let m = 0; // Count of 1's in input string
  
        // Traverse input string and count of 1's in it
        for (let i = 0; i < n; i++)
        {
            if (str[i] == '1')
                m++;
        }
  
        // Return count of possible pairs among m 1's
        return m * Math.floor((m - 1) / 2);
    }
     
    // Driver program to test the above function
    let str = "00100101";
    let n = str.length;
    document.write(countSubStr(str, n));
     
    //  This code is contributed by avanitrachhadiya2155
</script>
Output: 
 
3
 
This article is contributed by Shivam. Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above
 



My Personal Notes
arrow_drop_up
Previous
Amazon Interview Experience | Set 162
Next

Given only a pointer/reference to a node to be deleted in a singly linked list, how do you delete it?
Recommended Articles
Page :
Different substrings in a string that start and end with given strings
22, Nov 17
Number of substrings that start with "geeks" and end with "for"
03, Sep 19
Maximum number of 0s placed consecutively at the start and end in any rotation of a Binary String
12, Mar 21
Count characters to be shifted from the start or end of a string to obtain another string
30, Sep 20
Count of subarrays which start and end with the same element
16, May 20
Print all Subsequences of String which Start with Vowel and End with Consonant.
24, Aug 17
Count ways to reach end from start stone with at most K jumps at each step
30, Mar 20
Sub-strings that start and end with one character and have at least one other
26, Dec 18
Program to build a DFA to accept strings that start and end with same character
14, Feb 20
Move all zeros to start and ones to end in an Array of random integers
18, Apr 19
Maximum sum subarray such that start and end values are same
29, Nov 18
Rearrange the Array by shifting middle elements to start and end alternatively
30, Jul 21
Count binary strings of length same as given string after removal of substrings "01" and "00" that consists of at least one '1'
18, Nov 20
Count ways to split a Binary String into three substrings having equal count of zeros
09, Sep 20
Check if binary representations of 0 to N are present as substrings in given binary string
23, Jul 20
Maximize sum by selecting M elements from the start or end of rows of a Matrix
28, Sep 20
Split a Binary String such that count of 0s and 1s in left and right substrings is maximum
14, Feb 21
Count of substrings of a given Binary string with all characters same
15, Jul 20
Check if all substrings of length K of a Binary String has equal count of 0s and 1s
08, Sep 20
Count of substrings of a string containing another given string as a substring
03, Dec 20
Count of substrings of a string containing another given string as a substring | Set 2
14, Dec 20
Number of alternating substrings from a given Binary String
14, Jun 21
Check if end of given Binary string can be reached by choosing jump value in between given range
15, Oct 21
Split the binary string into substrings with equal number of 0s and 1s
14, Nov 19
Article Contributed By :
https://media.geeksforgeeks.org/auth/avatar.png
GeeksforGeeks
Vote for difficulty
Current difficulty :
Easy





Improved By :
Article Tags :
Practice Tags :
Report Issue

We use cookies to ensure you have the best browsing experience on our website. By using our site, you
acknowledge that you have read and understood our
Cookie Policy &
        Privacy Policy

Lightbox