Count the Number of Powerful Integers at Sprinklr
Hard46.3% acceptance
This problem has 87.5% frequency at Sprinklr.
Problem Description
You are given three integers `start`, `finish`, and `limit`. You are also given a **0-indexed** string `s` representing a **positive** integer. A **positive** integer `x` is called **powerful** if it ends with `s` (in other words, `s` is a **suffix** of `x`) and each digit in `x` is at most `limit`...
Read full problem and hintsTopics
Also asked at 4 companies
More Sprinklr Questions
Create Components With Same ValueHardNumber of Great PartitionsHardApply Bitwise Operations to Make Strings EqualMediumNext Greater Numerically Balanced NumberMediumMinimum Time to Revert Word to Initial State IIHard
View all Sprinklr questions