Array Rotate Problem !!!

 PROBLEM 48: Array Rotate 

A program to rotate 'N' number of elements in an array depending on the size of the rotate. Rotation to be considered from both the ends of an array. (Without using Built-in functions) (INTERVIEW QUESTION)

(For best view experience, view in windows version)

Author - Ajay Zad

Date     - 08/04/2022

n = int(input("Enter the size of the array :"))

m = int(input("Enter the size of rotation :"))

l = []

for i in range(0,n):

        a = int(input("Enter the elements in the array :"))

        l.append(a)

x = 1

while x == 1:

        d = input("Enter the direction for rotation Right(r) or Left(l):")

        if d == 'l':

            l2 = list(l)        

            j = 1

            for i in range(m-1,-1,-1):

                l2[n-j] = l[i]   

                j = j + 1

            j = 0

            for i in range(m,n):

                 l2[j] = l[m+j]

                 j = j + 1

            print(l2)

            l = l2[:]        

        elif d == 'r':

            l2 = list(l)

            j = 0

            for i in range(m-1,-1,-1):

                l2[i] = l[n-(j+1)]

                j = j + 1

            j = 0

            for i in range(m,n):

                l2[m+j] = l[j]

                j = j + 1

            print(l2)

            l = l2[:]

        else:

            print("Enter the correct option")

        x = int(input("Enter 1 to continue or press any other number to exit: "))

   

The above code is in Python language.

Input:

Enter the size of the array : 8

Enter the size of rotation   : 4

Enter the elements in the array : 1

Enter the elements in the array : 2

Enter the elements in the array : 3

Enter the elements in the array : 4

Enter the elements in the array : 5

Enter the elements in the array : 6

Enter the elements in the array : 7

Enter the elements in the array : 8

Enter the direction for rotation Right(r) or Left(l): l

[5, 6, 7, 8, 1, 2, 3, 4]

Enter 1 to continue or press any other number to exit: 1

Enter the direction for rotation Right(r) or Left(l): r

[1, 2, 3, 4, 5, 6, 7, 8]

Enter 1 to continue or press any other number to exit: 2

  

Repetition Of All Numbers Problem !!!

 PROBLEM 46: Repetition Of All Numbers

A Program to find out number of times the elements are repeated in the array.

(Interview Question)

Author - Ajay Zad

Date   - 15-03-2022

n = int(input("Enter the size of the array :"))

l = []

for i in range(0,n):

    m = int(input("Enter the elements in the array (repeat the values) :"))

    l.append(m)

    

s = set(l)

l1 = list(s)

l1.sort()

for i in range(0,len(l1)):

    cnt = 0

    for j in range(0,n):

        if l1[i] == l[j]:

            cnt = cnt + 1

    print("Number ",l1[i]," is repeated for = ",cnt," times")

       

The above code is in python language.

Input : 

Enter the size of the array : 5 

Enter the elements in the array (repeat the values) :1

Enter the elements in the array (repeat the values) :2

Enter the elements in the array (repeat the values) :1

Enter the elements in the array (repeat the values) :3

Enter the elements in the array (repeat the values) :2

Output: 

Number  1  is repeated for =  2  times

Number  2  is repeated for =  1  times

Number  3  is repeated for =  2  times

Prime Problem !!!

 PROBLEM 45: Prime 

Program to find out all the prime numbers from the range of 0 to n. 

 Name - Ajay Zad

 Date - 14/03/2022 

n = int(input("Enter the value for n :"))

cnt = 0 

print("The Prime numbers are :")

for i in range(2,n+1):

    for j in range(2,i):

        if i % j == 0:   

            cnt = cnt + 1

        

    if cnt == 0:

        print(i)

    cnt = 0

Input:

Enter the value for n : 

10

Output :

The Prime numbers are :

2

3

5

7

Missing Number Problem !!!

 PROBLEM 43 : Missing Number 

A Program to find out the missing number from a range of 0-N numbers in a series. 

(Interview Question)

Author - Ajay Zad

Date   - 10/03/2022 

import sys    

n = int(input("Enter the value for n : "))

l = []

for i in range(1,n):

    n1 = int(input("Enter the value less than or equal to 'n' without repeating the values :"))

    l.append(n1)

    

l.sort()

j = 1

for i in range(0,n-1):

    if j != l[i]:

        print("The missing number is ",j)

        sys.exit()

    j = j + 1

    

print("The missing number is ",n)

                                                                    OR

n = int(input("Enter the value for n : "))

l = []

sum = 0

for i in range(1,n):

    n1 = int(input("Enter the value less than or equal to 'n' without repeating the values :"))

    l.append(n1)

    sum = sum + n1

    

