Deloitte | PWC | ATS resumes | Wipro | Infosys | Accenture | Capegemini | job links

Wipro / Delottie/ Accenture exam help available ✅

SYO- 701 Certification done✅ 🎈Result - pass🥳(As Always) --> @placementsBro😎 100 percent clearance✔️

Q3✅ All 3 codes done successfully ✅ Any other exam help Contact @placementsBro😎 100 percent clearance ✅

Colourd ball Kth palindrome String container Play with stacks Perfectly even Divisible string

import java.util.*; class Main {   public static void main (String[] args) {     Scanner sc=new Scanner(System.in);     int n=sc.nextInt(),i;     TreeMap<Long,Integer> map=new TreeMap<>();     long dp[]=new long[n];     long r[]=new long[n];     long h[]=new long[n];     long mod=(long)1e9+7;     for(i=0;i<n;i++) r[i]=sc.nextLong();     for(i=0;i<n;i++) h[i]=sc.nextLong();     for(i=0;i<n;i++){         long volume=(h[i]*r[i]*r[i])%mod;         Long low=map.floorKey(volume);         if(low!=null) dp[i]=(dp[i]+dp[map.get(low)]+volume)%mod;         else dp[i]=(dp[i]+volume)%mod;         map.put(volume,i);     }     long max=0;     for(long it:dp) max=Math.max(max,it);     System.out.println(max);   } } Biggest Tower ✅ https://t.me/Infycodes

Path Covered ranges✅

Code is ready to share✅ Pls make our group 5k I will many more codes🥰

#include <bits/stdc++.h> #define ll long long  using namespace std; ll mod=1e9+7; ll C(vector<ll>&a,ll n) {     ll count=0;     for(ll i=0;i<n-1;i++)     {         if(((a[i]*a[i+1])-(a[i]+a[i+1]))%2==0) count++;     }     return count; } void generate(ll n,ll m,ll k,vector<ll>&current,ll&count) {     if (current.size()==n)     {         if (C(current,n)==k)         {             count=(count+1)%mod;         }         return;     }     for (ll i=1;i<=m;i++)     {         current.push_back(i);         generate(n,m,k,current,count);         current.pop_back();     } } ll solve(ll n,ll m,ll k) {     vector<ll>current;     ll count=0;     generate(n,m,k,current,count);     return count%mod; } signed main() {     ll n,m,k; cin>>n>>m>>k;     cout<<solve(n,m,k);     return 0; } Perfectly even ✅ https://t.me/Infycodes