Trick Or Treat solution | Codechef Starters 140 Solution |

In this video, we dive into the Codechef Starter 140 contest and explore the solution for the “Trick or Treat” problem. If you’re interested in competitive coding and want to learn how to tackle this specific challenge, join us as we break down the problem and discuss the solution.
Feel free to watch the video to enhance your coding skills and gain insights into problem-solving techniques! 🚀👨‍💻
#coding #codechef #codechefsolution #codechefstarter #codechefsolutions
#programming #codingtips #competitiveprogramming #algorithm #problem-solving

[@kiranvats9503]

Sir please help above code

[@kiranvats9503]

Sir please please help me with this for fifth question giving run time error I do not know string hashing so i use 3 vectors that store prefix strting suffix string and the current string with length n/2. Giving. Run time error on 5 th hidden test case . Took more than 5 hour #include using namespace std; int main() { int t; cin>>t; while(t--){ string s; cin>>s; int ans=0; int n=s.length(); if(n%2!=0) ans=0; else{ int x=n/2; vectorprefix(n),suffix(n),mera(n); for(int i=0;i=0) prefix[i]=prefix[i-1]+s[i]; else prefix[i]=s[0]; } for(int i=n-1;i>=0;i--){ if(i