TCS Coding Question 2 Day 1 Slot 1

September 15, 2021

Coding Question 2 for 2022 (September slot)

In this article, we will discuss about the TCS Coding Question which is asked in the TCS placement test. This type of Coding Questions will help you to crack your upcoming TCS exam as well as during your inteview process.

TCS Coding Question 2 Day1 slot1

TCS Coding Question Day 1 Slot 1 – Question 2

Problem Statement – Given a string S(input consisting) of ‘*’ and ‘#’. The length of the string is variable. The task is to find the minimum number of ‘*’ or ‘#’ to make it a valid string. The string is considered valid if the number of ‘*’ and ‘#’ are equal. The ‘*’ and ‘#’ can be at any position in the string.

Note : The output will be a positive or negative integer based on number of ‘*’ and ‘#’ in the input string.

  • (*>#): positive integer
  • (#>*): negative integer
  • (#=*): 0

Example 1:

Input 1:

  • ###***   -> Value of S

Output :

  • 0 → number of * and # are equal
#include <bits/stdc++.h>
using namespace std;
 
int main()
{
    string s;
    int a=0,b=0;
    getline(cin,s);
    for(auto i:s)
    if(i=='#') a++;
    else if(i=='*') b++;
    cout<<b-a;
}
import java.util.*;
public class Solution
{
 	public static void main(String[] args)
 	{
        		Scanner sc=new Scanner(System.in);
        		String str=sc.next();
        		int count1=0,count2=0;
        		for(int i=0;i<str.length();i++)
        		{
                 		if(str.charAt(i)=='*')
                        		count1++;
                 		else if(str.charAt(i)=='#')
                         		count2++;
        		}
        		System.out.println(count1-count2);
	}
}
s=input()
a=0
b=0
for i in s:
    if i=='*':
        a+=1
    elif i=='#':
        b+=1
print(a-b)

5 comments on “TCS Coding Question 2 Day 1 Slot 1”


  • Abhishek

    ……………………….THE FOLLOWING ANSWER WILL ONLY CLEARR YOUR TEST CASES IN NQT EXAM……………………………..BY ABHISHEK PATIL
    n=str(input())
    m=str(input())
    if len(n)==len(m):
    print(“0”)
    if len(n)>len(m):
    print(len(n)-len(m))
    if len(n)len(m):
    print(len(n)-len(m))
    if len(n)>len(m):
    print(len(n)-len(m))

    1

    • Abhishek

      n=str(input())
      m=str(input())
      if len(n)==len(m):
      print(“0”)
      if len(n)>len(m):
      print(len(n)-len(m))
      if len(n)len(m):
      print(len(n)-len(m))
      if len(n)>len(m):
      print(len(n)-len(m))

      0

      • Abhishek

        n=str(input())

        m=str(input())

        if len(n)==len(m):

        print(“0”)

        if len(n)>len(m):

        print(len(n)-len(m))

        if len(n)len(m):

        print(len(n)-len(m))

        if len(n)>len(m):

        print(len(n)-len(m))

        0

  • Rahul

    rah = “####*****”
    raj = rah.count(“#”)
    ram = rah.count(“*”)
    if(raj>ram):
    print(“Positive integer”)
    elif(raj==ram):
    print(“0”)
    else:
    print(“Negative integer”)

    0

    • Rahul

      rah = “###***”
      raj = rah.count(“#”)
      ram = rah.count(“*”)
      if(raj>ram):
      print(“Positive integer”)
      elif(raj==ram):
      print(“0”)
      else:
      print(“Negative integer”)

      0