Solution 1 for Scaler Topics Fortnightly Contest - 21
FREE
Itachi's Sacrifice Complete Solution
This article is part of the Scaler Topics Fortnightly Contest - 21
Build an AI-First Career, Master the Complete Skillset
Choose from our industry-leading programs designed for career success
Modern Software and AI Engineering Program
Master full-stack development with AI integration
+1000 moreModern Data Science and ML with specialisation in AI
Advanced data science techniques with AI specialization
+1000 moreAdvanced AIML with Specialisation in Agentic AI
Deep dive into AIML with focus on Agentic systems
+1000 moreDevOps, Cloud & AI Platform Engineering
Build and manage AI-powered cloud infrastructure
+1000 moreAI Engineering Advanced Certification by IIT-Roorkee
Premier AI engineering certification from IIT-Roorkee
AI Forward Deployed Engineer Program
Full-stack engineering, production AI and client-facing consulting
+1000 moreSolution Approach
It is clear if we observe the transitions that the parity of 0s will always remain same. Hence one necessary condition is to check if the count of 0s is even. If count of 0s is odd then we can never win.
After this, it is also necessary to have a place to hold to perform our operations. That means there should be atlease one position with value 1. Because we can not hold a position with value 0 as we won’t be able to change it in future.
Take care of the edge cases as well :)
C++ Implementation
Java Implementation
How Scaler Transformed Careers in Different Fields
Scaler learners achieved 2.5x salary growth with average post-Scaler CTC reaching ₹23L.
Google
Amazon
Microsoft
Flipkart
Adobe1200+ more
