Solution 4 for Scaler Topics Fortnightly Contest - 28
Subarray Size-OR
This article is part of the Scaler Topics Fortnightly Contest - 28
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
For each starting point, if we go rightwards, how many times is the OR sum going to change? It will change at most 17 times. So, we can find all these changing points using binary search and a sparse table in O(log^3^N). We can optimize this binary search by taking mid in powers of 2 and reducing the complexity to O(log^2^N). Now that we have all the changing points, we can easily calculate the number of such subarrays for each ending point. So the total complexity is O(N⋅log^2^N). The O(N⋅log^3^N) would exceed the time limit.
Time Complexity: O(|A|⋅log^2^|A|) Space Complexity: O(|A|⋅log|A|)
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
