c++||easy solution ||comments
```\n int n1=l1.length();\n        int n2=l2.length();\n        string s1=l1.substr(0,2);\n        string s2=l2.substr(0,2);\n        string t1=l1.substr(3,n1);
```\n int n1=l1.length();\n        int n2=l2.length();\n        string s1=l1.substr(0,2);\n        string s2=l2.substr(0,2);\n        string t1=l1.substr(3,n1);\n        string t2=l2.substr(3,n2);\n        int res1=stoi(s1);\n        int res2=stoi(s2);\n        int tt1=stoi(t1);\n        int tt2=stoi(t2);\n        int ans=0;\n      if(res1>res2){\n          res2+=24;\n       }\n        if(res1==res2&&tt1>tt2){\n            res2+=24;\n        }\n        //this is case is for when starting time is greater then ending time\n        res1++;\n        int temp1=res2-res1;\n        temp1=temp1*60;\n        temp1=temp1/15;\n        ans+=temp1;\n        //calculating  the no of games possible in between hr \n        int temp2=60-tt1;\n        temp2=temp2/15;\n        ans+=temp2;\n        //temp2 is calculated by subracting from 60 because res1 is is increased by 1;\n        //calculting the no of possible games in min\n        int temp3=tt2/15;\n        ans+=temp3;\n        \n       if(ans==-1){\n           return 0;\n       }\n        \n       \n            \n        return ans;
[]