softare development

Solve the HackerRank Substring Challenge (Java Solution)

In this article we will solve the HackerRank Substring challenge (Java solution). Let’s take a look at the question

Question:

A substring is a group of contiguous characters in a string. For instance, all substrings of abc are [a, b, c, ab, bc, abc].

In this challenge, you will be given a binary representation of a number. You must determine the total number of substrings present that match the following conditions:

  1. The 0’s and 1’s are grouped consecutively (e.g., 01, 10, 0011, 1100, 000111, etc).
  2. The number of 0’s in the substring is equal to the number of 1’s in the substring.

As an example, consider the string 001101. The 4 substrings matching the two conditions include [0011, 01, 10, 01]. Note that 01 appears twice, from indexes 1-2 and 4-5. There are other substrings, e.g. 001 and 011 that match the first condition but not the second.

Java Solution to the Hackerrank challenge:

Let’s solve the hackerrank substring challenge using Java

import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

    /*
     * Complete the function below.
     */    static int counting(String s) {
        int curr = 1, prev = 0, ans = 0;
        for(int i = 1; i< s.length(); i++)
            if(s.charAt(i) == s.charAt(i-1)) curr++;
             else{
                 ans += Math.min(curr, prev);
                 prev = curr;
                 curr = 1;
             }
             return ans + Math.min(curr, prev);
            }
    public static void main(String[] args) throws IOException {
        Scanner in = new Scanner(System.in);
        final String fileName = System.getenv("OUTPUT_PATH");
        BufferedWriter bw = null;
        if (fileName != null) {
            bw = new BufferedWriter(new FileWriter(fileName));
        }
        else {
            bw = new BufferedWriter(new OutputStreamWriter(System.out));
        }

        int res;
        String s;
        try {
            s = in.nextLine();
        } catch (Exception e) {
            s = null;
        }

        res = counting(s);
        bw.write(String.valueOf(res));
        bw.newLine();

        bw.close();
    }
}

Here, we declared three variables cur, prev and ans. We’re also looping through to get the characters at the given index.

This is how we solve the hackerrank substring challenge using Java

Download the Codeflare mobile app and start learning how to code

Solve the FizzBuzz HackerRank Challenge

Start your software development training journey

View Comments

  • public static int CountUniqueSubstrings(string s)
    {
    int count = 0;
    int n = s.Length;
    HashSet uniqueChars = new HashSet();
    for (int i = 0; i < n; i++)
    {
    uniqueChars.Clear();

    for (int j = i; j < n; j++)
    {
    if (uniqueChars.Contains(s[j]))
    {
    break;
    }
    uniqueChars.Add(s[j]);
    count++;
    }
    }
    return count;
    }

Recent Posts

What is a QR Code And How to Create One

QR codes have evolved from a niche tracking technology to an indispensable digital connector, seamlessly…

7 days ago

Will AI Replace Software Developers?

Artificial Intelligence (AI) has made remarkable progress in recent years, transforming industries such as healthcare,…

2 weeks ago

Can Tech Really Solve Climate Change—Or Is It Just Greenwashing?

Climate change is one of the most pressing challenges of our time, with rising global…

3 weeks ago

The Inevitable Rise of Transhumanism

In the last few decades, technology has become so embedded in our daily lives that…

3 weeks ago

Drones 101: What They Are & How They Work

In recent years, drones have become more than just cool gadgets or tools for tech…

4 weeks ago

React Native vs. Flutter: Which is Best to Build Mobile Apps in Abuja?

Looking to build mobile apps in Abuja? Choosing the right framework is crucial for performance,…

1 month ago