C++ Simple Brute Approach | 100% Time
\nclass Solution {\npublic:\n    int numberOfRounds(string st, string fi) {\n        int h1=0, m1=0, h2=0, m2=0, ans=0;\n\t\t//Extracting the hour and minute in
```\nclass Solution {\npublic:\n    int numberOfRounds(string st, string fi) {\n        int h1=0, m1=0, h2=0, m2=0, ans=0;\n\t\t//Extracting the hour and minute individually\n        h1 = st[0]-\'0\';\n        h1 = h1*10 + (st[1]-\'0\');\n        m1 = st[3]-\'0\';\n        m1 = m1*10 + (st[4]-\'0\');\n        h2 = fi[0]-\'0\';\n        h2 = h2*10 + (fi[1]-\'0\');\n        m2 = fi[3]-\'0\';\n        m2 = m2*10 + (fi[4]-\'0\');\n\t\t//If start time is arithmetically greater than end time, we need to adjust by adding 24 hours to end time\n\t\t//this would not affect the result - food for thought ;)\n        if(h1>h2 || h1==h2 && m1>m2) h2+=24;        \n\t\t//approximating m1 and m2 to the nearest 15th minute\n        m1 += (m1%15==0 ? 0: 15-m1%15);\n        m2 -= (m2%15==0 ? 0 : m2%15);\n\t\t//now that we have all the necessary information, we convert time (hours and minutes) to minutes (imagine a time system which only functions on minutes, agnostic of everything else)\n        int time1 = h1*4 + m1/15, time2 = h2*4 + m2/15;\n        return (time2-time1<0 ? 0 : time2-time1);\n    }\n};\n```
['C']