Daily jobs Updates

# Straight Line number or not❤️ def isStraighLineNum(N): # N must be > 99 if (N <= 99): return False; str1 = str(N); # Difference between consecutive # digits must be same d = int(str1[1]) - int(str1[0]); for i in range(2, len(str1)): if (int(str1[i]) - int(str1[i - 1]) != d): return False; return True; # Driver Code # Given Number N N = 135; # Function Call if (isStraighLineNum(N)): print("Yes"); else: print("No"); https://t.me/offcampusjobs_0 https://t.me/offcampusjobs_0

Group for upcoming Slot of TCS NQT ❤️ https://t.me/good_coders

Python :RAO CODE❤️ 100% Executing https://t.me/offcampusjobs_0 https://t.me/offcampusjobs_0

CPP ❤️ RAO CODE #include <bits/stdc++.h> using namespace std; int main() { int n; cin>>n; char arr[n]; for(int i=0;i<n;i++) { cin>>arr[i]; } int ans=0; for(int i=0;i<n;i++) { for(int j=i+1;j<n;j++) { if(arr[i]==0 && arr[j]==1) { ans++; } } } cout<<ans; return 0; } RAO CODE https://t.me/offcampusjobs_0 https://t.me/offcampusjobs_0

Python :RAO CODE❤️ 100% Executing n=int(input()) l=list(map(int,input().split()[:n])) s=set(l) f=[] for i in s: if(l.count(i)%2): f.append(i) if(len(f)==0): print('All are even') else: for i in f: print(i) RAO CODE https://t.me/offcampusjobs_0 https://t.me/offcampusjobs_0

Biker Code :: Java 100% Executing ❤️❤️ import java.util.Scanner; public class Bikers { public static void main(String[] args) { Scanner in = new Scanner(System.in); int t =in.nextInt(); int e[]= new int[t]; for(int i=0;i<t;i++) e[i]= in.nextInt(); int count =0; for(int i=0;i<t;i++){ for(int j= i+1;j<t;j++){ if(e[i]!=e[j] && e[i]==0){ count++; } } } System.out.println(count); } } https://t.me/offcampusjobs_0 https://t.me/offcampusjobs_0

Maximum Number of Guests Cruise Code 100% Executing ❤️❤️ t= int(input ()) Max_g=0 g=0 For _ in range(t): E=int(input()) L=int(input ()) g+= E-L If g> max_g: max_g=g Print(max_g) https://t.me/offcampusjobs_0 https://t.me/offcampusjobs_0

Party code 100% executing ❤️ n=int(input()) entry=[] exit=[] for i in range(n): k=int(input()) entry.append(k) for i in range(n): l=int(input()) exit.append(l) max=0 sum=0 for i in range(n): sum+=entry[i]-exit[i] if sum>=max: max=sum print(max) https://t.me/offcampusjobs_0 https://t.me/offcampusjobs_0

Fun / Party Code ::: Python : n=int(input()) l=list(map(int,input().split()[:n])) s=set(l) f=[] for i in s: if(l.count(i)%2): f.append(i) if(len(f)==0): print('All are even') else: for i in f: print(i) All solution here https://t.me/offcampusjobs_0 https://t.me/offcampusjobs_0

Fun / Party Code ::: Python : n=int(input()) l=list(map(int,input().split()[:n])) s=set(l) f=[] for i in s: if(l.count(i)%2): f.append(i) if(len(f)==0): print('All are even') else: for i in f: print(i) All solution here https://t.me/offcampusjobs_0 https://t.me/offcampusjobs_0

8 https://t.me/offcampusjobs_0

TCS All Slots Solution posted Here join now 👇👇 https://t.me/offcampusjobs_0

TCS All Slots Solution posted Here join now 👇👇 https://t.me/offcampusjobs_0

string=input() n=int(input()) p=int(string[0:n+1]) for i in range(len(string)-n): p=max(p,int(string[i:i+n+1])) print(p) Join for more ❤️ https://t.me/offcampusjobs_0 https://t.me/offcampusjobs_0

#include <iostream> using namespace std; int main() { int count=1,n,j,i; cin>>n; int arr[n]; for(int i=0;i<n;i++) { cin>>arr[i]; } for(i=1;i<n;i++) { for( j=0;j<i;j++) { if(arr[j]>arr[i]) { break; } } if(j==i) count++; } cout<<count; return 0; } C++ Join for more ❤️❤️ https://t.me/offcampusjobs_0 https://t.me/offcampusjobs_0

EPAM Off-Campus Drive | 2022 Batch | 6LPA bit.ly/3BZ1vow ✅ Share post with ur college 2022 Batches https://t.me/offcampusjobs_0

TCS All Slots Solution will be posted Here join now 👇👇 https://t.me/offcampusjobs_0

TCS All Slots Solution will be posted Here join now 👇👇 https://t.me/offcampusjobs_0