Solution 3 for Scaler Topics Fortnightly Contest - 27
Faulty Calculator
This article is part of the Scaler Topics Fortnightly Contest - 27
Transform Your Career
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
Solution Approach
For each digit, we will count how many times it has changed.
The number of changes for the first digit (the lowest) is calculated using the formula A−B.
The number of changes for the second digit is calculated by the formula ⌊A/10⌋−⌊B/10⌋. That is, it is equivalent to the number of first-digit changes for numbers from ⌊B/10⌋ to ⌊A/10⌋.
To calculate the number of changes for the remaining digits, you need to apply similar reasoning with dividing the numbers by 10.
Time complexity
C++ Implementation
Java Implementation
Scaler Placement Report and Statistics
Scaler learners achieved 2.5x salary growth with average post-Scaler CTC reaching ₹23L.
Google
Amazon
Microsoft
Flipkart
Adobe1200+ more
