วีดีโอ

Problem 2 : def shiftzeros(arr): count = 0 temp = [] for i in range(len(arr)): if arr[i] == 0: count += 1 continue temp.append(arr[i]) temp += [0] * count return temp

Jackson Deborah Young Donald Robinson Laura

NICE SUPER EXCELLENT MOTIVATED

NICE SUPER EXCELLENT MOTIVATED

class HelloWorld { public static boolean isPrime(int n){ if(n==0 || n==1){ return false; } for(int i=2;i*i<=n;i++){ if(n%i==0){ return false; } } return true; } public static void main(String[] args) { int n=1; int lprime=0; for(int i=1;i<=n;i++){ if(n%i==0 && isPrime(i)){ lprime=i; } } if(Math.sqrt(n)<lprime){ System.out.println("Strange"); } else{ System.out.println("Not Strange"); } } }

// Online Java Compiler // Use this editor to write, compile and run your Java code online class HelloWorld { public static void main(String[] args) { int arr[]={0,1,0,2,1,0,1,3,2,1,2,1}; int left[]=new int[arr.length]; int right[]=new int[arr.length]; int leftmax=0; for(int i=0;i<arr.length;i++){ leftmax=Math.max(arr[i],leftmax); left[i]=leftmax; } int rightmax=0; for(int i=arr.length-1;i>=0;i--){ rightmax=Math.max(arr[i],rightmax); right[i]=rightmax; } int water=0; for(int i=0;i<arr.length;i++){ int min=Math.min(left[i],right[i]); water+=(min-arr[i]); } System.out.println(water); } }

Johnson Mark Jones Thomas Brown Charles

is there repeating question is coming or not??

Yesterday I had my interview also

please do capgemini its coming in campus

✅✅Important IT Interview Subject Notes: topmate.io/code_bashers/1026390 ✅✅Join Our Telegram Group for Accenture 2025 Batch Discussion : t.me/placement_batch_2025

sir can you plz provide code in python

Sir I got the TCS Atlas offer letter then what is the next step i will do.

jise coding ka c nhi ata wo kese kre....kese kia or kese padhe ki yh chije samjh ay

// Online Java Compiler // Use this editor to write, compile and run your Java code online import java.util.*; class HelloWorld { public static void main(String[] args) { Scanner sc=new Scanner(System.in); String str=sc.nextLine(); str=str.toLowerCase(); String letter="abcdefghijklmnopqrstuvwxyz"; int flag=0; for(int i=0;i<letter.length();i++){ if(str.indexOf(letter.charAt(i))==-1){ flag=1; break; } } if(flag==1){ System.out.println("No"); } else{ System.out.println("Yes"); } } }

Will the communication is an elimination round before interview ?

import java.util.*; public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int N = sc.nextInt(); int M = sc.nextInt(); int R = sc.nextInt(); int sum = 0; int income[] = new int[N]; int outcome[] = new int[M]; for(int i = 0; i < N; i++) income[i] = sc.nextInt(); for(int i = 0; i < M; i++) outcome[i] = sc.nextInt(); for(int i = 0; i < M; i++) sum += (outcome[i] - R); for(int i = 0; i < N; i++) sum -= (income[i] - R); if(sum == 0) System.out.println("Balanced"); else System.out.println(sum - R); } }

bro please upload new videos on coding

brother please make series of capgemini and cognizant latest and past year coding solution

Jo 2 Coding Questions ke liye 90 Min milte hai ,usme humlog kabhi bhi unn 2 Questions ke beech switch kar sakte hai ki ?? Har 1 Coding Question ka time slot fixed hota hai aur agar fixed hota hai to 1st quesn ko kitna time milta hai ??

public class Main { public static void main(String[] args) { String str="RGGRGRG"; char ch[]=str.toCharArray(); int k=3; int time=0; for(int i=0;i<ch.length;i++){ if(ch[i]=='R'){ time++; for(int j=i;j<i+k && j<ch.length;j++){ if(ch[j]=='R'){ ch[j]='G'; } else{ ch[j]='R'; } } } } System.out.println(time); } }

Is there detailed solution available for each numerical ability question in the preparation material

make the series of question which are asked in the technical assessment it would be great help

2:00 how do i believe that these are previous year questions and not some random questions from internet?

Sir how to apply for tcs nqt exam ??

✅✅TCS NQT Preparation Material 2025: topmate.io/code_bashers/1183056 CouponCode : TCS2025 ✅✅Join Our Telegram Group for Accenture 2025 Batch Discussion : t.me/placement_batch_2025

