Codechef Div3 Left Right Problem

Codechef/Codechef_LeftRight

@@ -0,0 +1,16 @@
+t=int(input())
+for i in range(t):
+	n=int(input())
+	s=input()
+	l=[]
+	flag=0
+	for j in range(len(s)):
+		l.append(s[j])
+	for k in range(len(l)-1):
+		if l[k]==l[k+1]:
+			flag=1
+			break
+	if flag==1:
+		print("yes")
+	else:
+		print("no")

Codechef/Minimum bracket Reversal

@@ -0,0 +1,42 @@
+
+#include<bits/stdc++.h>
+using namespace std;
+
+int countMinReversals(string expr)
+{
+	int len = expr.length();
+
+	if (len%2)
+	return -1;
+
+	stack<char> s;
+	for (int i=0; i<len; i++)
+	{
+		if (expr[i]=='}' && !s.empty())
+		{
+			if (s.top()=='{')
+				s.pop();
+			else
+				s.push(expr[i]);
+		}
+		else
+			s.push(expr[i]);
+	}
+
+	int red_len = s.size();
+
+	int n = 0;
+	while (!s.empty() && s.top() == '{')
+	{
+		s.pop();
+		n++;
+	}
+	return (red_len/2 + n%2);
+}
+
+int main()
+{
+string expr = "}}{{";
+cout << countMinReversals(expr);
+return 0;
+}

div3jan(a.py

@@ -0,0 +1,7 @@
+t=int(input())
+for i in range(t):
+	n=int((input()))
+	a=list(map(int,input().split()))
+	m=max(a)
+	n=min(a)
+	print(m-n)

div3jan(b.py

@@ -0,0 +1,18 @@
+for i in range(int(input())):
+	a,b,c=list(map(int,input().split()))
+
+
+	f = (a+c)/2 
+	e = 2*b-c
+	g = 2*b-a
+
+	if f%b==0 and f>0:
+		print("yes")
+	elif e%a==0 and e>0:
+		print("yes")
+	elif g%c==0 and g>0:
+		print("yes")
+	else:
+		print("no")
+
+

fixedDeposite.py

@@ -0,0 +1,14 @@
+for i in range(int(input())):
+	n,x=list(map(int,input().split()))
+	l=list(map(int,input().split()))
+	l.sort(reverse=True)
+	c=0
+	a=0
+	for j in l:
+		c+=1
+		a+=j
+		if a>=x:
+			print(c)
+			break
+	else:
+		print(-1)

pattern.py

@@ -0,0 +1,10 @@
+def pypart(n):
+
+    for i in range(0, n):
+        for j in range(0, i+1):
+            print("* ",end="")
+
+        print("\r")
+
+n = int(input())
+pypart(n)