sum1 = 0    

for i in range(1,n+1):

    sum1 = sum1 + i

    

print("The missing number is ",(sum1-sum))

The above code is in Python language.

Input :

Enter the value for n : 5

Enter the value less than or equal to 'n' without repeating the values : 3

Enter the value less than or equal to 'n' without repeating the values : 1

Enter the value less than or equal to 'n' without repeating the values : 5

Enter the value less than or equal to 'n' without repeating the values : 2

Output :

The missing number is 4

Diamond Problem !!!

 PROBLEM 42 : Diamond 

A program to display the shape of  a diamond using asterisk (*) symbol for 'N' number of lines 

Author - Ajay Zad

date   - 08/03/2022 

# n defines number of lines     

n = int(input("Enter for n :"))

stars = 1

spaces = n     

for i in range(0,n):

    #loop for implementing spaces

    for j in range(spaces,0,-1):

        print(" ",end="")

    #loop for printing stars

    for k in range(0,stars):

        print("*",end="")

    print()

    stars = stars + 2

    spaces = spaces - 1

    

stars = (n*2) - 1

spaces = 1

for i in range(0,n):

    for j in range(0,spaces):

        print(" ",end="")

    for k in range(stars,0,-1):

        print("*",end="")

    print()

    stars = stars - 2

    spaces = spaces + 1

The above code is in Python language.

Input :

Enter for n : 4

Output :

              *

        *    *    *

    *    *    *    *    *

 *    *    *    *    *    *

    *    *    *    *    *

        *    *    *

              *

First & Last Problem !!!

PROBLEM 41 : First & Last

A program to find whether the first digit of  the input and the last digit of the input are same or not. 

 Author - Ajay Zad

 date   - 07/03/2022 

num = int(input("Enter the number :"))

#Converting from int data type to string data type

string = str(num)         

#Finding the length of the string           

length = len(string)       

#Comparing for equality          

if  string[0] == string[length-1]:     

    print("Both the digits are same")

else:

    print("Both the digits are not same")

Input :

Enter the number : 10011

Output :

Both the digits are same

Input :

Enter the number : 10022

Output:

Both the digits are not same 

Team Problem !!!

 PROBLEM 40: Team

Problem Reference: Codeforces 

One day three best friends Petya, Vasya and Tonya decided to form a team and take part in programming contests. Participants are usually offered several problems during programming contests. Long before the start the friends decided that they will implement a problem if at least two of them are sure about the solution. Otherwise, the friends won't write the problem's solution.

This contest offers n problems to the participants. For each problem we know, which friend is sure about the solution. Help the friends find the number of problems for which they will write a solution.

Input:

The first input line contains a single integer n (1 ≤ n ≤ 1000) — the number of problems in the contest. Then n lines contain three integers each, each integer is either 0 or 1. If the first number in the line equals 1, then Petya is sure about the problem's solution, otherwise he isn't sure. The second number shows Vasya's view on the solution, the third number shows Tonya's view. The numbers on the lines are separated by spaces.

Output:

Print a single integer — the number of problems the friends will implement on the contest.

Solution: 

1. n = int(input())
2. k=0
3. for i in range(0,n):
4. a , b , c = input().split()
5. if(int(a) == 1 and int(b) == 1 and int(c) == 1):
6. k = k + 1
7. elif(int(a) == 0 and int(b) == 1 and int(c) == 1):
8. k = k + 1
9. elif(int(a) == 1 and int(b) == 0 and int(c) == 1):
10. k = k + 1
11. elif(int(a) == 1 and int(b) == 1 and int(c) == 0):
12. k = k + 1
13. else:
14. pass
15. print(k)

The above solution is in python language.

Examples

input

3
1 1 0
1 1 1
1 0 0

output

2

input

2
1 0 0
0 1 1

output

1

Sereja and Dima Problem !!!

 PROBLEM 39: Sereja and Dima

Problem Reference: Codeforces

Sereja and Dima play a game. The rules of the game are very simple. The players have n cards in a row. Each card contains a number, all numbers on the cards are distinct. The players take turns, Sereja moves first. During his turn a player can take one card: either the leftmost card in a row, or the rightmost one. The game ends when there is no more cards. The player who has the maximum sum of numbers on his cards by the end of the game, wins.

Sereja and Dima are being greedy. Each of them chooses the card with the larger number during his move.

Inna is a friend of Sereja and Dima. She knows which strategy the guys are using, so she wants to determine the final score, given the initial state of the game. Help her.

Input:

