Practice
Resources
Contests
Online IDE
New
Free Mock
Scaler
Practice
Improve your coding skills with our resources
Contests
Compete in popular contests with top coders
Scaler
Explore Offerings by SCALER

Begin your success journey!

Sign Up using
Full name *
Email *
Password *

By creating an account, I acknowledge that I have read and agree to InterviewBit’s Terms and Privacy Policy .

Welcome back!

Log In using
Email *
Password *

Queries in Infinite String!

Problem Description

Suppose Suzuka has an empty string S. In First iteration she adds all character from 'a' to 'z' in S i.e now S = "abcdefghijklmnopqrstuvwxyz".

In Second iteration she add all character from 'a' to 'z' two times each i.e after second iteration S = "a..zaabbccdd..zz"

Similarly in Third iteration she add all characters from 'a' to 'z' three times each, and so on suzuka perform the iterations infinite number of times.

Nobita asks out Suzuka for a Drive but Suzuka will only go with Nobita if Nobita solves a certain problem.

As you are a good friend of Nobita, he ask you to solve the problem.

You have to answer Q queries ,in each query you are given two integer L and R you need to tell the number of vowels in the substring of String S ranging from L to R inclusive.

NOTE:

  • Assume String S as 1-indexed i.e S[1] = 'a'.


  • Problem Constraints

    1 <= L, R <= 109

    1 <= Q <= 103



    Input Format

    First and only argument is an 2D integer array A of size Q x 2 where (A[i][0], A[i][1]) denotes the L, R for Query i.



    Output Format

    Return an integer array containing Q integers denoting the answers to queries.

    NOTE:

  • Return the answers to the queries in the order, in which the queries occur in the input.


  • Example Input

    Input 1:

     A = [
            [1, 5]
            [26, 29]
         ]
    

    Input 2:

     A = [
            [79, 85]
         ]
    



    Example Output

    Output 1:

     [2, 2]
    

    Output 2:

     [3]
    



    Example Explanation

    Explanation 1:

     String S = "abcdefghijklmnopqrstuvwxyzaabbccddeeff...zzaaabbbccc...zzz......"
     Query 1: Substring [1 : 5] of S is "abcde" 
      Number of vowels = 2
     Query 2: Substring [26 : 29] of S is "zaab" 
      Number of vowels = 2
    

    Explanation 2:

     Query 1: Substring [79 : 85] of S is "aaabb" 
      Number of vowels = 3
    



    NOTE: You only need to implement the given function. Do not read input, instead use the arguments to the function. Do not print the output, instead return values as specified. Still have a question? Checkout Sample Codes for more details.
    Start solving Queries in Infinite String! on Interview Code Editor
    Hints
    • Hint 1
    • Solution Approach
    • Complete Solution

    Discussion


    Loading...
    Click here to start solving coding interview questions
    Free Mock Assessment
    Fill up the details for personalised experience.
    All fields are mandatory
    Current Employer *
    Enter company name *
    Graduation Year *
    Select an option *
    1992
    1993
    1994
    1995
    1996
    1997
    1998
    1999
    2000
    2001
    2002
    2003
    2004
    2005
    2006
    2007
    2008
    2009
    2010
    2011
    2012
    2013
    2014
    2015
    2016
    2017
    2018
    2019
    2020
    2021
    2022
    2023
    2024
    2025
    2026
    2027
    Phone Number *
    OTP will be sent to this number for verification
    +1 *
    +1
    Change Number
    Phone Number *
    OTP will be sent to this number for verification
    +1 *
    +1
    Change Number
    Graduation Year *
    Graduation Year *
    1992
    1993
    1994
    1995
    1996
    1997
    1998
    1999
    2000
    2001
    2002
    2003
    2004
    2005
    2006
    2007
    2008
    2009
    2010
    2011
    2012
    2013
    2014
    2015
    2016
    2017
    2018
    2019
    2020
    2021
    2022
    2023
    2024
    2025
    2026
    2027
    *Enter the expected year of graduation if you're student
    Current Employer *
    Company Name *
    Please verify your phone number
    Edit
    Resend OTP
    By clicking on Start Test, I agree to be contacted by Scaler in the future.
    Already have an account? Log in
    Free Mock Assessment
    Instructions from Interviewbit
    Start Test