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

Queen's Attack II HackerRank Solution in Java with Explanation

Queen's Attack II Problem's Solution in Java (Chessboard Problem)   Problem Description : You will be given a square chess board with one queen and a number of obstacles placed on it. Determine how many squares the queen can attack.  A queen is standing on an n * n chessboard. The chess board's rows are numbered from 1 to n, going from bottom to top. Its columns are numbered from 1 to n, going from left to right. Each square is referenced by a tuple, (r, c), describing the row r and column c, where the square is located. The queen is standing at position (r_q, c_q). In a single move, queen can attack any square in any of the eight directions The queen can move: Horizontally (left, right) Vertically (up, down) Diagonally (four directions: up-left, up-right, down-left, down-right) The queen can move any number of squares in any of these directions, but it cannot move through obstacles. Input Format : n : The size of the chessboard ( n x n ). k : The number of obstacles...

Sales by Match HackerRank Solution | Java Solution

HackerRank Sales by Match problem solution in Java   Problem Description : Alex works at a clothing store. There is a large pile of socks that must be paired by color for sale. Given an array of integers representing the color of each sock, determine how many pairs of socks with matching colors there are. For example, there are n=7 socks with colors socks = [1,2,1,2,1,3,2]. There is one pair of color 1 and one of color 2 . There are three odd socks left, one of each color. The number of pairs is 2 .   Example 1 : Input : n = 6 arr = [1, 2, 3, 4, 5, 6] Output : 0 Explanation : We have 6 socks with all different colors, So print 0. Example 2 : Input : n = 10 arr = [1, 2, 3, 4, 1, 4, 2, 7, 9, 9] Output : 4 Explanation : We have 10 socks. There is pair of color 1, 2, 4 and 9, So print 4. This problem easily solved by HashMap . Store all pair of socks one by one in Map and check if any pair is present in Map or not. If pair is present then increment ans variable by 1 ...