Skip to main content

Check if two strings after processing backspace character are equal or not

Java Solution for Backspace String Compare

Check if two strings after processing backspace character are equal or not

Problem Description :

Given two strings s1 and s2, in which backspaces are represented by #. The task is to determine whether the resultant strings after processing the backspace character would be equal or not.

Example 1 :

Input :
s1 = "abcd#"
s2 = "abc"

Output :
true

Explanation : s1 become "abc" after backspace d character and s2 is already "abc"

Example 2 :

Input :
s1 = "abc#"
s2 = "abc"

Output :
false

Explanation : s1 become "ab" after backspace c character and s2 is "abc"

Example 3 :

Input :
s1 = "ab##c"
s2 = "ac"

Output :
false

Explanation : s1 become "c" after backspace and s2 is "ac"

Example 4 :

Input :
s1 = "abcdefg"
s2 = "abcdefi#g"

Output :
false

Here we have to delete last character if '#' (backspace) present in given String s1 or String s2. After that compare both string and if s1 and s2 matches return true otherwise return false. 

Solution 1 : Java Code for BackSpace String Compare

import java.util.Scanner;

public class BackspaceStringCompare {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        System.out.println("Enter str1 and str2 : ");
        String str1 = sc.next();
        String str2 = sc.next();

        System.out.println(backspaceCompare(str1, str2));
       
    }
    
    public static boolean backspaceCompare(String s, String t) {

        StringBuilder b1 = new StringBuilder();
        StringBuilder b2 = new StringBuilder();
       
        for (int i = 0; i < s.length(); i++) {
            if (s.charAt(i) == '#') {
                if (b1.length() !=0 ) {
                    b1.deleteCharAt(b1.length()-1);
                }
            } else {
                b1.append(s.charAt(i));
            }
        }
       
        for (int i = 0; i < t.length(); i++) {
            if (t.charAt(i) == '#') {
                if (b2.length() != 0) {
                    b2.deleteCharAt(b2.length()-1);
                }
            } else {
                b2.append(t.charAt(i));
            }
        }
       
        return b1.toString().equals(b2.toString());

    }
}

Solution Explanation :

  • Take two StringBuilder objects for String s1 and s2.
  • Traverse through entire given string characters one by one and add String character in StringBuilder. check if backspace is present or not, If present delete last character from given StringBuilder. 
  • Also check for StringBuilder length is greater than 0 otherwise it will gives error while deleting.
  • Last check both string using .equals() method and return true if matches otherwise return false.


RECOMMENDED TUTORIALS :

 

 

Comments

Popular posts from this blog

Plus Minus HackerRank Solution in Java | Programming Blog

Java Solution for HackerRank Plus Minus Problem Given an array of integers, calculate the ratios of its elements that are positive , negative , and zero . Print the decimal value of each fraction on a new line with 6 places after the decimal. Example 1 : array = [1, 1, 0, -1, -1] There are N = 5 elements, two positive, two negative and one zero. Their ratios are 2/5 = 0.400000, 2/5 = 0.400000 and 1/5 = 0.200000. Results are printed as:  0.400000 0.400000 0.200000 proportion of positive values proportion of negative values proportion of zeros Example 2 : array = [-4, 3, -9, 0, 4, 1]  There are 3 positive numbers, 2 negative numbers, and 1 zero in array. Following is answer : 3/6 = 0.500000 2/6 = 0.333333 1/6 = 0.166667 Lets see solution Solution 1 import java.io.*; import java.math.*; import java.security.*; import java.text.*; import java.util.*; import java.util.concurrent.*; import java.util.function.*; import java.util.regex.*; import java.util.stream.*; import static java.util.st

Flipping the Matrix HackerRank Solution in Java with Explanation

Java Solution for Flipping the Matrix | Find Highest Sum of Upper-Left Quadrant of Matrix Problem Description : Sean invented a game involving a 2n * 2n matrix where each cell of the matrix contains an integer. He can reverse any of its rows or columns any number of times. The goal of the game is to maximize the sum of the elements in the n *n submatrix located in the upper-left quadrant of the matrix. Given the initial configurations for q matrices, help Sean reverse the rows and columns of each matrix in the best possible way so that the sum of the elements in the matrix's upper-left quadrant is maximal.  Input : matrix = [[1, 2], [3, 4]] Output : 4 Input : matrix = [[112, 42, 83, 119], [56, 125, 56, 49], [15, 78, 101, 43], [62, 98, 114, 108]] Output : 119 + 114 + 56 + 125 = 414 Full Problem Description : Flipping the Matrix Problem Description   Here we can find solution using following pattern, So simply we have to find Max of same number of box like (1,1,1,1). And last