The first line contains integer n (1 ≤ n ≤ 1000) — the number of cards on the table. The second line contains space-separated numbers on the cards from left to right. The numbers on the cards are distinct integers from 1 to 1000.

Output:

On a single line, print two integers. The first number is the number of Sereja's points at the end of the game, the second number is the number of Dima's points at the end of the game.

Soutions:

1. n = int(input())
2. a = [int(a) for a in input().split()]
3. s = []
4. d = []
5. i = 0
6. j = len(a) - 1
7. t = 0
8. while i <= j :
9. if t == 0:
10. if a[i] > a[j]:
11. s.append(a[i])
12. i = i + 1
13. else:
14. s.append(a[j])
15. j = j - 1
16. t = 1
17. else:
18. if a[i] > a[j]:
19. d.append(a[i])
20. i = i + 1
21. else:
22. d.append(a[j])
23. j = j - 1
24. t = 0
25.  
26. print(sum(s),sum(d))

The above solution is in python language

Examples

input

4
4 1 2 10

output

12 5

input

7
1 2 3 4 5 6 7

output

16 12

Do Not Be Distracted Problem !!!

 PROBLEM 38: Do Not Be Distracted!

Problem Reference: Codeforces 

Polycarp has 26 tasks. Each task is designated by a capital letter of the Latin alphabet.

The teacher asked Polycarp to solve tasks in the following way: if Polycarp began to solve some task, then he must solve it to the end, without being distracted by another task. After switching to another task, Polycarp cannot return to the previous task.

Polycarp can only solve one task during the day. Every day he wrote down what task he solved. Now the teacher wants to know if Polycarp followed his advice.

For example, if Polycarp solved tasks in the following order: "DDBBCCCBBEZ", then the teacher will see that on the third day Polycarp began to solve the task 'B', then on the fifth day he got distracted and began to solve the task 'C', on the eighth day Polycarp returned to the task 'B'. Other examples of when the teacher is suspicious: "BAB", "AABBCCDDEEBZZ" and "AAAAZAAAAA".

If Polycarp solved the tasks as follows: "FFGZZZY", then the teacher cannot have any suspicions. Please note that Polycarp is not obligated to solve all tasks. Other examples of when the teacher doesn't have any suspicious: "BA", "AFFFCC" and "YYYYY".

Help Polycarp find out if his teacher might be suspicious.

Input:

The first line contains an integer t (1≤t≤1000). Then t test cases follow.

The first line of each test case contains one integer n$($1≤n≤50) — the number of days during which Polycarp solved tasks.

The second line contains a string of length n, consisting of uppercase Latin letters, which is the order in which Polycarp solved the tasks.

Output:

For each test case output:

• "YES", if the teacher cannot be suspicious;
• "NO", otherwise.

You may print every letter in any case you want (so, for example, the strings yEs, yes, Yes and YES are all recognized as positive answer).

Solution:

1. t = int(input())
2. while 0 < t :
3. n = int(input())
4. s = input()
5. a = set()
6. i = 1
7. while i < len(s):
8. if s[i-1] != s[i]:
9. a.add(s[i-1])
10. if s[i] in a:
11. print("NO")
12. break
13. i = i + 1
14. if s[i-1] not in a:
15. print("YES")
16. t = t - 1

The above solution is in python language.

Example

input

5
3
ABA
11
DDBBCCCBBEZ
7
FFGZZZY
1
Z
2
AB

output

NO
NO
YES
YES
YES

Soft Drinking Problem !!!

 PROBLEM 37: Soft Drinking

Problem Reference : Codeforces

This winter is so cold in Nvodsk! A group of n friends decided to buy k bottles of a soft drink called "Take-It-Light" to warm up a bit. Each bottle has l milliliters of the drink. Also they bought c limes and cut each of them into d slices. After that they found p grams of salt.

To make a toast, each friend needs nl milliliters of the drink, a slice of lime and np grams of salt. The friends want to make as many toasts as they can, provided they all drink the same amount. How many toasts can each friend make?

Input:

The first and only line contains positive integers n, k, l, c, d, p, nl, np, not exceeding 1000 and no less than 1. The numbers are separated by exactly one space.

Output:

Print a single integer — the number of toasts each friend can make.

Solution: 

1. n, k, l, c, d, p, nl, np = input().split()
2. print(min((int(k) * int(l)) // int(nl) , int(c) * int(d) , int(p) // int(np)//int(n))

The above solution is in python language.

Examples

input

3 4 5 10 8 100 3 1

output

2

input

5 100 10 1 19 90 4 3

output

3

input

10 1000 1000 25 23 1 50 1

output

0