For Q1 if all costs were different: public static void transformcost(String s1,String s2){ //changes in s1 to s2 int add=0; int remove=0; HashMap<Character,Integer> map = new HashMap<>(); for(int i=0;i<s2.length();i++){ if(map.containsKey(s2.charAt(i))){ map.put(s2.charAt(i), map.get(s2.charAt(i))+1); }else{ map.put(s2.charAt(i),1); } } String newstr=""; for(int i=0;i<s1.length();i++){ if(map.containsKey(s1.charAt(i))){ if(map.get(s1.charAt(i))==0){ map.remove(s1.charAt(i)); remove++; }else{ map.put(s1.charAt(i), map.get(s1.charAt(i))-1); newstr+=s1.charAt(i); } }else{ remove++; } } for(Character s:map.keySet()){ add+=map.get(s); while(map.get(s)>0){ newstr+=s; map.put(s,map.get(s)-1); } } int swaps=0; for(int i=0;i<newstr.length();i++){ if(newstr.charAt(i)!=s2.charAt(i)){ swaps++; } } System.out.println(add*1); }

For everyone who are attending at the same time, same qns will be given or different qns for coding?

thnaku

If i know only c++ then how can i handle all these java questions

PYTHON CODE WHERE I HAVENT USED OPERATORS count=0 n=int(input("enter a range that u want to check magic no")) for j in range(1,n+1): binlist=list(bin(j)[2:]) print(binlist) for i in range(len(binlist)): if int(binlist[i])==0: binlist[i]=1 else: binlist[i]=2 print(binlist) su = sum(int(x) for x in binlist) if su%2!=0: count=count+1 print(count)

Hi sir I have joined in one company as a graduate appreticeship trainee before getting tcs OL. If I want to abscond from this company, will tcs bgc fail. I do not have pf and I have 30 das notice. I attendes tcs as fresher. I received only stipend from current campany and I try to abscond as they are not giving me the releiving letter. Will.I be caught in tcs bgc if I hide this company? Pls answer sir

Hi sir I have joined in one company as a graduate appreticeship trainee before getting tcs OL. If I want to abscond from this company, will tcs bgc fail. I do not have pf and I have 30 das notice. I attendes tcs as fresher. I received only stipend from current campany and I try to abscond as they are not giving me the releiving letter. Will.I be caught in tcs bgc if I hide this company? Pls answer sir

don't purchase it, waste of money

Is it correct for 1st question s = input() k = int(input()) x = 0 for i in s: if i == 'a': x+=1 if (x >= k): print(k) else: print(x)

public class Find_number_of_cards_pyramid { public static void main(String[] args) { Scanner sc = new Scanner(System.in); System.out.println("Enter Number of levels of Pyramid"); int levels = sc.nextInt(); int count =0; for(int i=1;i<=levels;i++){ count = count+2*i; } System.out.println(count); } }

Will the communication round is an elimination round..?

Sir, I have applied for Packaged APP Development Associate in accenture. I received assesment slot booking mail on 20th August, but it was showing "No slots available at the moment. Comeback later!". Will I get another mail regarding slots booking.? Will I able to proceed further in the hiring process.

2nd question: import java.util.*; public class Main { public static void main(String[] args) { Scanner sc=new Scanner (System.in); int n=sc.nextInt(); int[] arr=new int [n]; for(int i=0;i<n;i++){ arr[i]=sc.nextInt(); } ArrayList<Integer> list=new ArrayList<Integer>(); for(int i=0;i<n;i++){ if(arr[i]>=0) list.add(arr[i]); } System.out.println(list); // if you want to see the positve element list. if(list.size()%2 != 0){ System.out.println(list.get(list.size()/2)); } else System.out.println(list.get((list.size()/2)-1)); } }

Please upload some coding question for IBM and cognizant

does this code satisfies for above question conditions:? import java.io.*; import java.util.*; public class Subarray { public static void main(String[] args) { Scanner in=new Scanner(System.in); System.err.println("enter the length of array:"); int n=in.nextInt(); int a[]=new int[n]; System.err.println("enter the array values:"); for(int i=0;i<a.length;i++) { a[i]=in.nextInt(); } int res=Subarray(a); System.err.println(res); } static int Subarray(int a[]) { int zeroscount=0; int onescount=0; for(int i=0;i<a.length;i++) { if(a[i]==0) zeroscount++; else onescount++; } if(zeroscount<onescount) return (zeroscount+zeroscount); else return (onescount+onescount); } }

How many rounds of interview will mindtree conduct

#include<iostream> #include<stdio.h> #include<algorithm> #include<vector> using namespace std; int FindMid(int *a,int n) { vector<int>b; int count=0; for(int i=0;i<n;i++) { if(a[i]>0) { b.push_back(a[i]); count++; } } int mid=(b.size()+1)/2; cout<<"middle Element Index :"<<mid<<endl; if(count%2==1) { return b[mid-1]; } else { if(b[mid-1]>b[mid]) { return b[mid]; } else { return b[mid-1]; } } return 0; } int main() { int a[]={1,20,-2,-43,-12,-45,90,100,}; int size=sizeof(a)/sizeof(a[0]); int ans=FindMid(a,size); cout<<"Middle element :"<<ans; }