occurrence 2 as a gidit

 x=0

for i in range(23):

    x+=str(i).count('2')

print(x)

Comments

Post a Comment

Popular posts from this blog

Minimum indexed character

  Easy Accuracy: 50.58% Submissions: 21507 Points: 2 Given a string  str  and another string  patt . Find the first position (considering 0-based indexing) of the character in  patt  that is present at the minimum index in  str . Example 1: Input: str = geeksforgeeks patt = set Output: 1 Explanation: e is the character which is present in given patt "geeksforgeeks" and is first found in str "set". First Position of e in str is 1. Example 2: Input: str = adcffaet patt = onkl Output: -1 Explanation: There are none of the characters which is common in patt and str. Your Task: You only need to complete the function minIndexChar()  that returns the index of answer in str or returns -1 in case ...
Read more

Right most non zero digit

Right most non zero digit Easy Accuracy: 39.12% Submissions: 8042 Points: 2 You will be given an array A of N non-negative integers. Your task is to find the rightmost non-zero digit in the product of array elements. Example 1: Input: N = 4, A = {3, 23, 30, 45} Output: 5 Explanation: Product of these numbers are 93150. Rightmost non-zero digit is 5. Example 2: Input: N = 5, A = {1, 2, 3, 4, 5} Output: 2 Explanation: Product of these numbers are 120. Rightmost non-zero digit is 2....
Read more

Count the Reversals

Given a string   S   consisting only of opening and closing curly brackets  '{'   and  '}'  find out the minimum number of reversals required to make a balanced expression. Input The first line of input contains an integer  T,  denoting the number of test cases. Then  T  test cases follow. The first line of each test case contains a string  S  consisting only of  {  and  } . Output Print out minimum reversals required to make  S  balanced. If it cannot be balanced, then print  -1 . Constraints 1 <= T <= 100 0 <= |S| <= 50 Examples Input 4 }{{}}{{{ {{}}}} {{}{{{}{{}}{{ {{{{}}}} Output 3 1 -1 0 Explanation: Testcase 1:  For the given string }{ {} }{{{ since the length is even we just need to count the number of openning brackets('{') suppose denoted by 'm' and closing brackest('}') suppose dentoed by 'n' after removing highlighted ones. After counting compute ceil(m/2) + ceil(n/...
Read more