> combinationSum(ArrayList<Integer> A, int B)\"\n ],\n \"initial_code\": \"//Initial template for JAVA\\n\\nimport java.util.*;\\nimport java.io.*;\\nimport java.lang.*;\\n\\nclass Driverclass\\n{\\n static ArrayList<ArrayList<Integer>> res = new ArrayList<>();\\n public static void main (String[] args)throws IOException {\\n \\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\\n PrintWriter out = new PrintWriter(System.out);\\n int t = Integer.parseInt(br.readLine());\\n \\n while(t-- >0)\\n {\\n String str[] = br.readLine().trim().split(\\\" \\\");\\n int n = Integer.parseInt(str[0]);\\n ArrayList<Integer> list = new ArrayList<>();\\n str = br.readLine().trim().split(\\\" \\\");\\n for(int i = 0; i <n ;i++)\\n list.add(Integer.parseInt(str[i]));\\n str = br.readLine().trim().split(\\\" \\\"); \\n int sum = Integer.parseInt(str[0]);\\n \\n Solution ob = new Solution();\\n \\n res = ob.combinationSum(list, sum);\\n if (res.size() == 0) {\\n \\t\\t\\tout.print(\\\"Empty\\\");\\n \\t\\t}\\n \\t\\t// Print all combinations stored in res.\\n \\t\\tfor (int i = 0; i < res.size(); i++) {\\n \\t\\t\\tif (res.size() > 0) {\\n \\t\\t\\t\\tout.print(\\\"(\\\");\\n \\t\\t\\t\\tList<Integer> ij = res.get(i);\\n \\t\\t\\t\\tfor (int j = 0; j < ij.size(); j++) {\\n \\t\\t\\t\\t \\n \\t\\t\\t\\t\\tout.print(ij.get(j));\\n \\t\\t\\t\\t\\tif(j < ij.size()-1)\\n \\t\\t\\t\\t\\t out.print(\\\" \\\");\\n \\t\\t\\t\\t}\\n \\t\\t\\t\\tout.print(\\\")\\\");\\n \\t\\t\\t}\\n \\t\\t}\\n \\t\\tout.println();\\n \\t\\tres.clear();\\n\\t \\nout.println(\\\"~\\\");\\n}\\n\\t out.flush();\\n }\\n \\n}\",\n \"script_name\": \"Driverclass\",\n \"solution\": \"None\",\n \"updated_at_timestamp\": 1730273055,\n \"user_code\": \"//User function template for JAVA\\n\\nclass Solution\\n{\\n //Function to return a list of indexes denoting the required \\n //combinations whose sum is equal to given number.\\n static ArrayList<ArrayList<Integer>> combinationSum(ArrayList<Integer> A, int B)\\n {\\n // add your code here\\n }\\n}\"\n}"},"python":{"kind":"string","value":"{\n \"class_name\": \"Solution\",\n \"created_at_timestamp\": 1617731110,\n \"func_sign\": [\n \"combinationalSum(self,A, B)\"\n ],\n \"initial_code\": \"# Initial Template for Python 3\\n\\nimport atexit\\nimport io\\nimport sys\\n\\n# Position this line where user code will be pasted.\\nif __name__ == '__main__':\\n test_cases = int(input())\\n for cases in range(test_cases):\\n n = int(input())\\n a = list(map(int, input().strip().split()))\\n s = int(input())\\n ob = Solution()\\n result = ob.combinationalSum(a, s)\\n if not len(result):\\n print(\\\"Empty\\\")\\n continue\\n for i in range(len(result)):\\n print(\\\"(\\\", end=\\\"\\\")\\n size = len(result[i])\\n for j in range(size - 1):\\n print(result[i][j], end=\\\" \\\")\\n if (size):\\n print(result[i][size - 1], end=\\\")\\\")\\n else:\\n print(\\\")\\\", end=\\\"\\\")\\n print()\\n\\n print(\\\"~\\\")\\n\",\n \"solution\": \"# Back-end complete function Template for Python 3\\n\\nclass Solution:\\n def sumUtil(self, a, n, s, result, temp, index):\\n # returning if conditions are out of bound.\\n if index >= n or s < 0:\\n return\\n\\n # pushing the combination in result if the sum becomes equal to 0.\\n if s == 0:\\n result.append(temp[:])\\n return\\n\\n # pushing to temp for possible answer.\\n temp.append(a[index])\\n\\n # calling function recursively for further inclusions.\\n self.sumUtil(a, n, s - temp[-1], result, temp, index)\\n\\n # backtracking to remove already present number in combination\\n # and provide space for further additions and possible answers.\\n temp.pop()\\n\\n # calling function recursively to move to next index as all possible\\n # combination for current index have been done.\\n self.sumUtil(a, n, s, result, temp, index + 1)\\n\\n # Function to return a list of indexes denoting the required\\n # combinations whose sum is equal to given number.\\n\\n def combinationalSum(self, a, s):\\n # putting in set and removing duplicates from array a.\\n a = set(a)\\n a = list(a)\\n\\n # sorting a to maintain order.\\n a.sort()\\n result = []\\n self.sumUtil(a, len(a), s, result, [], 0)\\n\\n # returning the result.\\n return result\\n\",\n \"updated_at_timestamp\": 1730273055,\n \"user_code\": \"#User function Template for python3\\n\\nclass Solution:\\n \\n #Function to return a list of indexes denoting the required \\n #combinations whose sum is equal to given number.\\n def combinationalSum(self,A, B):\\n \\n # code here\"\n}"},"test_cases":{"kind":"string","value":"eJzdfc2uLbluXoJ4kMfY6JEbuDB2UZRUlbnfwYDb8MC+Aw98cgd9AQdBgjxEHjh7VYnkR4qqtc5f9+mgcA6KlEr8p6i1VaX/8zf/8F/+63/+T//4P3/6t09/+euvP/23t5+2Xz5t9ePfG72VN36rb+2tv+1vx9v2/rZtbxu9beVt47dHJ3r/6U9vP/35P/7y53/59c//+s///a+/jkH+9qPjK9fPL3WkV7qV553olZH4WRd6Tqred6DnnNAzPsozLtpdMz2Tgu5lKPfs9XUjPZOe7mWne8npTu5yJxTfUd1XTXSvSrpTJN2pkdZKLHcqKGsF8JqVI2+ge3PRnbHozlS0NhStzURrI9HKRGWt5LJSMa94q0sNvmd4unMPWjsHrV2DVo5Ba7eglVPQyiUod4iyMk1ZGabkZuFchrrQezJN0J1v0tozae2XtPJKWvkkrTyScn+klTdS7ouUeyLlfkipF5aVX5TcK0ruEyXzCM6l50z2mgnYUoNPFjVjT3JIw8SyGHrij/IYolUEUR4/lEcPZbFDeeRQHjeURQ1lMUNZxFASLyV3vJK5XcmcrmQuVxKH40wpPKukziK2xEOCNehtGffWwHnDZFppaBl6Mhfl0U5ZrIsvJX0nhVMW5ZTFOCURTnl8UxbdlMU2zZFNWVzTHNU0xzTNEU1TPJcsGkoWC2WOhDLHQZmjoEwxwLOSeVYxTwquUTstctQnt3VSoMuWvKFm6OA9gu4zcrK/oNuM5IzYEVGTfSjLVTRnKprzFM1ZiqYcJW7MM7JHFMfBptxEU2aiOS9RzEoUcxLFjEQhH5Us+MocemUOvBLDrsxBV2LIlRhwJYZbCcHG0RocbcHBEjUqswZVNs93D+EAz5K/8gbO0E6lhm4z0vmpjpmNukdU8DdB9ojimW6dqaKSNCijGMEzJKpqRB0ewbNEHOWpkfEWKW3OAlMSpjkFU0zAFNMvxeRLIfVSTLwU0y6FpEs+5ZJPuOTTLblkK/E4obpHOIZKzB8lZI8Sc0fxmaP4vFF81iguZ3C0JXtLsrcjeyuys2H1mq9O782J0JHf3Qj6CC0Zus5IULAhe0Q59zdkiyieSRwe4RxVWYhMlCgWR55qJG4Ks4jliOoewX4Q5zsXwhQvsVs9wolXPdvN09tAg9NsI6jmEY6em2cozjLk5xjyMwz5+YXc7EJ+biE/s5CbV8jPKuTmFMIZhXA+IZhNRPiAAFmKT1bFp6riE1Vxaar4JFV8iiouQRVMTwWTU8HUVCAxsXcCRhdgdABG8zMYv6JZKhqlgkkaiNSB5V3IUbwyNM9I9TlEtohS48BY82i7R0DIGap7BEdaNVISWSHzeJYhTCyBVI9wSuLIO3vOq2ey+dE30KzzWxUZBwe/FdY6ghUHN78VNhuCTjXsFFNRwoYUO9LblLMwnQqiIwjk3URKbhqVxFMRPAyoxg1MnwSTJ/mpk3DiJJw2CSdNgimTcMIkmC4JJkuyqZJsoix2eURDUMUrmHWLz7kFM27BfFsw2xbItQUzbcE8WyDLFsyxBTJssfxaLLsWza2MTsToQgwOxOY+bM7D5jqsjlPNnNWMWdWUzcRsKmRXQXaleVwUY9YqM7JG1HBaRHWPUGsiqnkEx4EdPxrWQNSTHWFtwzkeqid3yY8ZjD2iI8j4sMadgJcGLZNVBEGIigw2pLCpbpzrG6IhCBTU9VUjJoe6vjDdDWg44uUVwn03AHTGoLGKCqggfjNeupHeRl9XVKjWhV8oKETKboByYqWEyNsMqDY2K1taQpAVEGTlA2nxIEmvGnDIrZqOzXCsZqum3GqqrarYpix3ZWuUCZbsGMFuwJCwYMYvkO8l5VUDdOTBdrE8XzTLF8zxxTJ8sfxeLLsXze3FMnvRvF40qxfJ6UUyOptbsTkVq0uxORSrO7E4E4sr8XCkKvasYs0qtqzDkk2kbUPWPnjfB8njpBJTHT1KtIjiiDpj06OaR5wu7saIo+wIDuMjoiPIfvzqR0dBNHUgoiHI+PCZOoBH5IKRx4oMNRxxU41pbINQNuCIbWOjG1BtwCu2jaFmAIjNIHQ1GZpR6Db+NniAMDOwG6DENMwEEGIaZgIccluF8gizIcowBKNu2TTLplc2rbLqtJpmquqlKTtd6O/XgK5sMrAZMJjXgkmtdDGnxZLooMtts1Eu5rRIkrzb5PbiU8uj6/ZieZRGV+4dZLazD5ux2UzNamgWM7MYmcXEPAxcxQhVTFCHAZqw3wbzfTC5j9HPwse0Vw04FSPALren4JKOm9w+xhR1NrmtMtolyfXIoNZkxC7jbSc1nYSKTEFFJqAi008Zk0+RqafIxFPGtFPGpFPGlFOuCYfNG1l8kcUTWfyQhxey+CAPD+Thf3x5H1++V8Xaddi6Xpaul53raeV2CdwucdspbD+F2E9ax5Wa3x8D/PLpf//y6af/9ae3sE/u/fHvw177xyDtgxZ/KO0jwn/5RPUrN8bZ9fNnPvLSZjm7Xtg2B2N/3uhPt9LhyJ/ByJPtdY7f1zl+uuXOrvI6t7fb8DynL475ZGsecvmiQDfb9TyHL2qTXtUlvarJ2219KPFLqrnd6mfXctNfVMprW09f4Y1eM9rN5kBUxkvKvdkwiBp7gfnFJsKorReciF5zIXrNgegV96FXnOdmAyJ2euo45RUzL7cn2rXcqGjXesuiXenmRa+/F9ycXnFyesXF6bmD0yvuTc+de7kFErs8cezy3HWWGySxyxO3WWyatGu1fVLleCn+6JXoo1dij55HHj2PO3oedfQs5uh5xNGzeFtsxsQOT2It36BpV3nu0+WZRy+2b2KHW29ebOnEDreaTrd52pVv+FT9vJBp9CeAZ11u7U3PcowuyZ91eSLPrTXoPrfQs8xCz/IK3WeVdFMpNt9mlPIsqMp9SKUbTbH5Npyyzad2pdtQsflG7cnWVLuyTaqqrhcyrHW5efPjaXbVn77uO9w4j/6kdd/h9r2XW/PTfUal+3xK99mUbnMpPcukdJ9H6T6L0l0OTTfP+uYbnd5kz2RrrV3lPlOU+zxR7rJEsuEWG28yRLLlFhtvzDtvw7Vr2pBr17Q11655k66q9emsYx2WryU9mXGkwy0PNx4rHZZvTN3ONHQ3z+gPzHfNN29d3cwwdDe/0N3s4v4CumpeDnwzr8DfSvPGld8lG4h941K9y9lk2l5sF/xuvm5eiKi/q68aF5wmG5B94/L9umXSmrYn2zVtTMampV9Mm5OxaWW6tpI4bl0eF/nrWZflW3q3k7h1WLyYdzuBK+176jfiLaNLmhfvGN5M23Q3adPNlK3Jb62qpb9Lfrp5jTK1Pt1N1LSepmk9SdN6ioY/Rq4al6wsJ2f9s2XetAiiaUO2b1qabzUl02pCptV0TKvJGP4gumpcPrcQCXYoZE25SNOGb9+0eDN2kefLKstPW8F90+K12YXv8crz6soP2kL4nsu3Zwz5TLl8o3ZZO2GWXL6qu6ibIL/eUU7ThqXPG6YSNRjF5XOLQJbGpRLTQJaMunwleREt0rgYchEtY75ZyZZHi+TR5cvRCzWm0XJl0JTrm4pIGlORltUQrWoh2UuweEs7jUxaVUG0qoHC9nnfsLD4ovqhRe1DeeVDed0Dmw3yplQjuhEha0jl000Kc8NiYiqraaksJqWST0kln5BKPh3xyq05d2rOXZpzh665u9TcWXoq5j6zQfG677B4NX5ZuGJz+j78smgFmndUk7feb8pVa0xf5l+UqjofrbmctQ1zzUotaQqySWH5fYKFEdMUJE0LPSU+NYyVc7aIeFV4zkAa8SLm4rMK6WcKFqXomJlzvrKIv0RP9ZhE/FlPZHwuy0/Ym5c1pCIsCk/bvzfj03yj+/pmdJJvdL9fRC+KTfcahUenvpSWmZQXmZSWmJQVmJSVl7b/bQo4aZhoykw1qbHks71sj0s/jJEopuTzfMlneffihkcn+ir5/F7S2b1kc3vJZnbOg4zzEOM0wDgLL86Ci7PQqpmr1sxRW6bGPeHomL9Z4a+774bkX/bQVL1uTL7cARPDurGtmpKvcci1kC9J2MD6+tMnyQdKLgYWMk0OijNgSiXJkMbXYrD0EyfZUsPmxPSBKUOKEKnYk+PB3J6ZMU02NkkmHCXJRi2UfxQm+bhKuqgYDpVxkyQbmUqT3kmyudCZ6qdkc02iE8uLRYT6zSx7uoAQzU7SpIsH0WuKToTMlg2ULRooWzJQtmBwL+pEdPJ1ncQxk4UCvMbjkYn55yUCzQsEm1KT7+wk8StWaxl60mxJaxuZYpPOk2pKVtWUrKZxrwpFdPLFoEmN8CIRIpNKpiR1TJmrmDLXMJyFJGcByVk4chKMPIciz4FYZ1+usyfX2Y/brOlj+pLOdN01Lz+FNC0wfWNbNSUfJrLJbElt+kiRzVmLZ6YPDxmVBW/TR4jkyhWYTDfYlBKZphtrmL7hJFNCKh/nGqm50C3jJsn0oNSM7JTpTaiE7JTpTaQUnao/ZnoRM9FWy3jrM2dpCrWGtH/CcpJCBT2znKRQQSff7po+Y5UsC9U7ZjmmFCr6TQZIPGNKoZdyZ6H6zPseCS8WgdbQMvSkqmT5p36afXNsUkCy8BthOnMwJX2pRKaeU9K/kFFV02LvqkECi8lCD15ei8j582hTUEwLPH3JDVHT4k5feEPUtLCjaVlHcVFntq8ZOhhO0PuMDOaQ8qVF5KS/kpWQF9Lzfg04cd9mbnrkJSkc9TU7j6pxtKlk1JfvPGr6RlwsFkssFeGlvIjcIyoQ1Ff2EDXlBJ4yAsd8wDEb1Dle6hQtNcZKjZHSolnaVAe9T19zC5XLurGumtyE4Zt63hCynm9qecP0LTm5jgwdYssxu/ow3/QZvYtsKkPN2JxmT2xIhgmzp6GTj/DFnw6Mv1QxnKmlZiK2mbNkYsKGieVpYjL0xMU0MRk6+Yzh9Om/6ScC08LUkzMr1Uy5NVFtm3nvkcUki4MfRCmnLG666zNy4n3K4oKcBIpZXHR5RFSbuemRlymLC3L6kuPkXjw7V51NWmeD9on93ZNLl/uG7jMyaC5Z6AvSk04W+YKcOAoKmJb36v2Ra47ePy3sR7KIQtToJnFJf5k0cLp7YtNiXoqr5lFT6MRlPMVFPMUlPMUFPMXlO8XFO8WlO4WFe8ErQ7cZGT56ORXRGsHzBzedpcSNekS1SDWoWOqv0Cuo+EJFYVvktHuWpnK5zMVymUrlEgvlEsvkEovkEkvkEgvkEsvjEorj4ktjqc5qRIU+jirHRMMxzXBMMhxSDPsEU2Ng1RBW1QdV9SHVvImaN1BHJVJ2rRuTr5PqXLtqannD9OFRqCjyhj1DuxzsG1IhOeen5tz4D4666iRvSAZ30Y7oY0ZyLj1nstdMwDZzEEoEp7iZmCsRUISJmCsRUIAEmaiXE+XWWSdt5mZy32kuRnTSd2IxzMWGjCyGudiQ03d1a+TbzcVg7cg1z9bm2dY8W7rO9miTAD1yGj5ZnExliG4zMqgjTGXgafP3f3mmHQQNU5mZoEdUjb1qtKifysQkgdPuWeLZoXl2Z56cmaMrc3Rkjm5co8vU6DAtqmIPVA+kmfzGA5HiP1QcVgZm2h5RTs3TLzu6FIs0vX7Cbzpi5kC/e+phYhZU+AJz9aOw12H4FWfkMM9/D6zuSGL69UZQu0c4IuF3GyllHcJHKvs4ZR+lNfp2DZ5dvV9X79XNq7p5RbtfaLC05RnZI8p96Xla4ggqju/sKqjDI8CuUuA66sEsgto9osaHmmfYmeWi4pntnq8dCYRljBS9DRHV68MvYIpfvhS/eCl+6VL8wqX4ZUvxi5bilizixM0jgDMOKY19QmOfztgnM/apjH0iY5/G2CUxxhRWfbBWH6rVBWrFMG3ObA2N1tBk3dRLyZV8mHtMtHmDhkhs6BkaptjY0DI052STz49Dyg/s5R8gT1TAGc91ZsxlBo+eBoDsgMjpg+P4QyNylCiAZ/HrLE6LvIQKx6PbjJwoQ4XjtDt/bp0jO1DhgMEjVZ4twLP+66y8OqmuRU6Dz4ciwdnVy+OKBNROj6jAqSsSDFUjTQ7MQ5Fgmgr0u6fOs6NwdBOOTsLRRWo0Uo0m6oFVdw7ANGciskeU00yYMw2F5MKcaajAgxPTzZngsZ5H9h7r5kwNYs9w9ebGOVNM5PjakQBHV+fo6BzdnIOTs3dx9g5evQ9V70HV+0/zGjqADlZCZUa2iALrCOrwCKd7Qe0eAbqXqsdRcsqTEsf1cMq7EF6o5vnqyIIrE3Txi+NhmSDuciDY/Hgd2a3ooe6nu5EUkfTu6BxGJfxkJwjXDnTcj3XiXg50RxxgoDOGefWOX53bV3T6ii7fUOEN1Q0/y6Gz1YhSrzHU7hEcx4FTDcRrAqJ6OmZUGeBAsHmKjm9nDEEcCFZ8Gowh7upAd2xDd2ztNmxYlgliRxAGdgsyKcsBbEAHlmJngNqgbhlW3CKs4BKs4AKs4PKr4OKr4NJLBOoIKo/ssyK7nMiYERnzIWM2ZMyFjJmQMQ8yZMGKEVsxXitGa4VYrRapDczXzHjd9NtFu5Rfq6bpPAqtRPKGlqFHpE1j56MnbOp8H9F9RnLGQ804wOMmjE4ims5CHsnzoHCIBEg5886zlHUWpkWqkLaCciIJTV2e4R5RNZLgWYE8q48n5dUoeYv0u6fu6jiPnPoFlqCOQ5RnCeo4RB0eUT2XWsc563keOVqPo+04Wq5GPbfAbPd8uVgNxZFHtohyIkNx5HwlntHCkZ4TCIojVG33iOp7VG8hK45M0Y6vjixwdEOOTsjBBdk7IHv3Y+981Zu9eqM3L+zu6MDhPqGOcD6Nh8dAHYFm6h4B6nN1hCGqp4PyQx1hBnMUO9KDOsIQB4IVn2bUD9QRArozcLpja7dhXR1hiB1BGBjqCLGvO0UHI4gxfhijp3o/rM4LK/pgRQ9sqL6GytM6wi9bOKK6R8DpOmLu6hF+VLCPIA4E1T5SNAI9p2ZB7AhW370hc6Dma2RkrCMXuw0KBZUtZZqBFeVlMAL8LCuLGB20vsF5Q9UsAj/HylpGgUNHdj/E6o8XwgX+CCuudxigtODnV/HB3QA4wQiSBkPKYEsYFQMHfnC9XE8eqBYyDZTfTPXNFK8/shZ/RVTziOFahjgQVOcxhKOhRxqJ68Ho6gVKCFvVCwS8pJNxgAsQC6yogWGjmBWF3mFAw1G6MaZWHHnXWhqKs8PIh4zrVsQCQpuODGthiQAA4DCormR0DSzrnyaAnQmlq99ia99iK99i695iq162C8HdgIodB3OyElJAuGBLuGzpljHZMqRatkTLlmbZkixbimVLsNUSQLXwrxb81UK/auA3s2FTCzaxX1dtd9H1Lsf+ZNd0QNUoGDJ0mU+4Oiu7GTlidEa35NSsjNiRHKU19xtlSEROwvLMY42s6CwXkT2ieH60Rt7sKCjjYRKUo5g1st48dUh/EdkiKlAbSTDoLh4mxp6BkQqdAT0ljrrlqNkalVODaprnqyMLUH4GOyHnWn56+btHOL60/ERE9XTYMTrKT9SEo9iRHkdzszc2e1OzN3T1aq9e6d2xtduwrlbzqO4RIDnUaogwElCrIcJRBWG0VnNehhwxepnWagY2ZK6i2aRWM5UDF5Dj2Lsle6dk75LsHJLRHRmdsaL9K1q/ou0bSm9nB4bixaOaR6iuoXhxnu8PplNtQvFiYMPRQS1QvJgVK1KujvmGXHQjqcWLgTCKFC9m6sOAhqN0Y6yaP2nxIuYHcXYY+ZBxoXgxENp0ZC1ezCUAgCP2LNzYgq2iY1Zwy2pOWc0lm6mvmfK6CI3OUT2C7bw9yHLW6p7Xs/XE1g6sOLaYRR48DGhIAzgExQp4GFDtKVWsOBUAcDxgBxZ2GQqqOAN3A3QwreJs+aVA05FZzKE/vouDqTbqmx06WMVO+qO7eJ3eqkJGFWcu1w0YvEh5WQ2wRwYltiyjP7CLDypWDzDU7MKaW/RndVly9etWY6VqpFSJk6bKb6L6LpoaP6O7hIVnG47pBF20uTMRH+Ia+CADzoyN48BCeQyINqOg7mDgbkDFjs0YGe4goxkT3WiqmGo+5VGeVfMJIAMN840YlIGG+cTTFaunNjaT7BhjwSJeQ+yiaAt44eqQ2zG2Lt2F011u9eTHJlqRJfup9mskXa4PfV0dZal+rb6O63hIUWETBTZR31ig2/qrGnDIbbUuJ2cSGHqrR0letFlyray42nUrJ0qOLMuSY1kyLEt+Zcmu1aK9aqxXifQqcV4lyqvEeJUIb2K2NozWhyr7pcj9ZHV1DuUvn+j98W916CQtj7AsjyMs3774egzwzU66tGvFbQVmP6CnlJdSn+d21jf65dOS/btDP8fvB2/bB43HmbFv24dLHW/0aF6M9/f//pdf/0c2Hj1kevz3/j00+SNdP/9/Ichnnq/6I170RxeC/tgi0B9ZAPrjsk9/VObpj8k6/REZpz8e2xPLPzrTCcM/Msspuz8qwwtmf0R2l6z+aMzeMPojsXrL5o/C6BMmfwQ2n7L4ezP5AoO/J4svsfd7Mfgic78Hey+z9lsz9xmM/ZasfRZbvxVjn8nUb8HWZ7P0vZn6Aoa+J0tfxM73YugLmfke7HwxK9+ama9g5Fuy8lVsfCtGvpKJb8HGV7PwtUx8Awa+hoVvQv5LGfhGxL+E/Dcj/bnEvyHhzyH9Tcm+SvgbE32F7Dcn+YzodyB4R/K7kFsR/E7EMnLfjVQk9h0JIanvSkYIfWciDzLfncQHkdVfp+tjH8Djj9Hbfv5Vup1/nubz79R0/sH6/e1429/6W/vlU13+ybm94bX/7BD92qhg18YIf1AtCH8wQgg//m6OsNsC8bgIoHOrOSG8u8f72C8BxA+D9rGLwuBzNwVwBqJ9DARyPbhqAH5orgJITuiHdlXmfjG9IYxsnLugjI2z827QtdUDQOPqFLYZ9OCxArgBU/3kUZnaZYc+KKYZdMBA+zkuA7i5gR7jqkWOx6Ns0OPRAuAGfU9DB3gDRX0MbKZ/qFTV8HBg5f3cb6FAUzm6aP4dYVXmaOwGgUaGjWAk00gfmmYATSN9aJoEPFVbDTrgyR3104dq9clTl8UgUJbsNtkEHLo0eFPdXfyo1A9FqpQPRaoGHoocEl/uIYzuF9vFIGBlH2xvAp5sk0HA1y58vgNMBmzK5+VWuwJF+dxPppXPB9NDu8dFejMISD1A0vtHw6HAppSOk2xXoCil4yQ7KA0pdoM2fepUjT522tc9x6rWU2vWczufqwYV60mYYc5AVnN8JHaR65HmT6m6Xg4c7q2B0QwSH+3i7GyQ+qhksmFeiRnra24iSc51VTfp4t1kkLqJkBTbDZgM2EBMdZM+fLsrwCChukkX3y4GGSPi25uA5lFdnfndQNJ79SgRdFeAlKndPKoPRx5MDd99N0hGO8zVJOq7AqSjHeZnfTjrMMvQZTdo06eGs1aDij232SzXxT2hragOh3sK1FUtj6LjFGMXrZNBothdtf5uIOm96WU8pAOqXiQFdQVEL/tQeVVA9LIPlR8GyGCH6WsfGm8KkA52mLI0rzWDNu04lAw9RXW7KJkNImsjm0kek5EqZeuqhU1qluFAXe6Vm2OIUBUQXo4hQrmAIUI1aNOOQwTpudmMdwjTNKA62DzOufgYt1LTSGCPkWXaGoNJRTBGk4IAQB6jn5yO4U9RYXyZ1cezknQunx2Pb6cnHHJf5fHtHOp6nKwCGSn3kHupP053gP5SfZxqlT7FptmxPfTqw5aizkxw6t5S97lH2ABsvHKu5vhTe1bunOpS8BJfJwDoK4lPx3yHrpL4lMT72H98gaT3I/EZNeV6JL6uqbkpwCqO5QWBjC7kBQFJ7yUvqCSH3I+8YHNOV4CUCc0Lok9VqeYFVcMu9yMvdM3ETQHSwTQvwETWDNq0o+UFnWXVOpYXdMq1Ns0L1yyuShl5oY/Mu1/bxoeGN4NsS/nZcsi9yj066QAqt2TapoDILZmWL0CSkc2aTYFNHzlMAZJPi+x1l2SknqkdLRlpUeEg0c0uyeiq5VXQkYx00m1yrxQlZ7ICQk/TJBu0uTahfkDuGjMyjQ38I3P1kSMHLyNvWfEzhrUcSQJuFtaX21wjj/LykPs6xh4J8hp8k6yms/gh9yz9N8lqXTLiqaPheIfcF+lPkuG6ZMSrf5GKrEsWVLxku5EF6/VOg9QCBunrDmfDLveXd1np0BTYYLDhXVLxnQrVmqLJ/TC75B59RM2+m0OyQZtru8y+m0MKdJn9WgWeutuHNw5ZhtmlHrk4EW9kBYSaeCNdgDnKbt4obeomI7guRg5xkn244j5u22DE/I8AlJEuYa+hRs465J7HYMP5dLQ2tH1xNJ7dxJl2ccRd7lme3cSZtBra5b5IHxLH2sX5ThUO52tyL042HO5Ds4eoXO+HKg9VOV2AqeMwLW8DupQhxdQxbi9VHEPFfdxeijhAxZuA2xhmONMh92UMNPTb5b7KUJssiLQU2+W+SP9NdHSITut5TzJJH6LTJvcsfYrMlIfo8fG5i3eQ4R1gMuDiymq6XYGLLwmpk6gk/JOS5bhdAdJnNmFUpgV9hmSGlykCW4zxIjPVye/FstaKXYEx1CYUqwJjqE0oVgWKthRJOKceLiIEK3lZNF19SNbxp+0vxRVZSp0+cOFY5vvTFxR3pcZTe1drlQlvvI30aG2Sds5If0i6+NV4f7zSJD+G1JOzD+/kXz7x8h0r/+pmuOKbnXi1deOxamrrpx4xmj+yGG2rGb6taLQFhSMff5veatWvyiQjJ6wcKT3aIq7lLLeU4Zax2xJmj4SnMfkEhsLLui2TsiUytkTCNsl3zAwfE7sjECedeK20RCdt1kib9NEmbbRZFy1o4pjEO4JwIzECojoybdZlmzTZJj22oMUWddiCBlvU3xHkPaK0h5P1MQ0CvVFXBEPg+9HREC2aoQUjtGAC/WEUEcZSC8pvTvXNK755tR9eW4fT1eE1ZasxU4Qy8UjHSnNkaa+RwyNkXP2DCSEsY+mv3Qji2MBhc5Zs3o4NrNjQhg0teDhVHqDIA9V4oBJtZhQ9DDLnbCJveDu/MPAipSqyN8LNI1RB1SAVrIEv6N8CyCBjQNlv6AMNPaCB/RtavznbN7N8M7s3s/oBhjjQDIca4TATHGYAq3wLVLiXJs/HHrOz+xNqw79qNveXyuMN/3xqj+lvoeZMplT4A4vdw1+5Lv6buZBoE3+aJLm/OqjrNHOcBm7TxGmauMxhVjnUJodZ5AB7HGKNQ2xxaJVEwqWUN1I5PQY5K53nhdGoivYfvyb6VpXP96lwlnXLF1coL5ceLxQVywriC6qFL5vXn8zacZJ+bdr9rEn29Ynxc+e3mxnMT1luKoIkvZg/XpwvXsn2i+Stqe1pwl2kVcykkCd1YZ4mOrfK++j3dd/w+I2/1ZGuKccOJfuALf6Z1RbUb9c2ptsF6D1Ty+aSNZUc3TyyzP1K7HMIWHz3gl3h7MkGA+CyQcNxRMHw4asiOH3n4RfL76TYh1K26xMjn7ZnX0x5ybveo47K9/ev1x9+f6lvaupNf9eakNh//Hgjv4J95Ud1hoWub8A809+KmD77pTRvvjyz/GhNFsTbvgjjr3SKF7dNv9JtZXoc55WR+FkXek6qvrBF+lmXJ3ws0ppd7a6ZnklB9zKUe/b60/3a9x1uBqd7yelO7nInFN9R3VdNdK9KulMk3amR1kpM5ipsXCqAV6zQvVXoziZ0ZxFa24PW1qC1LWhlibLWZVlpkle81aXN0lmI7ryA1j5Aaw+glf1pbX1a2Z5Wli8rG5SVBUquf86ZrQsFJ2mf7pyQ1i5IaweklfvRyvlo5XqUOx6t3I5yp6Pc5Sh3OErdrawcoOTmL7nxOReUMzFrJktLbTsZz+w6sSwNE3di04k/yuOCVlFBeUxQHhGUxwPl0UBZLFAWCZTFASVRUHJ3KpkzlcyVSuZIJXEjzuSvszwtsXzQcng9Jm/ivGEymTS0DD3ZhvKApSxcxUeSvpN2KQtUysKUkiClPEQpC1DKwpOy4KQ5NGkOTJrDkqagLJmfl8zLy+zjZfbwMvt3mbybZ43yrE+etNkiA31yScc0umPJG2qGDp4h6D4jJ9sKus1InolNuqcsw9CcX2jOLjTnFpoyi36we0b2iOI42JRRaMonNGcTirmEYiahkEfgt5GIbBEViJU5XEoMlhJDpcRAKSFMOOqao6Y56LlGVdWgqB5cGTqTv/IGztBOZYZuM9K5nY6ZjbpHVHAfQfaI4plunamiVjSgohjB8hIkYTCeBeDIfo18tjjw5hQ+pUf9Wn1E7R7BnlBIixSSIsWUSDEhUkiH5JMh+VRILhFKPE2o7hGOgxLDvYRgLzHUiw/04sO8uCDnaC32tmJvKfZ2Ymel6nVbnWab43k3Gj7KSoauMxKUaMgeUc6FDdkiiiMJ52xKMdIsUQqOLNRIy1RiQcYR1T2C/SDOHS6EqVbiz3Wons/mCWygoSnj6+kRHuEIhFxPPtOTz/Pkszy5HK8HDxnoNMhOf9Urojo1dOTAsroIGBDAfvFZpPgcUnwGKS5/FJ89is8dxWWOgnmjYNYokDPYG5PRlIyGZDBjRX1X1HYFXTdgHM8zT2c9j+QZqS6DyBZRqncYax5t9wgIEUN1j+BIq0ZKXkDn5YZqHsF+EI7Msme1eq6aH24DVTofVBlxcPBB4aUjWHFw80FhsyHodMFOEw2JdCSxKTNh1tIjZBAEim6+Ijdb6WkvBlZjAOYpglnKnWQs4G4AaJ1R5wwar6ivCtpqwBsc4h7SoIANwek4e0YQhnJn1zccRBjUE5wsazQDhNuCCa9AuiuW7IqmOkY/YPQCBh9g8wA2+7Na3x3truapapxmAjUVpyvLcoxhzCrJEew1osp89nj3CLUQoppHTOdol4jgeI73jmA4eDwchn3JiSmFPaIj6M6FDueA+zPA2fPtznx2Jz5vKr9zWUM0BKeTkxnB3QB3THLDQS4bC4/dAHfEseklHGJsQsKZxdvo4OZmVag/oXg3AI7thUOobUYWIZsB7ixfO8kXDujtNug2CDOaAw6YhsOlWQ3hTspVzVXVW1Pm7PRUl2AF6AbAIbLqNQUSqyQgbYBDYuGI2G2crgvpVA9ekrTT5bYJTUmjcL5y0RRaNIHqocpsjsHmFqxOAUcq23HKenryeM9Ezlna5JSlM+ecLDcRqQ2B+mDwev8yZhrKvg7EEVXmU02bR0ynlHIcZUdwmBMRHcFw1mg4StOfT1k8eyOqMYHBw+wZcwd/utMnGw6yqZI0AkEOf+7kbgAcxujO4SxgCkZZ3VmceA4nHLvYbdCNwwmKCHY88LC54w4NwEMK4fxFOIgQjiHcijts0IDdThDscqv6Y9WeOztQNGBnCOo5dZCqDWzuTD93OJ8BOgAcvtfs0YsRrSYk5zW5vXiCEyHtNEg9/PGqIEQJDc67k1s5604Psutydt1lLzi3Tk+tu1TbhNk2WO2DJTnDDGYAtTkeUqf7IPVct+F3RfO+aK3JLRz0JkT0DLcuw2wnEc30RfJ8kSxfRo7Xkw/11MMysnsZuV1OQNSj0+R2l1PRxvFoTQ5HezytRx3y8B057nCcb+hOO7vOOhsHnMkex318h+X61sH1DvD1wubPf/vi3qnHf+96J9d+6J6zH3fDmX9F8maHZD/tNA4V+7zNkbAn/XZT+q2ETXj7p//7d/8PVKTr/w=="}}},{"rowIdx":758,"cells":{"question_id":{"kind":"number","value":704544,"string":"704,544"},"question_title":{"kind":"string","value":"Check Tree Traversal"},"question_content":{"kind":"string","value":"Given Preorder, Inorder and Postorder traversals of some tree of size N. The task is to check if they are all of the same tree or not.\nExamples:\nInput:\nN = 5\npreorder[] = {1, 2, 4, 5, 3}\ninorder[] = {4, 2, 5, 1, 3}\npostorder[] = {4, 5, 2, 3, 1}\n\nOutput:\nYes\n\nExplanation: \n\nAll of the above three traversals \nare of the same tree.\n 1\n/ \\\n 2 3\n / \\\n 4 5\nInput:\nN = 5\npreorder[] = {1, 5, 4, 2, 3}\ninorder[] = {4, 2, 5, 1, 3}\npostorder[] = {4, 1, 2, 3, 5}\n\nOutput:\nNo\n\nExplanation: \nThe three traversals can \nnot be of the same tree.\n\nConstraints:\n\n1 ≤ N ≤ 10**3\nNode values are unique."},"dataset":{"kind":"string","value":"geeksforgeeks"},"difficulty":{"kind":"string","value":"Hard"},"java":{"kind":"string","value":"{\n \"class_name\": \"Solution\",\n \"created_at_timestamp\": 1615292571,\n \"func_sign\": [\n \"static boolean checktree(int preorder[], int inorder[], int postorder[], int N)\"\n ],\n \"initial_code\": \"import java.util.*;\\nimport java.lang.*;\\nimport java.io.*;\\n\\nclass GFG\\n{\\n\\tpublic static void main(String args[])\\n\\t{\\n\\t\\tScanner sc = new Scanner(System.in);\\n int t = sc.nextInt();\\n while(t > 0){\\n \\tint n = sc.nextInt();\\n \\tint[] preorder = new int[n];\\n \\tint[] inorder = new int[n];\\n \\tint[] postorder = new int[n];\\n for(int i=0; i<n; i++)\\n preorder[i] = sc.nextInt();\\n for(int i=0; i<n; i++)\\n inorder[i] = sc.nextInt();\\n for(int i=0; i<n; i++)\\n postorder[i] = sc.nextInt();\\n Solution ob = new Solution();\\n if(ob.checktree(preorder, inorder, postorder, n) )\\n\\t\\t\\tSystem.out.println(\\\"Yes\\\");\\n\\t\\t\\telse\\n\\t\\t\\tSystem.out.println(\\\"No\\\");\\n t--;\\n \\nSystem.out.println(\\\"~\\\");\\n}\\n }\\n}\\n\",\n \"script_name\": \"GFG\",\n \"solution\": \"class Solution {\\n static boolean check(\\n int preorder[], int i1, int inorder[], int i2, int postorder[], int i3, int len) {\\n if (len == 0) return true;\\n // if array lengths are 1, then check if all of them are equal\\n if (len == 1) return ((preorder[i1] == inorder[i2]) && (inorder[i2] == postorder[i3]));\\n // search for first element of preorder in inorder array\\n int idx = -1;\\n for (int i = 0; i < len; i += 1)\\n if (inorder[i2 + i] == preorder[i1]) {\\n idx = i2 + i;\\n break;\\n }\\n if (idx == -1) return false;\\n // matching element in postorder array\\n if (preorder[i1] != postorder[i3 + len - 1]) return false;\\n // nodes in left subtree =\\n int left = idx - i2;\\n // check for the left subtree\\n boolean ret1 = check(preorder, i1 + 1, inorder, i2, postorder, i3, left);\\n // check for the right subtree\\n boolean ret2 =\\n check(\\n preorder, i1 + 1 + left, inorder, i2 + 1 + left, postorder, i3 + left, len - left - 1);\\n // return 1 only if both of them are correct else 0\\n return (ret1 && ret2);\\n }\\n\\n static boolean checktree(int preorder[], int inorder[], int postorder[], int N) {\\n return check(preorder, 0, inorder, 0, postorder, 0, N);\\n }\\n}\\n\",\n \"updated_at_timestamp\": 1729753320,\n \"user_code\": \"class Solution\\n{\\n static boolean checktree(int preorder[], int inorder[], int postorder[], int N)\\n {\\n // Your code goes here\\n }\\n}\"\n}"},"python":{"kind":"string","value":"{\n \"class_name\": \"Solution\",\n \"created_at_timestamp\": 1615292571,\n \"func_sign\": [\n \"checktree(self, preorder, inorder, postorder, N)\"\n ],\n \"initial_code\": \"# Initial Template for Python 3\\n\\n# Driver Code\\nif __name__ == \\\"__main__\\\":\\n t = int(input())\\n for _ in range(t):\\n n = int(input())\\n preorder = list(map(int, input().strip().split()))\\n inorder = list(map(int, input().strip().split()))\\n postorder = list(map(int, input().strip().split()))\\n obj = Solution()\\n if obj.checktree(preorder, inorder, postorder, n):\\n print(\\\"Yes\\\")\\n else:\\n print(\\\"No\\\")\\n\",\n \"solution\": \"# Back-end complete function Template for Python 3\\nclass Solution:\\n def checktree(self, preorder, inorder, postorder, N):\\n # if the array lengths are 0, then all of them are obviously equal\\n if N == 0:\\n return 1\\n\\n # if array lengths are 1, then check if all of them are equal\\n if N == 1:\\n return (preorder[0] == inorder[0]) and (inorder[0] == postorder[0])\\n\\n # search for first element of preorder in inorder array\\n idx = -1\\n\\n for i in range(N):\\n if inorder[i] == preorder[0]:\\n idx = i\\n break\\n\\n if idx == -1:\\n return 0\\n\\n # matching element in postorder array\\n if preorder[0] != postorder[N-1]:\\n return 0\\n\\n # check for the left subtree\\n ret1 = self.checktree(preorder[1:], inorder, postorder, idx)\\n\\n # check for the right subtree\\n ret2 = self.checktree(\\n preorder[idx + 1:], inorder[idx + 1:], postorder, idx)\\n\\n # return 1 only if both of them are correct else 0\\n return (ret1 and ret2)\\n\",\n \"updated_at_timestamp\": 1727776457,\n \"user_code\": \"#User function Template for python3\\n\\nclass Solution:\\n def checktree(self, preorder, inorder, postorder, N): \\n # Your code goes here\\n\"\n}"},"test_cases":{"kind":"string","value":"eJytVM0KgkAQ7lDvMexZAt2fQw/RucjoUHvookIKQQQ9RL1Ht16vmd01U1RYVRadFb9vvplvx8f89VnMzLV5Y7C7sXOSFTlbAQvjpFosAKavmT7m+nRIi9x9s9WXOGH3AOq4CBGAtwhCE3Wg12kfuGTwS80NELiB2gfv5GgXYCi4y04UGHtSCKtCEFqAo6HAV4twWkCQjLAMhLci6fqCUGkrEkgnSzLpTyepPDAW/4W/JH62qbJhEtHK9kpS2+xG4lYNM7J+Frw5qtXnhvC1w0gbecjQA5jUhObkUXGTNksN7BaxkZrpmZt/KvdqyLCr8dPeUmcvfv9cfgExvabv"}}},{"rowIdx":759,"cells":{"question_id":{"kind":"number","value":712176,"string":"712,176"},"question_title":{"kind":"string","value":"Find XOR of numbers from L to R."},"question_content":{"kind":"string","value":"You are given two integers L and R, your task is to find the XOR of elements of the range [L, R].\nExamples:\nInput:\nL = 4, R = 8 \n\nOutput:\n8 \n\nExplanation:\n\n4 ^ 5 ^ 6 ^ 7 ^ 8 = 8\n\n1<=l<=r<=10**9"},"dataset":{"kind":"string","value":"geeksforgeeks"},"difficulty":{"kind":"string","value":"Easy"},"java":{"kind":"string","value":"{\n \"class_name\": \"Solution\",\n \"created_at_timestamp\": 1664387363,\n \"func_sign\": [\n \"public static int findXOR(int l, int r)\"\n ],\n \"initial_code\": \"// Initial Template for Java\\n\\nimport java.io.*;\\nimport java.util.*;\\n\\nclass GFG {\\n public static void main(String[] args) throws IOException {\\n Scanner sc = new Scanner(System.in);\\n int t;\\n t = sc.nextInt();\\n while (t-- > 0) {\\n\\n int l;\\n l = sc.nextInt();\\n\\n int r;\\n r = sc.nextInt();\\n\\n Solution obj = new Solution();\\n int res = obj.findXOR(l, r);\\n\\n System.out.println(res);\\n \\nSystem.out.println(\\\"~\\\");\\n}\\n }\\n}\\n\",\n \"script_name\": \"GFG\",\n \"solution\": \"None\",\n \"updated_at_timestamp\": 1730481583,\n \"user_code\": \"// User function Template for Java\\n\\nclass Solution {\\n public static int findXOR(int l, int r) {}\\n}\"\n}"},"python":{"kind":"string","value":"{\n \"class_name\": \"Solution\",\n \"created_at_timestamp\": 1664516064,\n \"func_sign\": [\n \"findXOR(self, l, r)\"\n ],\n \"initial_code\": \"# Initial Template for Python 3\\n\\nif __name__ == '__main__':\\n t = int(input())\\n for _ in range(t):\\n l, r = list(map(int, input().split()))\\n ob = Solution()\\n res = ob.findXOR(l, r)\\n print(res)\\n print(\\\"~\\\")\\n\",\n \"solution\": \"# Back-end complete function Template for Python 3\\n\\nclass Solution:\\n\\n # Function to find XOR of a range\\n def findXOR(self, l, r):\\n\\n # Function to find XOR of a number\\n def findXOR(n):\\n rem = n % 4\\n if rem == 0:\\n return n\\n elif rem == 1:\\n return 1\\n elif rem == 2:\\n return n + 1\\n else:\\n return 0\\n\\n # Calculate XOR of range by finding XOR of\\n # (l-1) and r and returning the result\\n return findXOR(l-1) ^ findXOR(r)\\n\",\n \"updated_at_timestamp\": 1730481583,\n \"user_code\": \"#User function Template for python3\\n\\nclass Solution:\\n def findXOR(self, l, r):\\n # Code here\"\n}"},"test_cases":{"kind":"string","value":"eJyllE1KBDEQhV3oPULWg6QqP1XxJIItLrQXbtpZ9IAgiofQvTuvqYypDDI8ehzfpgsq85G8ejWvp++fZydbXX58F1dP/n5ab2Z/4TwNE4UmZ5X4lfPj43q8nce7m4fN3A6HYXoZJv+8cr8Jtal0QggAsTsAWLm1ybWKIIoAgjimXESrqyolp8iEEHYSkUyOTYhUMyVVYUBK3WSrEiD1PiCJOeRaRehOvQ9IanLtW5HV1keOR5NLJuRTIYmicPw2sWCzi+hO1ocp6EFainXP5EGRhHlMtSqL5IwudPR+0c8e/GdF9ycEAFwjhVhUF1ZicSOYNXAsjHK8+9sJR/uyFR+8nhLQq/bt+VMW+88X30rLr7x+O/8CcVeUwQ=="}}},{"rowIdx":760,"cells":{"question_id":{"kind":"number","value":700653,"string":"700,653"},"question_title":{"kind":"string","value":"Triplet Family"},"question_content":{"kind":"string","value":"Given an array arr of integers. Find whether three numbers are such that the sum of two elements equals the third element. \nExamples:\nInput:\narr[] = [1, 2, 3, 4, 5]\nOutput:\ntrue\n\nExplanation: \nThe pair (1, 2) sums to 3.\nInput:\narr[] = [5, 3, 4]\nOutput:\nfalse\n\nExplanation: \nNo triplets satisfy the condition.\n\nConstraints:\n1 <= arr.size() <= 10**3\n0 <= arr[i]\n<= 10**5"},"dataset":{"kind":"string","value":"geeksforgeeks"},"difficulty":{"kind":"string","value":"Easy"},"java":{"kind":"string","value":"{\n \"class_name\": \"Solution\",\n \"created_at_timestamp\": 1618437728,\n \"func_sign\": [\n \"public boolean findTriplet(int[] arr)\"\n ],\n \"initial_code\": \"// Initial Template for Java\\nimport java.io.*;\\nimport java.lang.*;\\nimport java.util.*;\\n\\n//Position this line where user code will be pasted.\\n\\nclass GFG {\\n public static void main(String[] args) throws IOException {\\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\\n int t = Integer.parseInt(br.readLine());\\n while (t-- > 0) {\\n String line = br.readLine();\\n String[] tokens = line.split(\\\" \\\");\\n\\n // Create an ArrayList to store the integers\\n ArrayList<Integer> array = new ArrayList<>();\\n\\n // Parse the tokens into integers and add to the array\\n for (String token : tokens) {\\n array.add(Integer.parseInt(token));\\n }\\n\\n int[] arr = new int[array.size()];\\n int idx = 0;\\n for (int i : array) arr[idx++] = i;\\n Solution obj = new Solution();\\n boolean res = obj.findTriplet(arr);\\n if (res)\\n System.out.println(\\\"true\\\");\\n else\\n System.out.println(\\\"false\\\");\\n\\n System.out.println(\\\"~\\\");\\n }\\n }\\n}\\n\",\n \"script_name\": \"GFG\",\n \"solution\": \"class Solution {\\n public boolean findTriplet(int[] arr) {\\n int n = arr.length;\\n // Sorting the array in ascending order\\n Arrays.sort(arr);\\n for (int i = n - 1; i >= 0; i--) {\\n int j = 0;\\n int k = i - 1;\\n // Checking for triplets in the array\\n while (j < k) {\\n // If triplet is found, return true\\n if (arr[i] == arr[j] + arr[k]) {\\n return true;\\n }\\n // Adjust pointers based on the sum of current elements\\n else if (arr[i] > arr[j] + arr[k]) {\\n j++;\\n } else {\\n k--;\\n }\\n }\\n }\\n return false;\\n }\\n}\\n\",\n \"updated_at_timestamp\": 1729753320,\n \"user_code\": \"class Solution {\\n public boolean findTriplet(int[] arr) {}\\n}\"\n}"},"python":{"kind":"string","value":"{\n \"class_name\": \"Solution\",\n \"created_at_timestamp\": 1618437728,\n \"func_sign\": [\n \"findTriplet(self, arr)\"\n ],\n \"initial_code\": \"# Initial Template for Python 3\\n\\nif __name__ == \\\"__main__\\\":\\n t = int(input())\\n while t > 0:\\n arr = list(map(int, input().split()))\\n ob = Solution()\\n res = ob.findTriplet(arr)\\n if (res):\\n print(\\\"true\\\")\\n else:\\n print(\\\"false\\\")\\n # print(res)\\n print(\\\"~\\\")\\n t -= 1\\n\",\n \"solution\": \"class Solution:\\n\\n def findTriplet(self, arr):\\n n = len(arr)\\n # Sorting the array in ascending order\\n arr.sort()\\n for i in range(n - 1, -1, -1):\\n j = 0\\n k = i - 1\\n # Checking for triplets in the array\\n while j < k:\\n # If triplet is found, return True\\n if arr[i] == arr[j] + arr[k]:\\n return True\\n # Adjust pointers based on the sum of current elements\\n elif arr[i] > arr[j] + arr[k]:\\n j += 1\\n else:\\n k -= 1\\n return False\\n\",\n \"updated_at_timestamp\": 1729753320,\n \"user_code\": \"class Solution:\\n def findTriplet(self, arr):\\n \"\n}"},"test_cases":{"kind":"string","value":"eJy1VMtKxEAQ9CB+R5HzIj3PzHr05h8IRkQ0giBx0SwIovgR+r9WT7LqCis6WQPdPQSmpqqrZ1523472dvJ3fMjFyWN13S2WfXWAyjSdEYERA8twXHvWIFLNULUPi/aiby/Pbpf9uKG/W7ZN99x01dMM34Bg4ZFgIpxF9DA2wYa4Aenq/OZ+E1QQUkBmxmpZLauyc6GA2RyGTGq4CB8QPKJDbZEM5gVoJAWHSHpkB0vZaYUcCromkhVmedp9Ue1MUVOtKWmaS5EnNNOI5QGO4XlGYJCs1Iz0d0ClNhBU4KEM/1TDYNRKTAlhdZ1Q3E9+OgRRm8AWsAF6YEELLKU7Sg+UnBTQ0nyH5Gl/VNBkOariSprxZUxjbvPESV2/Q2nSJaIzSvETsBsRKbgcNU//x/CXAQwO19uzeHzC8hsm0x6xcZTxX/dxDX77+EbUc795848T87ttp6/77yNvvrU="}}},{"rowIdx":761,"cells":{"question_id":{"kind":"number","value":702726,"string":"702,726"},"question_title":{"kind":"string","value":"Large Factorial"},"question_content":{"kind":"string","value":"You are given an array A of integersof length N. You need to calculatefactorial of each number.The answer can be very large, so print it modulo 10**9+ 7.\r\nExamples:\nInput:\nN = 5\nA[] = {0, 1, 2, 3, 4}\n\nOutput:\n1 1 2 6 24\n\nExplanation:\n\nFactorial of 0 is 1, \nfactorial of 1 is 1,factorial of 2is 2,\nfactorial of 3is 6 and so on.\nInput:\nN = 3\nA[] = {5, 6, 3}\n\nOutput:\n120 720 6\n\nExplanation:\n\nFactorial of 5 is 120, \nfactorial of 6 is 720,\nfactorial of 3is 6.\n\nConstraints:\n\n1 <= N <= 10**5\n\n0 <= A[i] <= 10**5"},"dataset":{"kind":"string","value":"geeksforgeeks"},"difficulty":{"kind":"string","value":"Medium"},"java":{"kind":"string","value":"{\n \"class_name\": \"Solution\",\n \"created_at_timestamp\": 1617950236,\n \"func_sign\": [\n \"public long[] factorial(long a[], int n)\"\n ],\n \"initial_code\": \"// Initial Template for Java\\n\\nimport java.io.*;\\nimport java.util.*;\\n\\nclass Main {\\n // Driver code\\n public static void main(String[] args) throws Exception {\\n BufferedReader br =\\n new BufferedReader(new InputStreamReader(System.in));\\n int t = Integer.parseInt(br.readLine().trim());\\n while (t-- > 0) {\\n int n = Integer.parseInt(br.readLine().trim());\\n long a[] = new long[n];\\n String[] str = br.readLine().trim().split(\\\" \\\");\\n for (int i = 0; i < n; i++) {\\n a[i] = Long.parseLong(str[i]);\\n }\\n\\n Solution ob = new Solution();\\n \\n long res[] = ob.factorial(a,n);\\n \\n for (int i=0; i<n; i++) {\\n System.out.print(res[i] + \\\" \\\");\\n }\\n System.out.println();\\n \\nSystem.out.println(\\\"~\\\");\\n}\\n }\\n}\",\n \"script_name\": \"Main\",\n \"solution\": \"// Back-end complete function Template for Java\\n\\nclass Solution {\\n public long[] factorial(long a[], int n) {\\n // initialize variables\\n int i, MAX = 100_000;\\n long fac[] = new long[MAX + 1], mod = 1000_000_007;\\n \\n fac[0] = 1; // initialize factorial of 0 as 1\\n \\n // calculate factorial for each number up to MAX\\n for (i = 1; i <= MAX; i++) {\\n fac[i] = (fac[i - 1] % mod * (long)i) % mod;\\n }\\n \\n long[] ans = new long[n]; // store factorial values\\n \\n // store factorial values for input array elements in ans array\\n for (i = 0; i < n; i++) {\\n ans[i] = fac[(int)a[i]];\\n }\\n return ans;\\n }\\n}\",\n \"updated_at_timestamp\": 1730269721,\n \"user_code\": \"// User function Template for Java\\n\\nclass Solution {\\n public long[] factorial(long a[], int n) {\\n // code here\\n }\\n}\"\n}"},"python":{"kind":"string","value":"{\n \"class_name\": \"Solution\",\n \"created_at_timestamp\": 1617950236,\n \"func_sign\": [\n \"factorial(self,a, n)\"\n ],\n \"initial_code\": \"# Initial Template for Python 3\\n\\n# Driver code\\nif __name__ == \\\"__main__\\\":\\n tc = int(input())\\n while tc > 0:\\n n = int(input())\\n a = list(map(int, input().strip().split()))\\n ob = Solution()\\n res = ob.factorial(a, n)\\n for i in res:\\n print(i, end=\\\" \\\")\\n print()\\n tc -= 1\\n print(\\\"~\\\")\\n\",\n \"solution\": \"# Back-end complete function Template for Python 3\\n\\nclass Solution:\\n # Function to calculate the factorial of each element in the array\\n def factorial(self, a, n):\\n MAX = 10**5\\n fac = [0] * (MAX + 1)\\n mod = 10**9 + 7\\n fac[0] = 1\\n\\n # Calculating factorial values\\n for i in range(1, MAX + 1):\\n fac[i] = (fac[i - 1] % mod * i) % mod\\n\\n ans = [0] * n\\n\\n # Storing factorial values in a new array\\n for i in range(0, n):\\n ans[i] = fac[a[i]]\\n\\n return ans\\n\",\n \"updated_at_timestamp\": 1730269721,\n \"user_code\": \"#User function Template for python3\\nclass Solution:\\n\\n\\tdef factorial(self,a, n):\\n \\t# code here\\n\"\n}"},"test_cases":{"kind":"string","value":"eJzNVctuFDEQ5MCFv2jNOULul7vNlyCxiAPsgcuSQyIhIRB3bgj+l/LMbAZFcRZIgLQ0nl573I+qsvfz4+9fnzya7fkXOC8+TG8P55cX0zOaeHfg0h8YtW7ks88kpGTkVCmmM5r278/3ry/2b169u7xYN7ty8xKSlDU4zRPfajT1VJ8jVBIjlkKBx4sV2h0+7Q7TxzO6VoTjETUnNxXupRCKWErBgJmM6tQXMdONpBtpN7Ju5N2odqPoNio8mjeJYMRrVjylUXitxia98K0xbdzUMtFHCNaRkLE1Uxl5gtEsC1lND63RqwnRsHRqKlYs4OEXCuUk1lozNIPSWkUYNDnAA3AsbPQh5zHmsc6jDxrbeBDLZsxV0YyIKWsSUmp1LkkWXsQdkQf5c9VEobIKYimHaZ3meWpQhgFgdBfg/idBbMUB96svDOucrD3k4suoKIFSrymTgA3NioDMADAxcoJC5AjqkI9K5IE+rShcraD4+MK7Na7dsWjQYoUnEkVKOFIE5FO8QRBh6DQdTSdaY7dKEFQtlftqLY1BA04YxAJmSgxPA/oc1j3ew7+7R2Y8Z0KHWzemTkl10Yn4UR4+CnrTbSFQKZDFwd0EoZy1ZLGhSnVJnUdx3tbJdiC29Cd7WwBa3idwGoP8S6r1fy1btzBhdbsn2Y6QOQFqR1X+CNY1yt8nhf4zKzwHvImRk9DMf513QffI0R0o6v8ht90vV8f9Hm99lod47zfBHu133Nrqy29PfwBFQVfT"}}},{"rowIdx":762,"cells":{"question_id":{"kind":"number","value":705612,"string":"705,612"},"question_title":{"kind":"string","value":"Rohan's Love for Matrix"},"question_content":{"kind":"string","value":"Rohan has a special love for matrices especially for the first element of the matrix. Being good at Mathematics, he also loves to solve the different problems on matrices. So one day he started to multiplythe matrix with theoriginal matrix. The elements of theoriginal matrixaare given by[a00=1, a01=1, a10=1, a11=0].Given the power of the matrix,n calculates thea**n and returnsthea10elementmod1000000007.Example 1:\nExamples:\nInput:\nn = 3\n\nOutput:\n2\n\nExplanation:\nTake the cube of the original matrix \ni.e \na\n**3\n and the (\na\n10\n)\n**th\n element is 2.\nInput:\nn = 4\n\nOutput:\n3\n\nExplanation:\nTake the quartic of the original matrix \ni.e \na\n**4\n and the (\na\n10\n)\n**th \nelement is 3.\n\nConstraints:\n1<= n<=10**6"},"dataset":{"kind":"string","value":"geeksforgeeks"},"difficulty":{"kind":"string","value":"Medium"},"java":{"kind":"string","value":"{\n \"class_name\": \"Solution\",\n \"created_at_timestamp\": 1615292571,\n \"func_sign\": [\n \"static int firstElement(int n)\"\n ],\n \"initial_code\": \"// Initial Template for Java\\nimport java.io.*;\\nimport java.util.*;\\n\\nclass GFG {\\n public static void main(String args[]) throws IOException {\\n BufferedReader read = new BufferedReader(new InputStreamReader(System.in));\\n int t = Integer.parseInt(read.readLine());\\n while (t-- > 0) {\\n int n = Integer.parseInt(read.readLine());\\n Solution ob = new Solution();\\n System.out.println(ob.firstElement(n));\\n \\nSystem.out.println(\\\"~\\\");\\n}\\n }\\n}\",\n \"script_name\": \"GFG\",\n \"solution\": \"None\",\n \"updated_at_timestamp\": 1729753320,\n \"user_code\": \"// User function Template for Java\\nclass Solution {\\n static int firstElement(int n) {\\n // code here\\n }\\n}\"\n}"},"python":{"kind":"string","value":"{\n \"class_name\": \"Solution\",\n \"created_at_timestamp\": 1615292571,\n \"func_sign\": [\n \"firstElement(self, n)\"\n ],\n \"initial_code\": \"# Initial Template for Python 3\\nif __name__ == '__main__':\\n t = int(input())\\n for _ in range(t):\\n n = int(input())\\n\\n ob = Solution()\\n print(ob.firstElement(n))\\n print(\\\"~\\\")\\n\",\n \"solution\": \"class Solution:\\n M = 1000000007\\n\\n # Function to find the first element in the Fibonacci series modulo M.\\n def firstElement(self, n):\\n a, b = 0, 1\\n\\n # if n is 0, return the first element which is 0.\\n if n == 0:\\n return a\\n\\n # iterating to find the first element in the Fibonacci series.\\n for i in range(2, n + 1):\\n c = (a + b) % self.M\\n a = b % self.M\\n b = c % self.M\\n\\n return b % self.M\\n\",\n \"updated_at_timestamp\": 1729753320,\n \"user_code\": \"#User function Template for python3\\nclass Solution:\\n def firstElement (self, n):\\n # code here \"\n}"},"test_cases":{"kind":"string","value":"eJytlb1OAzEMxxmQeAU2qpsrZCdOYvMkSAQxQAeWwFAkJATiIeB9cX1tuauSlgM83J2H/Pzxt3Pvx59nJ0dml6f6cfXS3ZfHp2V3Met8LghmuYhZLmzWzWfd4vlxcbtc3N08PC3XBwQZBF2MubzlEjF6EAIyj5FCiJC8ed3rfDaIhLkkswY4hMROAdXDLpdgpiHNGhDvETh56CHMCIkpSQ2pKE1JwdsWaAx7N9holP7p7CmI5EOA3vPaixgTcKN6bIFXVdVP7M2kFmFf/mPldk77b/m389AKPxZ9jK2m5tZw3gRpqQeYGDm6ymztIGmQ51rDH5U9lK+a63ghYPpGSAxOPMuEjZjUfB3nmCSkJtHZjrRGJ0QnwFAduV6najYq3gB+QMeInnT1qHZHNHU8KCQJIAsJ/UZItBomaolM2uqEvUckSNEYf2tdzv/UvFVRP18En6ozM8i8wdtfUPsPMmlKxr2uarm54Sboqfd/SFpdr5lLSKKXNFQjXn+cfwFfVBar"}}},{"rowIdx":763,"cells":{"question_id":{"kind":"number","value":714082,"string":"714,082"},"question_title":{"kind":"string","value":"Taxi Booking"},"question_content":{"kind":"string","value":"You are going to book a taxi. There are infinite number of points 1, 2, 3... on the X axis and your current position is cur. There are N Taxis near you, and the position of those taxis is given as an array pos. Where pos[i] denotes the position of the ith taxi. You are also given an array time. Where time[i] denotes the time taken by the ith taxi to cover 1 unit of distance. Your task is to find the minimum time to board a taxi.\nExamples:\nInput:\nN = 3, cur = 4\npos = [1, 5, 6]\ntime = [2, 3, 1]\n\nOutput:\n2\n\nExplanation:\n\nTotal time taken by the 1st taxi will be: (4-1)*2 = 6\nTotal time taken by the 2nd taxi will be: (5-4)*3 = 3\nTotal time taken by the 3rd taxi will be: (6-4)*1 = 2\nSo, the minimum time will be 2 sec.\nInput:\nN = 2, cur = 1\npos = [1, 6]\ntime = [10, 3]\n\nOutput:\n0\n\nExplanation:\n\nTotal time taken by the 1st taxi will be: (1-1)*10 = 0\nTotal time taken by the 2nd taxi will be: (6-1)*3 = 15\nSo, the minimum time will be 0 sec.\n\nConstraints:\n\n1 ≤ N≤ 10**5\n\n1≤ cur≤ 10**5\n\n1≤ pos[i] ≤ 10**5\n\n1≤ time[i]≤ 10**3"},"dataset":{"kind":"string","value":"geeksforgeeks"},"difficulty":{"kind":"string","value":"Easy"},"java":{"kind":"string","value":"{\n \"class_name\": \"Solution\",\n \"created_at_timestamp\": 1676973232,\n \"func_sign\": [\n \"public static int minimumTime(int N, int cur, int[] pos, int[] time)\"\n ],\n \"initial_code\": \"import java.io.*;\\nimport java.util.*;\\nclass IntArray\\n{\\n public static int[] input(BufferedReader br, int n) throws IOException\\n {\\n String[] s = br.readLine().trim().split(\\\" \\\");\\n int[] a = new int[n];\\n for(int i = 0; i < n; i++)\\n a[i] = Integer.parseInt(s[i]);\\n\\n return a;\\n }\\n\\n public static void print(int[] a)\\n {\\n for(int e : a)\\n System.out.print(e + \\\" \\\");\\n System.out.println();\\n }\\n\\n public static void print(ArrayList<Integer> a)\\n {\\n for(int e : a)\\n System.out.print(e + \\\" \\\");\\n System.out.println();\\n }\\n}\\n\\nclass GFG {\\n public static void main(String[] args) throws IOException {\\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\\n int t;\\n t = Integer.parseInt(br.readLine());\\n while(t-- > 0){\\n \\n int N;\\n N = Integer.parseInt(br.readLine());\\n \\n \\n int cur;\\n cur = Integer.parseInt(br.readLine());\\n \\n \\n int[] pos = IntArray.input(br, N);\\n \\n \\n int[] time = IntArray.input(br, N);\\n \\n Solution obj = new Solution();\\n int res = obj.minimumTime(N, cur, pos, time);\\n \\n System.out.println(res);\\n \\n \\nSystem.out.println(\\\"~\\\");\\n}\\n }\\n}\\n\",\n \"script_name\": \"GFG\",\n \"solution\": \"class Solution {\\n public static int minimumTime(int N, int cur, int[] pos, int[] time) {\\n // code here\\n int mn=(int)1e9;\\n for(int i=0;i<N;i++){\\n int dist=Math.abs(pos[i]-cur);\\n mn=Math.min(mn,dist*time[i]);\\n }\\n return mn;\\n }\\n}\",\n \"updated_at_timestamp\": 1729753320,\n \"user_code\": \"class Solution {\\n public static int minimumTime(int N, int cur, int[] pos, int[] time) {\\n // code here\\n }\\n}\\n \\n\"\n}"},"python":{"kind":"string","value":"{\n \"class_name\": \"Solution\",\n \"created_at_timestamp\": 1676973232,\n \"func_sign\": [\n \"minimumTime(self, N : int, cur : int, pos : List[int], time : List[int]) -> int\"\n ],\n \"initial_code\": \"class IntArray:\\n def __init__(self) -> None:\\n pass\\n\\n def Input(self, n):\\n arr = [int(i) for i in input().strip().split()] # array input\\n return arr\\n\\n def Print(self, arr):\\n for i in arr:\\n print(i, end=\\\" \\\")\\n print()\\n\\n\\nif __name__ == \\\"__main__\\\":\\n t = int(input())\\n for _ in range(t):\\n N = int(input())\\n cur = int(input())\\n pos = IntArray().Input(N)\\n time = IntArray().Input(N)\\n obj = Solution()\\n res = obj.minimumTime(N, cur, pos, time)\\n print(res)\\n print(\\\"~\\\")\\n\",\n \"solution\": \"from typing import List\\n\\n\\nclass Solution:\\n def minimumTime(self, N: int, cur: int, pos: List[int], time: List[int]) -> int:\\n mn = 10**9\\n for i in range(N):\\n dist = abs(pos[i] - cur)\\n mn = min(mn, dist * time[i])\\n return mn\\n\",\n \"updated_at_timestamp\": 1729753320,\n \"user_code\": \"from typing import List\\nclass Solution:\\n def minimumTime(self, N : int, cur : int, pos : List[int], time : List[int]) -> int:\\n # code here\\n \\n\"\n}"},"test_cases":{"kind":"string","value":"eJzNVctKxDAUdSH4G5esB8mzbfwSwYoL7cJNnUUHBkTxI/Sz3PlB5t5kJpX2dtphhCnlNg3NOafn3JCPy6+fqwu6br/D4O5VPLfrTSduQKi6NXXrpKxbJaUEjcXI4btYgWi26+axa54eXjZdWh9W0sfvdSveVvAX2UUQAoM4Gn0kLu89TeTCkHJ8CpG0sTteUh/lS7BUSS8UVEuqFVU/lLOkMEJRC29PQcYPrSappDQLAg0GLLgww3BZzzPZwFSUlScmJEIepMEJ8FBByaAab0ttGNgqLHf9eJPh2mXbjcvmJzNc4t9psTERzAPTOKbT8r20ZXotGisD4Cfs1TlI2A+O6V8SEfDIJd6H6fZHAWe0ByLeRHYW/qc7FRkp58U7rTK27V4j96vjiR6O1DKZEq1EXr2YeG4vwHk1w8Ej4+RnRn/PjZwhXGZqXmQn+aWJ3O8/r38Bw1gLUw=="}}},{"rowIdx":764,"cells":{"question_id":{"kind":"number","value":703882,"string":"703,882"},"question_title":{"kind":"string","value":"Copy Set Bits in Range"},"question_content":{"kind":"string","value":"Given two numbers X and Y, and a range [L, R] where 1 <= L <= R <= 32. You have to copy the set bits of 'Y' in the range L to R in 'X'.Return this modified X.\nExamples:\nInput:\nX = 44, Y = 3 \nL = 1, R = 5\n\nOutput:\n47\n\nExplanation:\nBinary represenation of 44 and 3 is 1011\n00\n and 0000\n11\n. So in the range 1 to 5 there are two set bits of 3 (1st & 2nd position). If those are set in 44 it will become 1011\n11\n which is 47.\nInput:\nX = 16, Y = 2\nL = 1, R = 3\n\nOutput:\n18\n\nExplanation:\n Binary represenation of 16 and 2 is 100\n00\n and \n10\n. If the mentioned conditions are applied then 16 will become 100\n10\n which is 18.\n\nConstraints:\n1 ≤ X, Y ≤ 10**9\n1 ≤ L ≤ R ≤ 32"},"dataset":{"kind":"string","value":"geeksforgeeks"},"difficulty":{"kind":"string","value":"Easy"},"java":{"kind":"string","value":"{\n \"class_name\": \"Solution\",\n \"created_at_timestamp\": 1615292571,\n \"func_sign\": [\n \"static int setSetBit(int x, int y, int l, int r)\"\n ],\n \"initial_code\": \"//Initial Template for Java\\nimport java.io.*;\\nimport java.util.*;\\n\\nclass GFG{\\n public static void main(String args[])throws IOException{\\n BufferedReader in = new BufferedReader(new InputStreamReader(System.in));\\n int t = Integer.parseInt(in.readLine());\\n while(t-- > 0){\\n String line[] = in.readLine().trim().split(\\\"\\\\\\\\s+\\\");\\n int x = Integer.parseInt(line[0]);\\n int y = Integer.parseInt(line[1]);\\n int l = Integer.parseInt(line[2]);\\n int r = Integer.parseInt(line[3]);\\n \\n Solution ob = new Solution();\\n System.out.println(ob.setSetBit(x, y, l, r));\\n \\nSystem.out.println(\\\"~\\\");\\n}\\n }\\n}\",\n \"script_name\": \"GFG\",\n \"solution\": \"class Solution{\\n static int setSetBit(int x, int y, int l, int r){\\n int m = x; //initialize m as x\\n for(int i = l;i <= r;i++){ //iterate from l to r\\n if((y & (1 << (i-1)) )>0 ) //check if the bit at position i is set in y\\n m |= (1 << (i-1)); //set the bit at position i in m\\n }\\n return m; //return the updated value of m\\n }\\n}\",\n \"updated_at_timestamp\": 1729753320,\n \"user_code\": \"//User function Template for Java\\n\\nclass Solution{\\n static int setSetBit(int x, int y, int l, int r){\\n // code here\\n }\\n}\"\n}"},"python":{"kind":"string","value":"{\n \"class_name\": \"Solution\",\n \"created_at_timestamp\": 1615292571,\n \"func_sign\": [\n \"setSetBit(self, x, y, l, r)\"\n ],\n \"initial_code\": \"# Initial Template for Python 3\\n\\nif __name__ == '__main__':\\n t = int(input())\\n\\n for _ in range(t):\\n arr = input().split()\\n x = int(arr[0])\\n y = int(arr[1])\\n l = int(arr[2])\\n r = int(arr[3])\\n\\n ob = Solution()\\n print(ob.setSetBit(x, y, l, r))\\n print(\\\"~\\\")\\n\",\n \"solution\": \"class Solution:\\n def setSetBit(self, x, y, l, r):\\n # create a variable m to store the updated value of x\\n m = x\\n\\n # iterate from l to r\\n for i in range(l, r+1):\\n # check if the ith bit is set in y\\n if y & (1 << (i-1)):\\n # if so, set the ith bit in m\\n m = m | (1 << (i-1))\\n\\n # return the updated value of m\\n return m\\n\",\n \"updated_at_timestamp\": 1729753320,\n \"user_code\": \"#User function Template for python3\\n\\nclass Solution:\\n def setSetBit(self, x, y, l, r):\\n # code here\"\n}"},"test_cases":{"kind":"string","value":"eJytlM9KAzEQxj2IzzHsucj8zSQ+gzcvghUP2oOXtYctCKL4EPq+ZtvuFqHJbsW5ZBeSHzPf9yWf5983F2fbur3OH3dvzXO73nTNFTS0bIlFLXhMkKIHU2ECQmBcts0CmtXrevXYrZ4eXjbdcIjF2Ylt2X7kTe8L+E3cMhB6JhIYkBVRph5FCxwaCngoIBAu0jgoKxFKAZiGgsPQjCCVUdFJUCh4AamcNAXnBNFiSpma4QZcHlmFnDVZqcljflQ17A8EI6XS1AdbR3RVxn7oICnFNEncLfkfInCsEk0xWElGJnWNEtRz9lxcKbLkfqtuj2dK3uC+ssPDV91uRcaUW+WZUtZ1zLvdhLFkDJ0ccBJOxsGldPWUYZ/HOD+QJ05Lfxx3zDMcgPt1Ars9NVPECQH74og08XbxrMerv3Rxygn9Dyt2fZ8eFQxYuh3H0ycz4sejevdflz8Ydrzq"}}},{"rowIdx":765,"cells":{"question_id":{"kind":"number","value":703278,"string":"703,278"},"question_title":{"kind":"string","value":"String formation from substring"},"question_content":{"kind":"string","value":"Given a string s, the task is to check if it can be constructed by taking a substring of it and appending multiple copies of the substring together. \nExamples:\nInput:\ns = \"ababab\"\n\nOutput:\n1\n\nExplanation:\nIt is constructed by \nappending \"ab\" 3 times\nInput:\ns = \"ababac\"\n\nOutput:\n0\n\nExplanation:\nNot possible to construct\n\nConstraints:\n1 <= |s| <= 10**5"},"dataset":{"kind":"string","value":"geeksforgeeks"},"difficulty":{"kind":"string","value":"Medium"},"java":{"kind":"string","value":"{\n \"class_name\": \"Solution\",\n \"created_at_timestamp\": 1615292571,\n \"func_sign\": [\n \"int isRepeat(String s)\"\n ],\n \"initial_code\": \"//Initial Template for Java\\n\\nimport java.io.*;\\nimport java.util.*;\\n\\nclass GFG {\\n public static void main(String args[]) throws IOException {\\n BufferedReader read =\\n new BufferedReader(new InputStreamReader(System.in));\\n int t = Integer.parseInt(read.readLine());\\n while (t-- > 0) {\\n String input = read.readLine();\\n \\n Solution ob = new Solution();\\n int result = ob.isRepeat(input);\\n \\n System.out.println(result);\\n \\nSystem.out.println(\\\"~\\\");\\n}\\n }\\n}\",\n \"script_name\": \"GFG\",\n \"solution\": \"None\",\n \"updated_at_timestamp\": 1729753320,\n \"user_code\": \"//User function Template for Java\\n\\nclass Solution {\\n int isRepeat(String s) {\\n // code here\\n }\\n}\"\n}"},"python":{"kind":"string","value":"{\n \"class_name\": \"Solution\",\n \"created_at_timestamp\": 1615292571,\n \"func_sign\": [\n \"isRepeat(self, s)\"\n ],\n \"initial_code\": \"# Initial Template for Python 3\\n\\nif __name__ == '__main__':\\n T = int(input())\\n\\n for i in range(T):\\n s = input()\\n\\n ob = Solution()\\n answer = ob.isRepeat(s)\\n\\n print(answer)\\n print(\\\"~\\\")\\n\",\n \"solution\": \"class Solution:\\n def computeLPSArray(self, str, M, lps):\\n len = 0\\n lps[0] = 0\\n i = 1\\n\\n while i < M:\\n if str[i] == str[len]:\\n len += 1\\n lps[i] = len\\n i += 1\\n else:\\n if len != 0:\\n len = lps[len-1]\\n else:\\n lps[i] = 0\\n i += 1\\n\\n def isRepeat(self, str):\\n n = len(str)\\n lps = [0]*n\\n\\n self.computeLPSArray(str, n, lps)\\n\\n length = lps[n-1]\\n\\n return 1 if (length > 0 and n % (n-length) == 0) else 0\\n\",\n \"updated_at_timestamp\": 1731514110,\n \"user_code\": \"#User function Template for python3\\nclass Solution:\\n\\tdef isRepeat(self, s):\\n\\t\\t# code here\"\n}"},"test_cases":{"kind":"string","value":"eJxrYJl6lJUBDCL2ARnR1UqZeQWlJUpWCkqGMXmJSclwFJOnpKOglFpRkJpckpoSn19aglBXB5Ss1VFA0wwESVCMU7MBDs0VlVVwVFlFsvbC8tSikkpkkmTnV+EFpIdGEhziDkrcoYEBSTYjJz8vvbikKDMvHRuLjNhNSoJhkjUXpRakJpbgIkk2DhEsMTFAEiXRkhpMqNGMHkhUiDlg1MVQYAjZ8V9RCcmTGGkRKZNSnsowUgb2ZEd2hiaYnYksUEiNAkhhhsUcMss3sC+IyAmkeDl2ih4A4VIVcQ=="}}},{"rowIdx":766,"cells":{"question_id":{"kind":"number","value":712069,"string":"712,069"},"question_title":{"kind":"string","value":"Maximum Nesting Depth of the Parentheses"},"question_content":{"kind":"string","value":"A string is a valid parentheses string (denoted VPS ) if is meets any one of the following:\nIt is an empty string \"\", or a single character not equals to \"(\" or \")\" ,\nIt can be written as AB (A concatenated with B ). We can similarly define the nesting depth depth (S) of any VPS S as follows:\ndepth (\"\") = 0\ndepth (C) = 0, where C is a string with a single character excluding \"(\" and \")\",\ndepth (A + B) = max (depth (A) , depth (B)) , where A and B are VPS's.\ndepth ( \"(\" + A + \")\" ) = 1 + depth (A) , where A is a VPS.\nFor example , \"\" , \" ( ) ( ) \" , and \" ( ) ( ( ) ( ) ) \" and VPS's (with nesting depths 0 , 1, and 2), and \" ) ( \" and \" ( ( ) \" are not VPS's.\nExample:\nInput:\ns = \" ((5+2)(3+4)((6))) \"\n\nOutput:\n3\n\nExplanation:\nCharacter '6' is inside three nested parentheses.\n\nInput:\n\" (43+4++3)((3)(9))+1 \"Output:\n2\n\nExplanation: Character '3' and '9' both are inside two nested parentheses.\nYour Task:\nYou don't need to read input or print anything. Your task is to complete the function maxDepth() which takes the string s as input parameters and returns nesting depth of the given string s."},"dataset":{"kind":"string","value":"geeksforgeeks"},"difficulty":{"kind":"string","value":"Easy"},"java":{"kind":"string","value":"{\n \"class_name\": \"Solution\",\n \"created_at_timestamp\": 1663911489,\n \"func_sign\": [\n \"public static int maxDepth(String s)\"\n ],\n \"initial_code\": \"import java.io.*;\\nimport java.util.*;\\n\\nclass GFG {\\n public static void main(String[] args) throws IOException {\\n Scanner sc=new Scanner(System.in);\\n int t = sc.nextInt();\\n while(t-- > 0){\\n sc.nextLine();\\n String s;\\n s = sc.next();\\n \\n Solution obj = new Solution();\\n int res = obj.maxDepth(s);\\n \\n System.out.println(res);\\n \\n \\nSystem.out.println(\\\"~\\\");\\n}\\n }\\n}\\n\",\n \"script_name\": \"GFG\",\n \"solution\": \"None\",\n \"updated_at_timestamp\": 1730481540,\n \"user_code\": \"class Solution {\\n public static int maxDepth(String s) {\\n // code here\\n }\\n}\\n \\n\"\n}"},"python":{"kind":"string","value":"{\n \"class_name\": \"Solution\",\n \"created_at_timestamp\": 1663739167,\n \"func_sign\": [\n \"maxDepth(self, s)\"\n ],\n \"initial_code\": \"# Initial Template for Python 3\\n\\nif __name__ == '__main__':\\n t = int(input())\\n\\n for _ in range(t):\\n s = input()\\n ob = Solution()\\n print(ob.maxDepth(s))\\n print(\\\"~\\\")\\n\",\n \"solution\": \"# Back-end complete function Template for Python 3\\n\\nclass Solution:\\n # Function to find the maximum depth of parentheses in a given string.\\n def maxDepth(self, s):\\n opening = ans = 0\\n\\n # iterating over each character in the string.\\n for ch in s:\\n # Checking if the character is an opening parenthesis,\\n # increase the count of opening parentheses.\\n if ch == '(':\\n opening += 1\\n # Checking if the character is a closing parenthesis,\\n # decrease the count of opening parentheses.\\n elif ch == ')':\\n opening -= 1\\n\\n # Updating the answer with the maximum count of opening parentheses.\\n ans = max(ans, opening)\\n\\n # Returning the maximum depth of parentheses.\\n return ans\\n\",\n \"updated_at_timestamp\": 1730481540,\n \"user_code\": \"#User function Template for python3\\n\\nclass Solution:\\n def maxDepth(self, s):\\n # Code here\"\n}"},"test_cases":{"kind":"string","value":"eJy9VdtOwkAQ9cHE32j6NLPDuhRaCv6FbyRAjEIFpBZU7gTjR+j/OtsCIdHdconOQzttsmfOzDmdflx+1a8u0qjfctJYuf1kNBm7N47rNRMHwKOSgLIEXwXIQaCjolOAkK9uwXGj+Shqj6PO3XAy3hwOmsl7M3HXBecHIuij6fk01dkmN6L5FjSAe3pgXm3qaHoRPWY0u9RDAX16OolkA1ZrbCE2QCcraLSQnw04ZQu9OS2YxlJTmgmY0DRjNxAx355lYiRnA82CpUFZRuEja0MVlCGKKqoaUtEEWjODajQBUFY+UoASKgQhw6V4m4JFzMIAHuYxvhepUIqFQhkhKyWhK3pcI9OJBvyCI9ZFhHU6VXOtuUewYNMu2bUzX002vp1WJIxD7vCtSi81VK9FSys2+8LOdLKNooMq66SL3InqIzciB0ix5g+JGhprWLRg1/yLaQI62zaWaZ815u3e2fdO51jz5K4pr2RgkL+qHANk8QjEMyGtDA/5qg+ktf/xw2lbemvo2c7R8V/twZNsnDfH3/8HuaNofV5/A9T271U="}}},{"rowIdx":767,"cells":{"question_id":{"kind":"number","value":713978,"string":"713,978"},"question_title":{"kind":"string","value":"Update Queries"},"question_content":{"kind":"string","value":"You are given an array of n elements, initially all a[i] = 0. Qqueries need to be performed. Each query contains three integers l, r, and x and you need to change all a[i] to (a[i] | x) for all l≤i ≤ r.\nExamples:\nInput:\nN=3, Q=2\nU=[[1, 3, 1],\n [1, 3, 2]]\nOutput:\na[]={3,3,3}\n\nExplanation:\n\nInitially, all elements of the array are 0. After execution of the\nfirst query, all elements become 1 and after execution of the \nsecond query all elements become 3.\nInput:\nN=3, Q=2\nU=[[1, 2, 1],\n [3, 3, 2]]\nOutput:\na[]={1,1,2}\n\nExplanantion:\n[0,0,0] => [1,1,0] => [1,1,2]\n\n1<= U[i][2] <=10**5"},"dataset":{"kind":"string","value":"geeksforgeeks"},"difficulty":{"kind":"string","value":"Medium"},"java":{"kind":"string","value":"{\n \"class_name\": \"Solution\",\n \"created_at_timestamp\": 1675772979,\n \"func_sign\": [\n \"int [] updateQuery(int N, int Q, int [][]U)\"\n ],\n \"initial_code\": \"//Initial Template for Java\\n\\nimport java.util.*;\\nimport java.io.*;\\nimport java.lang.*;\\n\\nclass GFG{\\n\\tpublic static void main(String [] args) throws IOException{\\n\\t\\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\\n\\t\\tint test = Integer.parseInt(br.readLine());\\n\\t\\twhile(test-- > 0) {\\n\\t\\t\\tString [] str = br.readLine().trim().split(\\\" \\\");\\n\\t\\t\\tint N = Integer.parseInt(str[0]);\\n\\t\\t\\tint Q = Integer.parseInt(str[1]);\\n\\t\\t\\tint [][] U = new int[Q][3];\\n\\t\\t\\tint i = 0;\\n\\t\\t\\twhile(i < Q) {\\n\\t\\t\\t\\tstr = br.readLine().trim().split(\\\" \\\");\\n\\t\\t\\t\\tU[i][0] = Integer.parseInt(str[0]);\\n\\t\\t\\t\\tU[i][1] = Integer.parseInt(str[1]);\\n\\t\\t\\t\\tU[i][2] = Integer.parseInt(str[2]);\\n\\t\\t\\t\\ti++;\\n\\t\\t\\t}\\n\\t\\t\\tSolution obj = new Solution();\\n\\t\\t\\tint [] arr = obj.updateQuery(N, Q, U);\\n\\t\\t\\tfor(int j: arr) {\\n\\t\\t\\t\\tSystem.out.print(j+\\\" \\\");\\n\\t\\t\\t}\\n\\t\\t\\tSystem.out.println();\\n\\t\\t\\nSystem.out.println(\\\"~\\\");\\n}\\n\\t}\\n}\",\n \"script_name\": \"GFG\",\n \"solution\": \"class Solution{\\n // Function to update the values of an array based on given queries.\\n\\tint [] updateQuery(int N, int Q, int [][]U){\\n // Creating a 2D array to store the differences between elements in each query.\\n int diff[][]=new int[N+1][20];\\n // Creating an array to store the final updated values.\\n int ans[]=new int[N];\\n \\n // Looping through each query and updating the differences array.\\n for(int i=0;i<Q;i++){\\n int temp=U[i][2];\\n int in=0;\\n while(temp>0){\\n // If the current bit is 1, increment the difference of the corresponding elements.\\n if((temp&1)!=0){\\n diff[U[i][0]-1][in]++;\\n diff[U[i][1]][in]--;\\n }\\n in++;\\n temp>>=1;\\n }\\n }\\n \\n // Calculating the cumulative differences for each element in the differences array.\\n for(int i=0;i<20;i++){\\n for(int j=1;j<N;j++){\\n diff[j][i]+=diff[j-1][i];\\n }\\n }\\n \\n // Calculating the final updated values based on the differences array.\\n for(int i=0;i<N;i++){\\n int val=0;\\n for(int j=0;j<20;j++){\\n if(diff[i][j]>0){\\n val+=(1<<j);\\n }\\n }\\n ans[i]=val;\\n }\\n \\n // Returning the updated values array.\\n return ans;\\n }\\n}\",\n \"updated_at_timestamp\": 1730482063,\n \"user_code\": \"//User function Template for Java\\n\\nclass Solution{\\n\\tint [] updateQuery(int N, int Q, int [][]U){\\n //Write your code here\\n }\\n}\"\n}"},"python":{"kind":"string","value":"{\n \"class_name\": \"Solution\",\n \"created_at_timestamp\": 1675772979,\n \"func_sign\": [\n \"updateQuery(self, N, Q, U)\"\n ],\n \"initial_code\": \"# Initial Template for Python 3\\n\\nif __name__ == \\\"__main__\\\":\\n for _ in range(int(input())):\\n n, q = map(int, input().split())\\n U = []\\n for i in range(q):\\n l, r, x = map(int, input().split())\\n U.append([l, r, x])\\n arr = Solution().updateQuery(n, q, U)\\n for i in arr:\\n print(i, end=\\\" \\\")\\n print()\\n print(\\\"~\\\")\\n\",\n \"solution\": \"class Solution():\\n\\n # Function to update the query.\\n def updateQuery(self, N, Q, U):\\n\\n # initializing the number of bits as 5.\\n bits = 5\\n\\n # creating a 2D array to store the dynamic programming values.\\n dp = [[0 for j in range(bits)] for i in range(N+1)]\\n\\n # iterating over each query.\\n for i in U:\\n l, r, x = i\\n # updating the dp array based on the query.\\n for j in range(bits):\\n val = int(x & (1 << j) > 0)\\n dp[l-1][j] += val\\n dp[r][j] -= val\\n\\n # initializing a temporary variable.\\n tmp = 0\\n\\n # creating an array to store the final values.\\n arr = [0] * N\\n\\n # calculating the initial value for arr[0].\\n for j in range(bits):\\n if dp[0][j] > 0:\\n val = 1\\n else:\\n val = 0\\n tmp += val << j\\n arr[0] = tmp\\n\\n # updating the remaining values for arr.\\n for i in range(1, N):\\n tmp = 0\\n for j in range(bits):\\n # updating dp and calculating the value for arr.\\n dp[i][j] += dp[i-1][j]\\n if dp[i][j] > 0:\\n val = 1\\n else:\\n val = 0\\n tmp += val << j\\n arr[i] = tmp\\n\\n # returning the final array.\\n return arr\\n\",\n \"updated_at_timestamp\": 1730482063,\n \"user_code\": \"#User function Template for python3\\n\\nclass Solution():\\n def updateQuery(self, N, Q, U):\\n #your code goes here\"\n}"},"test_cases":{"kind":"string","value":"eJzdVEtOwzAQZcGCY4y8rlDGnzjtSZAwYgFZsDFdpBISAvUQcB123AuP7URtw7gUogo1M6pcd/pm8vz81ufvnxdn8bn6CIvrZ/Hgl6tOLECg8wjpA7Cix3kxA9E+Ldu7rr2/fVx1ubQC51/Dry8z2AYwCcCAkra27P8VwmYyYFiBiuNUPap0vqavmkeGPswQLHzGzQsGMdJxAsGwoDLHxIAECWlrLx9lNDUIiFuzwqJgwCWdf1ZnGlYWoDQ0BWGZNE4Qkg4KaUhXFjDsNqQvS/BzehcW3FI9xjSUNgY3eW5IjYkIDJODNPG+mNgWa+iLwgb/VjLU9blzi8Yp51vJDKeJBQSdLoNOJA+bDS+EPDzlX+VAZb+RxMiwpHPEnq8Pda7CqFNI91ABwDEVsOna+3y34OoWbPkajPrgsRrlPt8Ixk/Zt3zM//acd2mJtjo1Nz/zAjJkVTJ1itzh5u3yC4k8P3E="}}},{"rowIdx":768,"cells":{"question_id":{"kind":"number","value":700533,"string":"700,533"},"question_title":{"kind":"string","value":"Maximum Bipartite Matching"},"question_content":{"kind":"string","value":"There are M job applicants and N jobs. Each applicant has a subset of jobs that he/she is interseted in. Each job opening can only accept one applicant and a job applicant can be appointed for only one job. Given a matrix G where G(i,j) denotes i**thapplicant is interested in j**thjob. Find an assignment of jobs to applicant in such that as many applicants as possible get jobs.\nExamples:\nInput:\nG = {{1,1,0,1,1},{0,1,0,0,1},\n{1,1,0,1,1}}\n\nOutput:\n3\n\nExplanation: \nThere is one of the possible\nassignment-\nFirst applicant gets the 1st job.\nSecond applicant gets the 2nd job.\nThird applicant gets the 3rd job.\nInput:\nG = {{1,1},{0,1},{0,1},{0,1},\n{0,1},{1,0}}\n\nOutput:\n2\n\nExplanation: \nThere is one of the possible\nassignment-\nFirst applicant gets the 1st job.\nSecond applicant gets the 2nd job.\n\nConstraints:\n\n1 ≤ N, M ≤ 100"},"dataset":{"kind":"string","value":"geeksforgeeks"},"difficulty":{"kind":"string","value":"Medium"},"java":{"kind":"string","value":"{\n \"class_name\": \"Solution\",\n \"created_at_timestamp\": 1615292571,\n \"func_sign\": [\n \"public int maximumMatch(int[][] G)\"\n ],\n \"initial_code\": \"//Initial Template for Java\\n\\nimport java.util.*;\\nimport java.lang.*;\\nimport java.io.*;\\nclass GFG\\n{\\n public static void main(String[] args) throws IOException\\n {\\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\\n int T = Integer.parseInt(br.readLine().trim());\\n while(T-->0)\\n {\\n String[] S = br.readLine().trim().split(\\\" \\\");\\n int m = Integer.parseInt(S[0]);\\n int n = Integer.parseInt(S[1]);\\n int[][] G = new int[m][n];\\n for(int i = 0; i < m; i++){\\n String[] s = br.readLine().trim().split(\\\" \\\");\\n for(int j = 0; j < n; j++)\\n G[i][j] = Integer.parseInt(s[j]);\\n }\\n Solution obj = new Solution();\\n int ans = obj.maximumMatch(G);\\n System.out.println(ans);\\n \\nSystem.out.println(\\\"~\\\");\\n}\\n }\\n}\",\n \"script_name\": \"GFG\",\n \"solution\": \"// User function Template for Java\\nclass Solution {\\n boolean bpm(int bpGraph[][], int u, boolean seen[], int matchR[], int M, int N) {\\n // Try every job one by one\\n for (int v = 0; v < N; v++) {\\n // If applicant u is interested\\n // in job v and v is not visited\\n if (bpGraph[u][v] == 1 && !seen[v]) {\\n // Mark v as visited\\n seen[v] = true;\\n // If job 'v' is not assigned to\\n // an applicant OR previously\\n // assigned applicant for job v (which\\n // is matchR[v]) has an alternate job available.\\n // Since v is marked as visited in the\\n // above line, matchR[v] in the following\\n // recursive call will not get job 'v' again\\n if (matchR[v] < 0 || bpm(bpGraph, matchR[v], seen, matchR, M, N)) {\\n matchR[v] = u;\\n return true;\\n }\\n }\\n }\\n return false;\\n }\\n\\n // Returns maximum number\\n // of matching from M to N\\n int maxBPM(int bpGraph[][], int M, int N) {\\n // An array to keep track of the\\n // applicants assigned to jobs.\\n // The value of matchR[i] is the\\n // applicant number assigned to job i,\\n // the value -1 indicates nobody is assigned.\\n int matchR[] = new int[N];\\n // Initially all jobs are available\\n for (int i = 0; i < N; ++i) matchR[i] = -1;\\n // Count of jobs assigned to applicants\\n int result = 0;\\n for (int u = 0; u < M; u++) {\\n // Mark all jobs as not seen\\n // for next applicant.\\n boolean seen[] = new boolean[N];\\n for (int i = 0; i < N; ++i) seen[i] = false;\\n // Find if the applicant 'u' can get a job\\n if (bpm(bpGraph, u, seen, matchR, M, N)) result++;\\n }\\n return result;\\n }\\n\\n public int maximumMatch(int[][] G) {\\n // Code here\\n int M = G.length;\\n int N = G[0].length;\\n int ans = maxBPM(G, M, N);\\n return ans;\\n }\\n}\\n\",\n \"updated_at_timestamp\": 1729753320,\n \"user_code\": \"//User function Template for Java\\n\\nclass Solution\\n{\\n public int maximumMatch(int[][] G)\\n {\\n // Code here\\n }\\n}\"\n}"},"python":{"kind":"string","value":"{\n \"class_name\": \"Solution\",\n \"created_at_timestamp\": 1615292571,\n \"func_sign\": [\n \"maximumMatch(self, G)\"\n ],\n \"initial_code\": \"# Initial Template for Python 3\\n\\nif __name__ == '__main__':\\n T = int(input())\\n for i in range(T):\\n m, n = map(int, input().strip().split())\\n G = []\\n for i in range(m):\\n G.append(list(map(int, input().strip().split())))\\n obj = Solution()\\n ans = obj.maximumMatch(G)\\n print(ans)\\n\",\n \"solution\": \"class Solution:\\n def try_kunh(self, u, G, used, mt):\\n # iterating over all the vertices v in G[u]\\n for v in range(len(G[0])):\\n # if there is an edge between u and v and v is not used\\n if G[u][v] and used[v] == False:\\n # mark v as used\\n used[v] = True\\n # if v is not matched with any other vertex or\\n # recursively trying to match the vertex mt[v] with some other vertex\\n if mt[v] < 0 or self.try_kunh(mt[v], G, used, mt):\\n mt[v] = u\\n # return True once we find a matching for v\\n return True\\n # return False if a matching for v cannot be found\\n return False\\n\\n def maximumMatch(self, G):\\n m = len(G)\\n n = len(G[0])\\n N = max(n, m)\\n ans = 0\\n mt = [-1 for i in range(N)]\\n # iterate over all the vertices in G\\n for i in range(m):\\n used = [False for j in range(N)]\\n # try to match vertex i\\n if self.try_kunh(i, G, used, mt):\\n ans = ans + 1\\n # return the maximum number of matches\\n return ans\\n\",\n \"updated_at_timestamp\": 1727776457,\n \"user_code\": \"#User function Template for python3\\n\\nclass Solution:\\n\\tdef maximumMatch(self, G):\\n\\t\\t#code here\"\n}"},"test_cases":{"kind":"string","value":"eJztWMFKxDAQ9eBPeBCG4HGRJN1li18iWPGgPXiJe+iCIIIfof9rOk27STOztHahu24WsqTpZOa9l2baydflz83VBf7ur23n4UO8ms22EncgssKsYFUYBRKwFcZ1QLaj2G1G0cCzXcKyvsZbtQ2adxadr8KsYe35CP2Etn4UD4oD0oYi7nYDYgGifN+Uz1X58vS2rRxVy9KCtTDE5wI8CXRh8p0EFFnHqoUgebm6aXLnTNleH3E4ORju6RKFoSwDWcMghKUHMhqOLXtr0zVe5ZptT2OFMuStRIHU+9bdl51gTWsT6RLhj1hGFgy7nGKmJWhaI6qRClMteUwe/7dHZpNpMn9kErLhGCbhmsQ+RU6RU+QUOUVOkc8uMvNGz+I3OmdKFA6IiTFXZKmBn/zMDPLjQoPGUgT/Rk90NS+HUaeiIXk8I4/q8C79NrxqwMOXwXmm2cqndlDhklZ9iMVRjXOk5BPqzLqoeYU5puUfRnPUQRX89TV3YqKokbLwD7hujjPn3vyHW4GJm8Nq22gF6riS5cAHY0/mQ8KP37e/IPLswQ=="}}},{"rowIdx":769,"cells":{"question_id":{"kind":"number","value":710025,"string":"710,025"},"question_title":{"kind":"string","value":"Levels Of Game"},"question_content":{"kind":"string","value":"You are playing a game. At each level of the game, you have to choose one of the roads to go to the next level. Initially, you have h amount of health and mamount of money.If you take the first road then health decreases by 20 and money increase by 5.If you take the second road then your health decreases by 5 and money decrease by 10. If you take the thirdroad then your health increases by 3and money increase by 2.You have to tell what is the maximum level you can reach up to under the constraints that in no two consecutive levels you can select the same road twice and once your health or money becomes <= 0 game ends(that level is not counted).\nExamples:\nInput:\nH=2\nM=10\n\nOutput:\n1\n\nExplanation:\n\nFor the first level, we can only choose the third road.\nNow we cannot move ahead anymore.\nInput:\nH=20\nM=8\n\nOutput:\n5\n\nExplanation:\n\nGo like this:- R3(23,10)->R1(3,15)->R3(6,17)->\nR2(1,7)->R3(4,9)-> game ends as we cannot choose\nany more roads.\n\nConstraints:\n1 <= H,M<=800."},"dataset":{"kind":"string","value":"geeksforgeeks"},"difficulty":{"kind":"string","value":"Medium"},"java":{"kind":"string","value":"{\n \"class_name\": \"Solution\",\n \"created_at_timestamp\": 1650389561,\n \"func_sign\": [\n \"public static int maxLevel(int h,int m)\"\n ],\n \"initial_code\": \"import java.io.*;\\nimport java.util.*;\\nclass IntArray\\n{\\n public static int[] input(BufferedReader br, int n) throws IOException\\n {\\n String[] s = br.readLine().trim().split(\\\" \\\");\\n int[] a = new int[n];\\n for(int i = 0; i < n; i++)\\n a[i] = Integer.parseInt(s[i]);\\n \\n return a;\\n }\\n \\n public static void print(int[] a)\\n {\\n for(int e : a)\\n System.out.print(e + \\\" \\\");\\n System.out.println();\\n }\\n \\n public static void print(ArrayList<Integer> a)\\n {\\n for(int e : a)\\n System.out.print(e + \\\" \\\");\\n System.out.println();\\n }\\n}\\n\\nclass GFG {\\n public static void main(String[] args) throws IOException {\\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\\n int t;\\n t = Integer.parseInt(br.readLine());\\n while(t-- > 0){\\n \\n int[] a = IntArray.input(br, 2);\\n int h = a[0],m = a[1];\\n Solution obj = new Solution();\\n int res = obj.maxLevel(h,m);\\n \\n System.out.println(res);\\n \\n \\nSystem.out.println(\\\"~\\\");\\n}\\n }\\n}\\n\",\n \"script_name\": \"GFG\",\n \"solution\": \"None\",\n \"updated_at_timestamp\": 1730480919,\n \"user_code\": \"class Solution {\\n public static int maxLevel(int h,int m) {\\n // code here\\n }\\n}\\n \\n\"\n}"},"python":{"kind":"string","value":"{\n \"class_name\": \"Solution\",\n \"created_at_timestamp\": 1650389561,\n \"func_sign\": [\n \"maxLevel(self, h:int,m:int) -> int\"\n ],\n \"initial_code\": \"class IntArray:\\n def __init__(self) -> None:\\n pass\\n\\n def Input(self, n):\\n arr = [int(i) for i in input().strip().split()] # array input\\n return arr\\n\\n def Print(self, arr):\\n for i in arr:\\n print(i, end=\\\" \\\")\\n print()\\n\\n\\nif __name__ == \\\"__main__\\\":\\n t = int(input())\\n for _ in range(t):\\n a = IntArray().Input(2)\\n h, m = a[0], a[1]\\n obj = Solution()\\n res = obj.maxLevel(h, m)\\n print(res)\\n print(\\\"~\\\")\\n\",\n \"solution\": \"from typing import List\\n\\n\\nclass Solution:\\n def maxLevel(self, h: int, m: int) -> int:\\n # code here\\n dp = [[None for j in range(1500)] for i in range(1500)]\\n\\n def rec(h, m):\\n if h <= 0 or m <= 0:\\n return 0\\n if dp[h][m] != None:\\n return dp[h][m]\\n a = rec(h - 5 + 3, m - 10 + 2) + 2\\n b = rec(h - 20 + 3, m + 5 + 2) + 2\\n dp[h][m] = max(a, b)\\n return dp[h][m]\\n\\n return rec(h, m) - 1\\n\",\n \"updated_at_timestamp\": 1730480919,\n \"user_code\": \"from typing import List\\nclass Solution:\\n def maxLevel(self, h:int,m:int) -> int:\\n # code here\\n \\n\"\n}"},"test_cases":{"kind":"string","value":"eJylkj8KwjAUxh16kEfmKnlJQxtPIlhx0AwusUMLgigeQg/g5jF9OigOnzY1EAiEX74/L6fscstGzzW7ymG+V5vYdK2akuI6MrHKSYVdE1ZtWC+3Xfu+PNZRHXL6JCqtSTagLHvAOWIIAcRocgBxAGFxZ6A7VwKs9J5kJ4eyBBlk0JFF9pC7QkLB8io0KNZUwCZQIGbNWMvAIr4YHCODUt5DUT6TiP7UhoWK9GuACIYdDRAEtvGvS3+ob6xeL6fCmoZPkv+OsjhP7rQkZro="}}},{"rowIdx":770,"cells":{"question_id":{"kind":"number","value":701151,"string":"701,151"},"question_title":{"kind":"string","value":"First Set Bit"},"question_content":{"kind":"string","value":"Given an integerN. The task is to return the position of first set bit found from the right side in the binary representation of the number.Note: If there is no set bit in the integer N, then return 0 from the function.\nExamples:\nInput:\nN = 18\n\nOutput:\n2\n\nExplanation:\n\nBinary representation of 18 is 010010,the first set bit from the right side is at position 2.\nInput:\nN = 12 \n\nOutput:\n3 \n\nExplanation:\n\nBinary representation of 12 is 1100, the first set bit from the right side is at position 3.\n\nConstraints:\n0 <= N <= 10**8"},"dataset":{"kind":"string","value":"geeksforgeeks"},"difficulty":{"kind":"string","value":"Easy"},"java":{"kind":"string","value":"{\n \"class_name\": \"Solution\",\n \"created_at_timestamp\": 1618483437,\n \"func_sign\": [\n \"public static int getFirstSetBit(int n)\"\n ],\n \"initial_code\": \"//Initial Template for Java\\n\\nimport java.util.*;\\nimport java.lang.*;\\nimport java.io.*;\\n\\nclass Main {\\n \\n \\n\\tpublic static void main (String[] args) {\\n\\t\\tScanner sc=new Scanner(System.in);\\n\\t\\tint t=sc.nextInt();//taking testcases\\n\\t\\twhile(t-->0){\\n\\t\\t\\tint n=sc.nextInt();//input n\\n\\t\\t\\tSolution ob=new Solution();\\n\\t\\t\\tSystem.out.println(ob.getFirstSetBit(n));//calling method\\n\\t\\t\\nSystem.out.println(\\\"~\\\");\\n}\\n\\t}\\n}\\n\",\n \"script_name\": \"Main\",\n \"solution\": \"None\",\n \"updated_at_timestamp\": 1729753320,\n \"user_code\": \"//User function Template for Java\\n\\nclass Solution\\n{\\n //Function to find position of first set bit in the given number.\\n public static int getFirstSetBit(int n){\\n \\n // Your code here\\n \\n }\\n}\"\n}"},"python":{"kind":"string","value":"{\n \"class_name\": \"Solution\",\n \"created_at_timestamp\": 1618483437,\n \"func_sign\": [\n \"getFirstSetBit(self,n)\"\n ],\n \"initial_code\": \"# Initial Template for Python 3\\n\\nimport math\\n\\n# Position this line where user code will be pasted.\\n\\n\\ndef main():\\n T = int(input())\\n\\n while T > 0:\\n n = int(input())\\n ob = Solution()\\n print(ob.getFirstSetBit(n))\\n T -= 1\\n print(\\\"~\\\")\\n\\n\\nif __name__ == \\\"__main__\\\":\\n main()\\n\",\n \"solution\": \"# Back-end complete function Template for Python 3\\n\\nclass Solution:\\n # Function to find position of first set bit in the given number.\\n def getFirstSetBit(self, n):\\n if n == 0:\\n return 0\\n\\n # doing AND operation of n and -n. n and -n will have similar\\n # bits only till the first set bit starting from the right\\n # and different bits after the first set bit. Then we take\\n # log2 of the result to find the position.\\n\\n # we add 1 to obtained value so that count starts from 1 instead of 0.\\n return math.ceil(math.log2(n & -n) + 1)\\n\",\n \"updated_at_timestamp\": 1729753320,\n \"user_code\": \"#User function Template for python3\\n\\nclass Solution:\\n \\n #Function to find position of first set bit in the given number.\\n def getFirstSetBit(self,n):\\n #Your code here\"\n}"},"test_cases":{"kind":"string","value":"eJytlE0KwjAQhV30ICXrIvmbZOpJBCsutAs30UUFQRQPoVt33tNUqyj0BRSzCm2/eXlvJj1m52s2uK/xJW4mO7EM600jRrlQVZCiyEW9Xdfzpl7MVpumeyWrcKiC2Bf55/dKWibvAKUVwIwhstZoxDnAOa8ks7OI84Aj49jLUiFBA/0Zq5X3mpEiw2C6BcCyj9NV0EQRBtAjzt5QI6q0seQ8x9Ile0cx3x8KxYfasTUUayHTvYd/pdWOEU4sIRo1kWI65RcO40aqj/n9FmodJgcfm6RvXd4b+6/OdvfnfT7RYdJ9Svwq8Hi+u0jCzyCmp+ENMZtrgg=="}}},{"rowIdx":771,"cells":{"question_id":{"kind":"number","value":700408,"string":"700,408"},"question_title":{"kind":"string","value":"Rat in a Maze Problem - I"},"question_content":{"kind":"string","value":"Consider a rat placed at (0, 0) in a square matrix mat of order n* n. It has to reach the destination at (n - 1, n - 1). Find all possible paths that the rat can take to reach from source to destination. The directions in which the rat can move are 'U'(up), 'D'(down), 'L' (left), 'R' (right). Value 0 at a cell in the matrix represents that it is blocked and rat cannot move to it while value 1 at a cell in the matrix represents thatratcan be travelthrough it.Note: In a path, no cell can be visited more than one time.If the source cell is 0, the rat cannot move to any other cell. In case of no path, return an empty list. The driver will output \"-1\" automatically.\nExamples:\nInput:\nmat[][] = [[1, 0, 0, 0],\n [1, 1, 0, 1], \n [1, 1, 0, 0],\n [0, 1, 1, 1]]\n\nOutput:\nDDRDRR DRDDRR\n\nExplanation:\nThe rat can reach the destination at (3, 3) from (0, 0) by two paths - DRDDRR and DDRDRR, when printed in sorted order we get DDRDRR DRDDRR.\nInput:\nmat[][] = [[1, 0],\n [1, 0]]\n\nOutput:\n-1\n\nExplanation:\nNo path exists and destination cell is blocked.\n\nConstraints:\n2 ≤ n ≤ 5\n0 ≤ mat[i][j] ≤ 1"},"dataset":{"kind":"string","value":"geeksforgeeks"},"difficulty":{"kind":"string","value":"Medium"},"java":{"kind":"string","value":"{\n \"class_name\": \"Solution\",\n \"created_at_timestamp\": 1615292571,\n \"func_sign\": [\n \"public ArrayList<String> findPath(int[][] mat)\"\n ],\n \"initial_code\": \"// Initial Template for Java\\n\\nimport java.util.*;\\n\\nclass Rat {\\n public static void main(String[] args) {\\n Scanner sc = new Scanner(System.in);\\n int t = sc.nextInt();\\n\\n while (t-- > 0) {\\n int n = sc.nextInt();\\n int[][] a = new int[n][n];\\n for (int i = 0; i < n; i++)\\n for (int j = 0; j < n; j++) a[i][j] = sc.nextInt();\\n\\n Solution obj = new Solution();\\n ArrayList<String> res = obj.findPath(a);\\n Collections.sort(res);\\n if (res.size() > 0) {\\n for (int i = 0; i < res.size(); i++) System.out.print(res.get(i) + \\\" \\\");\\n System.out.println();\\n } else {\\n System.out.println(-1);\\n }\\n \\nSystem.out.println(\\\"~\\\");\\n}\\n }\\n}\\n\",\n \"script_name\": \"Rat\",\n \"solution\": \"class Solution {\\n private ArrayList<ArrayList<Integer>> visitedCells;\\n private ArrayList<String> possiblePaths;\\n\\n // Function to find the path using DFS\\n public void explorePaths(ArrayList<ArrayList<Integer>> mat, int row, int col,\\n String currentPath, int n) {\\n if (row == n - 1 && col == n - 1) {\\n possiblePaths.add(currentPath);\\n return;\\n }\\n\\n if (mat.get(row).get(col) == 0 || visitedCells.get(row).get(col) == 1) {\\n return;\\n }\\n\\n visitedCells.get(row).set(col, 1);\\n\\n if (row > 0) // Move up\\n explorePaths(mat, row - 1, col, currentPath + \\\"U\\\", n);\\n if (col > 0) // Move left\\n explorePaths(mat, row, col - 1, currentPath + \\\"L\\\", n);\\n if (row < n - 1) // Move down\\n explorePaths(mat, row + 1, col, currentPath + \\\"D\\\", n);\\n if (col < n - 1) // Move right\\n explorePaths(mat, row, col + 1, currentPath + \\\"R\\\", n);\\n\\n visitedCells.get(row).set(col, 0); // Backtrack\\n }\\n\\n // Function to find all possible paths\\n public ArrayList<String> findPath(ArrayList<ArrayList<Integer>> mat) {\\n int n = mat.size();\\n possiblePaths = new ArrayList<>();\\n visitedCells = new ArrayList<>();\\n for (int i = 0; i < n; i++) {\\n visitedCells.add(new ArrayList<>(Collections.nCopies(n, 0)));\\n }\\n\\n if (mat.get(0).get(0) == 0 || mat.get(n - 1).get(n - 1) == 0) {\\n return possiblePaths;\\n }\\n\\n explorePaths(mat, 0, 0, \\\"\\\", n);\\n Collections.sort(possiblePaths);\\n return possiblePaths;\\n }\\n}\",\n \"updated_at_timestamp\": 1730272373,\n \"user_code\": \"class Solution {\\n public ArrayList<String> findPath(int[][] mat) {\\n // Your code here\\n }\\n}\"\n}"},"python":{"kind":"string","value":"{\n \"class_name\": \"Solution\",\n \"created_at_timestamp\": 1722276232,\n \"func_sign\": [\n \"findPath(self, m: List[List[int]]) -> List[str]\"\n ],\n \"initial_code\": \"# Main function to read input and output the results\\nif __name__ == \\\"__main__\\\":\\n t = int(input().strip())\\n for _ in range(t):\\n n = int(input().strip())\\n m = []\\n for i in range(n):\\n m.append(list(map(int, input().strip().split())))\\n obj = Solution()\\n result = obj.findPath(m)\\n result.sort()\\n if len(result) == 0:\\n print(-1)\\n else:\\n print(\\\" \\\".join(result))\\n print(\\\"~\\\")\\n\",\n \"solution\": \"# Import necessary modules\\nfrom typing import List\\n\\n# Class to implement the solution\\n\\n\\nclass Solution:\\n def __init__(self):\\n self.result = []\\n self.visited = []\\n\\n def path(self, m: List[List[int]], x: int, y: int, dir: str, n: int):\\n # If the current cell is the destination, add the direction to the result list\\n if x == n - 1 and y == n - 1:\\n self.result.append(dir)\\n return\\n\\n # If the current cell is blocked or already visited, return\\n if m[x][y] == 0 or self.visited[x][y]:\\n return\\n\\n # DFS traversal\\n # Marking the current cell as visited\\n self.visited[x][y] = True\\n\\n # Recursively calling the path function for the adjacent cells in all possible directions\\n if x > 0:\\n self.path(m, x - 1, y, dir + 'U', n)\\n if y > 0:\\n self.path(m, x, y - 1, dir + 'L', n)\\n if x < n - 1:\\n self.path(m, x + 1, y, dir + 'D', n)\\n if y < n - 1:\\n self.path(m, x, y + 1, dir + 'R', n)\\n\\n # Marking the current cell as not visited\\n self.visited[x][y] = False\\n\\n # Function to find all possible paths\\n def findPath(self, m: List[List[int]]) -> List[str]:\\n n = len(m)\\n # Resetting the visited cells and result list\\n self.visited = [[False for _ in range(n)] for _ in range(n)]\\n self.result.clear()\\n\\n # If the source or destination cell is blocked, return empty result list\\n if m[0][0] == 0 or m[n - 1][n - 1] == 0:\\n return self.result\\n\\n # Finding all possible paths\\n self.path(m, 0, 0, \\\"\\\", n)\\n\\n # Returning the result list\\n return self.result\\n\",\n \"updated_at_timestamp\": 1730272373,\n \"user_code\": \"from typing import List\\n\\nclass Solution:\\n def findPath(self, m: List[List[int]]) -> List[str]:\\n # code here\"\n}"},"test_cases":{"kind":"string","value":"eJzVVDsOwjAMZWDjElHmgpyBhbkjUyckghigA0vo0EpIfMQh4L4kaUPVTz5tANGkUi0r8vPzs30fPy+TkTyrjBvrMz6wJEvxAmFC2ZwygvILlAESV5rSI/zCLPzlW4IDhONTEu/SeL89ZmkRMYqiMOQfZTfK8DVArWgyXAUCql6ivAWwBk0gCUTE/9Iww9ajVryKJDiR5IBLfiRqZEJtBrUloCcrYd04tgA35TVxzOsZGrnpGwQUzXc6hdeAFnroB530mxK7YqSlcHXFbO1pxnEfA3tndBgDKEUjqhmg1xjY6HXeKZ9fEG7rSJ8oDCpTj7r/hmT/jrEK8V9KaFJFQ83VY+MrQvb1o90/wxwcGMjk2HKUj3NnDwl8ysvNL4nusk3KShDfudw8Zi/2kNo6"}}},{"rowIdx":772,"cells":{"question_id":{"kind":"number","value":705695,"string":"705,695"},"question_title":{"kind":"string","value":"Assignment Problem"},"question_content":{"kind":"string","value":"You are the head of a firm and you have to assign jobs to people. You have N persons working under you and you have N jobs that are to be done by these persons. Each person has to do exactly one job and each job has to be done by exactly one person. Each person has his own capability (in terms of time taken) to do any particular job. Your task is to assign the jobs to the persons in such a way that the total time taken is minimum. A job can be assigned to only one person and a person can do only one job.\nExamples:\nInput:\nN = \n2\nArr[] = \n{3, 5, 10, 1}\nOutput:\n4\n\nExplanation:\nThe first person takes times 3 and 5\nfor jobs 1 and 2 respectively. The second\nperson takes times 10 and 1 for jobs 1 and\n2 respectively. We can see that the optimal\nassignment will be to give job 1 to person 1\nand job 2 to person 2 for a total for 3+1 = 4.\nInput:\nN = \n3\nArr[] = \n{\n2, 1, 2,9, 8, 1, 1, 1, 1}\nOutput:\n3 \n\nExplanation: \n\nThe optimal arrangement would be to assign \njob 1 to person 3,job 2 to person 1 and job \n3 to person 2.\n\nConstraints:\n1 <= N <= 30\n\n1 <= Arr[i] <= 100"},"dataset":{"kind":"string","value":"geeksforgeeks"},"difficulty":{"kind":"string","value":"Hard"},"java":{"kind":"string","value":"{\n \"class_name\": \"Solution\",\n \"created_at_timestamp\": 1615292571,\n \"func_sign\": [\n \"static int assignmentProblem(int Arr[], int N)\"\n ],\n \"initial_code\": \"//Initial Template for Java\\n\\nimport java.io.*;\\nimport java.util.*;\\n\\nclass GFG {\\n public static void main(String args[]) throws IOException {\\n BufferedReader read =\\n new BufferedReader(new InputStreamReader(System.in));\\n int t = Integer.parseInt(read.readLine());\\n while (t-- > 0) {\\n int N = Integer.parseInt(read.readLine());\\n String S[] = read.readLine().split(\\\" \\\");\\n \\n int[] Arr = new int[N*N];\\n \\n for(int i=0; i<N*N; i++)\\n Arr[i] = Integer.parseInt(S[i]);\\n\\n Solution ob = new Solution();\\n System.out.println(ob.assignmentProblem(Arr,N));\\n }\\n }\\n}\",\n \"script_name\": \"GFG\",\n \"solution\": \"None\",\n \"updated_at_timestamp\": 1730436740,\n \"user_code\": \"//User function Template for Java\\n\\nclass Solution {\\n static int assignmentProblem(int Arr[], int N) {\\n // code here\\n }\\n};\"\n}"},"python":{"kind":"string","value":"{\n \"class_name\": \"Solution\",\n \"created_at_timestamp\": 1615292571,\n \"func_sign\": [\n \"assignmentProblem(self, Arr, N)\"\n ],\n \"initial_code\": \"# Initial Template for Python 3\\n\\nif __name__ == '__main__':\\n t = int(input())\\n for _ in range(t):\\n N = int(input())\\n Arr = list(map(int, input().split()))\\n\\n ob = Solution()\\n print(ob.assignmentProblem(Arr, N))\\n print(\\\"~\\\")\\n\",\n \"solution\": \"class Solution:\\n\\n def assignmentProblem(self, Arr, N):\\n n = N\\n l = Arr\\n m = []\\n m_beg = []\\n\\n # Creating a matrix from the given array\\n for i in range(n):\\n m.append(l[i*n:(i+1)*n])\\n m_beg.append(l[i*n:(i+1)*n])\\n\\n # Function to solve the assignment problem\\n def util():\\n u, v, ind = [0]*n, [0]*n, [-1]*n\\n\\n # Finding the minimum cost assignment using Hungarian Algorithm\\n for i in range(n):\\n links, mins, visited = [-1]*n, [1000]*n, [False]*n\\n marked_i, marked_j = i, -1\\n\\n while marked_i != -1:\\n j = -1\\n for j1 in range(n):\\n if not visited[j1]:\\n current = m[marked_i][j1] - u[marked_i] - v[j1]\\n if current < mins[j1]:\\n mins[j1] = current\\n links[j1] = marked_j\\n if j == -1 or mins[j1] < mins[j]:\\n j = j1\\n\\n delta = mins[j]\\n\\n for j1 in range(n):\\n if visited[j1]:\\n u[ind[j1]] += delta\\n v[j1] -= delta\\n else:\\n mins[j1] -= delta\\n\\n u[i] += delta\\n visited[j] = True\\n marked_j, marked_i = j, ind[j]\\n\\n while links[j] != -1:\\n ind[j] = ind[links[j]]\\n j = links[j]\\n\\n ind[j] = i\\n\\n # Returning the assignment pairs\\n return [(ind[j], j) for j in range(n)]\\n\\n # Finding the total cost of the assignment\\n return sum(m_beg[x][y] for x, y in util())\\n\",\n \"updated_at_timestamp\": 1729753320,\n \"user_code\": \"#User function Template for python3\\n\\nclass Solution:\\n def assignmentProblem(self, Arr, N):\\n # code here \"\n}"},"test_cases":{"kind":"string","value":"eJzdVztuFEEUJCDmDE8bW2he9+sfJ0FiEQE4IBkIbAkJgTgEXJGMO1BVjSUTNDYWoDWrCVarUb/6vZrZTw+/fHv0QJ+nX/Hl2fvD6/3t5cXhiR38uMdx78l6tjpsJPNiKVlNNsIcV7biVqsNt9KtZvx+OLPD+bu35y8vzl+9eHN5cXVWz8f943E/fDizn0eU4z6K5c1is7pZCcvJUljD3GE1LDBls96sFQLA9O6WhvVuoxMG7vHKm0taTY+0mF6PO47FUBwFFgGCmTDAOsCoWAewai7uYJ0z1WgA0K1xokWTIG5jWG5WgLZY23gnRas8B/ASOK7FKQt4DVe3VDU9WXYCA+DALE2B7BHWg5gHLunTMk0BKYAsgxSSZGyNeKoTfwjhyKScp6SbJIWhjceCSMcgp61Qe0D/ICOYnseCSPK+IILfYSLwQ0MI0isRUq5BOhhBFoVC1U61gRYIu0ZPsgge6QQFB1TgQWZgAbjkIVJB+rmSJsCDVBUjV4pSs0jCH3QKWkHVjAMbrfFGMaEt8ozgeWfe6GliMBrs86V3K8rwrs84NR6SFelpCg4EKihPHRrxQxyMg9cgAoKY25VtsCOXrNiLMgUMeuqijIiCDvzK8p2L4CSetRFg3eeeVlo5yorF8PWC+LZJhc6zQkHEYJwI0LAHBECDC9wEOtEGUKXBAuGSnsEaVBy6gxICDfOgDsMaVJwpXOFLaaUyNocJDrHdSHXKDXgIPaZkpRkZIiSXgoV4XM01vR/C0PNKnbxShx4PzcrUBxyBBABCriT5hCmYxarKxEChhnpTgZ5L1bWoIelgdlJQulJCX13Ky9SkrM9lRtFUpQTqMd9dFbAswVIXLHw77sCNVWhSamw/sNIqzaBkG9eUKqsaWcCuhZaUzCCi7YJbiLtLBSAeoT3u0kVVWtUriEJXzSCtSZ0a6idvV6VVmPS5slBtrohrvxmXoe1X1eX5WEjqLZVH0sbDVNgPQaEydo7ruFFK7Dq0hr4wfiguCApcBGafxTDrXENZqIovNAmGbFl+q0fcX2jx7YYar/kWRX6nB/xd2v+2U1L50y8S/+5NYtb9ve/7tVXcgOtm2c1elV/05vWNuNVKnOibzemW5xj/ZX2eUFjG78flrm8M9bReGUCDbX0//5w8//z4O4LBQwk="}}},{"rowIdx":773,"cells":{"question_id":{"kind":"number","value":712035,"string":"712,035"},"question_title":{"kind":"string","value":"Pattern 17"},"question_content":{"kind":"string","value":"Geek is very fond of patterns. Once, his teacher gave him a pattern to solve. He gave Geekan integer n and asked him to build a pattern.\nExamples:\nInput:\n4\n\nOutput:\nA\n ABA\n ABCBA\nABCDCBA\n\nConstraints:1<= N <= 20"},"dataset":{"kind":"string","value":"geeksforgeeks"},"difficulty":{"kind":"string","value":"Easy"},"java":{"kind":"string","value":"{\n \"class_name\": \"Solution\",\n \"created_at_timestamp\": 1662630677,\n \"func_sign\": [\n \"void printTriangle(int n)\"\n ],\n \"initial_code\": \"import java.io.*;\\nimport java.util.*;\\n\\nclass Main {\\n // Driver code\\n public static void main(String[] args) throws Exception {\\n BufferedReader br =\\n new BufferedReader(new InputStreamReader(System.in));\\n int t = Integer.parseInt(br.readLine().trim());\\n while (t-- > 0) {\\n int n = Integer.parseInt(br.readLine().trim());\\n Solution obj = new Solution();\\n obj.printTriangle(n);\\n \\nSystem.out.println(\\\"~\\\");\\n}\\n }\\n}\",\n \"script_name\": \"Main\",\n \"solution\": \"None\",\n \"updated_at_timestamp\": 1730481442,\n \"user_code\": \"class Solution {\\n\\n void printTriangle(int n) {\\n // code here\\n }\\n}\"\n}"},"python":{"kind":"string","value":"{\n \"class_name\": \"Solution\",\n \"created_at_timestamp\": 1663316956,\n \"func_sign\": [\n \"printTriangle(self, N)\"\n ],\n \"initial_code\": \"# Initial Template for Python 3\\n\\nif __name__ == '__main__':\\n t = int(input())\\n\\n for _ in range(t):\\n N = int(input().strip())\\n ob = Solution()\\n ob.printTriangle(N)\\n print(\\\"~\\\")\\n\",\n \"solution\": \"# Back-end complete function Template for Python 3\\n\\nclass Solution:\\n\\n # Function to print the triangular pattern\\n def printTriangle(self, N):\\n\\n # Initial number of spaces\\n spaces = N\\n\\n # Iterating over each row\\n for i in range(65, 65 + N):\\n\\n # Printing spaces\\n for sp in range(1, spaces):\\n print(' ', end='')\\n\\n # Printing characters in increasing order\\n for j in range(65, i + 1):\\n print(chr(j), end='')\\n\\n # Printing characters in decreasing order\\n for j in range(i - 1, 64, -1):\\n print(chr(j), end='')\\n\\n # Updating the number of spaces for the next row\\n spaces -= 1\\n\\n # Moving to the next line\\n print()\\n\",\n \"updated_at_timestamp\": 1730481442,\n \"user_code\": \"#User function Template for python3\\n\\nclass Solution:\\n def printTriangle(self, N):\\n # Code here\"\n}"},"test_cases":{"kind":"string","value":"eJztndmSG0kVhrmAG55CoWsHoX3xnYdhGIZ9H5gajFYwi9xAFxiMHTwE78UroXYvOiplVmaVasuTX0XYPq3NdTL///sldVXlf776+f++/rWvfPG2/+pwk972n/f60+QwTA6j5DBODpPkcPyx/6zX37252W1ud9uXr9Pbhwe+SA7vk0Pv+M+Ljx7qux96H3568dE3n278cOv9zb2H24//fCwecP+Ih4c8Pqb39KC74ltPj++/e9YT+3vczeHg+Oe4o6OBdWd7j9v9/3RffnT64fH/fPzh49OP4n9/+vGT0w33P3/7dMvDDZ+ebnq85Tun255u+kzc+P60bxc7e7HHl7tt2HdTA6fbPsncetGKvPXTzO2Gps5v/yxzz+mO72buEvd8L3OfvOv7mTvP7vtB5t7zO3+YvftiqI3jbR50y8jbht86B/aJyJmNvCnJnZf8ycncm52h7N3Zabq4PztXlw/IzojhERezZnjIj0wPyj7mx6ZHXTzoJ6aHXT7qp6bHGR72M+MDLwF2RO38yK+lg12nIToNhGhXNnW26+c7mKt/s87NKrdo3KZwq77t6s7Rdp6yc3Wdr2qHpl2KdurZrWYPLfso2UvHfir20/DxjcLsqOG7LF4c/4zytfzU+1OHpz7E3sp9Mss2q46sIi5UcDnzhtk2zbBxVs0zaZk924xZZ8k+M+4oM3rW6FizXy1utXnV6lS7T3NcmufRXIfm+9PhTpc3nc50+9LDlT6eNDvSNvsvsoOcHdiLwbwcQMOgmQbKODjmAbEMgq1xB36Gfu/9LSNkHinLiNlGTt7OGz3e6JlVOnR8mr58a5gvbT7JIPDuCHz8Qa5338b4S/ZsVs5m4Hy0MyPbzvcx2T2WcsRa2buxVqVfEtx9Q1DoXY5ZkWY9WtTIx/k4Ps5f6ATMgbl2MHf3+yf72+QPXT/09bjnT/t2+t8Nwj6f3POpzExcdpouJuVyCgwDbhpe42Cah873rdaA91qGaZQ3AyEgVPBzut1SRite/s78WN85M//tWhGQvbj4bbtxN0ZP+1HPblzYrmcxqcWlNptafWo3ao5T86ya69V8szrc6rKr069uw3o41seyXp71M62na31ta3qc2bemB/7cavEc4zx+yXb/9Vzxr9qC3MyeDXGzcCbEzcbGEDcrz0Pc7BkU4paTmyFueVkf4pb7/iTELf89VYib431giJvrvWuIm/P9doib+zNCiJvH55oQN5/PYiFuXp8fQ9z8PvOGuHl+Tg9x8/1uIcTN+/uQtne0zFbgO5y2d7XEZuzuF2r6M7f3SzUNWvr7XE2HtgZ/paZFa4e/VtOjvcUv1DSZ02OSqGkzt8sv9TSa3+dv9HTqaPSlnlZdnf5WT6/OVld6mnX3utbTrUezGz3t+nS71dOvV7s7PQ379bvX07Fnw7/T07Jvx7/X07N3y6/0NO3f8x/0dF2g6T/qabtI13/S03ehtv+sp/FifR/0dF6w8dd6Wi/a+Y2e3gu3/hc9zRfv/a96ui/R/N/0tF+m+1s9/ZdqP9UzAOX6/7ueESg5AP/QMwRlR+CNnjEoPQT/1DMI5cfgX3pG4YpBeKtnGK4ZhX/rGYerhuGdnoG4bhze6xmJKwciSQeD+V7PeFQyHHd/LwbKhqbikVkMNY5SPYM0UjtgdY7XWPfY1T90kwiGsalRnMYyos0O6CyqwW1jbOfxjXN7w7yIdMjbHvFlzKPfjcFfRT8RXZqHNXPSzSnZMD2dn50tMxXSRO2YtEDnbM/8BT99ywFTqWkml0NmVeukjpjgCOZ3zFzHNdUTpj3aWZ+iAAQwWM4QA1o408IcXSALmywWSASFeChkiVoQSzGxrBAOuimtmzUaQkJVSGiDnFBTxWraoiyEVZ+wdogMjTWisT16Q24Ny201QHqNSg/lnSlvNUSFzasQEZpEOEKQLQkSPdr1OEabbWoTabqkOUGmrcsUlfqpdIpiu6FYBFtEsDPE2yHxot3i2p2j467pGBmXlfECSXdS0ij6OkUvUXd31Y24qxD3CqF3XOjovDqdr9F8CJpH8lVLfoP8g5E/6q9H/VucEJYTMEKdRthhigBNgSfq98Qef4TqD+zRkD3WA6wStFVwSqNOWQ9xTfiuwTRtmGaEgZQYCP+0558xXtLkJazUtpUm2EqdrXBVN1w1xWE6HYbBumSwGWZTbDa81j2vzfGddt9hu67aboEFo7AgDuy2A5e4MR43YsYQzLjCmJEZE1+G48s1Ho3Ro1g0NItusGu0dsWtYbp1i3Pjdi7GDdm4O0yMifGwAg/vRY2fo/YzdlZi583gVGNtrI2zdTl7MzzVuByXY3K9Jh+JGsNjePweg9/Hosb7eB/rC8nEYP2JqMEAGIACabQUmIoaIkAEgAAQjn/PRA0cgANsgA3nbJiLGk7ACTABJqyYWIgaZIAMiAExfIixFDX0gB7AQ0w48PCBx0rUgASQwJEUjpTmyFrUMAWmgBSQUglSNqIGL+AFukCXqumyFTWkgTRXkwbQABo7aHaiBjpApxrowByY42LOXtTwB/5UyB/wA3688LMdnGpQBIoqRxEkgkQFSLQdnmqoBJXqoRJQAkrFoTQSNYACUPUBCj7Bp7J8GosaVsGqmlkFqkDVdaiaiBpsga0msAW1oFYV1JqKGoJBsMYIBsAAWHUAm4kamAGzZmEGy2BZ1SybixquwbUWuAbWwFo9WFuIGsSBuLYQB+EgXJ2EW4oa2kG7VmkH7IBd/bBbiRrwAb72wQf34F5T3FuLGgbCwI4wEASCwGYRuBE1OASHXcIhNISGbdBwK2rICBk7R0bACBjbA+NO1EASSHYTkjASRrbNyL2o4SW87DAvwSW47AQud4NTDTpBZ+fRCTkhZ4fIuRueaigKRcOgKBAFot2D6EjUABWghgNUeApPu8rTsahhK2wNjK2gFbR2G60TUYNZMBsiZqEslA2BslNRQ1yIGyxxAS7ADQe4M1EDX+AbNnxhL+wNjb1zUcNhOKyAw2AYDIeJ4YWoQTJI1oJkiAyRQybyUtTQGTqrojNwBs7hw3klakANqPWBGk7DaS2cXosaZsNspcwG2SBbF7I3ogbf4FszvqE39NZI762oITkkV09yQA7I9YJ8J2qgDtTjgDpMh+namb4XNXyH7xHxHbyD9yjwvh+calAP6qNDPaSH9BGRfj881VAf6sdJfaAP9OOD/kjUBAABEG8AwH/4Hyv/x6ImC8iCyLOAKCAK4o6CiaiJBWKBWCAVUlKBVDj+PRU1CUFCkBAEBAFBQGQCYiZqwoKwICzICrKCrLBnxVzU5Aa5QW4QG8QGseEVGwtREyFECBFijhAShAQhQewJshQ1aUKakCY5aUKYECaEiStMVqImWAgWgsUVLOQKuUKu+OXKWtRkDBlDxnhlDBFDxBAxRSJmI2rihrghbvzjhrQhbUib4mmzFTXJQ/KQPAWTh+AheAiessGzEzUhRAgRQmVCiAwig8ig6zJoL2ryiDwij0rnEXFEHBFH18fRcDB4qokmooloujaaSCaSiWSqKpmGg2FCSqWkFClVZUoRUoQUIVV1SI0SAislsAisygOLvCKvyKt68mqckF0p2UV21ZNdRBfRRXTVGV2ThBhLiTFirMYYI8VIMVKs/hSbJiRaSqKRaHUnGoFGoBFoTQXaLCHcUsKNcGsk3Mg2so1sazbb5gk5l5Jz5FxzOUfMEXPEXBsxt0iIvJTII/IajjwSj8Qj8dpLvGVC+qWkH+nXSvq9Tw79d896b/uvDjfpbf95rz9KDsPh8U9yON71rNffvbnZbW5325ev09uHh4grWJ1dPuT8jO3MqXHZMw8uDue8PDLG8KtF0zeyxo+v5oTPtG4dgOQwuh+DgWMo7l+hZ9iMq9ufD9LZlcCsyxrbV6vMWXosb/WY3Mv+51+l2XEpTddVzpyXnXGf/e9x6qXP2S5ehxX7HbXl+atw398qeH8t4/9utoj1j8p/1HwyLK76EDezU0PcLHQJcbMRMcTNSvEQN3vyhLjlpGWIW17Ch7jlvisJcct/JxXi5nj3F+Lmesca4uZ8lx3i5v5kEOLm8WkmxM3nE1iIm9enxhA3v0+6IW6en85D3Hy/UQhx8/4WpO0dLbMV+Oam7V0tsZl/y6qmP8svkdU0aPsluZoOrUcBqGnRfpyDmh5zDuVQ02Tu4Spq2sw/KEdPo46Dj/R06jrKSk+rzuPJ9PTqPnROT7Mehwnq6dbnmEg97XodAaqnX78DXvU07HmAr56OfY9o1tOy9zHcenr2P2xdT9MFDtXX03WR8xP0tF3orAw9fRc7GUVP4wVPwtHTedGzj/S0Xvi8Kz29Fz/lTE/zJU6309N9mXMN9bRf6kxLPf2XO9FUzwCUPNFWzwiUPdNYzxCUPtdazxiUP91czyBcccq9nlG45roDeobhqqsv6BmH6y5CoWcgrrwYh56RqOSqJHrGo+KLtCgamnouX6NslOq8xo/GAav/mkhqx66py0npHsZmL8oVwYi2cZWzWAa3vSvIRTXObV+oL74hb3vE277mP4PfiWuUMQ/n1weNfk66NyVdu6wfs2O7oC4zFchEdfmqmcxZ3px1/6qnTJ9r+oK5gC0zWeSy8cyqwkkN8brTzG+5tR6Y62imOvRLyzPr5Wddx+ICCOBKAWhaaQItVLeyE7pAFtYFv5AICvFZEg61IBZvscSwFha6qUs38aynhoRqlVBsy/OhpqYWwkVZCKvGFZYRGRprZBVv9IbcGl80Huk1Jj2Ud6Y8lvNuQ4WI0CRC1pdvS5Do0a7HMdpsU5tI0yXNCTJtXaao1E+lUxTbDcUi2CKCnSHeDokX7RbX7hwdd03HyLisjBdIupOSRtHXKXqJururbsRdhbhXCL3jQkfn1el8jeZD0DySr1ryG+QfjPxRfz3q3+KEsJyAEeo0wg5TBGgKPFG/J/b4I1R/YI+G7LEeYJWgrYJTGnXKeohrwncNpmnDNCMMpMRA+Kc9/4zxkiYvYaW2rTTBVupshau64aopDtPpMAzWJYPNMJtis+G17nltju+0+w7bddV2CywYhQVxYLcduMSN8bgRM4ZgxhXGjMyY+DIcX67xaIwexaKhWXSDXaO1K24N061bnBu3czFuyMbdYWJMjIcVeHgvavwctZ+xsxI7bwanGmtjbZyty9mb4anG5bgck+s1+UjUGB7D4/cY/D4WNd7H+1hfSCYG609EDQbAABRIo6XAVNQQASIABIBw/HsmauAAHGADbDhnw1zUcAJOgAkwYcXEQtQgA2RADIjhQ4ylqKEH9AAeYsKBhw88VqIGJIAEjqRwpDRH1qKGKTAFpICUSpCyETV4AS/QBbpUTZetqCENpLmaNIAG0NhBsxM10AE61UAH5sAcF3P2ooY/8KdC/oAf8OOFn+3gVIMiUFQ5iiARJCpAou3wVEMlqFQPlYASUCoOpZGoARSAqg9Q8Ak+leXTWNSwClbVzCpQBaquQ9VE1GALbDWBLagFtaqg1lTUEAyCNUYwAAbAqgPYTNTADJg1CzNYBsuqZtlc1HANrrXANbAG1urB2kLUIA7EtYU4CAfh6iTcUtTQDtq1SjtgB+zqh91K1IAP8LUPPrgH95ri3lrUMBAGdoSBIBAENovAjajBITjsEg6hITRsg4ZbUUNGyNg5MgJGwNgeGHeiBpJAspuQhJEwsm1G7kUNL+Flh3kJLsFlJ3C5G5xq0Ak6O49OyAk5O0TO3fBUQ1EoGgZFgSgQ7R5ER6IGqAA1HKDCU3jaVZ6ORQ1bYWtgbAWtoLXbaJ2IGsyC2RAxC2WhbAiUnYoa4kLcYIkLcAFuOMCdiRr4At+w4Qt7YW9o7J2LGg7DYQUcBsNgOEwML0QNkkGyFiRDZIgcMpGXoobO0FkVnYEzcA4fzitRA2pArQ/UcBpOa+H0WtQwG2YrZTbIBtm6kL0RNfgG35rxDb2ht0Z6b0UNySG5epIDckCuF+Q7UQN1oB4H1GE6TNfO9L2o4Tt8j4jv4B28R4H3/eBUg3pQHx3qIT2kj4j0++GphvpQP07qA32gHx/0R6ImAAiAeAMA/sP/WPk/FjVZQBZEngVEAVEQdxRMRE0sEAvEAqmQkgqkwvHvqahJCBKChCAgCAgCIhMQM1ETFoQFYUFWkBVkhT0r5qImN8gNcoPYIDaIDa/YWIiaCCFCiBBzhJAgJAgJYk+QpahJE9KENMlJE8KEMCFMXGGyEjXBQrAQLK5gIVfIFXLFL1fWoiZjyBgyxitjiBgihogpEjEbURM3xA1x4x83pA1pQ9oUT5utqEkekofkKZg8BA/BQ/CUDZ6dqAkhQogQKhNCZBAZRAZdl0F7UZNH5BF5VDqPiCPiiDi6Po6Gg8FTTTQRTUTTtdFEMpFMJFNVyTQcDBNSKiWlSKkqU4qQIqQIqapDapQQWCmBRWBVHljkFXlFXtWTV+OE7ErJLrKrnuwiuoguoqvO6JokxFhKjBFjNcYYKUaKkWL1p9g0IdFSEo1EqzvRCDQCjUBrKtBmCeGWEm6EWyPhRraRbWRbs9k2T8i5lJwj55rLOWKOmCPm2oi5RULkpUQekddw5JF4JB6J117iLRPSLyX9SL9W0u99cui/e9Z72391uElv+897/VFyGI6Pf5JDkgynH4rjTcdbJsnh7sdD/1mvv3tzs9vc7rYvX6e3D887u6pv5lKL2ateXVx25PJsb8OpdaazF4yHhZqPsrH8qtL2La/1Y7H93cPF0NoGeDq6H8u7Qf7wt8eYem6mxZHdTzKuqex+lnktZvfTLIs4u59nW/7Z/UTrytHuZ9pXnXY/NWfJavdz8xa8dj85d71s97Pz19t2P92xYLf7+a4lv90v4Fw13P0K7pXH3S/hsXy5+zV8FkF3v4jXWuruV/Fbk939Mp6Lu7tfx3eZePcLea84734l/9Xr3S/lv46xx2sVWBXZ48WKLLLs8WqFFm32eLmCy0D7vGDRpaV9XrLwetU+r1l8FWyfFy2xuLbPq5ZZtNvr9/KlXtjna6H61hmvcdHZOtcdrHXBqXrXF6n5IvJ1Xx+49gs+1n/drgYuutLEefKNnNDYzPkmDR0E3NTxWI39Qry530OU/tLngx4e5utxPJ/6Pe2P+JLoy/9+4/9Z1AeX"}}},{"rowIdx":774,"cells":{"question_id":{"kind":"number","value":705437,"string":"705,437"},"question_title":{"kind":"string","value":"Area of intersection of two circles"},"question_content":{"kind":"string","value":"Given the coordinates of the centres of two circles (X1, Y1) and (X2, Y2) as well as the radii of the respective circles R1 and R2.Find the floor of the area of their intersection.Note:Use the value of Pi as 3.14\nExamples:\nInput:\nX1=0,Y1=0,R1=4\n\nX2=6,Y2=0,R2=4\n\nOutput:\n7\n\nExplanation:\nThe intersecting area equals 7.25298806.\nSo,Answer is 7.\nInput:\nX1=0,Y1=0,R1=5\n\nX2=11,Y2=0,R2=5\n\nOutput:\n0\n\nExplanation:\n\nThe circles don't intersect.\n\nConstraints:\n\n-10**9\n<=X1,Y1,X2,Y2<=10**9\n\n1<=R1,R2<=10**9"},"dataset":{"kind":"string","value":"geeksforgeeks"},"difficulty":{"kind":"string","value":"Easy"},"java":{"kind":"string","value":"{\n \"class_name\": \"Solution\",\n \"created_at_timestamp\": 1615292571,\n \"func_sign\": [\n \"long intersectionArea(double X1, double Y1, double R1, double X2, double Y2,\\ndouble R2)\"\n ],\n \"initial_code\": \"// Initial Template for Java\\n\\nimport java.io.*;\\nimport java.util.*;\\n\\nclass GFG {\\n public static void main(String args[]) throws IOException {\\n BufferedReader read =\\n new BufferedReader(new InputStreamReader(System.in));\\n int t = Integer.parseInt(read.readLine());\\n while (t-- > 0) {\\n String s[] = read.readLine().split(\\\" \\\");\\n double X1, Y1, R1, X2, Y2, R2;\\n X1 = Double.parseDouble(s[0]);\\n Y1 = Double.parseDouble(s[1]);\\n R1 = Double.parseDouble(s[2]);\\n X2 = Double.parseDouble(s[3]);\\n Y2 = Double.parseDouble(s[4]);\\n R2 = Double.parseDouble(s[5]);\\n Solution ob = new Solution();\\n long ans = ob.intersectionArea(X1, Y1, R1, X2, Y2, R2);\\n System.out.println(ans);\\n \\nSystem.out.println(\\\"~\\\");\\n}\\n }\\n}\",\n \"script_name\": \"GFG\",\n \"solution\": \"// Back-end complete function Template for Java\\nclass Solution {\\n // Function to calculate the intersection area of two circles.\\n long intersectionArea(double X1, double Y1, double R1, double X2, double Y2, double R2) {\\n // Constant value of PI.\\n double P = 3.14;\\n double d, alpha, beta, a1, a2;\\n long ans;\\n // Calculating the distance between the centers of the two circles.\\n d = Math.sqrt((X2 - X1) * (X2 - X1) + (Y2 - Y1) * (Y2 - Y1));\\n // Checking if the circles are completely separate (no intersection).\\n if (d > R1 + R2) ans = 0;\\n // Checking if one circle is completely inside the other (one is a subset of the other).\\n else if (d <= Math.abs(R2 - R1) && R1 >= R2) ans = (long) (P * R2 * R2);\\n else if (d <= Math.abs(R2 - R1) && R2 >= R1) ans = (long) (P * R1 * R1);\\n // Calculating the intersection area if there is partial overlap between the circles.\\n else {\\n alpha = Math.acos((R1 * R1 + d * d - R2 * R2) / (2 * R1 * d)) * 2;\\n beta = Math.acos((R2 * R2 + d * d - R1 * R1) / (2 * R2 * d)) * 2;\\n a1 = (double) 0.5 * beta * R2 * R2 - 0.5 * R2 * R2 * Math.sin(beta);\\n a2 = (double) 0.5 * alpha * R1 * R1 - 0.5 * R1 * R1 * Math.sin(alpha);\\n ans = (long) (a1 + a2);\\n }\\n // Returning the final intersection area.\\n return ans;\\n }\\n}\\n;\\n\",\n \"updated_at_timestamp\": 1729753320,\n \"user_code\": \"// User function Template for Java\\n\\nclass Solution {\\n long intersectionArea(double X1, double Y1, double R1, double X2, double Y2,\\ndouble R2) {\\n // code here\\n }\\n};\"\n}"},"python":{"kind":"string","value":"{\n \"class_name\": \"Solution\",\n \"created_at_timestamp\": 1615292571,\n \"func_sign\": [\n \"intersectionArea(self,X1,Y1,R1,X2,Y2,R2)\"\n ],\n \"initial_code\": \"# Initial Template for Python 3\\n\\nimport math\\n\\nif __name__ == '__main__':\\n t = int(input())\\n for _ in range(t):\\n X1, Y1, R1, X2, Y2, R2 = map(int, input().strip().split(\\\" \\\"))\\n ob = Solution()\\n ans = ob.intersectionArea(X1, Y1, R1, X2, Y2, R2)\\n ans = int(ans)\\n print(ans)\\n print(\\\"~\\\")\\n\",\n \"solution\": \"# Back-end complete function Template for Python 3\\n\\nclass Solution:\\n # Function to find the area of intersection between two circles.\\n def intersectionArea(self, X1, Y1, R1, X2, Y2, R2):\\n P = 3.14\\n\\n # Calculating the distance between the centers of the two circles.\\n d = math.sqrt((X2-X1)*(X2-X1) + (Y2-Y1)*(Y2-Y1))\\n\\n # If the distance is greater than the sum of the radii, there is no intersection.\\n if (d > R1+R2):\\n ans = 0\\n\\n # If the distance is less than the absolute difference of the radii and R1 is greater than or equal to R2,\\n # then the smaller circle is completely inside the larger circle, so the intersection is equivalent to the area of the smaller circle.\\n elif (d <= abs(R2-R1) and R1 >= R2):\\n ans = P*R2*R2\\n\\n # If the distance is less than the absolute difference of the radii and R2 is greater than or equal to R1,\\n # then the smaller circle is completely inside the larger circle, so the intersection is equivalent to the area of the smaller circle.\\n elif (d <= abs(R2-R1) and R2 >= R1):\\n ans = P*R1*R1\\n\\n # If none of the above conditions are satisfied, we calculate the intersection area using trigonometry.\\n else:\\n alpha = math.acos((R1*R1 + d*d - R2*R2) / (2*R1*d)) * 2\\n beta = math.acos((R2*R2 + d*d - R1*R1) / (2*R2*d)) * 2\\n a1 = 0.5 * beta * R2*R2 - 0.5 * R2*R2 * math.sin(beta)\\n a2 = 0.5 * alpha * R1*R1 - 0.5 * R1*R1 * math.sin(alpha)\\n ans = a1 + a2\\n\\n # Returning the integer value of the intersection area.\\n ans = int(ans)\\n return ans\\n\",\n \"updated_at_timestamp\": 1729753320,\n \"user_code\": \"#User function Template for python3\\n\\nclass Solution:\\n def intersectionArea(self,X1,Y1,R1,X2,Y2,R2):\\n #code here\"\n}"},"test_cases":{"kind":"string","value":"eJzdVUtOwzAQZcGKU1hZN2jGn7HNSZAIYgFZsAldtBISAnEIuCE7LoGbr5PYiamQQLhVOrXHM/PefPJ6+v55dlKvyw8nXD1l99V2v8suWMaLChgwhG6N/wxio6f6E+Vd6OVsw7LycVve7sq7m4f9rnWCnBtBlqwhMFqRFlRUL0UlQIPlkktSHI1FI+vt7HnD5iHabnmSt9viaD5rcRAqDqglmNohRNzmHhN5kJVV0RkZmPJETznE6RqjTcScrJWImhyH5NgL4sAxDl9kMXyLXif2xayCQplyUayytk53UkrqaBYRQDzrcqnO5VBsrT/Gx/77mFg+OSmqIC0emmE3D6iOoccojCPvek0QOBhISDMqEtOL47Y7qr69+6tlEeQthhJFoyF0y38DSmnQlgRXnEtn2j2bARRpfORCujFlnEujSUnBvV7x93q9/rSfQ35S+sATynISjaoTf6irg0mG7RdmaVkcIz80yyYuozaH/uh+Q0lcTydXWuuaFRIWkCwIQ9rZlKnli7ECnUsYkJbn78RX1/KROxNt+C8vmN9/AUynPxw9/p3FtOwNIzpRvwsxUR2+qY/JgQ9cJV6oq/ovJnkBwfXb+RemQ5/X"}}},{"rowIdx":775,"cells":{"question_id":{"kind":"number","value":703911,"string":"703,911"},"question_title":{"kind":"string","value":"Factorial Number"},"question_content":{"kind":"string","value":"For a given number N, findwhether it is a factorial number or not.A Factorial number is a number which is equal to the factorial value of other numbers.\nExamples:\nInput:\nN = 6\n\nOutput:\n1\n\nExplanation:\n\n6 is factorial of 3\nInput:\nN = 5\n\nOutput:\n0\n\nExplanation:\n\nno number's factorial is 5.\n\nConstraints:\n\n1 <= N <= 100000"},"dataset":{"kind":"string","value":"geeksforgeeks"},"difficulty":{"kind":"string","value":"Easy"},"java":{"kind":"string","value":"{\n \"class_name\": \"Solution\",\n \"created_at_timestamp\": 1615292571,\n \"func_sign\": [\n \"static int isFactorial(int N)\"\n ],\n \"initial_code\": \"//Initial Template for Java\\n\\nimport java.io.*;\\nimport java.util.*;\\n\\nclass GFG\\n{\\n public static void main(String args[])throws IOException\\n {\\n BufferedReader read = new BufferedReader(new InputStreamReader(System.in));\\n int t = Integer.parseInt(read.readLine());\\n while(t-- > 0)\\n {\\n int N = Integer.parseInt(read.readLine());\\n Solution ob = new Solution();\\n System.out.println(ob.isFactorial(N));\\n \\nSystem.out.println(\\\"~\\\");\\n}\\n }\\n}\",\n \"script_name\": \"GFG\",\n \"solution\": \"// Back-end complete function Template for Java\\nclass Solution {\\n static int isFactorial(int N) {\\n int x = 1;\\n int i = 1;\\n // loop until x becomes greater than N\\n while (x <= N) {\\n // if x is equal to N then return 1\\n if (x == N) return 1;\\n // calculate factorial of i\\n x = x * i;\\n // increase i by one\\n i++;\\n }\\n // if x crosses N then N is not a factorial number\\n return 0;\\n }\\n}\\n\",\n \"updated_at_timestamp\": 1729753320,\n \"user_code\": \"//User function Template for Java\\n\\nclass Solution{\\n static int isFactorial(int N) {\\n //code here\\n }\\n}\"\n}"},"python":{"kind":"string","value":"{\n \"class_name\": \"Solution\",\n \"created_at_timestamp\": 1615292571,\n \"func_sign\": [\n \"isFactorial(self, N)\"\n ],\n \"initial_code\": \"# Initial Template for Python 3\\n\\nif __name__ == '__main__':\\n t = int(input())\\n for _ in range(t):\\n N = int(input())\\n\\n ob = Solution()\\n print(ob.isFactorial(N))\\n print(\\\"~\\\")\\n\",\n \"solution\": \"class Solution:\\n def isFactorial(self, N):\\n x = 1\\n i = 1\\n # loop until x becomes greater than N\\n while(x <= N):\\n # if x is equal to N then return 1\\n if(x == N):\\n return 1\\n # calculate factorial of i\\n x = x * i\\n # increase i by one\\n i += 1\\n # if x crosses N then N is not a factorial number\\n return 0\\n\",\n \"updated_at_timestamp\": 1729753320,\n \"user_code\": \"#User function Template for python3\\n\\nclass Solution:\\n def isFactorial (self, N):\\n # code here\"\n}"},"test_cases":{"kind":"string","value":"eJxrYJnazcIABhEtQEZ0tVJmXkFpiZKVgpJhTJ6hko6CUmpFQWpySWpKfH5pCUKqLiZPqVZHAVW9kQmJGgyNDEjUYY5DvQEO9cZmRhYWBqTaAtGFy/s47bK0NDQjwzKINlJtMyLRGhNzSwMDQzOSnWdkQnaww3WT7De4EeYIM8hxh7mlMSyEDUgPYjTd5PoGhAxJzUsQuw1BGN0BYHES3WBiDs5t+JMAvuiAhgVF4WBoaGRIyO7YKXoAZ2dmbw=="}}},{"rowIdx":776,"cells":{"question_id":{"kind":"number","value":702672,"string":"702,672"},"question_title":{"kind":"string","value":"Number of matches"},"question_content":{"kind":"string","value":"In a knockout tournament, there are n players, each with a unique rating represented by an array arr[]. In each round: - The 1st player plays against the 2nd player, the 3rd player plays against the 4th, and so on. - The player with the higher rating wins the match and moves to the next round. - If there is an odd number of players, the last player automatically moves to the next round.\nExamples:\nInput:\narr[] = {7, 1, 5, 3, 9}\n\nOutput:\n3 1 2 1 1\n\nExplanation:\n\nplayers: 7 1 5 3 9, The first round: (7 has a match with 1), (5 has a match with 3), (9 has no matches automatically qualifies)\nplayers: 7 5 9 The second round: (7 has a match with 5), (9 has no matches automatically qualifies)\nplayers: 7 9 The third round: (7 has a match with 9).\nThe player with rating 7 played 3 matches. The player with rating 1 played 1 match. The player with rating 5 played 2 matches. The player with rating 3 played 1 match. The player with rating 9 played 1 match.\nInput:\n arr[] = {8, 4, 3, 5, 2, 6}\n\nOutput:\n3 1 1 2 1 2\n\nConstraints:\n1 ≤ arr.size\n\n≤ 10**5 \n0 ≤ arr[i]\n\n≤ 10**6 \n, The rating of the players, arr[i] will be \ndistinct\n."},"dataset":{"kind":"string","value":"geeksforgeeks"},"difficulty":{"kind":"string","value":"Easy"},"java":{"kind":"string","value":"{\n \"class_name\": \"Solution\",\n \"created_at_timestamp\": 1617361068,\n \"func_sign\": [\n \"public static int[] getAnswer(int arr[])\"\n ],\n \"initial_code\": \"// Initial Template for Java\\n\\n/*package whatever //do not write package name here */\\n\\nimport java.io.*;\\nimport java.lang.*;\\nimport java.util.*;\\n\\nclass GFG {\\n public static void main(String[] args) throws IOException {\\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\\n int t = Integer.parseInt(br.readLine().trim()); // Inputting the testcases\\n while (t-- > 0) {\\n\\n String inputLine[] = br.readLine().trim().split(\\\" \\\");\\n int n = inputLine.length;\\n int arr[] = new int[n];\\n\\n for (int i = 0; i < n; i++) {\\n arr[i] = Integer.parseInt(inputLine[i]);\\n }\\n\\n Solution obj = new Solution();\\n int answer[] = obj.getAnswer(arr);\\n StringBuilder output = new StringBuilder();\\n for (int i = 0; i < n; i++) output.append(answer[i] + \\\" \\\");\\n System.out.println(output);\\n System.out.println(\\\"~\\\");\\n }\\n }\\n}\\n\",\n \"script_name\": \"GFG\",\n \"solution\": \"None\",\n \"updated_at_timestamp\": 1729753320,\n \"user_code\": \"// User function Template for Java\\n\\nclass Solution {\\n\\n public static int[] getAnswer(int arr[]) {\\n // Your task is to store the answer of each index in one 'answer' array and\\n // return it Note: indexing is 0 based\\n }\\n}\\n\"\n}"},"python":{"kind":"string","value":"{\n \"class_name\": \"Solution\",\n \"created_at_timestamp\": 1617361068,\n \"func_sign\": [\n \"getAnswer(self, arr, answer)\"\n ],\n \"initial_code\": \"# Initial Template for Python 3\\ndef main():\\n T = int(input())\\n\\n while T > 0:\\n arr = [int(x) for x in input().strip().split()]\\n n = len(arr)\\n\\n ob = Solution()\\n answer = ob.getAnswer(arr)\\n print(*answer)\\n print(\\\"~\\\")\\n\\n T -= 1\\n\\n\\nif __name__ == \\\"__main__\\\":\\n main()\\n\",\n \"solution\": \"class Solution:\\n\\n def getAnswer(self, arr):\\n n = len(arr)\\n answer = [0 for i in range(n)]\\n a = [[0 for i in range(2)] for j in range(n + 5)]\\n\\n for i in range(1, n + 1):\\n a[i][0] = arr[i - 1]\\n a[i][1] = i\\n\\n count = n\\n\\n while count > 1:\\n p = 1\\n for i in range(1, count, 2):\\n answer[a[i][1] - 1] += 1\\n answer[a[i + 1][1] - 1] += 1\\n\\n if a[i][0] > a[i + 1][0]:\\n a[p][0] = a[i][0]\\n a[p][1] = a[i][1]\\n p += 1\\n elif a[i + 1][0] > a[i][0]:\\n a[p][0] = a[i + 1][0]\\n a[p][1] = a[i + 1][1]\\n p += 1\\n\\n if count % 2 == 1:\\n a[(count // 2) + 1][0] = a[count][0]\\n a[(count // 2) + 1][1] = a[count][1]\\n count = (count // 2) + 1\\n elif count % 2 == 0:\\n count = count // 2\\n return answer\\n\",\n \"updated_at_timestamp\": 1729753320,\n \"user_code\": \"#User function Template for python3\\n\\nclass Solution:\\n def getAnswer(self, arr, answer):\\n # Your task is to store the answer of each index in one 'answer' array and return it\\n # Note: indexing is 0 based\"\n}"},"test_cases":{"kind":"string","value":"eJy1VUFOhEAQ9GDiC7x5qHDemB6GgcaXmIjxoBy84B7YxMRofIT+155pSXCzPQsa51IQpoueqmp4P/28ODtJ6/pcLm5eisdhuxuLKxSuG1yxQdE/b/v7sX+4e9qN34+oG966oXjdYG8/pQUy6hycWYmS4AkVIRBqQkNgQksQUpOuhIOHYhXxSGNtWgqs0CjUCkGhUvAKpYKlRoWfjZTmKVswGtQI0qxPe62jLecMFEWL2kUJc3JNXKYH8tRLZ0E6bKTTVrjgZL8USa20FOBquAaO4Vp523JfZvdhuv9XrxSUhZWFlYWVhZWFlYWVhZWFlYUtxwPyR/RZxw6pvFDJTAxWj2osqsiOtVUpIY71YtM8y4eTmEl4JociUeJKZIhsyAbbPKNBtFqq2bdp5UfJDrnK78J6A9bMafJBZ+ePA+vX+CU6h185tif1NKjLBPe5P4AVKnesx9uPyy/mEdGP"}}},{"rowIdx":777,"cells":{"question_id":{"kind":"number","value":701192,"string":"701,192"},"question_title":{"kind":"string","value":"Smallest Positive Missing Number"},"question_content":{"kind":"string","value":"You are given an integer arrayarr[]. Your task is to find the smallest positive numbermissing from the array.\nExamples:\nInput:\narr[] = [1, 2, 3, 4, 5]\n\nOutput:\n6\n\nExplanation: \nSmallest positive missing number is 6.\nInput:\narr[] = [0, -10, 1, 3, -20]\n\nOutput:\n2\n\nExplanation: \nSmallest positive missing number is 2.\n\nConstraints:\n \n1 <= arr.size() <= 10**6\n-10**6\n<= arr[i] <= 10**6"},"dataset":{"kind":"string","value":"geeksforgeeks"},"difficulty":{"kind":"string","value":"Medium"},"java":{"kind":"string","value":"{\n \"class_name\": \"Solution\",\n \"created_at_timestamp\": 1731130209,\n \"func_sign\": [\n \"public int missingNumber(int[] arr)\"\n ],\n \"initial_code\": \"import java.io.*;\\nimport java.util.*;\\n\\npublic class Main {\\n public static void main(String[] args) throws IOException {\\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\\n\\n // Reading number of test cases (t)\\n int t = Integer.parseInt(br.readLine().trim());\\n while (t-- > 0) {\\n // Read the line of integers (prices)\\n String input = br.readLine().trim();\\n\\n // Split the input line into integers and store in an array\\n String[] tokens = input.split(\\\" \\\");\\n int[] arr = new int[tokens.length];\\n for (int i = 0; i < tokens.length; i++) {\\n arr[i] = Integer.parseInt(tokens[i]);\\n }\\n\\n // Create an instance of the Solution class\\n Solution ob = new Solution();\\n\\n // Call the missingNumber method\\n int res = ob.missingNumber(arr);\\n\\n // Print the result\\n System.out.println(res);\\n\\n // Print the \\\"~\\\" symbol to match the original output\\n // System.out.println(\\\"~\\\");\\n }\\n }\\n}\\n\",\n \"script_name\": \"Main\",\n \"solution\": \"None\",\n \"updated_at_timestamp\": 1731130209,\n \"user_code\": \"\\nclass Solution {\\n // Function to find the smallest positive number missing from the array.\\n public int missingNumber(int[] arr) {\\n // Your code here\\n }\\n}\\n\"\n}"},"python":{"kind":"string","value":"{\n \"class_name\": \"Solution\",\n \"created_at_timestamp\": 1731130209,\n \"func_sign\": [\n \"missingNumber(self,arr)\"\n ],\n \"initial_code\": \"# Initial Template for Python 3\\n\\nimport math\\n\\n\\ndef main():\\n T = int(input())\\n while T > 0:\\n arr = [int(x) for x in input().strip().split()]\\n ob = Solution()\\n print(ob.missingNumber(arr))\\n T -= 1\\n\\n\\nif __name__ == \\\"__main__\\\":\\n main()\\n\",\n \"solution\": \"class Solution:\\n\\n # Function to find the smallest positive number missing from the array.\\n def missingNumber(self, arr):\\n n = len(arr) # defining n as the length of the array\\n\\n # first separating positive and negative numbers.\\n shift = self.segregate(arr)\\n\\n # shifting the array to access only positive part.\\n # calling function to find result and returning it.\\n return self.findMissingPositive(arr[shift:])\\n\\n # Function that puts all non-positive (0 and negative) numbers on left\\n # side of arr[] and return count of such numbers.\\n def segregate(self, arr):\\n n = len(arr) # defining n as the length of the array\\n j = 0\\n for i in range(n):\\n if arr[i] <= 0:\\n # changing the position of negative numbers and 0.\\n arr[i], arr[j] = arr[j], arr[i]\\n # incrementing count of non-positive integers\\n j += 1\\n\\n return j\\n\\n # Finding the smallest positive missing number in an array\\n # that contains only positive integers.\\n def findMissingPositive(self, arr):\\n n = len(arr) # defining n as the length of the array\\n\\n # marking arr[i] as visited by making arr[arr[i] - 1] negative.\\n # note that 1 is subtracted because indexing starts from 0 and\\n # positive numbers start from 1.\\n for i in range(n):\\n if abs(arr[i]) - 1 < n and arr[abs(arr[i]) - 1] > 0:\\n arr[abs(arr[i]) - 1] = -arr[abs(arr[i]) - 1]\\n\\n for i in range(n):\\n if arr[i] > 0:\\n # returning the first index where value is positive.\\n # 1 is added because indexing starts from 0.\\n return i + 1\\n\\n return n + 1\\n\",\n \"updated_at_timestamp\": 1731130209,\n \"user_code\": \"#User function Template for python3\\n\\nclass Solution:\\n \\n #Function to find the smallest positive number missing from the array.\\n def missingNumber(self,arr):\\n #Your code here\"\n}"},"test_cases":{"kind":"string","value":"eJytkz1OA0EMhSngHk9Tx8ie/6Gk4wZIgChgC5okxUZCQkgcAu7LZHcDSjKDMivGxW5hf7afnj/Ov24uzoZ3e51/7t7Uy3K96dUVlNwvhaEZhmEZjuEZgREZiSHMagHVva67p757flxt+t869b7APokEpEEGZEEO5EEBFEEJJE0kgc5hYHO4HB6+Uh5K5Q4BESnPDxGIhhiIhbiWGXLtMMO2+w5XqbfFHXh4SMMbP3Fi2pFawcWyuBPvMKRC0WVhf5qXFYJ4SIDkSVP2RQtbN7Kha6OX3eXG/cnudNjTErECSyer2eb1idBka8b/3VpL9vFBzLmIGRtXXJtabEumknpCO0ozGm5X/Sv54fPyGzvDaCk="}}},{"rowIdx":778,"cells":{"question_id":{"kind":"number","value":702995,"string":"702,995"},"question_title":{"kind":"string","value":"Stuffs Division"},"question_content":{"kind":"string","value":"You are given an array arr[] where each element represents the amount of goodies currently held by students. Each student at index ishould receive exactly iamount of goodies (1-based indexing) for a fair distribution, with no wastage allowed. Your task is to determine whether it is possible to redistribute the goodies such that the student at index i gets exactly i amount of goodies. Return true if it is possible otherwise return false.\nExamples:\nInput:\narr[] = [7, 4, 1, 1, 2]\n\nOutput:\ntrue\n\nExplanation: \nSince, all the goods can be redistributed as 1 2 3 4 5 (i\n**th\n students get i number of goodies).So, output is true.\nInput:\narr[] = [1, 1, 1, 1, 1]\n\nOutput:\nfalse\n\nConstraints:\n1 <= arr.size() <= 10**6\n1 <= arr[i] <= 10**6"},"dataset":{"kind":"string","value":"geeksforgeeks"},"difficulty":{"kind":"string","value":"Easy"},"java":{"kind":"string","value":"{\n \"class_name\": \"Solution\",\n \"created_at_timestamp\": 1615292571,\n \"func_sign\": [\n \"public boolean possible(int[] arr)\"\n ],\n \"initial_code\": \"// Initial Template for Java\\nimport java.io.*;\\nimport java.lang.*;\\nimport java.util.*;\\n\\n//Position this line where user code will be pasted.\\n\\nclass GFG {\\n public static void main(String[] args) throws IOException {\\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\\n int t = Integer.parseInt(br.readLine());\\n while (t-- > 0) {\\n // int k = Integer.parseInt(br.readLine());\\n String line = br.readLine();\\n String[] tokens = line.split(\\\" \\\");\\n\\n // Create an ArrayList to store the integers\\n ArrayList<Integer> array = new ArrayList<>();\\n\\n // Parse the tokens into integers and add to the array\\n for (String token : tokens) {\\n array.add(Integer.parseInt(token));\\n }\\n\\n int[] arr = new int[array.size()];\\n int idx = 0;\\n for (int i : array) arr[idx++] = i;\\n Solution obj = new Solution();\\n System.out.println(obj.possible(arr) ? \\\"true\\\" : \\\"false\\\");\\n System.out.println(\\\"~\\\");\\n }\\n }\\n}\",\n \"script_name\": \"GFG\",\n \"solution\": \"None\",\n \"updated_at_timestamp\": 1729753320,\n \"user_code\": \"// User function Template for Java\\n\\nclass Solution {\\n\\n public boolean possible(int[] arr) {\\n // write code here\\n }\\n}\"\n}"},"python":{"kind":"string","value":"{\n \"class_name\": \"Solution\",\n \"created_at_timestamp\": 1615292571,\n \"func_sign\": [\n \"possible(self, arr)\"\n ],\n \"initial_code\": \"# Initial Template for Python 3\\n\\nif __name__ == \\\"__main__\\\":\\n t = int(input())\\n while t > 0:\\n arr = list(map(int, input().split()))\\n ob = Solution()\\n if ob.possible(arr):\\n print(\\\"true\\\")\\n else:\\n print(\\\"false\\\")\\n t -= 1\\n print(\\\"~\\\")\\n\",\n \"solution\": \"class Solution:\\n\\n def possible(self, arr):\\n n = len(arr)\\n sum = 0\\n sum1 = 0\\n\\n for i in range(n):\\n sum += arr[i]\\n\\n # Calculate the sum of first n natural numbers\\n sum1 = n * (n + 1) // 2\\n\\n return sum == sum1\\n\",\n \"updated_at_timestamp\": 1729753320,\n \"user_code\": \"#User function Template for python3\\n\\nclass Solution:\\n def possible(self, arr):\\n #code here.\\n \\n \\n\\n\"\n}"},"test_cases":{"kind":"string","value":"eJztVMFKxDAU9ODBmzfPQ87L0iR9aeuXCFZEtIIgdXFbEETxI/R/ne3roSzboukueDAPOqVJXt+bmeTj+Ovs5KgbF6d8uXw1D/Wqbcw5jC1rm3QD//gn0CxgqpdVddtUd9dPbdMLdX/zuK7K+r2szdsCWwrCwSOFICBDjoK5RtI0z+1YlqIbsNsRUZBDHxF7RdmQaDJ6Ovt2umeukCkEBVFIFbyCU4hpWrAjotT01NHSEAJHaXP4gJS5KC/1ZS8UJRFYxyWcsuJhM34rEq6Po4yWyWmdwJJT/t6Nqj7hH6+8u6Gb99u+hM38gTj4fcM/EWp2XRszSncuJ45o1CGdTXSIZHp4W01eVrN52TsxO3XVq2pWF4eQd8LUw31Xn8tvbL0VYw=="}}},{"rowIdx":779,"cells":{"question_id":{"kind":"number","value":702811,"string":"702,811"},"question_title":{"kind":"string","value":"Mr Modulo and Pairs"},"question_content":{"kind":"string","value":"Mr. Modulo comes up with another problem related to modulo and this time he has an array of integers arr[] and an integer k, he is interested in finding all the possible pairs arr[i] and arr[j] in the array arr[] such that arr[i] % arr[j] = k. The array given will have distinct elements.You are required to return the number of such pairs.\nExamples:\nInput:\narr[] = [2, 3, 5, 4, 7], k = 3\n\nOutput:\n4\n\nExplanation:\nThe pairs which give remainder 3 : {7, 4}, {3, 4}, {3, 5}, {3, 7}.\nInput:\narr[] = [1, 2], k = 3\n\nOutput:\n0\n\nExplanation:\nNo pairs give remainder 3.\n\nConstraints:\n1 ≤ arr.size() ≤ 10**5\n1 ≤ arr[i] ≤ 10**6"},"dataset":{"kind":"string","value":"geeksforgeeks"},"difficulty":{"kind":"string","value":"Medium"},"java":{"kind":"string","value":"{\n \"class_name\": \"Solution\",\n \"created_at_timestamp\": 1615292571,\n \"func_sign\": [\n \"public int printPairs(List<Integer> arr, int k)\"\n ],\n \"initial_code\": \"// Initial Template for Java\\n\\n// Initial Template for Java\\n\\nimport java.io.*;\\nimport java.util.*;\\n\\n//Position this line where user code will be pasted.\\n\\npublic class Main {\\n\\n public static void main(String[] args) {\\n Scanner scanner = new Scanner(System.in);\\n int t = scanner.nextInt();\\n scanner.nextLine(); // Consume the newline character\\n\\n for (int i = 0; i < t; i++) {\\n List<Integer> arr = new ArrayList<>();\\n String input = scanner.nextLine();\\n String[] inputArray = input.split(\\\" \\\");\\n\\n for (String str : inputArray) {\\n arr.add(Integer.parseInt(str));\\n }\\n\\n int k = scanner.nextInt();\\n scanner.nextLine(); // Consume the newline character\\n Solution solution = new Solution();\\n System.out.println(solution.printPairs(arr, k));\\n System.out.println(\\\"~\\\");\\n }\\n\\n scanner.close();\\n }\\n}\",\n \"script_name\": \"Main\",\n \"solution\": \"class Solution {\\n // Function to find all the divisors of a number\\n public List<Integer> findDivisors(int n) {\\n List<Integer> divisors = new ArrayList<>();\\n // iterating from 1 to sqrt(n) to find divisors\\n for (int i = 1; i <= Math.sqrt(n); i++) {\\n if (n % i == 0) {\\n // if n/i is equal to i, add only i\\n if (n / i == i) {\\n divisors.add(i);\\n } else {\\n divisors.add(i);\\n divisors.add(n / i);\\n }\\n }\\n }\\n return divisors;\\n }\\n\\n // Function to find the number of pairs with a given difference\\n public int printPairs(List<Integer> arr, int k) {\\n int ans = 0;\\n HashMap<Integer, Boolean> occ = new HashMap<>();\\n // creating a hashmap to store occurrence of array elements\\n for (int num : arr) {\\n occ.put(num, true);\\n }\\n boolean isPairFound = false;\\n // iterating through the array elements\\n for (int num : arr) {\\n // if k is in the array and k is smaller than num\\n if (occ.containsKey(k) && k < num) {\\n ans++;\\n isPairFound = true;\\n }\\n // if num is greater than or equal to k\\n if (num >= k) {\\n List<Integer> divisors = findDivisors(num - k);\\n for (int divisor : divisors) {\\n // if num modulo divisor is equal to k, num is not equal to divisor\\n // and divisor exists in the hashmap\\n if (num % divisor == k && num != divisor && occ.containsKey(divisor)) {\\n ans++;\\n isPairFound = true;\\n }\\n }\\n }\\n }\\n return ans;\\n }\\n}\\n\",\n \"updated_at_timestamp\": 1730468721,\n \"user_code\": \"\\nclass Solution {\\n\\n public int printPairs(List<Integer> arr, int k) {\\n // Your code goes here.\\n }\\n}\\n\"\n}"},"python":{"kind":"string","value":"{\n \"class_name\": \"Solution\",\n \"created_at_timestamp\": 1615292571,\n \"func_sign\": [\n \"printPairs(self, arr, k)\"\n ],\n \"initial_code\": \"def main():\\n t = int(input())\\n for _ in range(t):\\n arr = list(map(int, input().strip().split()))\\n k = int(input())\\n ob = Solution()\\n print(ob.printPairs(arr, k))\\n print(\\\"~\\\")\\n\\n\\nif __name__ == \\\"__main__\\\":\\n main()\\n\",\n \"solution\": \"class Solution:\\n\\n def findDivisors(self, n):\\n # Function to find all the divisors of a number\\n divisors = []\\n # iterating from 1 to sqrt(n) to find divisors\\n for i in range(1, int(n**0.5) + 1):\\n if n % i == 0:\\n # if n/i is equal to i, add only i\\n if n // i == i:\\n divisors.append(i)\\n else:\\n divisors.append(i)\\n divisors.append(n // i)\\n return divisors\\n\\n def printPairs(self, arr, k):\\n n = len(arr)\\n ans = 0\\n occ = {}\\n\\n # creating a hashmap to store occurrence of array elements\\n for num in arr:\\n occ[num] = True\\n\\n isPairFound = False\\n\\n # iterating through the array elements\\n for num in arr:\\n # if k is in the array and k is smaller than num\\n if k in occ and k < num:\\n ans += 1\\n isPairFound = True\\n\\n # if num is greater than or equal to k\\n if num >= k:\\n divisors = self.findDivisors(num - k)\\n for divisor in divisors:\\n # if num modulo divisor is equal to k, num is not equal to divisor\\n # and divisor exists in the hashmap\\n if num % divisor == k and num != divisor and divisor in occ:\\n ans += 1\\n isPairFound = True\\n\\n return ans\\n\",\n \"updated_at_timestamp\": 1730468721,\n \"user_code\": \"class Solution:\\n def printPairs(self, arr, k):\\n #Your code goes here.\\n\"\n}"},"test_cases":{"kind":"string","value":"eJy9lLFOwzAQhhkYeIxfmSsU27GdsLDxDEgEMUAGltAhlSohEA8B74vz34WpVknT9ob/2sT13/vO56/Ln7urC8b9bfrw8F689uvNUNygMG1vSgYkG80WDUNSDZsWFisU3XbdPQ/dy9PbZtA9Qtt/tn3xscLujb2kyAwryTAjSEqrZVXGwuUsrKt8ADWCWoPagJocRjWgWlAdqBVtx/e5ysqMLZE4oolCKBomL9+8vHPy0DYjvTjTY6KnbagZiAwEBjwDFQOOAcsYazOMjK+xueLqGHwFqgPVgmpALUFtQE1HY9QIahh9+Zu5THfVG6XeIPV6qbeSep3Ua6Veg7/TMNeXMVFThkpU+SptZa+d0P+ZdpDFM4eDlAWyMBbEQlgAC1/BC2Wc3NLTQ9nquOgs6LjoLOi46CjpnOjwTGz9+Xt6ln6aIzT08KvILbqLlPFpr9l/nJ+jHRYxKU/kojfX8qsjx3BRh07bov0jXu4H+vh9/Qtq6xpF"}}},{"rowIdx":780,"cells":{"question_id":{"kind":"number","value":704213,"string":"704,213"},"question_title":{"kind":"string","value":"Perfect Sum Problem"},"question_content":{"kind":"string","value":"Given an array arr of size nof non-negative integers and an integer sum, the task is to countall subsets of the given array with a sum equal to a given sum.\nExamples:\nInput:\nn = 6, arr = [5, 2, 3, 10, 6, 8], sum = 10\n\nOutput:\n3\n\nExplanation:\n\n{5, 2, 3}, {2, 8}, {10} are possible subsets.\nInput:\nn = 5, arr = [2, 5, 1, 4, 3], sum = 10\n\nOutput:\n3\n\nExplanation:\n\n{2, 1, 4, 3}, {5, 1, 4}, {2, 5, 3} are possible subsets.\n\nExamples:"},"dataset":{"kind":"string","value":"geeksforgeeks"},"difficulty":{"kind":"string","value":"Medium"},"java":{"kind":"string","value":"{\n \"class_name\": \"Solution\",\n \"created_at_timestamp\": 1619006521,\n \"func_sign\": [\n \"public int perfectSum(int arr[],int n, int sum)\"\n ],\n \"initial_code\": \"//Initial Template for Java\\n\\nimport java.io.*;\\nimport java.util.*;\\nclass GfG\\n{\\n public static void main(String args[])\\n {\\n Scanner sc = new Scanner(System.in);\\n int t = sc.nextInt();\\n while(t-->0)\\n {\\n int n = sc.nextInt();\\n int sum = sc.nextInt();\\n int arr[] = new int[n];\\n for(int i = 0;i<n;i++)\\n arr[i] = sc.nextInt();\\n \\n Solution ob = new Solution();\\n System.out.println(ob.perfectSum(arr,n,sum));\\n }\\n }\\n} \",\n \"script_name\": \"GfG\",\n \"solution\": \"None\",\n \"updated_at_timestamp\": 1730474443,\n \"user_code\": \"class Solution{\\n\\n\\tpublic int perfectSum(int arr[],int n, int sum) \\n\\t{ \\n\\t // Your code goes here\\n\\t} \\n}\"\n}"},"python":{"kind":"string","value":"{\n \"class_name\": \"Solution\",\n \"created_at_timestamp\": 1619006521,\n \"func_sign\": [\n \"perfectSum(self, arr, n, sum)\"\n ],\n \"initial_code\": \"# Initial Template for Python 3\\n\\nif __name__ == '__main__':\\n T = int(input())\\n for i in range(T):\\n n, sum = input().split()\\n n, sum = int(n), int(sum)\\n arr = [int(x) for x in input().split()]\\n ob = Solution()\\n ans = ob.perfectSum(arr, n, sum)\\n print(ans)\\n\",\n \"solution\": \"class Solution:\\n def __init__(self):\\n self.mod = int(1e9 + 7) # Initialize mod value for calculations\\n self.dp = [] # 2D list to store dynamic programming values\\n self.N = 0 # Size of the array\\n\\n def fun(self, pos, sum, arr):\\n if pos >= self.N:\\n # Check if sum is zero when array position reaches the end\\n return int(sum == 0)\\n\\n ans = self.dp[pos][sum]\\n if ans != -1:\\n return ans # Return the already calculated value from dp list\\n\\n ans = 0 # Initialize answer with zero\\n\\n # Recursively call function for the next position with sum unchanged\\n ans += self.fun(pos + 1, sum, arr)\\n ans %= self.mod # Take modulo of the answer to avoid overflow\\n if arr[pos] <= sum:\\n ans += self.fun(pos + 1, sum - arr[pos], arr)\\n ans %= self.mod # Recursively call function for the next position with reduced sum\\n\\n self.dp[pos][sum] = ans # Store the calculated answer in dp list\\n return ans # Return the calculated answer\\n\\n def perfectSum(self, arr, n, sum):\\n self.dp = [[-1] * (sum + 1)\\n for _ in range(n + 1)] # Initialize dp list with -1\\n self.N = n # Assign n to N variable\\n # Call recursive function with initial parameters\\n return self.fun(0, sum, arr)\\n\",\n \"updated_at_timestamp\": 1730474443,\n \"user_code\": \"#User function Template for python3\\nclass Solution:\\n\\tdef perfectSum(self, arr, n, sum):\\n\\t\\t# code here\"\n}"},"test_cases":{"kind":"string","value":"eJytVEFOwzAQ5FBx4ROrnCu069ixw0uQCOIAOXAJPaRSJVSJR8B/mTWpVBo7cqsmTpTYszPjiZ2v1c/d7U08Hld4ePqs3ofNdqweqDLdIEyGu8HR7MSYI2EMehJLNUkAlFoy6PZk8AZYS4IR7emGak1Vv9v0r2P/9vKxHQ8qAg5rLAD7NR3JSzeA0PHkgmomq+/UMHmmADFWBySQqslCriFPQUU5KyfWp5Tg0bvjiQpPzcSmc4jNaMuz+7ZN0SONAJH/RrMsTTKLGHdBGmpbHQMhVp3jAkiAEsCk1XpcyqOTA84AZ1w+tJZDCMnYCEX5OpOu0Vs+wlRNrToxvnPrDh81W1cnPZYsvCtQ1uWk8ywXoz/BXr6X+ezNbGS+mdFdbpYLYfBdhjxZCTGM4m83WV9ctJf9utwV/l1/zvJqCXZZWmbV/vn7/hfh5Zx6"}}},{"rowIdx":781,"cells":{"question_id":{"kind":"number","value":713589,"string":"713,589"},"question_title":{"kind":"string","value":"Balloon Everywhere"},"question_content":{"kind":"string","value":"Bob is very fond of balloons. Once he visited an amusement park with his mother. The mother told Bob that she would buy him a balloon only if he answer her problem right. She gave Bob a stringS [contains only lowercase characters]and asked him to use the characters of string to formas many instances of the word \"balloon\" as possible. Return the maximum number of instances that can be formed.\nExamples:\nInput:\nS: nlaebolko\n\nOutput:\n1\n\nExplanation:\n\nHere, the number of occurence of 'b' = 1\nof occurence of 'a' = 1\nof occurence of 'l' = 2\nof occurence of 'o' = 2\nof occurence of 'n' = 1\nSo, we can form 1 \"balloon\" using the letters.\nInput:\nS: loonbalxballpoon\n\nOutput:\n2\n\nExplanation:\n\nHere, the number of occurence of 'b' = 2\nof occurence of 'a' = 2\nof occurence of 'l' = 4\nof occurence of 'o' = 4\nof occurence of 'n' = 2\nSo, we can form 2 \"balloon\" using the letters.\n\nConstraints:\n1 <= s.length <= 10**6"},"dataset":{"kind":"string","value":"geeksforgeeks"},"difficulty":{"kind":"string","value":"Easy"},"java":{"kind":"string","value":"{\n \"class_name\": \"Solution\",\n \"created_at_timestamp\": 1673953354,\n \"func_sign\": [\n \"public int maxInstance(String s)\"\n ],\n \"initial_code\": \"// Initial Template for Java\\n\\nimport java.util.*;\\nimport java.lang.*;\\nimport java.io.*;\\n\\n// Position this line where user code will be pasted.\\n\\nclass GFG {\\n public static void main(String[] args) throws IOException {\\n BufferedReader br =\\n new BufferedReader(new InputStreamReader(System.in));\\n PrintWriter out=new PrintWriter(System.out);\\n int T = Integer.parseInt(br.readLine().trim());\\n while (T-- > 0) {\\n String s = br.readLine().trim();\\n Solution ob = new Solution();\\n int ans = ob.maxInstance(s);\\n out.println(ans);\\n \\nout.println(\\\"~\\\");\\n}\\n out.close();\\n }\\n}\",\n \"script_name\": \"GFG\",\n \"solution\": \"// Back-end complete function Template for Java\\n\\nclass Solution {\\n public int maxInstance(String s) {\\n // initialize an array to store the frequency of each character\\n int[] freq = new int[26];\\n \\n // count the frequency of each character in the string\\n for (char c : s.toCharArray()) freq[c - 'a']++;\\n \\n // return the minimum value among the frequencies of 'o', 'l', 'b', 'a', and 'n'\\n return Math.min(Math.min(freq['o' - 'a'] / 2, freq['l' - 'a'] / 2),\\n Math.min(Math.min(freq['b' - 'a'], freq['a' - 'a']),\\n freq['n' - 'a']));\\n }\\n}\",\n \"updated_at_timestamp\": 1730481934,\n \"user_code\": \"// User function Template for Java\\n\\nclass Solution {\\n public int maxInstance(String s) {\\n // Code here\\n }\\n}\"\n}"},"python":{"kind":"string","value":"{\n \"class_name\": \"Solution\",\n \"created_at_timestamp\": 1673953354,\n \"func_sign\": [\n \"maxInstance(self, s : str) -> int\"\n ],\n \"initial_code\": \"if __name__ == \\\"__main__\\\":\\n t = int(input())\\n for _ in range(t):\\n s = input()\\n obj = Solution()\\n res = obj.maxInstance(s)\\n print(res)\\n print(\\\"~\\\")\\n\",\n \"solution\": \"class Solution:\\n def maxInstance(self, s: str) -> bool:\\n # initializing a dictionary to count the occurrences of each character\\n diction = {\\\"b\\\": 0, \\\"a\\\": 0, \\\"l\\\": 0, \\\"o\\\": 0, \\\"n\\\": 0}\\n\\n # iterating through the string and incrementing the count of each character\\n for i in s:\\n if i in diction:\\n diction[i] += 1\\n\\n # dividing the counts of \\\"l\\\" and \\\"o\\\" by 2 since they appear twice in \\\"ballon\\\"\\n diction[\\\"l\\\"] //= 2\\n diction[\\\"o\\\"] //= 2\\n\\n # returning the minimum count among all characters\\n return min(diction.values())\\n\",\n \"updated_at_timestamp\": 1730481934,\n \"user_code\": \"class Solution:\\n def maxInstance(self, s : str) -> int:\\n # code here\"\n}"},"test_cases":{"kind":"string","value":"eJyllElOwzAUhlm094i8rirSdsVJkDCq7MQd6MMv0ARSEIhD0NN015PVQ9uERE5kk0XyMrzh+/07P4P9cXhjjvuDCh4+yVpmRU7uIhJTyTljAIhSUklGERFlJpJcpHMs8uqrb/XyaxQ1UhmU5gTO1FtHqkQEANWasZC2ng0nGtM0A42Kmlbhamo9vi6Yqbh53zPZzD1fR65LEUA1oWTYweYSpPRuxniSisVytX7awLPE7OV1mxdv7+Xuw7sUt+75e3FWmfZbicYWyVvAUC9yuwvi6za4VPqPx4yfWoailT26FXJCWqG8xfG3SEsVSoN00UPb5Q3ehf64reEbzxr/vdqqXyjrWnsDn5fYRFfqfk7oafP4Oz4BuNQHqQ=="}}},{"rowIdx":782,"cells":{"question_id":{"kind":"number","value":700353,"string":"700,353"},"question_title":{"kind":"string","value":"Interleaved Strings"},"question_content":{"kind":"string","value":"Given strings A, B, and C, find whether C is formed by an interleaving of Aand B.\nExamples:\nInput:\nA = YX, B = X, C =XXY\n\nOutput:\n0\n\nExplanation: \nXXY is not interleaving of YX and X.\nInput:\nA = XY, B = X, C = XXY\n\nOutput:\n1\n\nExplanation: \nXXY is interleaving of XY and X.\n\nConstraints:\n1 ≤ length of A, B ≤ 300\n1 ≤ length of C ≤ 600"},"dataset":{"kind":"string","value":"geeksforgeeks"},"difficulty":{"kind":"string","value":"Medium"},"java":{"kind":"string","value":"{\n \"class_name\": \"Solution\",\n \"created_at_timestamp\": 1617123739,\n \"func_sign\": [\n \"public boolean isInterLeave(String a,String b,String c)\"\n ],\n \"initial_code\": \"//initial code\\nimport java.util.*;\\nimport java.lang.*;\\nclass InterLeaveString\\n{\\n public static void main(String[] args)\\n {\\n Scanner sc=new Scanner(System.in);\\n int t=sc.nextInt();\\n while(t>0)\\n {\\n String a =sc.next();\\n String b = sc.next();\\n String c = sc.next();\\n Solution g=new Solution();\\n \\n System.out.println(g.isInterLeave(a,b,c)==true?1:0);\\n t--;\\n \\nSystem.out.println(\\\"~\\\");\\n}\\n }\\n}\\n\\n\",\n \"script_name\": \"InterLeaveString\",\n \"solution\": \"None\",\n \"updated_at_timestamp\": 1729753320,\n \"user_code\": \"/*you are required to complete this method */\\nclass Solution {\\n\\tpublic boolean isInterLeave(String a,String b,String c)\\n\\t{\\n //Your code here\\n\\t}\\n}\\n\\n\"\n}"},"python":{"kind":"string","value":"{\n \"class_name\": \"Solution\",\n \"created_at_timestamp\": 1641055290,\n \"func_sign\": [\n \"isInterleave(self, A, B, C)\"\n ],\n \"initial_code\": \"# Initial Template for Python 3\\n\\nif __name__ == '__main__':\\n t = int(input())\\n for i in range(t):\\n arr = input().strip().split()\\n if Solution().isInterleave(arr[0], arr[1], arr[2]):\\n print(1)\\n else:\\n print(0)\\n print(\\\"~\\\")\\n# contributed By: Harshit Sidhwa\\n\",\n \"solution\": \"class Solution:\\n # The function checks if string 'c' is an interleaving of strings 'a' and 'b'\\n def isInterleave(self, a, b, c):\\n # m and n store the lengths of strings 'a' and 'b' respectively\\n m = len(a)\\n n = len(b)\\n\\n # Create a dp table of size (m+1) x (n+1) initialized with False\\n dp = [[False] * (n + 1) for i in range(m + 1)]\\n\\n # If the length of string 'c' does not equal the sum of the lengths of 'a' and 'b',\\n # then 'c' cannot be an interleaving of 'a' and 'b'\\n if m + n != len(c):\\n return False\\n\\n # Iterate over each cell of the dp table\\n for i in range(0, m + 1):\\n for j in range(0, n + 1):\\n # Base cases: set dp[0][0] as True\\n if i == 0 and j == 0:\\n dp[i][j] = True\\n # If 'a' is empty and 'b' matches character in 'c', set dp[i][j] as dp[i][j-1]\\n elif i == 0:\\n if b[j - 1] == c[j - 1]:\\n dp[i][j] = dp[i][j - 1]\\n # If 'b' is empty and 'a' matches character in 'c', set dp[i][j] as dp[i-1][j]\\n elif j == 0:\\n if a[i - 1] == c[i - 1]:\\n dp[i][j] = dp[i - 1][j]\\n # If neither 'a' nor 'b' is empty\\n else:\\n # If 'a' matches current character in 'c' but 'b' does not,\\n # set dp[i][j] as dp[i-1][j]\\n if a[i - 1] == c[i + j - 1] and b[j - 1] != c[i + j - 1]:\\n dp[i][j] = dp[i - 1][j]\\n # If 'b' matches current character in 'c' but 'a' does not,\\n # set dp[i][j] as dp[i][j-1]\\n elif a[i - 1] != c[i + j - 1] and b[j - 1] == c[i + j - 1]:\\n dp[i][j] = dp[i][j - 1]\\n # If both 'a' and 'b' match current character in 'c',\\n # set dp[i][j] as the logical OR of dp[i-1][j] and dp[i][j-1]\\n elif a[i - 1] == c[i + j - 1] and b[j - 1] == c[i + j - 1]:\\n dp[i][j] = (dp[i - 1][j] or dp[i][j - 1])\\n\\n # Return the value of dp[m][n], which represents whether 'c' is an interleaving of 'a' and 'b'\\n return dp[m][n]\\n\",\n \"updated_at_timestamp\": 1729753320,\n \"user_code\": \"#User function Template for python3\\n\\n #Your task is to complete this Function \\\\\\n\\nclass Solution:\\n #function should return True/False\\n def isInterleave(self, A, B, C):\\n # Code here\"\n}"},"test_cases":{"kind":"string","value":"eJzVVc1OwzAM5sCBx7ByntAKN25xuvGzjf9BAgUO0AOXsEMnISEQDwHvi5OwKKvabilDCLd1G7exv3x23Pf1z3xjzYq8pYfrF/aoJ9OC7QDbzjRH4AI4CjppZJ6tiTQ3BhQpOMURhUhT1gGWP0/y+yJ/uHuaFt+uupl+y7TTidXstQNBrC3nrNff3ds/gMFwdHh0fHJ6dj4GPsDhSNDQvDQm+mBssJiAMLsRHIuSBjUQkgBCRXAvgF6s9/KVaekFlBeQSkkVKqnikSQhDY4FsDRcXEp1VfmqbKz/vDE3FUCADt64hir0gNykIzoYsY2xwSzC6FAogHgBR0/0+mgSuCq12hrinTgEDQCWLY/+n9ZHEkl/+20OP9/mM+ZxUfLrZmOQOLPyNsnz8+tqqYVT3WLPNfe8FbbjJdrnr3a9uN7c8Isqt4558Kvg8z/yONeLFhTgzcfmF7CKhjU="}}},{"rowIdx":783,"cells":{"question_id":{"kind":"number","value":705151,"string":"705,151"},"question_title":{"kind":"string","value":"Row with minimum number of 1's"},"question_content":{"kind":"string","value":"Given a 2D binary matrix(1-based indexed) a of dimensions nxm , determine the row that contains the minimum number of 1's.Note: The matrix contains only 1's and 0's. Also, if two or more rows contain the minimum number of 1's, the answer is the lowest of those indices.\nExamples:\nInput:\nn = 4,m = 4\na = [[1, 1, 1, 1],\n [1, 1, 0, 0], \n [0, 0, 1, 1],\n [1, 1, 1, 1]]\n\nOutput:\n2\n\nExplanation:\n\nRows 2 and 3 contain the minimum number \nof 1's(2 each).Since,row 2 is less than row 3.\nThus, the answer is 2.\nInput:\nn = 3,m = 3\na = [[0, 0, 0],\n [0, 0, 0],\n [0, 0, 0]]\n\nOutput:\n1\n\nExplanation:\n\nAll the rows contain the same number \nof 1's(0 each).Among them, index 1 \nis the smallest, so the answer is 1.\n\n0 <= a[i][j] <= 1"},"dataset":{"kind":"string","value":"geeksforgeeks"},"difficulty":{"kind":"string","value":"Easy"},"java":{"kind":"string","value":"{\n \"class_name\": \"Solution\",\n \"created_at_timestamp\": 1729917875,\n \"func_sign\": [\n \"int minRow(int mat[][])\"\n ],\n \"initial_code\": \"// Initial Template for Java\\n\\nimport java.io.*;\\nimport java.util.*;\\n\\nclass GFG {\\n public static void main(String args[]) throws IOException {\\n BufferedReader read = new BufferedReader(new InputStreamReader(System.in));\\n int t = Integer.parseInt(read.readLine());\\n while (t-- > 0) {\\n String s[] = read.readLine().split(\\\" \\\");\\n int N = Integer.parseInt(s[0]);\\n int M = Integer.parseInt(s[1]);\\n int mat[][] = new int[N][M];\\n for (int i = 0; i < N; i++) {\\n String S[] = read.readLine().split(\\\" \\\");\\n for (int j = 0; j < M; j++) {\\n mat[i][j] = Integer.parseInt(S[j]);\\n }\\n }\\n Solution ob = new Solution();\\n System.out.println(ob.minRow(mat));\\n\\n System.out.println(\\\"~\\\");\\n }\\n }\\n}\\n\",\n \"script_name\": \"GFG\",\n \"solution\": \"//Back-end complete function Template for Java\\n\\nclass Solution {\\n // Function to find the row with minimum number of 1's\\n int minRow(int mat[][]) {\\n int i, j, mn = (int)(1e6), mni = -1;\\n int n = mat.length, m = mat[0].length;\\n\\n // Loop through each row\\n for (i = 0; i < n; i++) {\\n int c = 0;\\n\\n // Loop through each element in the row\\n for (j = 0; j < m; j++) {\\n // Count the number of 1's in the row\\n if (mat[i][j] == 1) c++;\\n }\\n\\n // Check if the number of 1's in the row is minimum so far\\n if (mn > c) {\\n mn = c;\\n mni = i + 1; // Store the index of the row\\n }\\n }\\n\\n // Return the index of the row with minimum number of 1's\\n return mni;\\n }\\n};\",\n \"updated_at_timestamp\": 1730481289,\n \"user_code\": \"// User function Template for Java\\n\\nclass Solution {\\n int minRow(int mat[][]) {\\n // code here\\n }\\n};\"\n}"},"python":{"kind":"string","value":"{\n \"class_name\": \"Solution\",\n \"created_at_timestamp\": 1729917875,\n \"func_sign\": [\n \"minRow(self,a)\"\n ],\n \"initial_code\": \"# Initial Template for Python 3\\n\\nimport math\\n\\nif __name__ == '__main__':\\n t = int(input())\\n for _ in range(t):\\n N, M = map(int, input().strip().split(\\\" \\\"))\\n mat = []\\n for i in range(N):\\n B = list(map(int, input().strip().split(\\\" \\\")))\\n mat.append(B)\\n ob = Solution()\\n print(ob.minRow(mat))\\n print(\\\"~\\\")\\n\",\n \"solution\": \"#Back-end complete function Template for Python 3\\n\\n\\nclass Solution:\\n #Function to find the row with minimum number of 1s.\\n def minRow(self, mat):\\n mn, mni = 1000000, -1\\n n = len(mat)\\n m = len(mat[0])\\n\\n #iterating over all the rows.\\n for i in range(n):\\n c = 0\\n\\n #counting number of 1s in the current row.\\n for j in range(m):\\n if mat[i][j] == 1:\\n c += 1\\n\\n #checking if the current row has minimum number of 1s.\\n if mn > c:\\n mn = c\\n mni = i + 1\\n\\n #returning the row index with minimum number of 1s.\\n return mni\\n\",\n \"updated_at_timestamp\": 1730481289,\n \"user_code\": \"#User function Template for python3\\n\\nclass Solution:\\n def minRow(self,a):\\n #code here\"\n}"},"test_cases":{"kind":"string","value":"eJydVMtOwzAQ5FCJ31j5XCFvHqXqlyBRxIHmwCX0kEoIREX/ofwvfsTrdxOnqVLH3pn1jCf9Xf1d7u/U5+lLDJ6/2Xt/PA1sB6zd9xvY7HsEuuwDBy4fuLmCFe6uyB8ieITWAFEvohniOEQD8alsP/RmW8loOjgbwQCLLtYoECPuSUyAUypJqxUYVFrVWTgpxBieqUxuKTG5ha3dArkWULqtMazgyZZ+u9GnKQhbA+s+j93b0B1eP06DDdhZHJ+61+peOTPsZw1OGkVBo6PjnWPolpetGhqqSg1aG+8gJXGIo2OcUqe1oKMuUKTdFm2yFHgLhsWwCiqlQx3ZUrT2fUJ1jK6h1h6OgeH0VEjUjJZpB8q9M3j6FuMbihuFx8kULWV4k1HgEpgB3JQgX/JFMkyEklyFdOp/dN7u5Us5szK/ibByPuFMRj/t1YK4x7ZOGPpyffgHBfgDKQ=="}}},{"rowIdx":784,"cells":{"question_id":{"kind":"number","value":712680,"string":"712,680"},"question_title":{"kind":"string","value":"Unique Binary Tree Requirements"},"question_content":{"kind":"string","value":"Geek wants to know the traversals required to construct a unique binary tree.Given a pair of traversal, return true if it is possible to construct unique binary tree from the given traversals otherwise return false.\nExamples:\nInput:\na = 1, b=2\n\nOutput:\n1\n\nExplanation: \nWe can construct binary tree using inorder traversal and preorder traversal.\nInput:\na = 1, b=3\n\nOutput:\n0 \n\nExplanation: \nWe cannot construct binary tree using preorder traversal and postorder traversal.\n\nExpected Time Complexity:\nO(1)\nExpected Auxiliary Space:\nO(1)"},"dataset":{"kind":"string","value":"geeksforgeeks"},"difficulty":{"kind":"string","value":"Easy"},"java":{"kind":"string","value":"{\n \"class_name\": \"Solution\",\n \"created_at_timestamp\": 1668490265,\n \"func_sign\": [\n \"public static boolean isPossible(int a, int b)\"\n ],\n \"initial_code\": \"//Initial Template for Java\\n\\nimport java.util.*;\\nimport java.lang.*;\\nimport java.math.*;\\nimport java.io.*;\\n\\nclass GFG {\\n public static void main(String[] args) throws IOException {\\n Scanner sc = new Scanner(System.in);\\n int T = sc.nextInt();\\n while (T-- > 0) {\\n int a=sc.nextInt();\\n int b=sc.nextInt();\\n \\n Solution obj = new Solution();\\n boolean ans = obj.isPossible(a,b);\\n if(ans==true)\\n System.out.println(1);\\n else{\\n System.out.println(0);\\n }\\n \\nSystem.out.println(\\\"~\\\");\\n}\\n }\\n}\",\n \"script_name\": \"GFG\",\n \"solution\": \"None\",\n \"updated_at_timestamp\": 1729753320,\n \"user_code\": \"//User function Template for Java\\n\\nclass Solution{\\n \\n public static boolean isPossible(int a, int b){\\n // Code here\\n }\\n}\"\n}"},"python":{"kind":"string","value":"{\n \"class_name\": \"Solution\",\n \"created_at_timestamp\": 1668490581,\n \"func_sign\": [\n \"isPossible(self, a, b)\"\n ],\n \"initial_code\": \"# Initial Template for Python 3\\n\\nif __name__ == \\\"__main__\\\":\\n t = int(input())\\n for _ in range(0, t):\\n a, b = input().split()\\n a = int(a)\\n b = int(b)\\n\\n obj = Solution()\\n ans = obj.isPossible(a, b)\\n if(ans == True):\\n print(1)\\n else:\\n print(0)\\n print(\\\"~\\\")\\n\",\n \"solution\": \"# Back-end complete function Template for Python 3\\n\\nclass Solution:\\n\\n # Function to check if two numbers can form a valid pair.\\n def isPossible(self, a, b):\\n\\n # Checking if the numbers are (2,1) or (1,2), which are valid pairs.\\n if ((a == 2 and b == 1) or (a == 1 and b == 2)):\\n return True\\n\\n # Checking if the numbers are (2,3) or (3,2), which are valid pairs.\\n elif ((a == 2 and b == 3) or (a == 3 and b == 2)):\\n return True\\n\\n # If none of the valid pairs, return False.\\n return False\\n\",\n \"updated_at_timestamp\": 1729753320,\n \"user_code\": \"#User function Template for python3\\n\\nclass Solution:\\n def isPossible(self, a, b):\\n #Code here\"\n}"},"test_cases":{"kind":"string","value":"eJy1VctOwzAQ5MCBT+iNlc8Vil9p6ZcgYcQBcuBiekilSlURH9H+L/bGStrSddeE5mAlSjI7OzNef9/u7+9u8HqahJvnjfjwy1UrFiC08wqk8xqU8xasmIJo1svmrW3eXz9XbfosfPHlfLdWuIrtFA5wbHgbIQYwBQHbQM1AvIhuEhwCG7CRKge4oiFVJIy4VM+Zn+u+WyQlU98mAmrQbGYXWc4OZR0k0ElbrmWUJlRzQyUZC0vAmGBhWSh7ptBRZkxnhioTMIM+T8Cy7yUlsktPL6LJFqsY+p0tL6tevN/+JRKh4zoymUHweQ6P2SDy/cywOtrucsR+J4IJV00m29L4fB1bMaSM5i01nigzKaMUZzAXEIbE2LnAeaA8lu+JNWbUdqOGY7kv6t+NOZ2OZ4+mv45M3kGYcxP5oKHFbb7sHn4AwhiQlQ=="}}},{"rowIdx":785,"cells":{"question_id":{"kind":"number","value":702832,"string":"702,832"},"question_title":{"kind":"string","value":"Strange Sort"},"question_content":{"kind":"string","value":"Given an array arr[] of non-negative integers. Sort the array in ascending order such that the element at the Kth position in the unsorted array stays unmoved and all other elements are sorted.\nExamples:\nInput:\narr[] = [3, 12, 30, 79, 2] , k=2\n\nOutput:\n[2, 12, 3, 30, 79]\n\nExplanation:\nThe element at the 2nd position (12) remains at its own place while others are sorted.\nInput:\narr[] = [16, 16, 18, 10, 9, 22, 11, 5, 35, 22] , k=5\nOutput:\n[5, 10, 11, 16, 9, 16, 18, 22, 22, 35]\n\nExplanation:\nThe element at the 5th position (9) remains at its own place while others are sorted.\n\nConstraints:\n1<=arr.size()<=10**6\n1<=k<=arr.size()"},"dataset":{"kind":"string","value":"geeksforgeeks"},"difficulty":{"kind":"string","value":"Easy"},"java":{"kind":"string","value":"{\n \"class_name\": \"Solution\",\n \"created_at_timestamp\": 1615292571,\n \"func_sign\": [\n \"void strangeSort(int[] arr, int k)\"\n ],\n \"initial_code\": \"// Initial Template for Java\\n\\nimport java.io.*;\\nimport java.util.*;\\n\\npublic class Main {\\n\\n public static void main(String[] args) throws Exception {\\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\\n int t = Integer.parseInt(br.readLine());\\n while (t-- > 0) {\\n\\n String line = br.readLine();\\n String[] tokens = line.split(\\\" \\\");\\n\\n // Create an ArrayList to store the integers\\n ArrayList<Integer> array = new ArrayList<>();\\n\\n // Parse the tokens into integers and add to the array\\n for (String token : tokens) {\\n array.add(Integer.parseInt(token));\\n }\\n\\n int[] arr = new int[array.size()];\\n int idx = 0;\\n for (int i : array) arr[idx++] = i;\\n\\n int k = Integer.parseInt(br.readLine());\\n // Create Solution object and find closest sum\\n Solution ob = new Solution();\\n ob.strangeSort(arr, k);\\n int n = arr.length;\\n for (int i = 0; i < n; i++) System.out.print(arr[i] + \\\" \\\");\\n System.out.println();\\n\\n System.out.println(\\\"~\\\");\\n }\\n }\\n}\\n\",\n \"script_name\": \"Main\",\n \"solution\": \"class Solution {\\n void strangeSort(int[] arr, int k) {\\n int n = arr.length;\\n int ele = arr[k - 1]; // Store the kth element\\n arr[k - 1] = Integer.MAX_VALUE; // Temporarily set it to a large value to place\\n // it at the end after sorting\\n // Sort the array except the original k-th element\\n Arrays.sort(arr);\\n // Insert the original k-th element back into its correct position\\n int i = n - 1;\\n while (i >= k) {\\n arr[i] = arr[i - 1];\\n i--;\\n }\\n arr[i] = ele; // Place the k-th element in its original position\\n }\\n}\\n\",\n \"updated_at_timestamp\": 1729753320,\n \"user_code\": \"// User function Template for Java\\n\\nclass Solution {\\n void strangeSort(int[] arr, int k) {\\n // your code here\\n }\\n}\"\n}"},"python":{"kind":"string","value":"{\n \"class_name\": \"Solution\",\n \"created_at_timestamp\": 1615292571,\n \"func_sign\": [\n \"strangeSort(self,arr, k)\"\n ],\n \"initial_code\": \"# Initial Template for Python 3\\n\\nif __name__ == '__main__':\\n tc = int(input())\\n while tc > 0:\\n arr = list(map(int, input().strip().split()))\\n k = int(input().strip())\\n ob = Solution()\\n ob.strangeSort(arr, k)\\n n = len(arr)\\n for i in range(n):\\n print(arr[i], end=\\\" \\\")\\n print()\\n tc -= 1\\n print(\\\"~\\\")\\n\",\n \"solution\": \"class Solution:\\n\\n def strangeSort(self, arr, k):\\n n = len(arr)\\n ele = arr[k - 1] # Store the k-th element\\n arr[k - 1] = float('inf') # Temporarily set it to a large value\\n\\n arr.sort() # Sort the array\\n\\n # Re-insert the original k-th element into its correct position\\n i = n - 1\\n while i >= k:\\n arr[i] = arr[i - 1]\\n i -= 1\\n arr[i] = ele # Place the original k-th element in its original position\\n\",\n \"updated_at_timestamp\": 1729753320,\n \"user_code\": \"#User function Template for python3\\n\\nclass Solution:\\n def strangeSort (self,arr, k):\\n # your code here\"\n}"},"test_cases":{"kind":"string","value":"eJzNVktuE0EQZcEFuEHL6whN9b85CRKDWEAWbIYsEgkJBXEIuBY77sOrT9vjxG1MSEKstD2ZeVX1qup19Xx7/uPXi2fyef0TF2++bD4uF1eXm1duE+aFHE3ycUl/mnwc+RBTdq2WnKLj61Kd3CtO7gUn335e2Iui5QY5Abdui2f4c3jAz/DAnuGPn/FNLFzNS5mXHt7tu+w81IkFMF/4R1jJB1ymzZnbnH++OH9/ef7h3aerS8t269MytWwsN82m52bxOhsr0bx8lVw5H6NuLjWDw/z2U7DM1dXKfGVnCZndrmIrRpqsetlcn7lVUz2XANlhBayorXUZq2BV7jEW5+SIkcRQYiwxmBhNDCfGExtQU48T+0bHXUaHoAfXHLy74iIejMr+YGQ0/QAKBCoRRDKoVJA6VBeaF/HN/WwVC/JryKMlLMi0oafNYxFHQCjgUGJimVbgKnAVuApcBa4S0wEv4KAfKsAV4ApwBbgCXAGuEHNHEsBl4NBZysBl4DJwGbgMXCZOFBkDl4BLwEEalIDjbZSAS8Al4qqgPMBF4CJwEbgIXAQO6qUIXCQuIWoJXAAuABeAC8AF4AJwEDwF4nqj8LzpgfO8LYHzwHnZvljAidi5S8ARcAQcAUfAEXAEHAFHxJ1ES3nfADcBNwE3ATcBNwE3ATehIWm4VycyVDCrZF6KeW0aRaJ5ix6NTTZ2Vdkya2HvLZto2WXLtmr2XAWphrfqRKtWtupVrSZXVarrrdrRqp+tG1W70zslXQvWxWRdLdblpl2X7ntTQzR1ZFNLVfWwikRN3tQVTW3Z1FdVjaxKUac3tUZTbzY1V1U3q1zU7k390XZDtt1RZbf4vtNub6gb89H30Rp0TtW9TSntctwsrpnjTjFxx23iKPMSB2rwcBi779MddhKHpvjtXMQ9TyidVTaVdNL0CfXnUTYv9cgcHBn6vTm4ChtWpNIx9oEdSs4MhAX8OhYMGOUhIzYIYpDFpohZOxxFD5btO4LbFbfIN58J/JvkW48qFQIsk75qSAlXWapD0B+e2WK/8hUt1i5SWTHpXd6er4OIozLSVlksM6gLR5tj+anOokgti9QqF48abNKQvAn3gGJVruGmYke0uiL0QPTJpOECX8VkkopHa5m2hUjd201HU/d2hMfqJXG9v7QLIoJx1qONf+SdTZ2tXKVTNn3eI3XSCLhfebf/pO9t5BMndti9+d/z0FYNmO+TR7YQ+qu5HaY7jz6de6XbNB3QJ4kDh/aTGn9t135jdtcJ2EeN+r6/eTMaNbtYdzuY2/R4Z/P4WO40DubgnubBcnviPZySu+99La/j5H8/wO8xIXmZf6ycVjEPpTU6HDfXb7+//A2X5eQE"}}},{"rowIdx":786,"cells":{"question_id":{"kind":"number","value":703833,"string":"703,833"},"question_title":{"kind":"string","value":"Semi Prime"},"question_content":{"kind":"string","value":"Given a positive integer n. Find whether a number is a semiprime or not.Note:A semiprime is a natural number that is a product of two prime numbers .\nExamples:\nInput:\nN=35\n\nOutput:\n1\n\nExplanation:\n\n35=7x5.So 35 is a semi-prime.\nInput:\n8\n\nOutput:\n0\n\nExplanation:\n\n8 is not a semi prime.\n\nConstraints:\n\n1<=N<=10**9"},"dataset":{"kind":"string","value":"geeksforgeeks"},"difficulty":{"kind":"string","value":"Easy"},"java":{"kind":"string","value":"{\n \"class_name\": \"Solution\",\n \"created_at_timestamp\": 1615292571,\n \"func_sign\": [\n \"int checkSemiprime(int N)\"\n ],\n \"initial_code\": \"// Initial Template for Java\\n\\nimport java.io.*;\\nimport java.util.*;\\n\\nclass GFG {\\n public static void main(String args[]) throws IOException {\\n BufferedReader read =\\n new BufferedReader(new InputStreamReader(System.in));\\n int t = Integer.parseInt(read.readLine());\\n while (t-- > 0) {\\n int N = Integer.parseInt(read.readLine());\\n Solution ob = new Solution();\\n System.out.println(ob.checkSemiprime(N));\\n \\nSystem.out.println(\\\"~\\\");\\n}\\n }\\n}\",\n \"script_name\": \"GFG\",\n \"solution\": \"// Back-end complete function Template for Java\\nclass Solution {\\n int checkSemiprime(int N) {\\n int cnt = 0;\\n for (int i = 2; cnt < 2 && i * i <= N; ++i)\\n while (N % i == 0) {\\n N /= i;\\n ++cnt;\\n } // Increment count\\n // of prime numbers\\n // If number is greater than 1, add it to\\n // the count variable as it indicates the\\n // number remain is prime number\\n if (N > 1) ++cnt;\\n // Return '1' if count is equal to '2' else\\n // return '0'\\n return (cnt == 2 ? 1 : 0);\\n }\\n}\\n\",\n \"updated_at_timestamp\": 1729753320,\n \"user_code\": \"// User function Template for Java\\n\\nclass Solution {\\n int checkSemiprime(int N) {\\n // code here\\n }\\n}\"\n}"},"python":{"kind":"string","value":"{\n \"class_name\": \"Solution\",\n \"created_at_timestamp\": 1615292571,\n \"func_sign\": [\n \"checkSemiprime(self,N)\"\n ],\n \"initial_code\": \"# Initial Template for Python 3\\n\\nif __name__ == '__main__':\\n t = int(input())\\n for _ in range(t):\\n N = int(input())\\n ob = Solution()\\n print(ob.checkSemiprime(N))\\n print(\\\"~\\\")\\n\",\n \"solution\": \"# Back-end complete function Template for Python 3\\n\\nclass Solution:\\n # Function to check if a number is a semiprime or not.\\n def checkSemiprime(self, N):\\n cnt = 0\\n i = 2\\n # Loop to factorize the number into prime factors.\\n while (i * i <= N and cnt < 2):\\n while (N % i == 0):\\n N //= i\\n cnt += 1\\n i += 1\\n # If there is a remaining prime factor, increment count.\\n if (N > 1):\\n cnt += 1\\n # If the count of prime factors is 2, return 1. Otherwise, return 0.\\n if cnt == 2:\\n return 1\\n return 0\\n\",\n \"updated_at_timestamp\": 1729753320,\n \"user_code\": \"#User function Template for python3\\n\\nclass Solution:\\n def checkSemiprime(self,N):\\n #code here\"\n}"},"test_cases":{"kind":"string","value":"eJxrYJmayMIABhFRQEZ0tVJmXkFpiZKVgpJhTJ6Zko6CUmpFQWpySWpKfH5pCUKqLiZPqVZHAVW9oSmJGkwsSdRgZESqBnMcGgxwaDDHpQGnp40MSdVhYkyyt0m1w9iIZDvMwRECjkZ84YAr4IBuxBsauPQBXYovJeDSBrSIsJ24YwCbh2NiSA0zY1zJEbdnqWk7KItSzQXG5AWAsTkxiSV2ih4AjNhe8Q=="}}},{"rowIdx":787,"cells":{"question_id":{"kind":"number","value":705190,"string":"705,190"},"question_title":{"kind":"string","value":"Geek and knots"},"question_content":{"kind":"string","value":"Given two walls A, B with M, N hooks respectively. You are given K ropes. By using one rope you can connect one hook on wall A with another hook on wall B. One hook can connect with only one rope.Find the number of different ways you can use all the K ropes.\rTwo ways that use theexact same set of hooks from wall A and wall B are considered to be same.\nExamples:\nInput:\nM = 3, N = 2, K = 2\n\nOutput:\n3\n\nExplanation: \n\nhooks on Wall A are A1, A2, A3.\nhooks on wall B are B1, B2. \nDifferent Possible Knots are\nK1 = (A1-B1, A2-B2), K2 = (A1-B1, A3-B2), \nK3 = (A2-B1, A3-B2) \nEach of these use different set of hooks from wall A.\nInput:\nM = 2, N = 2, K = 2\n\nOutput:\n1\n\nExplanation: \n\nA1 A2 \n| | \nB1 B2\nThere is only one way to select 2 hooks \nfrom wall A and 2 from wall B.\n\nConstraints:\n\n1 ≤ N, M, K ≤ 1000\n\n1 ≤ K ≤ min(N, M)"},"dataset":{"kind":"string","value":"geeksforgeeks"},"difficulty":{"kind":"string","value":"Medium"},"java":{"kind":"string","value":"{\n \"class_name\": \"Solution\",\n \"created_at_timestamp\": 1615292571,\n \"func_sign\": [\n \"static int knots(int M, int N, int K)\"\n ],\n \"initial_code\": \"//Initial Template for Java\\n\\nimport java.io.*;\\nimport java.util.*;\\nimport java.math.*;\\n\\nclass GFG{\\n public static void main(String args[])throws IOException\\n {\\n BufferedReader in = new BufferedReader(new InputStreamReader(System.in));\\n int t = Integer.parseInt(in.readLine());\\n while(t-- > 0){\\n String a[] = in.readLine().trim().split(\\\"\\\\\\\\s+\\\");\\n int M = Integer.parseInt(a[0]);\\n int N = Integer.parseInt(a[1]);\\n int K = Integer.parseInt(a[2]);\\n \\n Solution ob = new Solution();\\n System.out.println(ob.knots(M, N, K));\\n \\nSystem.out.println(\\\"~\\\");\\n}\\n }\\n}\",\n \"script_name\": \"GFG\",\n \"solution\": \"None\",\n \"updated_at_timestamp\": 1729753320,\n \"user_code\": \"//User function Template for Java\\n\\nclass Solution{\\n static int knots(int M, int N, int K){\\n // code here\\n }\\n}\"\n}"},"python":{"kind":"string","value":"{\n \"class_name\": \"Solution\",\n \"created_at_timestamp\": 1615292571,\n \"func_sign\": [\n \"knots(self, M, N, K)\"\n ],\n \"initial_code\": \"# Initial Template for Python 3\\n\\nif __name__ == '__main__':\\n t = int(input())\\n for _ in range(t):\\n M, N, K = [int(x) for x in input().split()]\\n ob = Solution()\\n print(ob.knots(M, N, K))\\n print(\\\"~\\\")\\n\",\n \"solution\": \"class Solution:\\n def knots(self, M, N, K):\\n # code here\\n def s(a, b):\\n i = 1\\n j = a\\n k = b\\n while k > 0:\\n k -= 1\\n i = i * j\\n j -= 1\\n # print(i)\\n p = 1\\n for j in range(1, b + 1):\\n p = p * j\\n # print(p)\\n return (i // p)\\n\\n ans = s(M, K) * s(N, K)\\n return ans % (1000000007)\\n\",\n \"updated_at_timestamp\": 1729753320,\n \"user_code\": \"#User function Template for python3\\n\\nclass Solution:\\n def knots(self, M, N, K):\\n # code here\"\n}"},"test_cases":{"kind":"string","value":"eJydlE0KwjAQhV30IEPWRTJJUxtPIlhxoV24qV20IIjiIfQc7jyf6Y8VxJfS9o9C+uXNm3n0Fjxewaw5Vk/3sj6LQ15UpViS4DRncqcISWSnItuV2X57rMrv8jXNxSWkH0ZKSf1jEow13TIiO83xpHFYd4+sVpGGgjF0SGzIAGphYnchOUm67ipgrXWsiiz26SySQtJacxyZxEYA186sQtJ4KJ5horY2SopRoTAB3rRCMTmQufYDT3bYHx7FkiOVcDIcP1W7mGC8ib4/+362bcHAkNEWfQentfBfBQO/ns9Wm/v8DZLvY5o="}}},{"rowIdx":788,"cells":{"question_id":{"kind":"number","value":703861,"string":"703,861"},"question_title":{"kind":"string","value":"Skip the work"},"question_content":{"kind":"string","value":"Given an array A[ ] denoting the time taken to complete N tasks, determine the minimum amount of time required to finish the tasks considering that you can skip any task, butskipping two consecutive tasks is forbidden.\nExamples:\nInput:\nN = 2\nA[] ={10,20}\n\nOutput:\n10\n\nExplanation:\nwe can take time of\n10 units and skip 20 units time.\nInput:\nN = 4\nA[] = {10,5,7,10}\n\nOutput:\n12\n\nExplanation:\nwe can skip both the\ntens and pick 5 and 7 only.\n\n"},"dataset":{"kind":"string","value":"geeksforgeeks"},"difficulty":{"kind":"string","value":"Medium"},"java":{"kind":"string","value":"{\n \"class_name\": \"Solution\",\n \"created_at_timestamp\": 1615292571,\n \"func_sign\": [\n \"public int minAmount(int A[] , int N)\"\n ],\n \"initial_code\": \"//Initial Template for Java\\n\\nimport java.io.*;\\nimport java.util.*;\\nclass GfG\\n{\\n public static void main(String args[])\\n {\\n Scanner sc = new Scanner(System.in);\\n int t = sc.nextInt();\\n while(t-->0)\\n {\\n int n = sc.nextInt();\\n int A[] = new int[n];\\n for(int i = 0;i<n;i++)\\n A[i] = sc.nextInt();\\n Solution ob = new Solution();\\n System.out.println(ob.minAmount(A,n));\\n \\nSystem.out.println(\\\"~\\\");\\n}\\n }\\n} \",\n \"script_name\": \"GfG\",\n \"solution\": \"class Solution\\n{\\n public int minAmount(int a[] , int n)\\n {\\n //code here.\\n if (n <= 0) return 0;\\n\\n int incl = a[0];\\n int excl = 0;\\n\\n // Process remaining n-1 tasks\\n for (int i = 1; i < n; i++) {\\n int inclNew = a[i] + Math.min(excl, incl);\\n int exclNew = incl;\\n incl = inclNew;\\n excl = exclNew;\\n }\\n\\n return Math.min(incl, excl);\\n }\\n}\",\n \"updated_at_timestamp\": 1729753320,\n \"user_code\": \"\\nclass Solution\\n{\\n public int minAmount(int A[] , int N)\\n {\\n //code here.\\n }\\n}\"\n}"},"python":{"kind":"string","value":"{\n \"class_name\": \"Solution\",\n \"created_at_timestamp\": 1615292571,\n \"func_sign\": [\n \"minAmount(self, A, n)\"\n ],\n \"initial_code\": \"# Initial Template for Python 3\\n\\nif __name__ == '__main__':\\n t = int(input())\\n for _ in range(t):\\n n = int(input())\\n A = list(map(int, input().strip().split()))\\n ob = Solution()\\n print(ob.minAmount(A, n))\\n print(\\\"~\\\")\\n\",\n \"solution\": \"# User function Template for python3\\n\\nclass Solution:\\n def minAmount(self, A, n):\\n # updating the array A by adding the minimum of the two previous elements\\n for i in range(2, n):\\n A[i] = A[i] + min(A[i - 1], A[i - 2])\\n\\n # return the minimum value between the last two elements of the updated array A\\n return min(A[n - 1], A[n - 2])\\n\",\n \"updated_at_timestamp\": 1729753320,\n \"user_code\": \"#User function Template for python3\\n\\nclass Solution:\\n def minAmount(self, A, n): \\n # code here \\n\\n\"\n}"},"test_cases":{"kind":"string","value":"eJyllEFLw0AQhT3o/xj2XCSzm90m/hLBFQ+ag5e1hxQKYunNmyf9v75ZajXgK5qGQJYk8+W9ebPZnX+8XZzV4/oVi5tn91hW69FdidNcYi7aiG9EowQsoluIGzar4X4cHu6e1uP+1djkss3FvSxkCki5BEkSpROA1JN67Ug97uPLshRvBOmlZQSmwB6oF+0gwkfzYjj4gZ7QMD8toQVIgp+e1CVStsQJC5CPYmsEcxEIoK9BKDzg4+hjNdERio+sFz4XXzXs4wAmAgSiigaCCz3D2XgcEFOwtqLJuu5ZjxNLrDWvjURw6oUmzgAmK540toe8knkKxxJjkztxgetXv6gb/e8AYwFlrD0tG+HfhOU8S9r37tYTt/f8/f0zbBvoOXEf/UfQAaQ/CYLr/hzZ7fvlJ1PxkXM="}}},{"rowIdx":789,"cells":{"question_id":{"kind":"number","value":703803,"string":"703,803"},"question_title":{"kind":"string","value":"Candy Packets"},"question_content":{"kind":"string","value":"Given a number N denoting candies. Find how many packetsare needed to contain the number if 1st packetcan contain 1 candy, 2nd packetcan contain 2 candies, 3rd packetcan contain 4 candies and so on.\nExamples:\nInput:\nN = 2\n\nOutput:\n2\n\nExplanation:\n\nPut 1 candy in first packet.\nPut 1 candy in second packet.\nThus two,packets are required.\nInput:\nN = 8\n\nOutput:\n4\n\nExplanation:\n\nPut 1 candy in first packet.\nPut 2 candies in second packet.\nPut 4 candies in third packet.\nPut 1 candy in fourth packet.\nThus 4 packets are required.\n\n"},"dataset":{"kind":"string","value":"geeksforgeeks"},"difficulty":{"kind":"string","value":"Easy"},"java":{"kind":"string","value":"{\n \"class_name\": \"Solution\",\n \"created_at_timestamp\": 1615292571,\n \"func_sign\": [\n \"static long countPackets(long N)\"\n ],\n \"initial_code\": \"//Initial Template for Java\\n\\nimport java.io.*;\\nimport java.util.*;\\n\\nclass GFG {\\n public static void main(String args[]) throws IOException {\\n BufferedReader read =\\n new BufferedReader(new InputStreamReader(System.in));\\n int t = Integer.parseInt(read.readLine());\\n while (t-- > 0) {\\n long N = Long.parseLong(read.readLine());\\n Solution ob = new Solution();\\n System.out.println(ob.countPackets(N));\\n \\nSystem.out.println(\\\"~\\\");\\n}\\n }\\n}\",\n \"script_name\": \"GFG\",\n \"solution\": \"None\",\n \"updated_at_timestamp\": 1729753320,\n \"user_code\": \"//User function Template for Java\\n\\nclass Solution{\\n static long countPackets(long N){\\n //code here\\n }\\n}\"\n}"},"python":{"kind":"string","value":"{\n \"class_name\": \"Solution\",\n \"created_at_timestamp\": 1615292571,\n \"func_sign\": [\n \"countPackets(self,N)\"\n ],\n \"initial_code\": \"# Initial Template for Python 3\\n\\nif __name__ == '__main__':\\n t = int(input())\\n for _ in range(t):\\n N = int(input())\\n ob = Solution()\\n print(ob.countPackets(N))\\n print(\\\"~\\\")\\n\",\n \"solution\": \"class Solution:\\n # Function to count the number of packets required.\\n def countPackets(self, N):\\n c = 0\\n # while loop to divide N by 2 until N becomes 0.\\n while N:\\n N //= 2\\n # incrementing count by 1 for each division.\\n c += 1\\n # returning the count as the number of packets required.\\n return c\\n\",\n \"updated_at_timestamp\": 1729753320,\n \"user_code\": \"#User function Template for python3\\n\\nclass Solution:\\n def countPackets(self,N):\\n #code here\"\n}"},"test_cases":{"kind":"string","value":"eJydk0EKwjAQRV30ICXrIpkkk7aeRDCioEXcxC5aEETxEHpfmxoXXfxq7SaF8Cb//5m5J89DMuu/5bb7WV3E0ddtIxapIOeJRZaK6lxXu6bab05tE++M8zfnxTVLh4AmADAASEpA5JBQGiAkAaOkKRCjAGNkidxDpnMD/RDKzDJriyCYgtKGJ1NlkVs2gFIoPZIETSEmpEfxdB6GX/6CO/Zf+oHKhBLR9NRJtmNtgVEZSVilHVH57udYU0fGJ1QmhluB3u1DHmb8j/SwXHGK0fZ/tK8f8xdGa1xR"}}},{"rowIdx":790,"cells":{"question_id":{"kind":"number","value":704694,"string":"704,694"},"question_title":{"kind":"string","value":"Count the number of ways to tile the floor of size n x m using 1 x m size tiles"},"question_content":{"kind":"string","value":"Given a floor of size n x m and tiles of size 1 x m. The problem is to count the number of ways to tile the given floor using 1 x m tiles. A tile can either be placed horizontally or vertically.Both n and m are positive integers and 2 < = m.\nExamples:\nInput:\nn = 2, m = 3\n\nOutput:\n1\n\nExpanation: \nThere is only one way to tile the\ngiven floor.\nInput:\nn = 4, m = 4\n\nOutput:\n2\n\nExplanation: \nThere is two ways to tile the\ngiven floor.One way is to place 1 x 4 size \nof tile vertically and another one is to \nplace them horizontally.\n\nConstraints:\n\n1 <= n <= 100000\n2 <= m <= 100000"},"dataset":{"kind":"string","value":"geeksforgeeks"},"difficulty":{"kind":"string","value":"Medium"},"java":{"kind":"string","value":"{\n \"class_name\": \"Solution\",\n \"created_at_timestamp\": 1615292571,\n \"func_sign\": [\n \"public int countWays(int n, int m)\"\n ],\n \"initial_code\": \"//Initial Template for Java\\n\\nimport java.util.*;\\nimport java.lang.*;\\nimport java.io.*;\\nclass GFG\\n{\\n public static void main(String[] args) throws IOException\\n {\\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\\n int T = Integer.parseInt(br.readLine().trim());\\n while(T-->0)\\n {\\n String s = br.readLine().trim();\\n String [] S = s.split(\\\" \\\");\\n int n = Integer.parseInt(S[0]);\\n int m = Integer.parseInt(S[1]);\\n Solution ob = new Solution();\\n int ans = ob.countWays(n, m);\\n System.out.println(ans); \\n }\\n }\\n}\\n\",\n \"script_name\": \"GFG\",\n \"solution\": \"None\",\n \"updated_at_timestamp\": 1730475865,\n \"user_code\": \"//User function Template for Java\\n\\nclass Solution\\n{\\n public int countWays(int n, int m)\\n {\\n // Code here\\n }\\n}\"\n}"},"python":{"kind":"string","value":"{\n \"class_name\": \"Solution\",\n \"created_at_timestamp\": 1615292571,\n \"func_sign\": [\n \"countWays(self, n, m)\"\n ],\n \"initial_code\": \"# Initial Template for Python 3\\n\\nif __name__ == '__main__':\\n T = int(input())\\n for i in range(T):\\n n, m = input().split()\\n n = int(n)\\n m = int(m)\\n ob = Solution()\\n ans = ob.countWays(n, m)\\n print(ans)\\n\",\n \"solution\": \"class Solution:\\n def countWays(self, n, m):\\n count = [0] * (n + 2)\\n count[0] = 0\\n for i in range(1, n + 1):\\n # recurrence relation\\n if i > m:\\n count[i] = count[i-1] + count[i-m]\\n # base cases\\n elif i < m or i == 1:\\n count[i] = 1\\n # i == m\\n else:\\n count[i] = 2\\n # required number of ways\\n return count[n] % (10**9 + 7)\\n\",\n \"updated_at_timestamp\": 1730475865,\n \"user_code\": \"#User function Template for python3\\n\\nclass Solution:\\n\\tdef countWays(self, n, m):\\n\\t\\t# Code here\"\n}"},"test_cases":{"kind":"string","value":"eJydU8sKwjAQ9NAPCTkXaXbNY/0SwYoH7cFL7aEFQQQ/Qv/XNFZEyDbEvaSQmZ3ZyfZePIdiEWrT+o/tVZ7abujlWkhVt0qALIVsLl1z6Jvj/jz030t5K8UvHFg4xOAoMAeuqrFYCTLWKAc4x30fOaLaC2qO4GIMIqE5CR2NbTJHYzFEjPOE5YQYPDdKdBLvyyadgSMAY8HOx86tkfWFsIrOF7Ifj6z8A0t5npj4wDZIvAbHUoZcVYFJqn+24W8Xdn5jkSo0ZHQ0PeR/L+WQVNq+t12HRrnmpy46Qds9li+jMU0/"}}},{"rowIdx":791,"cells":{"question_id":{"kind":"number","value":702946,"string":"702,946"},"question_title":{"kind":"string","value":"Remaining String"},"question_content":{"kind":"string","value":"Given a string s without spaces, a character ch and an integer count. Your task is to return the substring that remains after the character ch has appeared count number of times.Note: Assume upper case and lower case alphabets are different. “”(Empty string) should be returned if it is not possible, or the remaining substring is empty.\nExamples:\nInput:\ns = \"Thisisdemostring\", ch = 'i', count = 3\n\nOutput:\nng\n\nExplanation: \nThe remaining substring of s after the 3rd\noccurrence of 'i' is \"ng\", hence the output is ng.\nInput:\ns = \"Thisisdemostri\", ch = 'i', count = 3\n\nOutput:\n\"\"\n\nExplanation:\nThe 3rd occurence of 'i' is at the last index. In this case the remaining substring is empty, hence we return empty string.\nInput:\ns = \"abcd\", ch = 'x', count = 2\n\nOutput:\n\"\"\n\nExplanation:\nThe character x is not present in the string, hence we return empty string.\n\nConstraints:\n1<= s.length()<=10**5\n1<=count<=s.length()\ns[i] is both upper case and lower case"},"dataset":{"kind":"string","value":"geeksforgeeks"},"difficulty":{"kind":"string","value":"Easy"},"java":{"kind":"string","value":"{\n \"class_name\": \"Solution\",\n \"created_at_timestamp\": 1615292571,\n \"func_sign\": [\n \"public String printString(String s, char ch, int count)\"\n ],\n \"initial_code\": \"// Initial Template for Java\\n\\nimport java.io.*;\\nimport java.util.*;\\n\\nclass GFG {\\n public static void main(String args[]) throws IOException {\\n Scanner sc = new Scanner(System.in);\\n int t = sc.nextInt();\\n while (t-- > 0) {\\n String s = sc.next();\\n char ch = sc.next().charAt(0);\\n int count = sc.nextInt();\\n Solution ob = new Solution();\\n String result = ob.printString(s, ch, count);\\n\\n System.out.println(result);\\n \\nSystem.out.println(\\\"~\\\");\\n}\\n }\\n}\",\n \"script_name\": \"GFG\",\n \"solution\": \"class Solution {\\n public String printString(String s, char ch, int count) {\\n String str = \\\"\\\";\\n int i = 0;\\n while (i < s.length() && count != 0) {\\n\\n if (s.charAt(i) == ch) {\\n count--;\\n i++;\\n } else if (s.charAt(i) != ch) {\\n i++;\\n }\\n }\\n\\n if (count == 0) {\\n str = s.substring(i);\\n }\\n\\n return s.substring(i).equals(\\\"\\\") ? \\\"\\\" : s.substring(i);\\n }\\n}\",\n \"updated_at_timestamp\": 1729753320,\n \"user_code\": \"class Solution {\\n public String printString(String s, char ch, int count) {\\n // code here\\n }\\n}\"\n}"},"python":{"kind":"string","value":"{\n \"class_name\": \"Solution\",\n \"created_at_timestamp\": 1615292571,\n \"func_sign\": [\n \"printString(self, s, ch, count)\"\n ],\n \"initial_code\": \"# Initial Template for Python 3\\n\\nif __name__ == '__main__':\\n T = int(input())\\n for i in range(T):\\n s = input()\\n ch = input()[0]\\n count = int(input())\\n ob = Solution()\\n answer = ob.printString(s, ch, count)\\n print(answer)\\n\",\n \"solution\": \"class Solution:\\n def printString(self, s, ch, count):\\n i = 0\\n while i < len(s) and count != 0:\\n if s[i] == ch:\\n count -= 1\\n i += 1\\n\\n result = s[i:]\\n return result if result != \\\"\\\" else \\\"\\\"\\n\",\n \"updated_at_timestamp\": 1727947200,\n \"user_code\": \"#User function Template for python3\\nclass Solution:\\n\\tdef printString(self, s, ch, count):\\n\\t\\t# code here\"\n}"},"test_cases":{"kind":"string","value":"eJztW9tOwkAQ9cEPIX0mBmJ48cW0VPF+v7R1jaEXoFyWAi2UGhM/Qj/HNz/MgkRjQoEF7AXOCRkmOz3LbDLM7M7C6+b75+7GENKHrzw8cya1HJvbSXFZQouqphsQ6ycIVQnNcukUZ7iWodmG/tR07FFgRO0cREQxwb2kU38ThAcAwIqDUNevBpmAcjAuLxQH8N8IzbGwIs9xEBGVFm0QYEEbjvG1Z8gslStmtVZv0KblV6PgPcvkCaBBg7aqGqH+KxdUvqL3D1r4ETG9nLTaHdvp9ty+BwsssMACyyyW7214huW0KEmSLMuKovA8LwhCPp8XRRGDCR0kVCZ0mykAGlTtaq5X7Oh+SPkRZTVNp2+3jV6rZ7TtvmM2rXqtWimX9E7Rc7WuShu/j/xYRrMwcUaWwM+ffYr5fF4GOWrnCa2xfuOD0wcv5MW9/cLB4dHxyenZ+cXl1fXN7d29JCvggANO/DmEFiZ0ixO2GHDmDQJcFgLA2oH9rjCGRxgMsgxKix7/BhMp0a8jrEF+uZMKcVjT4kEQdeICAODfMcdviWJ8zFkLjhxn58BJNAfNInDGNotwJRTilZDD6MDy74IgGEUMXFhY4F9GCIoxQbF6xaCOahBiL1CJQTssYc1AHt1AAIgxpvfNHt+2vgBEolJ7"}}},{"rowIdx":792,"cells":{"question_id":{"kind":"number","value":704973,"string":"704,973"},"question_title":{"kind":"string","value":"Pasha and Primes"},"question_content":{"kind":"string","value":"Given an array of N integers and another array R containing Q queries(of l and r). Answer all Q queries asking the number of primes in the subarray ranging from l to r (both inclusive).Note: A is 0-based but the queries will be 1-based.\nExamples:\nInput:\nN=5,Q=3\nA={2,5,6,7,8}\nR={{1,3},{2,5},{3,3}}\n\nOutput:\n2 2 0\n\nExplanation:\n\nThere are 2 primes in the range [1,3], \nwhich are 2 and 5.\nThere are 2 primes in the range [2,5],\nwhich are 5 and 7.\nThere are no primes in the range [3,3].\nInput:\nN=5,Q=3\nA={1,2,3,4,5}\nR={{1,4},{2,5},{2,3}}\n\nOutput:\n2 3 2\n\nExplanation:\n\nThere are 2 primes in range [1,4],\nwhich are 2 and 3.\nThere are 3 primes in the range [2,5],\nwhich are 2,3 and 5.\nThere are 2 primes in the range [3,3],\nwhich are 2 and 3.\n\nNote:Max(A[i]) represents the maximum value in the array A\nConstraints:\n\n1<=N,Q,A[i]<=10**6\n\n1<=l<=r<=N"},"dataset":{"kind":"string","value":"geeksforgeeks"},"difficulty":{"kind":"string","value":"Medium"},"java":{"kind":"string","value":"{\n \"class_name\": \"Solution\",\n \"created_at_timestamp\": 1615292571,\n \"func_sign\": [\n \"ArrayList<Integer> primeRange(int N, int Q, int A[], int R[][])\"\n ],\n \"initial_code\": \"// Initial Template for Java\\n\\nimport java.io.*;\\nimport java.util.*;\\n\\nclass GFG {\\n public static void main(String args[]) throws IOException {\\n BufferedReader read =\\n new BufferedReader(new InputStreamReader(System.in));\\n int t = Integer.parseInt(read.readLine());\\n while (t-- > 0) {\\n String S[] = read.readLine().split(\\\" \\\");\\n int N = Integer.parseInt(S[0]);\\n int Q = Integer.parseInt(S[1]);\\n String S1[] = read.readLine().split(\\\" \\\");\\n int A[] = new int[N];\\n for (int i = 0; i < N; i++) A[i] = Integer.parseInt(S1[i]);\\n int R[][] = new int[Q][2];\\n for (int i = 0; i < Q; i++) {\\n String S2[] = read.readLine().split(\\\" \\\");\\n R[i][0] = Integer.parseInt(S2[0]);\\n R[i][1] = Integer.parseInt(S2[1]);\\n }\\n Solution ob = new Solution();\\n ArrayList<Integer> ans = ob.primeRange(N, Q, A, R);\\n for (int i : ans) System.out.print(i + \\\" \\\");\\n System.out.println();\\n \\nSystem.out.println(\\\"~\\\");\\n}\\n }\\n}\",\n \"script_name\": \"GFG\",\n \"solution\": \"None\",\n \"updated_at_timestamp\": 1729753320,\n \"user_code\": \"// User function Template for Java\\n\\nclass Solution {\\n ArrayList<Integer> primeRange(int N, int Q, int A[], int R[][]) {\\n // R is a 2D array with dimensions Qx2\\n // code here\\n }\\n}\"\n}"},"python":{"kind":"string","value":"{\n \"class_name\": \"Solution\",\n \"created_at_timestamp\": 1615292571,\n \"func_sign\": [\n \"primeRange(self,N,Q,A,R)\"\n ],\n \"initial_code\": \"# Initial Template for Python 3\\n\\nimport math\\n\\nif __name__ == '__main__':\\n t = int(input())\\n for _ in range(t):\\n N, Q = map(int, input().strip().split(\\\" \\\"))\\n A = list(map(int, input().strip().split(\\\" \\\")))\\n R = []\\n for i in range(Q):\\n temp = list(map(int, input().strip().split(\\\" \\\")))\\n R.append(temp)\\n ob = Solution()\\n ans = ob.primeRange(N, Q, A, R)\\n for i in ans:\\n print(i, end=\\\" \\\")\\n print()\\n print(\\\"~\\\")\\n\",\n \"solution\": \"class Solution:\\n def primeRange(self, N, Q, A, R):\\n sieve = [0]*1000005\\n sieve[0] = 1\\n sieve[1] = 1\\n # using sieve of erasthothenes\\n for i in range(2, 1000005):\\n if sieve[i] == 0:\\n j = 2*i\\n while j < 1000005:\\n sieve[j] = 1\\n j += i\\n temp = [0]*(N+1)\\n # using prefix array\\n for i in range(N):\\n if sieve[A[i]] == 0:\\n temp[i+1] = 1\\n for i in range(1, N+1):\\n temp[i] += temp[i-1]\\n ans = []\\n for i in range(Q):\\n l = R[i][0]\\n r = R[i][1]\\n ans.append(temp[r]-temp[l-1])\\n return ans\\n\",\n \"updated_at_timestamp\": 1729753320,\n \"user_code\": \"#User function Template for python3\\n\\nclass Solution:\\n def primeRange(self,N,Q,A,R):\\n #R is a 2D array of dimensions Qx2\\n #code here\"\n}"},"test_cases":{"kind":"string","value":"eJy1VsuO00AQ5MCJr2j5vELTPW++BIkgDpADF7OHrLQC7Qr+Af6X6p5xoo0Ya8M6tuJ44nFXdU11T36+/vPrzSs73n/HzYcf09f59u4wvaOJdzM7irgysSfOxJXEk1TyTD5TYAoej4mdXjHTU97NycaBwm6ebmja39/uPx/2Xz59uzsskRHWTqbd/IhpDzd0Bhz19egI2BIVL2SKnpKjXKl4qmDjFBnEXMU0fAvARWmExgiPo9JJQyIIuMaikNdgiQoBAmSEOFhQpqLZJgWUYXhHeo5SlPa6B4NMA41NXQDErjHeyPZDUALFbkciI76dKvSAgzgNA4nBImBaApMlV7Z0fcuYOBm5YvyMSrt2oXUQT3J7FU5fL8Z37IQCWD2BZyTGPIPhGJcCnnAa+NZFtAIGJGzSYdXc4tAjx0ZO5TViyndAqakwpNJLwtlBFQfcGE8j2FNsSEGHasu4jFKlpCMbnEpHLiidAJnYPgN+vvFbt1Ur3V5TEazgrEyZKfteX6U+LbG8lJnFbrIqTmoDtzhgrCuwu5UANlzoaM6BRA1aOrxWtEZPnUrpdNSnmKdW0zwVwBAwT5NWvyJzFq1dNTTmiS5JMAfHY2HFdUfIShlbpxJqbeLUJNJiSpgNi5aaL4+66WoXu/WrRYyFXushZ/15qwZdrSjjGPhJ4+BndQ7euHX0TaT1Dr9SsM/bStIWe0m4dC8pW20mLzVCS/h/7fCv5Mp2O+VLkwtbZKeN40r/BM4dCjdey6ViJXPx/y4pVy6Xj7/f/gWCiJ/I"}}},{"rowIdx":793,"cells":{"question_id":{"kind":"number","value":702954,"string":"702,954"},"question_title":{"kind":"string","value":"Max value after m range operation"},"question_content":{"kind":"string","value":"Given an array arr of size n, with all initial values set to 0, the task is to perform a series of range increment operations as described below:\nExamples:\nInput:\nn = 5, a[] = [0, 1, 2], b[] = [1, 4, 3], k[] = [100, 100, 100]\n\nOutput:\n200\n\nExplanation:\n\nInitially, arr = [0, 0, 0, 0, 0]\nAfter the first operation: arr = [100, 100, 0, 0, 0]\nAfter the second operation: arr = [100, 200, 100, 100, 100]\nAfter the third operation: arr = [100, 200, 200, 200, 100]\nThe maximum element after all operations is 200.\nInput:\nn = 4, a[] = [1, 0, 3], b[] = [2, 0, 3], k[] = [603, 286, 882]\n\nOutput:\n882\n\nExplanation:\n\nInitially, arr = [0, 0, 0, 0]\nAfter the first operation: arr = [0, 603, 603, 0]\nAfter the second operation: arr = [286, 603, 603, 0]\nAfter the third operation: arr = [286, 603, 603, 882]\nThe maximum element after all operations is 882.\n\nConstraints:\n1 ≤ n ≤ 10**6\n1 ≤ a.size() = b.size() = k.size() ≤ 10**6\n0 ≤ a\ni ≤ b\ni≤ n-1\n0 ≤ k\ni≤ 10**6"},"dataset":{"kind":"string","value":"geeksforgeeks"},"difficulty":{"kind":"string","value":"Medium"},"java":{"kind":"string","value":"{\n \"class_name\": \"Solution\",\n \"created_at_timestamp\": 1728666671,\n \"func_sign\": [\n \"public int findMax(int n, int[] a, int[] b, int[] k)\"\n ],\n \"initial_code\": \"import java.util.*;\\n\\npublic class Main {\\n public static void main(String[] args) {\\n Scanner scanner = new Scanner(System.in);\\n\\n int t = Integer.parseInt(scanner.nextLine()); // Read the number of test cases\\n\\n while (t-- > 0) {\\n int n = Integer.parseInt(scanner.nextLine()); // Read the size of the array\\n\\n // Read array a\\n String[] aInput = scanner.nextLine().split(\\\" \\\");\\n int[] a = new int[aInput.length];\\n for (int i = 0; i < aInput.length; i++) {\\n a[i] = Integer.parseInt(aInput[i]);\\n }\\n\\n // Read array b\\n String[] bInput = scanner.nextLine().split(\\\" \\\");\\n int[] b = new int[bInput.length];\\n for (int i = 0; i < bInput.length; i++) {\\n b[i] = Integer.parseInt(bInput[i]);\\n }\\n\\n // Read array k\\n String[] kInput = scanner.nextLine().split(\\\" \\\");\\n int[] k = new int[kInput.length];\\n for (int i = 0; i < kInput.length; i++) {\\n k[i] = Integer.parseInt(kInput[i]);\\n }\\n\\n Solution solution = new Solution();\\n System.out.println(solution.findMax(n, a, b, k));\\n System.out.println(\\\"~\\\");\\n }\\n scanner.close();\\n }\\n}\\n\",\n \"script_name\": \"Main\",\n \"solution\": \"//Back-end complete function template in Java\\nclass Solution {\\n // Function to find the maximum value after applying given operations.\\n public int findMax(int n, int[] a, int[] b, int[] k) {\\n // Creating an array to store the changes made at each index.\\n long[] arr = new long[n + 1]; // Initialize with 0 values\\n\\n // Get the number of operations (size of a, b, or k).\\n int m = a.length;\\n\\n // Looping through each operation.\\n for (int i = 0; i < m; i++) {\\n // Getting the lower and upper bounds of the operation.\\n int lowerbound = a[i];\\n int upperbound = b[i];\\n\\n // Adding the value of the operation to the lower bound index.\\n arr[lowerbound] += k[i];\\n\\n // Subtracting the value of the operation from the upper bound + 1 index.\\n if (upperbound + 1 < n) {\\n arr[upperbound + 1] -= k[i];\\n }\\n }\\n\\n // Initializing variables for cumulative sum and result.\\n long sum = 0;\\n long res = Long.MIN_VALUE;\\n\\n // Looping through each index and updating the cumulative sum and result.\\n for (int i = 0; i < n; i++) {\\n sum += arr[i];\\n res = Math.max(res, sum);\\n }\\n\\n // Returning the maximum value after all operations.\\n return (int)res; // Return as an int\\n }\\n}\",\n \"updated_at_timestamp\": 1730273304,\n \"user_code\": \"// User function Template for Java\\n\\nclass Solution {\\n public int findMax(int n, int[] a, int[] b, int[] k) {\\n // code here\\n }\\n}\\n\"\n}"},"python":{"kind":"string","value":"{\n \"class_name\": \"Solution\",\n \"created_at_timestamp\": 1728666671,\n \"func_sign\": [\n \"find_max(self, n, a, b, k)\"\n ],\n \"initial_code\": \"if __name__ == \\\"__main__\\\":\\n t = int(input()) # Read the number of test cases\\n\\n for _ in range(t):\\n n = int(input()) # Read the size of the array\\n\\n # Read array a\\n a = list(map(int, input().split()))\\n\\n # Read array b\\n b = list(map(int, input().split()))\\n\\n # Read array k\\n k = list(map(int, input().split()))\\n\\n # Create an instance of Solution and call the method\\n solution = Solution()\\n print(solution.find_max(n, a, b, k))\\n print(\\\"~\\\")\\n\",\n \"solution\": \"class Solution:\\n\\n def find_max(self, n, a, b, k):\\n # Creating an array to store the changes made at each index.\\n arr = [0] * (n + 1) # Initialize with 0 values\\n\\n # Get the number of operations (size of a, b, or k).\\n m = len(a)\\n\\n # Looping through each operation.\\n for i in range(m):\\n # Getting the lower and upper bounds of the operation.\\n lowerbound = a[i]\\n upperbound = b[i]\\n\\n # Adding the value of the operation to the lower bound index.\\n arr[lowerbound] += k[i]\\n\\n # Subtracting the value of the operation from the upper bound + 1 index.\\n if upperbound + 1 < n:\\n arr[upperbound + 1] -= k[i]\\n\\n # Initializing variables for cumulative sum and result.\\n sum_value = 0\\n res = float('-inf')\\n\\n # Looping through each index and updating the cumulative sum and result.\\n for i in range(n):\\n sum_value += arr[i]\\n res = max(res, sum_value)\\n\\n # Returning the maximum value after all operations.\\n return res\\n\",\n \"updated_at_timestamp\": 1730273304,\n \"user_code\": \"class Solution:\\n def find_max(self, n, a, b, k):\\n # code here\"\n}"},"test_cases":{"kind":"string","value":"eJzNVcGOwiAQ9WBivPgNL5yNKbRV65eYiNmD9rAX1kNNTIzGj9D/tWUsca1gqbsqkL4Ghsmb4Q0c2qdet6XbtJP/zLbsW63WGZuAcanyEejBA91YHyzdrNJFli6/ftZZaUmrUu2lYrs+bpyUqwE4BEJEiDHECGMkUiVFC6CBEwiCkCAiiAmGBCOCMUHuhqPSrWStPAuKlZ5TRKWbqPBH6M6sjXJcMBaIivhDDU28O/Nx58juTr40HzbGpVxt2515NOdt4rua9XQo9NbLp15owhmaoDJ8thK9FP5kSdk43prVtZNKJfVML1LwKJB/Uo01YZ90BT2sueShMm1Sd+i0sVI/9jI2Eb2df4MX1Kve35EBw7JWCn49Bt5xzY+DM09/Pvo="}}},{"rowIdx":794,"cells":{"question_id":{"kind":"number","value":703399,"string":"703,399"},"question_title":{"kind":"string","value":"Remove Duplicates from unsorted array"},"question_content":{"kind":"string","value":"Given an array arr of integers which may or may not contain duplicate elements. Your task is to remove duplicate elements.\nExamples:\nInput:\narr[] = [1, 2, 3, 1, 4, 2]\n\nOutput:\n[1, 2, 3, 4]\n\nExplanation: \n2 and 1 have more than 1 occurence.\nInput:\narr[] = [1, 2, 3, 4]\n\nOutput:\n[1, 2, 3, 4]\n\nExplanation: \nThere is no duplicate element.\n\nConstraints:\n1<=arr.size()<=10**6\n1<=arr[i]<=10**5"},"dataset":{"kind":"string","value":"geeksforgeeks"},"difficulty":{"kind":"string","value":"Easy"},"java":{"kind":"string","value":"{\n \"class_name\": \"Solution\",\n \"created_at_timestamp\": 1615292571,\n \"func_sign\": [\n \"static ArrayList<Integer> removeDuplicate(int arr[])\"\n ],\n \"initial_code\": \"// Initial Template for Java\\n\\nimport java.io.*;\\nimport java.lang.*;\\nimport java.util.*;\\n\\nclass Main {\\n public static void main(String args[]) throws IOException {\\n BufferedReader read = new BufferedReader(new InputStreamReader(System.in));\\n int t = Integer.parseInt(read.readLine());\\n\\n while (t-- > 0) {\\n\\n ArrayList<Integer> array1 = new ArrayList<Integer>();\\n String line = read.readLine();\\n String[] tokens = line.split(\\\" \\\");\\n for (String token : tokens) {\\n array1.add(Integer.parseInt(token));\\n }\\n ArrayList<Integer> v = new ArrayList<Integer>();\\n int[] arr = new int[array1.size()];\\n int idx = 0;\\n for (int i : array1) arr[idx++] = i;\\n\\n v = new Solution().removeDuplicate(arr);\\n\\n for (int i = 0; i < v.size(); i++) System.out.print(v.get(i) + \\\" \\\");\\n\\n System.out.println();\\n\\n System.out.println(\\\"~\\\");\\n }\\n }\\n}\\n\",\n \"script_name\": \"Main\",\n \"solution\": \"None\",\n \"updated_at_timestamp\": 1729753320,\n \"user_code\": \"// User function Template for Java\\n\\nclass Solution {\\n\\n static ArrayList<Integer> removeDuplicate(int arr[]) {\\n // code here\\n }\\n}\"\n}"},"python":{"kind":"string","value":"{\n \"class_name\": \"Solution\",\n \"created_at_timestamp\": 1615292571,\n \"func_sign\": [\n \"removeDuplicate(self, arr)\"\n ],\n \"initial_code\": \"# Initial Template for Python 3\\n\\nif __name__ == \\\"__main__\\\":\\n t = int(input())\\n while t > 0:\\n arr = list(map(int, input().split()))\\n ob = Solution()\\n ans = ob.removeDuplicate(arr)\\n print(*ans)\\n print(\\\"~\\\")\\n t -= 1\\n\",\n \"solution\": \"# User function Template for python3\\nclass Solution:\\n\\n def removeDuplicate(self, arr):\\n # code here\\n s = set()\\n v = []\\n\\n # Traverse the input list\\n for item in arr:\\n # If not present, then put it in\\n # the set and add it to the result list\\n if item not in s:\\n s.add(item)\\n v.append(item)\\n\\n return v\\n\",\n \"updated_at_timestamp\": 1729753320,\n \"user_code\": \"#User function Template for python3\\n\\nclass Solution:\\n def removeDuplicate(self, arr):\\n # code here\\n \\n\\n\"\n}"},"test_cases":{"kind":"string","value":"eJy1VUtOwzAQZYE4x8jrGvmXxOUkSASxgCzYhC5SCQmBOARckh03YPxCK9FkRi1VHekpn3nzfXbezz+/L86wrr/45ubFPPar9WCuyPi2946q6WUWZLrnVXc/dA93T+thY8/Gbf/W9uZ1QRM/ngJFSsyvqaFMS/JOdjSxlhxX7KYsWpYFzMAGWAMrYAJGYAB6ILgZ3AxuBjfXUnqnjCnUGdwYkwIwAhOwAtbABpjH5IC/mR5DFtpwZEqiUthC1IVCY8kU0RTZFOEkXahbfcm6qko1XBahUHJkGS0/WH5n+ZP9ayGrZR9PQh5RbEbUOqj3UGu+wtPiqeEkondbuuIBVlMH3DOBMTdNcThCbu5/VdmAI0EKt9e+xtQP39zj+XPqHT47Cn5Zji4vuMG32W6lmNIBU+Ridv5EOyrS/00bBhK5/bj8ASRByKM="}}},{"rowIdx":795,"cells":{"question_id":{"kind":"number","value":714325,"string":"714,325"},"question_title":{"kind":"string","value":"Total Cuts"},"question_content":{"kind":"string","value":"You are given an array A of N integers and an integer K, and your task is to find the total number of cuts that you can make such that for each cut these two conditions are satisfied\r1. A cut divides an array into two parts equal or unequal length (non-zero).\r2. Sum of the largest element in the left part and the smallest element in the right part is greater than or equal to K.\nExamples:\nInput:\nN=3\nK=3\nA[]={1,2,3}\nOutput:\n2\n\nExplanation:\n\nTwo ways in which array is divided to satisfy above conditions are:\n{1} and {2,3} -> 1+2>=3(satisfies the condition)\n{1,2} and {3} -> 2+3>=3(satisfies the condition)\nInput:\nN=5\nK=5\nA[]={1,2,3,4,5}\nOutput:\n3\n\nExplanation:\n\n{1,2} and {3,4,5} -> 2+3>=5\n{1,2,3} and {4,5} -> 3+4>=5\n{1,2,3,4} and {5} -> 4+5>=5\n\nConstraints:\n\n1 <= N <= 10^6\n\n0 <= K <= 10^6\n\n0 <= A[i] <= 10^6"},"dataset":{"kind":"string","value":"geeksforgeeks"},"difficulty":{"kind":"string","value":"Easy"},"java":{"kind":"string","value":"{\n \"class_name\": \"Solution\",\n \"created_at_timestamp\": 1679290094,\n \"func_sign\": [\n \"public static int totalCuts(int N, int K, int[] A)\"\n ],\n \"initial_code\": \"import java.io.*;\\nimport java.util.*;\\nclass IntArray\\n{\\n public static int[] input(BufferedReader br, int n) throws IOException\\n {\\n String[] s = br.readLine().trim().split(\\\" \\\");\\n int[] a = new int[n];\\n for(int i = 0; i < n; i++)\\n a[i] = Integer.parseInt(s[i]);\\n\\n return a;\\n }\\n\\n public static void print(int[] a)\\n {\\n for(int e : a)\\n System.out.print(e + \\\" \\\");\\n System.out.println();\\n }\\n\\n public static void print(ArrayList<Integer> a)\\n {\\n for(int e : a)\\n System.out.print(e + \\\" \\\");\\n System.out.println();\\n }\\n}\\n\\nclass GFG {\\n public static void main(String[] args) throws IOException {\\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\\n int t;\\n t = Integer.parseInt(br.readLine());\\n while(t-- > 0){\\n \\n int N;\\n N = Integer.parseInt(br.readLine());\\n \\n \\n int K;\\n K = Integer.parseInt(br.readLine());\\n \\n \\n int[] A = IntArray.input(br, N);\\n \\n Solution obj = new Solution();\\n int res = obj.totalCuts(N, K, A);\\n \\n System.out.println(res);\\n \\n \\nSystem.out.println(\\\"~\\\");\\n}\\n }\\n}\\n\",\n \"script_name\": \"GFG\",\n \"solution\": \"//Back-end complete function Template for Java\\nclass Solution\\n{\\n public static int totalCuts(int N,int K,int A[])\\n {\\n int small[]=new int[N];\\n int large[]=new int[N];\\n large[0]=A[0];\\n for(int i=1;i<N;i++){\\n large[i]=Math.max(large[i-1],A[i]);\\n }\\n small[N-1]=A[N-1];\\n for(int i=N-2;i>=0;i--){\\n small[i]=Math.min(small[i+1],A[i]);\\n }\\n int ans=0;\\n for(int i=0;i<N-1;i++){\\n if(large[i]+small[i+1]>=K){\\n ans++;\\n }\\n }\\n return ans;\\n }\\n}\",\n \"updated_at_timestamp\": 1729753320,\n \"user_code\": \"class Solution {\\n public static int totalCuts(int N, int K, int[] A) {\\n // code here\\n }\\n}\\n \\n\"\n}"},"python":{"kind":"string","value":"{\n \"class_name\": \"Solution\",\n \"created_at_timestamp\": 1679290094,\n \"func_sign\": [\n \"totalCuts(self, N : int, K : int, A : List[int]) -> int\"\n ],\n \"initial_code\": \"class IntArray:\\n def __init__(self) -> None:\\n pass\\n\\n def Input(self, n):\\n arr = [int(i) for i in input().strip().split()] # array input\\n return arr\\n\\n def Print(self, arr):\\n for i in arr:\\n print(i, end=\\\" \\\")\\n print()\\n\\n\\nif __name__ == \\\"__main__\\\":\\n t = int(input())\\n for _ in range(t):\\n N = int(input())\\n K = int(input())\\n A = IntArray().Input(N)\\n obj = Solution()\\n res = obj.totalCuts(N, K, A)\\n print(res)\\n print(\\\"~\\\")\\n\",\n \"solution\": \"from typing import List\\n\\n\\nclass Solution:\\n def totalCuts(self, N: int, K: int, A: List[int]) -> int:\\n # Initializing the arrays to store the maximum and minimum values\\n # encountered so far\\n small = [0]*N\\n large = [0]*N\\n large[0] = A[0]\\n\\n # calculating the maximum value encountered so far from left to right\\n for i in range(1, N):\\n large[i] = max(large[i-1], A[i])\\n\\n small[-1] = A[-1]\\n # calculating the minimum value encountered so far from right to left\\n for i in range(N-2, -1, -1):\\n small[i] = min(small[i+1], A[i])\\n\\n ans = 0\\n # checking if the sum of the largest value encountered so far\\n # and the smallest value encountered after that is greater than or equal to K\\n for i in range(N-1):\\n if large[i] + small[i+1] >= K:\\n ans += 1\\n\\n return ans\\n\",\n \"updated_at_timestamp\": 1729753320,\n \"user_code\": \"from typing import List\\nclass Solution:\\n def totalCuts(self, N : int, K : int, A : List[int]) -> int:\\n # code here\\n \\n\"\n}"},"test_cases":{"kind":"string","value":"eJy1lc1KxEAQhBUEfYwi50W65yeZ8UkEIx50D17iHrIgiOJD6Pvak3V3WTalUdcMQ3KYqe76qiGvJ+9np0fDc3lsH1dP1X23WPbVBSptOxXb0TYcPAIiajRIyFCpZqjmj4v5bT+/u3lY9p+3fNu9tF31PMOuVL1Si9gsIhCJQGMCru1KI8maqE0iEIlAJJw14IgdqEId1EMDNEJraANN0AzHzCZSqDCLhZ3YXXhBEERBLWgESZCtnJSStu2A2gm1IxpZIWVYC5JCBtvltouoCRHL64zUoASD4wyPRyYyNZEx82nwXnrJNGiWkh8UIgSMhiM30yrixoqGYUCSdU8ndZSCsNNTQtaRlONBYmbJTMLFctrHZZ19RYxxJ92tGe2w+iWwaU7HI52c6MF94DsjP3My1qLI/ihYJTrHbBj+McONd3v9IcdJ7lvyp5hI5frt/AOaDeXP"}}},{"rowIdx":796,"cells":{"question_id":{"kind":"number","value":702983,"string":"702,983"},"question_title":{"kind":"string","value":"Palindrome Sentence"},"question_content":{"kind":"string","value":"Given a single sentence s, check if it is a palindrome or not. Ignore white spaces and any other character you may encounter.\nExamples:\nInput:\ns = race car.\n\nOutput:\n1 \n\nExplanation:\nprocessing str gives us\n\"racecar\" which is a palindrome.\nInput:\ns = hello world.\n\nOutput:\n0\n\nExplanation:\nprocessing str gives us\n\"helloworld\" which is not a palindrome.\n\n"},"dataset":{"kind":"string","value":"geeksforgeeks"},"difficulty":{"kind":"string","value":"Easy"},"java":{"kind":"string","value":"{\n \"class_name\": \"Solution\",\n \"created_at_timestamp\": 1731309703,\n \"func_sign\": [\n \"public boolean sentencePalindrome(String s)\"\n ],\n \"initial_code\": \"import java.io.*;\\nimport java.util.*;\\n\\nclass GFG {\\n public static void main(String args[]) throws IOException {\\n Scanner sc = new Scanner(System.in);\\n int t = Integer.parseInt(sc.nextLine());\\n\\n while (t > 0) {\\n String s = sc.nextLine();\\n Solution ob = new Solution();\\n if (ob.sentencePalindrome(s))\\n System.out.println(\\\"true\\\");\\n else\\n System.out.println(\\\"false\\\");\\n t--;\\n }\\n }\\n}\",\n \"script_name\": \"GFG\",\n \"solution\": \"class Solution {\\n public boolean sentencePalindrome(String s) {\\n int i = 0, j = s.length() - 1;\\n while (i < j) {\\n // Skip non-alphanumeric characters\\n if (!Character.isLetterOrDigit(s.charAt(i))) {\\n i++;\\n } else if (!Character.isLetterOrDigit(s.charAt(j))) {\\n j--;\\n } else {\\n // Compare characters case-insensitively\\n if (Character.toLowerCase(s.charAt(i)) != Character.toLowerCase(s.charAt(j))) {\\n return false;\\n }\\n i++;\\n j--;\\n }\\n }\\n return true;\\n }\\n}\\n\",\n \"updated_at_timestamp\": 1731309703,\n \"user_code\": \"class Solution {\\n\\n public boolean sentencePalindrome(String s) {\\n // code here\\n }\\n}\"\n}"},"python":{"kind":"string","value":"{\n \"class_name\": \"Solution\",\n \"created_at_timestamp\": 1731309703,\n \"func_sign\": [\n \"sentencePalindrome(self, s)\"\n ],\n \"initial_code\": \"# Initial Template for Python 3\\n\\nif __name__ == \\\"__main__\\\":\\n t = int(input())\\n for tc in range(t):\\n s = input()\\n ob = Solution()\\n if ob.sentencePalindrome(s):\\n print(\\\"true\\\")\\n else:\\n print(\\\"false\\\")\\n\",\n \"solution\": \"# Back-end complete function Template for Python 3\\nclass Solution:\\n def sentencePalindrome(self, s):\\n l = 0\\n h = len(s) - 1\\n\\n while l <= h:\\n # If there is another symbol in left of sentence\\n if s[l] < 'a' or s[l] > 'z':\\n l += 1\\n\\n # If there is another symbol in right of sentence\\n elif s[h] < 'a' or s[h] > 'z':\\n h -= 1\\n\\n # If characters are equal\\n elif s[l] == s[h]:\\n l += 1\\n h -= 1\\n\\n else:\\n return False\\n\\n return True\\n\",\n \"updated_at_timestamp\": 1731309703,\n \"user_code\": \"#User function Template for python3\\nclass Solution:\\n\\tdef sentencePalindrome(self, s):\\n\\t\\t# your code here\"\n}"},"test_cases":{"kind":"string","value":"eJytkkFLxDAQhT3o/3jmHBa8epGCi/TgKvSgYESm21EX0qS0aauI4I/Q/2uari6CIs1uLxko882bee9t/+PxYC981+SLmxexMlXrxDHEkTIJSjIShEqP75IMaYlL/5R0qIyQEPxU8dJxcWdbt269J92w//sq8RO4sPijxdXtrx1X1GDlwugatg6FQ4qG+pPp85NcM3qPTOXIwFznNJ2TOa5gDYxFxa6JuMS8Izmcc5DBjJzZ72nCeh1HbHZez3DRa5BjlM8o2ZFGb+tyOurU4sHL4SDszBYxd0ZGxpFXg0WSJRFB4Y6930UxeO5rE+1RlDshJ1vkY7zaoCBmclyWRqW7S9RA3TEtlRueUlsSk7VJ31Kj3dq4rVQc4Wu7//pu32efJ4LI3w=="}}},{"rowIdx":797,"cells":{"question_id":{"kind":"number","value":704853,"string":"704,853"},"question_title":{"kind":"string","value":"Knight Walk"},"question_content":{"kind":"string","value":"Given a square chessboard, the initial position of Knight and position of a target. Find out the minimum steps a Knight will take to reach the target position.If it cannot reach the target position return -1.\nExamples:\nInput:\nN=6\nknightPos[ ] = {4, 5}\ntargetPos[ ] = {1, 1}\n\nOutput:\n3\n\nExplanation:\n\nKnight takes 3 step to reach from\n(4, 5) to (1, 1):\n(4, 5) -> (5, 3) -> (3, 2) -> (1, 1).\nInput:\nN=8\nknightPos[ ] = {7, 7}\ntargetPos[ ] = {1, 5}\n\nOutput:\n4\n\nExplanation:\nKnight takes 4 steps to reach from\n(7, 7) to (1, 5):\n(4, 5) -> (6, 5) -> (5, 3) -> (7, 2) -> (1, 5).\n\nConstraints:\n1 <= N <= 1000\n1 <= Knight_pos(X, Y), Targer_pos(X, Y)<= N"},"dataset":{"kind":"string","value":"geeksforgeeks"},"difficulty":{"kind":"string","value":"Medium"},"java":{"kind":"string","value":"{\n \"class_name\": \"Solution\",\n \"created_at_timestamp\": 1615292571,\n \"func_sign\": [\n \"public int minStepToReachTarget(int KnightPos[], int TargetPos[], int N)\"\n ],\n \"initial_code\": \"import java.util.*;\\nimport java.lang.*;\\nimport java.io.*;\\nclass GFG\\n{\\n public static void main(String[] args) throws IOException\\n {\\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\\n int T = Integer.parseInt(br.readLine().trim());\\n while(T-->0)\\n {\\n int N = Integer.parseInt(br.readLine().trim());\\n String[] S1 = br.readLine().trim().split(\\\" \\\");\\n String[] S2 = br.readLine().trim().split(\\\" \\\");\\n int[] KnightPos = new int[2];\\n int[] TargetPos = new int[2];\\n for(int i = 0; i < 2; i++){\\n KnightPos[i] = Integer.parseInt(S1[i]);\\n TargetPos[i] = Integer.parseInt(S2[i]);\\n }\\n Solution obj = new Solution();\\n int ans = obj.minStepToReachTarget(KnightPos, TargetPos, N);\\n System.out.println(ans);\\n \\nSystem.out.println(\\\"~\\\");\\n}\\n }\\n}\\n\",\n \"script_name\": \"GFG\",\n \"solution\": \"// Back-end Complete function Template for JAVA\\n\\nclass Solution\\n{\\n boolean isValid(int x, int y, int N){\\n\\t\\treturn (x >=0 && x < N && y >=0 && y < N);\\n\\t}\\n\\t\\n public int minStepToReachTarget(int KnightPos[], int TargetPos[], int N)\\n {\\n KnightPos[0]--;\\n\\t\\tKnightPos[1]--;\\n\\t\\tTargetPos[0]--;\\n\\t\\tTargetPos[1]--;\\n\\t\\t\\n\\t\\t\\n\\t\\t// x and y direction, where a knight can move\\n int dx[] = { -2, -1, 1, 2, -2, -1, 1, 2 };\\n int dy[] = { -1, -2, -2, -1, 1, 2, 2, 1 };\\n \\n\\t\\tboolean vis[][] = new boolean[N][N];\\n\\t\\t\\n\\t\\tQueue<ArrayList<Integer>> q = new LinkedList<>(); \\n\\t\\tArrayList<Integer> temp = new ArrayList<>();\\n\\t\\ttemp.add(KnightPos[0]);\\n\\t\\ttemp.add(KnightPos[1]);\\n\\t\\ttemp.add(0);\\n\\t\\tq.add(temp);\\n\\t\\t\\n\\t\\tvis[KnightPos[0]][KnightPos[1]] = true;\\n\\t\\t\\n\\t\\twhile(!q.isEmpty())\\n\\t\\t{\\n\\t\\t ArrayList<Integer> temp2 = q.poll();\\n\\t\\t\\tint x = temp2.get(0);\\n\\t\\t\\tint y = temp2.get(1);\\n\\t\\t\\tint steps = temp2.get(2);\\n\\t\\t\\t\\n\\t\\t\\tif(x == TargetPos[0] && y == TargetPos[1])\\n\\t\\t\\t\\treturn steps;\\n\\t\\t\\t\\t\\n\\t\\t\\tfor(int i=0; i<8; i++)\\n\\t\\t\\t{\\n\\t\\t\\t\\tint n_x = x + dx[i];\\n\\t\\t\\t\\tint n_y = y + dy[i];\\n\\t\\t\\t\\tif(isValid(n_x, n_y, N) && !vis[n_x][n_y])\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t ArrayList<Integer> temp1 = new ArrayList<>();\\n \\t\\ttemp1.add(n_x);\\n \\t\\ttemp1.add(n_y);\\n \\t\\ttemp1.add(steps+1);\\n\\t\\t\\t\\t\\tq.add(temp1);\\n\\t\\t\\t\\t\\tvis[n_x][n_y] = true;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn -1;\\n }\\n}\",\n \"updated_at_timestamp\": 1729753320,\n \"user_code\": \"class Solution\\n{\\n public int minStepToReachTarget(int KnightPos[], int TargetPos[], int N)\\n {\\n // Code here\\n }\\n}\"\n}"},"python":{"kind":"string","value":"{\n \"class_name\": \"Solution\",\n \"created_at_timestamp\": 1615292571,\n \"func_sign\": [\n \"minStepToReachTarget(self, KnightPos, TargetPos, N)\"\n ],\n \"initial_code\": \"T = int(input())\\nfor i in range(T):\\n N = int(input())\\n KnightPos = list(map(int, input().split()))\\n TargetPos = list(map(int, input().split()))\\n obj = Solution()\\n ans = obj.minStepToReachTarget(KnightPos, TargetPos, N)\\n print(ans)\\n\",\n \"solution\": \"from collections import deque\\n\\n\\nclass Solution:\\n def isValid(self, x, y, N):\\n return (x >= 0 and x < N and y >= 0 and y < N)\\n\\n def minStepToReachTarget(self, KnightPos, TargetPos, N):\\n dxy = [[2, 1], [2, -1], [-2, 1], [-2, -1],\\n [1, 2], [1, -2], [-1, 2], [-1, -2]]\\n KnightPos[0] -= 1\\n KnightPos[1] -= 1\\n TargetPos[0] -= 1\\n TargetPos[1] -= 1\\n vis = [[False for i in range(N)] for j in range(N)]\\n q = deque()\\n q.append([KnightPos[0], KnightPos[1], 0])\\n vis[KnightPos[0]][KnightPos[1]] = True\\n while(len(q)):\\n cur = q.popleft()\\n x = cur[0]\\n y = cur[1]\\n steps = cur[2]\\n if(x == TargetPos[0] and y == TargetPos[1]):\\n return steps\\n for i in range(8):\\n n_x = x + dxy[i][0]\\n n_y = y + dxy[i][1]\\n if(self.isValid(n_x, n_y, N) and vis[n_x][n_y] == False):\\n q.append([n_x, n_y, steps + 1])\\n vis[n_x][n_y] = True\\n return -1\\n\",\n \"updated_at_timestamp\": 1727776457,\n \"user_code\": \"class Solution:\\n\\tdef minStepToReachTarget(self, KnightPos, TargetPos, N):\\n\\t\\t#Code here\"\n}"},"test_cases":{"kind":"string","value":"eJylk0sKwjAQhl3oPYasi0zSpFq9iGDEhXbhJnbRgiAFD6H3dVptVez0WUj4A8k3/zx6mz7Ws0nxbTSJ7VWcXJwmYgVCWicR0TqDCCYX+RHyTXggokscHZLouD+nyfuF72vrROZBHUWCbCcEQcATKh8GJQnJMFSjB/wkMsqDJqH5PJY8IgxDoGWdAjXEwst8mUw/QhFXkwGdC8nWwPcbqqgMwsKQoA3o0G8aTIlQphKsjT9Aa/dq7mvkwnLW64JyE/BD78gbFrbrq+8hGWWzc9r9frCmFlnqytg29SgWYxy7oIq0Rba7z5+7JH7I"}}},{"rowIdx":798,"cells":{"question_id":{"kind":"number","value":701276,"string":"701,276"},"question_title":{"kind":"string","value":"Unit Area of largest region of 1's"},"question_content":{"kind":"string","value":"Given a grid of dimension nxmcontaining 0s and 1s. Find the unit area of the largest region of 1s.\rRegion of 1's is a group of 1's connected 8-directionally (horizontally, vertically, diagonally).\r\nExamples:\nInput:\ngrid = {{1,1,1,0},{0,0,1,0},{0,0,0,1}}\n\nOutput:\n5\n\nExplanation: \nThe grid is-\n\n1 1 1\n 0\n0 0 \n1 \n0\n0 0 0 \n1\n\nThe largest region of 1's is colored\nin orange.\nInput:\ngrid = {{0,1}}\n\nOutput:\n1\n\nExplanation: \nThe grid is-\n0 \n1\n\nThe largest region of 1's is colored in \norange.\n\nConstraints:\n\n1 ≤ n, m ≤ 500"},"dataset":{"kind":"string","value":"geeksforgeeks"},"difficulty":{"kind":"string","value":"Medium"},"java":{"kind":"string","value":"{\n \"class_name\": \"Solution\",\n \"created_at_timestamp\": 1615292571,\n \"func_sign\": [\n \"public int findMaxArea(int[][] grid)\"\n ],\n \"initial_code\": \"import java.util.*;\\nimport java.lang.*;\\nimport java.io.*;\\nclass GFG\\n{\\n public static void main(String[] args) throws IOException\\n {\\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\\n int T = Integer.parseInt(br.readLine().trim());\\n while(T-->0)\\n {\\n String[] s = br.readLine().trim().split(\\\" \\\");\\n int n = Integer.parseInt(s[0]);\\n int m = Integer.parseInt(s[1]);\\n int[][] grid = new int[n][m];\\n for(int i = 0; i < n; i++){\\n String[] S = br.readLine().trim().split(\\\" \\\");\\n for(int j = 0; j < m; j++){\\n grid[i][j] = Integer.parseInt(S[j]);\\n }\\n }\\n Solution obj = new Solution();\\n int ans = obj.findMaxArea(grid);\\n System.out.println(ans);\\n \\nSystem.out.println(\\\"~\\\");\\n}\\n }\\n}\",\n \"script_name\": \"GFG\",\n \"solution\": \"None\",\n \"updated_at_timestamp\": 1730274045,\n \"user_code\": \"class Solution\\n{\\n //Function to find unit area of the largest region of 1s.\\n public int findMaxArea(int[][] grid)\\n {\\n // Code here\\n }\\n}\"\n}"},"python":{"kind":"string","value":"{\n \"class_name\": \"Solution\",\n \"created_at_timestamp\": 1615292571,\n \"func_sign\": [\n \"findMaxArea(self, grid)\"\n ],\n \"initial_code\": \"if __name__ == '__main__':\\n T = int(input())\\n for i in range(T):\\n n, m = map(int, input().split())\\n grid = []\\n for _ in range(n):\\n a = list(map(int, input().split()))\\n grid.append(a)\\n obj = Solution()\\n ans = obj.findMaxArea(grid)\\n print(ans)\\n print(\\\"~\\\")\\n\",\n \"solution\": \"from collections import deque\\n\\n\\nclass Solution:\\n\\n # Function to check whether the cell is within the matrix bounds.\\n def isValid(self, x, y, n, m):\\n return (x >= 0 and x < n and y >= 0 and y < m)\\n\\n # Function to find unit area of the largest region of 1s.\\n\\n def findMaxArea(self, grid):\\n n = len(grid)\\n m = len(grid[0])\\n\\n # These lists are used to get row and column numbers\\n # of 8 neighbours of a given cell.\\n dx = [-1, 1, 0, 0, 1, 1, -1, -1]\\n dy = [0, 0, 1, -1, 1, -1, 1, -1]\\n\\n # Queue to store the cell indexes which have grid value 1.\\n q = deque()\\n ans = 0\\n\\n # Traversing all the cells of the matrix.\\n for i in range(n):\\n for j in range(m):\\n\\n # If grid value is 1, we update the grid value as 0\\n # and push the cell indexes into queue.\\n if grid[i][j] == 1:\\n cnt = 1\\n grid[i][j] = 0\\n q.append([i, j])\\n\\n while len(q):\\n\\n # Storing the cell indexes at top of\\n # queue and popping them.\\n cur = q.popleft()\\n x = cur[0]\\n y = cur[1]\\n\\n # Iterating over the adjacent cells.\\n for k in range(8):\\n n_x = x + dx[k]\\n n_y = y + dy[k]\\n\\n # If indexes are within range and grid value is 1,\\n # we update the grid value as 0, increment counter\\n # and push the cell indexes into queue.\\n if self.isValid(n_x, n_y, n, m) and grid[n_x][n_y] == 1:\\n cnt = cnt + 1\\n grid[n_x][n_y] = 0\\n q.append([n_x, n_y])\\n\\n # Updating maximum area.\\n ans = max(ans, cnt)\\n\\n return ans\\n\",\n \"updated_at_timestamp\": 1730274045,\n \"user_code\": \"\\n\\nclass Solution:\\n\\n #Function to find unit area of the largest region of 1s.\\n\\tdef findMaxArea(self, grid):\\n\\t\\t#Code here\\n\"\n}"},"test_cases":{"kind":"string","value":"eJztWktu20AM7aIHGWgdFKRjBUhPEqAKski9yEbJwgYCFC1yiOYI2fWQtSWPxN+TrUWduJgYgcej4SP5huRwDL98fv1Tfer+bt62g28/qof2abOuvqaKm7ZOddNyou2LE++G3A2pabuZ3Yd+AfcLaL+WqotUrZ6fVvfr1fe7x806Yy6b9lfTVj8vkta0TMsenjMiCYXDIwR7CWB5K7w3NhvcjylDZos5uzVO7MfC13gljSs5sVCjSCH5aMQkqUhonTQJ0LC4RjTUiYed9OYYN6VRw6LeDk5+kTGTlFuswVlhiMiShklFYq8cC3lmDDtDaDZNy+h9jwmWj720MFGEfOCBYE1LClqO3hIXRCgKahAFC0oLGqMgCDY5H8WDdUTQ7xLMbAbbbfQ7pmhh9VCOxNhHnVGZAy322nLg9hNuHI4Li0g6Oq2VwiVPT6SaJaL33dkYUS3/BeE2yDSPTrUWMGboYpN9l2KivvnE9W45Hm1aDJi+znnyu3nptfVWLQWJdnWFEq1OuySMaPI1Rlgv9yt6N4VtpC+iLE4e0pUcc+6qXJxAUHjsG6wel3P5ky6WyA/lk80Zb5oNZMEYDjfDaGxYJGRInkT1WqKQ9iCuNYkEEIA7sML9tozFyDaag/Q/zNYwF/UAfu8ViA5LTLcA8L5YUQc4TXIorn3BGaPyBUUvMox0uZgyagDD7YpjKvYFkyxmUGOyQO1pl8iot58SQqooEkKLJ64N7nXOk7MZPt2tQc4LoHJt0JKgVP7DawPhHEN53DVAs/LyeA2lszq2syJSz0pvBZAtf4oxfM5FAKW3AuXMmqMZwySH4qW3mtVbnW/FBOpLySwlM0QuJROJl5I57zpKh29/8eyHnpx1/aOzPjpOfXKUc8MzhpZ7f8q5Uc4NgP2u5wb+6uP/OTqOXDr3q8MDPxzJ5Thn6bChuweHfjpy+/vLX0TddcA="}}},{"rowIdx":799,"cells":{"question_id":{"kind":"number","value":705474,"string":"705,474"},"question_title":{"kind":"string","value":"Overlapping rectangles"},"question_content":{"kind":"string","value":"Given two rectangles, find if the given two rectangles overlap or not. A rectangle is denoted by providing the x and y coordinates of two points: the left top corner and the right bottom corner of the rectangle. Two rectangles sharing a side are considered overlapping. (L1 and R1 are the extreme points of the first rectangle and L2 and R2 are the extreme points of the second rectangle).\nExamples:\nInput:\nL1=(0,10)\nR1=(10,0)\nL2=(5,5)\nR2=(15,0)\n\nOutput:\n1\n\nExplanation:\n\nThe rectangles overlap.\nInput:\nL1=(0,2)\nR1=(1,1)\nL2=(-2,0)\nR2=(0,-3)\n\nOutput:\n0\n\nExplanation:\n\nThe rectangles do not overlap.\n\nConstraints:\n-10**9\n<=x-coordinate,y-coordinate<=10**9"},"dataset":{"kind":"string","value":"geeksforgeeks"},"difficulty":{"kind":"string","value":"Easy"},"java":{"kind":"string","value":"{\n \"class_name\": \"Solution\",\n \"created_at_timestamp\": 1615292571,\n \"func_sign\": [\n \"int doOverlap(int L1[], int R1[], int L2[], int R2[])\"\n ],\n \"initial_code\": \"// Initial Template for Java\\n\\nimport java.io.*;\\nimport java.util.*;\\n\\nclass GFG {\\n public static void main(String args[]) throws IOException {\\n BufferedReader read =\\n new BufferedReader(new InputStreamReader(System.in));\\n int t = Integer.parseInt(read.readLine());\\n while (t-- > 0) {\\n String S[] = read.readLine().split(\\\" \\\");\\n int p[] = new int[2];\\n int q[] = new int[2];\\n int r[] = new int[2];\\n int s[] = new int[2];\\n p[0] = Integer.parseInt(S[0]);\\n p[1] = Integer.parseInt(S[1]);\\n q[0] = Integer.parseInt(S[2]);\\n q[1] = Integer.parseInt(S[3]);\\n r[0] = Integer.parseInt(S[4]);\\n r[1] = Integer.parseInt(S[5]);\\n s[0] = Integer.parseInt(S[6]);\\n s[1] = Integer.parseInt(S[7]);\\n Solution ob = new Solution();\\n int ans = ob.doOverlap(p, q, r, s);\\n System.out.println(ans);\\n \\nSystem.out.println(\\\"~\\\");\\n}\\n }\\n}\",\n \"script_name\": \"GFG\",\n \"solution\": \"// Back-end complete function Template for Java\\nclass Solution {\\n int doOverlap(int L1[], int R1[], int L2[], int R2[]) {\\n // If one rectangle is on left side of other\\n if (L1[0] > R2[0] || L2[0] > R1[0]) return 0;\\n // If one rectangle is above other\\n if (L1[1] < R2[1] || L2[1] < R1[1]) return 0;\\n return 1;\\n }\\n}\\n;\\n\",\n \"updated_at_timestamp\": 1729753320,\n \"user_code\": \"// User function Template for Java\\n\\nclass Solution {\\n int doOverlap(int L1[], int R1[], int L2[], int R2[]) {\\n // code here\\n }\\n};\"\n}"},"python":{"kind":"string","value":"{\n \"class_name\": \"Solution\",\n \"created_at_timestamp\": 1615292571,\n \"func_sign\": [\n \"doOverlap(self, L1, R1, L2, R2)\"\n ],\n \"initial_code\": \"# Initial Template for Python 3\\n\\nimport math\\n\\nif __name__ == '__main__':\\n t = int(input())\\n for _ in range(t):\\n p = [0] * 2\\n q = [0] * 2\\n r = [0] * 2\\n s = [0] * 2\\n p[0], p[1], q[0], q[1], r[0], r[1], s[0], s[1] = map(\\n int, input().strip().split(\\\" \\\"))\\n ob = Solution()\\n ans = ob.doOverlap(p, q, r, s)\\n print(ans)\\n print(\\\"~\\\")\\n\",\n \"solution\": \"# Back-end complete function Template for Python 3\\n\\nclass Solution:\\n\\n def doOverlap(self, L1, R1, L2, R2):\\n\\n # If one rectangle is on left side of other\\n if L1[0] > R2[0] or L2[0] > R1[0]:\\n return 0\\n\\n # If one rectangle is above other\\n if L1[1] < R2[1] or L2[1] < R1[1]:\\n return 0\\n\\n return 1\\n\",\n \"updated_at_timestamp\": 1729753320,\n \"user_code\": \"#User function Template for python3\\n\\nclass Solution:\\n \\n def doOverlap(self, L1, R1, L2, R2):\\n #code here\"\n}"},"test_cases":{"kind":"string","value":"eJzVVUtOxDAMZcGGW0RZT1DSjwScBIkiFtAFmzKLGWkkBOIQcCZ2nAk7aVOndT5lR+wZWYmbPtvP7sf518/FmV2332DcvcrnYX88yBsh627QwljVogUxrdC4p0UFogwqSDcYPS1BzOtpEUuR88AmLt6UOyH7075/PPRPDy/Hw4gLXvgOMMi/fNsJArxyIA3RCrUbFI90Eh5cBIZ7tYkAgOfxDnutalFBQgDZ+NkMshEkIbI5amhx4X5hsJwzbqcKSm5/qO5wjglFLWPKQOaZwF5QUH0Tj6/2aMeAVIUk1haxCd8L1Jh4sNypQs8w2AVlNF8bEauOITGwNGqjhM2ziG0+b67jCImJbe3psK54QXfF22kaHH6jOD0JOtcjqFFgPrkNImFP2nmGEAu6OzZkitvTn18xFnk6M6D+2jLpMZBv6jzxfIrH5IsapBHNlhxlvhyb+JJmSmwIM5+B2aSst/MSreS8LKgGi1BFSblyLPeMoVk52pAKnTO8W7rj5CiFUeYXTvnmf455SGO7JYsOXiqX95+Xv2w8amU="}}}],"truncated":false,"partial":false},"paginationData":{"pageIndex":7,"numItemsPerPage":100,"numTotalItems":1536,"offset":700,"length":100}},"jwt":"eyJhbGciOiJFZERTQSJ9.eyJyZWFkIjp0cnVlLCJwZXJtaXNzaW9ucyI6eyJyZXBvLmNvbnRlbnQucmVhZCI6dHJ1ZX0sImlhdCI6MTc3NjIzNzIwNywic3ViIjoiL2RhdGFzZXRzL0NvZGUtVFJFQVQvY29kZV9nZW5lcmF0aW9uIiwiZXhwIjoxNzc2MjQwODA3LCJpc3MiOiJodHRwczovL2h1Z2dpbmdmYWNlLmNvIn0.kUJarr-v99_QR8H6-mrQ7cpDMSU5vEIw9PwENOa417JcaFaZihndkR8kmlke9ueGDHlRoBIGlX0LLiitepS3BA","displayUrls":true,"splitSizeSummaries":[{"config":"default","split":"test","numRows":1536,"numBytesParquet":974461639}]},"discussionsStats":{"closed":0,"open":0,"total":0},"fullWidth":true,"hasGatedAccess":true,"hasFullAccess":true,"isEmbedded":false,"savedQueries":{"community":[],"user":[]}}">
question_id int64 700k 876k | question_title stringlengths 3 81 | question_content stringlengths 131 2.51k | dataset stringclasses 1
value | difficulty stringclasses 3
values | java dict | python dict | test_cases stringlengths 200 208M |
|---|---|---|---|---|---|---|---|
706,119 | Triplets with sum with given range | Given an array Arr[]of N distinct integers and a range from Lto R, the task is to count the number of triplets having a sum in the range [L, R].
Examples:
Input:
N = 4
Arr = {8 , 3, 5, 2}
L = 7, R = 11
Output:
1
Explanation:
There is only one triplet {2, 3, 5}
having sum 10 in range [7, 11].
Input:
N = 5
Arr = {5, 1... | geeksforgeeks | Medium | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"static int countTriplets(int Arr[], int N, int L, int R)"
],
"initial_code": "// Initial Template for Java\n\nimport java.io.*;\nimport java.util.*;\n\nclass GFG {\n public static void main(String args[]) throws IOException... | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"countTriplets(self, Arr, N, L, R)"
],
"initial_code": "# Initial Template for Python 3\n\nif __name__ == '__main__':\n t = int(input())\n for _ in range(t):\n N = int(input())\n Arr = input().split()\n ... | eJy9VUuOU0EMZMGGW1hvPYPabrs/nASJIBaQBZswi4w0EgJxCFiz45yU3Yk0A+lMBj0RyU9R4ld2lcvd357/+PXiWXxe/8SXN5+Xj7ub2/3yihbe7Dh5pES9d0QjJqFMSkaF6mYn/l/GY7miZXt3s32/33549+l2f4Tom93XzW75ckUPgVu866+SIgxREBXRvFzywv4rtym46AScDYE2jSp1YibOxEZciTsJKGQSI6kkaC+jxrREbm1SQ4YywE3kTMQGm2yDkdpgZTaYFRvsqg2GzYIldYv6/jBAip0XtNQZZ/EgUcqFtKEmVaGm1Aug... |
703,348 | Split Strings | Given a string S which consists of alphabets , numbers and special characters. You need to write a program to split the strings in three different strings S1, S2 and S3 such that the string S1 will contain all the alphabets present in S , the string S2 will contain all the numbers present in S and S3 will contain all s... | geeksforgeeks | Easy | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"static List<String> splitString(String S)"
],
"initial_code": "//Initial Template for Java\n\nimport java.io.*;\nimport java.util.*; \n\nclass GFG{\n public static void main(String args[]) throws IOException { \n Sca... | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"splitString(ob, S)"
],
"initial_code": "# Initial Template for Python 3\n\nif __name__ == '__main__':\n T = int(input())\n for _ in range(T):\n S = input()\n ob = Solution()\n ans = ob.splitString(S)... | eJy1Vl1v0lAY9sIrfwUt2wJjaAu0gIsJjOE2Y3RjEvdxGBlQRsWdFihfQ4jX3pno//VpSytVDrYyuCLk+XrPefqWr09/fn/2xPpcfMOX6wmvUr1v8C9DvEhovlYXE0kuFz5UmilJ3tq+OWqp6Ux2ZzfC74V4ZaQrdUNpVLW+MSeBASxQhIIJDtCEQgFcsAidEcpP90Jen6vxSMhmqrH4xXCQlqUXXyZlo5dKJqaEXJc6uihkK/sMQ1BBAhw4QqECPpigEApBSJkilX2GM5KdDZWScYm0iNg/0U4RGkkfrkYFZI9WYwxjm2YSTOjyccFm... |
700,360 | Sum of subset differences | Given a sorted array arr consisting of integers, find the sum of the difference between the last and the first element of each non-empty subset of arr.
Examples:
Input:
arr = [5,8]
Output:
3
Explanation:
There are 3 non-empty subsets possible for the given array
S = [5, 8]
:
Subset:
[5]
(The first and last eleme... | geeksforgeeks | Medium | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"long sumDiff(int arr[])"
],
"initial_code": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n int t = Integer.parseInt(scanner... | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"sumDiff(self, arr)"
],
"initial_code": "def main():\n T = int(input()) # Read the number of test cases\n\n while T > 0:\n a = list(map(\n int,\n input().strip().split())) # Convert input to... | eJy1lM9KxEAMxj2IzxF6XiXJdJqpTyJY8aB78FL3sAuCf/Ah9H1NYlcEO9kqWMrM0nZ+8+XLt/N6/P50cuTXxU5/XD42d+Nmt23OoUnDSECoNw5jRpCsEzBCnp41K2jWD5v1zXZ9e32/207ruJdhfBlGzj7JNDfPK/hGZ6Wj0RJCa0z9EqgFJuACKUPL1R2E0ZHUosyxydhodDQ+2g5oewSqhf3trNBOC1alVPSD3mdgUXJXx/k7MwFllkpmqWrqbBAbig29DaY9sBepopQ+GxYt7vWqLmVI0EKGDgQK9N57BTJQss5QBuqAtEsFqAeu... |
702,772 | Find the element that appears once in sorted array | Given a sorted array arr[] of size N. Find the element that appears only once in the array. All other elements appear exactly twice.
Examples:
Input:
N = 11
arr[] = {1, 1, 2, 2, 3, 3, 4, 50, 50, 65, 65}
Output:
4
Explanation:
4 is the only element that
appears exactly once.
| geeksforgeeks | Easy | {
"class_name": "Solution",
"created_at_timestamp": 1619079291,
"func_sign": [
"int findOnce(int arr[], int n)"
],
"initial_code": "//Initial Template for Java\n\nimport java.util.*;\n\npublic class GFG \n{\n public static void main(String args[]) \n {\n Scanner sc = new Scanner(System.in);\n... | {
"class_name": "Solution",
"created_at_timestamp": 1619079291,
"func_sign": [
"findOnce(self,arr : list, n : int)"
],
"initial_code": "# Initial Template for Python 3\n\nif __name__ == '__main__':\n t = int(input())\n\n for _ in range(t):\n n = int(input())\n arr = [int(x) for x in in... | eJzF1MFKxDAQBmAP4nMMPS+SZCZJ65MIVjzoHrzEPXRBEMWH0Cf15snJr1WQnbJ2C26+QNkynUw6zfPx6/vJEX7nb3px8dDcls12aM6o8X3xrJM8BR2sQyjqSDoy5b40K2rW95v19bC+ubrbDl+B0pcnvfm4ol9PizodVR4CMHmBCAmyMhPUZe3O0PUlOKo8BGAQChESZGihU2a2YNUTdLKjykMABoFInCBDC10lTpk5OVo5tXTxVAVgEIiQIJO00FXRgYeg7JeXrb3tS2dvUr21M0zXq71CE5F2YKSWWjPQ2iL9X8ZONYOTEazVj62O... |
704,439 | Minimum number of Coins | Given an infinite supply of each denomination of Indian currency{ 1, 2, 5, 10, 20, 50, 100, 200, 500, 2000 } and a target value N.
Find the minimum number of coins and/or notes needed to make the change for Rs N. You must return the list containing the valueof coins required.
Examples:
Input:
N = 43
Output:
20 20 2 1
... | geeksforgeeks | Easy | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"static List<Integer> minPartition(int N)"
],
"initial_code": "// Initial Template for Java\n\nimport java.io.*;\nimport java.util.*;\n\nclass GFG{\n public static void main(String args[])throws IOException\n {\n B... | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"minPartition(self, N)"
],
"initial_code": "# Initial Template for Python 3\n\nif __name__ == '__main__':\n t = int(input())\n for _ in range(t):\n N = int(input())\n\n ob = Solution()\n arr = ob.minP... | eJzt3U9Po0AYB2AP+0EIZzVAi1Y/ySaL8bD24KV6aBMTo/G8593vuzBtdWxEpf7LmGdanrYJJwL0x8zLcPfj3/jPTmg/99ovv67z89nlYp4fZ3nZzI5Ca2b5bpZPry6nv+fTs9OLxXy1RlUURQYAAIBUqKOlWi1199G966xqX83stk1/N7vZRi6cHB7UY7kQAAAgFeLkVxbL1Nef9urxqCoLaQ8APo74arws+s7HVWjOx3gHsq67p29PK0Ozp72eOFW1R3DZt2W7/rORYxgAgK9nczCsCv/hveloEpr/cAAAkCQPnY7rEqByWQLU24Ex... |
706,235 | Search insert position of K in a sorted array | Given a sorted arrayArr[](0-index based)consisting ofNdistinct integers and an integer k, the task is to find the index of k, if its present in the array Arr[]. Otherwise, find the index where kmust be inserted to keep the array sorted.
Examples:
Input:
N = 4
Arr = {1, 3, 5, 6}
k = 5
Output:
2
Explanation:
Since 5 i... | geeksforgeeks | Easy | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"static int searchInsertK(int Arr[], int N, int k)"
],
"initial_code": "//Initial Template for Java\n\nimport java.io.*;\nimport java.util.*;\n\nclass GFG{\n public static void main(String args[])throws IOException\n {\n ... | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"searchInsertK(self, Arr, N, k)"
],
"initial_code": "# Initial Template for Python 3\n\nif __name__ == '__main__':\n t = int(input())\n for _ in range(t):\n N = int(input())\n Arr = input().split()\n ... | eJzFVLFOwzAQZUDiNyzPDfI5cePwJUgEMUAGltAhlZBQKzY2Jvhf/M6uSyWuJBBEh1N9vrv38t4lz6fvr2cn/Lt8CX+unvR9v1oP+kJpansybV+QMUYVDsEiUDwqo0LAAVcoCrW1M3qhdPe46m6H7u7mYT3sp23bXm8W6ncQMkIzE4I03800n2sFDDMTxhEISSa7h2gQPEKNsMywFUJ5QCAi44h8lVigBb0Y0nyzGeW/EGpEPlYy4RMhn2lUO/CIWSUsn6xQhCwhTciTj+RCwIXFhcWF9eybE32jozpFNVyWxGVdXBbHfbUzyDITFwVD... |
705,637 | Broken blocks | In the game of Broken Blocks, the player is allowed to move on m x nblocks i.e. mlevels and nstone blocks on each level such that one level is vertically above the previous level (as in a staircase), with some of its stone blocks replaced by wooden blocks.
The player at the start of the game is present on the ground le... | geeksforgeeks | Medium | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"public int MaxGold(int[][] matrix)"
],
"initial_code": "//Initial Template for Java\n\nimport java.util.*;\nimport java.lang.*;\nimport java.io.*;\nclass GFG\n{\n public static void main(String[] args) throws IOException\n ... | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"MaxGold(self, matrix)"
],
"initial_code": "# Initial Template for Python 3\n\nif __name__ == '__main__':\n T = int(input())\n for i in range(T):\n m, n = input().split()\n m = int(m)\n n = int(n)\n ... | eJzlVktuE0EQZcEFuEHL6xhNVbv8QWLHIZAwYgFZsBmycCQkBOIQcF966j+O2pgoUQJkk/FMdderV68+35/+fPXsCf+9ftke3nxZfByvrg+LF2UB+5EK7UcYyhIKDgWoPezH9qO9QpK3+7EOhZ/Zzj63k+0fH5bzVGr7ubgoi8vPV5fvD5cf3n26PqirXXPzrX39elHmANZlPaFwCHw5+6AJjuFgEGLBLwW12LMtyqHKaOwTx6d31+mmLj7AHsBV2ShARUcTIo1cwzZk+9FIFBvxa9iZNCS17AEZhg6QTanNJ0VkerlQRJIXIQLJeGTz... |
702,994 | Count of camel case characters | Given a string. Count the number of Camel Case characters in it.
Examples:
Input:
S = "ckjkUUYII"
Output:
5
Explanation:
Camel Case characters present:
U, U, Y, I and I.
Input:
S = "abcd"
Output:
0
Explanation:
No Camel Case character
present.
| geeksforgeeks | Easy | {
"class_name": "Sol",
"created_at_timestamp": 1615292571,
"func_sign": [
"int countCamelCase(String s)"
],
"initial_code": "//Initial Template for Java\n\nimport java.io.*;\nimport java.util.*;\nclass GfG\n{\n public static void main (String[] args)\n {\n \n Scanner sc = new Scanner(S... | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"countCamelCase(self,s)"
],
"initial_code": "# Initial Template for Python 3\n\nt = int(input())\nfor tc in range(t):\n s = input()\n ob = Solution()\n print(ob.countCamelCase(s))\n print(\"~\")\n# Contributed By: P... | eJxrYJm6io0BDCIWAxnR1UqZeQWlJUpWCkqGMXlVxIMoCoCSjoJSakVBanJJakp8fmkJ1AFmBjF5dTF5SrU6CqjOcnRydnF1c/fw9PL28fXzDwgMCg4JDQuPiIyMikpMSk5JTUvPyMzKzsnNyy8oLCouKS0rr6iswmGLkQUOW3CZBLIlKjIiPCw0JDgoMMDfz9fH28vTw93N1cXZyRGHLca4/GJoZGxiamZuYWmg6KCsohqnpqWhGa9dU1sdo2Rlb2ejo6dvHRODw1Cc4YNDvSEO9bgiAJd6XxLV55Lo/kQS1eOKWhLC3JDiQMdiqCmG... |
703,489 | Compatible friends | Given two arrays arr1 and arr2. Return the count of i such that arr1[i]!=arr2[i]
Examples:
Input:
arr1[] = [3, 1, 2, 4, 5] and arr2[] = [3, 2, 4, 1, 5]
Output:
2
Explanation:
Compatibility difference is two because first ranks movie 1 before 2 and 4 but other ranks it after.
Input:
arr1[] = [5, 3, 1, 2, 4] and arr2[]... | geeksforgeeks | Easy | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"public int findDifference(int[] arr1, int[] arr2)"
],
"initial_code": "// Initial Template for Java\n\nimport java.io.*;\nimport java.lang.*;\nimport java.util.*;\n\nclass Main {\n public static void main(String args[]) thr... | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"findDifference(self, arr1, arr2)"
],
"initial_code": "# Initial Template for Python 3\nimport io\nimport sys\n\n# Contributed by : Nagendra Jha\n\nif __name__ == '__main__':\n test_cases = int(input())\n\n for cases in r... | eJztVk2PEzEM5cCRH/E05xWqJ+M44ZcgUcQBeuBS9tCVkBCrvXDjCP8Xf6SrBpRd2lIkJFxFb5omz88eu/Ld0+9fnz1xe/lFH159mt5vr2920wtMtN7SChUFggzGgoQZtquQ9CvrtujPFbSarjBtPl5v3u427958uNntOVbr7e16O32+wk/MTqak6+0984CDRxQrN1S3gBIgATlACQK7XeluWAxuAxF5LAKzrqRr0cW6si7RVUycLmP+/ZMDAeNEPvCJdzVcA1cycNUSVdwgbshuYDd9mW773Xam3Yj7A6fLKD4GJZCAMkgP0eJPbfdi... |
701,292 | Subarray range with given sum | Given an unsorted array of integers arr[], and a target tar, determine the number of subarrays whose elements sum up to the target value.
Examples:
Input:
arr[] = [10, 2, -2, -20, 10] , tar = -10
Output:
3
Explanation:
Subarrays with sum -10 are: [10, 2, -2, -20], [2, -2, -20, 10] and [-20, 10].
Input:
arr[] = [1, 4... | geeksforgeeks | Medium | {
"class_name": "Solution",
"created_at_timestamp": 1616127453,
"func_sign": [
"static int subArraySum(int arr[], int tar)"
],
"initial_code": "// Initial Template for Java\nimport java.io.*;\nimport java.lang.*;\nimport java.util.*;\n\n//Position this line where user code will be pasted.\n\nclass GFG {\n... | {
"class_name": "Solution",
"created_at_timestamp": 1616127453,
"func_sign": [
"subArraySum(self,arr, tar)"
],
"initial_code": "# Initial Template for Python 3\n\nif __name__ == \"__main__\":\n t = int(input())\n while t > 0:\n arr = list(map(int, input().split()))\n tar = int(input())... | eJxrYJl6goUBDCIOAhnR1UqZeQWlJUpWCkqGMXkgpKSjoJRaUZCaXJKaEp9fWoKQrYvJU6rVUUDVYgBEJGrRBWMSNRkagACMJtlGqG5dsrSDNCmQQsTkmeK2xQyXLQq6hgpYCNwBbGSKK1IUMCBuU0xxmaJrqoAbAaWNcJlojsNAUwUMCAopUmIDv8XYYh5fYjMgzedEeN0Eq6Nx2Y+mDk8kYVEJSmhgt5qSEqq4cpYhgayFNajQnKFLtEeJU6ZramSEP7pjp+gBACETYbs= |
703,481 | Next higher palindromic number using the same set of digits | Given a palindromic number N in the form of string. The task is to find the smallest palindromic number greater than N using the same set of digits as in N.
Examples:
Input:
N =
"
35453"
Output:
53435
Explanation:
Next higher palindromic
number is 53435.
Input:
N = "33"
Output:
-1
Explanation:
Next higher palind... | geeksforgeeks | Medium | {
"class_name": "Solution",
"created_at_timestamp": 1618226666,
"func_sign": [
"public String nextPalin(String N)"
],
"initial_code": "//Initial Template for Java\n\nimport java.io.*;\nimport java.util.*;\n\nclass GfG\n{\n public static void main(String args[])\n {\n Scanner sc = new Scanner(... | {
"class_name": "Solution",
"created_at_timestamp": 1618226666,
"func_sign": [
"nextPalin(self,N)"
],
"initial_code": "if __name__ == '__main__':\n t = int(input())\n\n for _ in range(t):\n s = input()\n\n solObj = Solution()\n\n print(solObj.nextPalin(s))\n print(\"~\")\... | eJyVk8EKwjAMhj3sQUbPU5o0ZZtv4W3gxIP24KXusMFAFB9C39e26A5CCsmpkH7Nn+Tvs3h3xSpFtwuH/U1d/DCNalsq6D2Aqkrl5sGdRnc+Xqfxm1uH5KP36l6VfwQa5CAEA8hwbQxpMUuGrFxhRiCrD7TW4mG0TV034q4olNIkbitScolhgGQYiIw1lOFYjKdYKDMN+SgwmDCz5GhRds95GDDaB9nKAOl5ng/5dCmnXe5O+zMAyL/D4jixd/g2F+Tw2nwAddVTOQ== |
705,888 | Print Diagonally | Give a N * N square matrix A, return all the elements of its anti-diagonals from top to bottom.
Examples:
Input:
N = 2
A = [[1, 2],
[3, 4]]
Output:
1 2 3 4
Explanation:
Hence, elements will be returned in the
order {1, 2, 3, 4}.
Input:
N = 3
A = [[1, 2, 3],
[4, 5, 6],
[7, 8, 9]]
Output:
1 2 4 3 5... | geeksforgeeks | Easy | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"static ArrayList<Integer> downwardDiagonal(int N, int A[][])"
],
"initial_code": "//Initial Template for Java\n\nimport java.io.*;\nimport java.util.*;\nclass GFG\n{\n public static void main(String args[])throws IOExceptio... | {
"class_name": null,
"created_at_timestamp": 1615292571,
"func_sign": [
"downwardDiagonal(N, A)"
],
"initial_code": "# Initial Template for Python 3\n\nif __name__ == '__main__':\n t = int(input())\n for _ in range(t):\n n = int(input())\n matrix = []\n for i in range(n):\n ... | eJzFVMtOwzAQ5NAL4idGOVco6zzLlyARxAFy4BJ6SCUkBOIj4H+ZOImbCtYODRVJJdvZ3ZnxdnffV58X52f2uV5xc/MSPTbbXRtdIZKq4S81VROtEdXP2/q+rR/unnbt4JAaVM0bza9rHMalVRPDvt6NgjvY1VchTag3ts9I444953BUeSfRmAQfnBRuJilDd3Ho6aIDaNcgMsqnNaEPtzkKlNiQl58FYiAJJIV0bjmkgJSQDQzthnEGJoEhfKZfj+g58RnaCSktaI6sY0k6ROJIbEnKDlAyS0DYuEfWlItLfDC1evpGD4f07UMAWlvD... |
702,679 | Complement | You are given a binary string str. In a single operation, you can choose two indices L and R such that 1 ≤ L ≤ R ≤ N and complement the characters between L and R i.e strL, strL+1, , strR. By complement, we mean change character 0 to 1 and vice-versa.
Examples:
Input:
N = 3
str = "111"
Output:
-1
Explanation:
As all... | geeksforgeeks | Medium | {
"class_name": "Solve",
"created_at_timestamp": 1615292571,
"func_sign": [
"Vector<Integer> findRange(String str, int n)"
],
"initial_code": "// Initial Template for Java\n\nimport java.io.*;\nimport java.util.*;\n\nclass GFG {\n // Driver code\n public static void main(String[] args) throws Except... | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"findRange(self,a, size)"
],
"initial_code": "if __name__ == '__main__':\n tc = int(input())\n while tc > 0:\n n = int(input())\n s = input()\n ob = Solution()\n ans = ob.findRange(s, n)\n ... | eJytlM8KgkAQxjvUewx7tpgRtehJgjaCyoOXzYNCEEEPUe/brrqStqNsOILsYX77ffNHn/N3tphVsTvpw/4uMpWXhdiCIKliqciECECktzw9F+nleC2LJmOpU8QjgC4UaQgJGSaE0AUlUmEVDEaQuLBNZRCR9xhB7AIJDYk1y4kmsP5huVxOwoZXC0O07TAxegmB0WIcoH38BmLYFh0Q5lgpiaREGu4wM51m7/Srb8Svj/VWKe+10kL1Hnd6+H2fNdTm9Ood3S2HYZyqcnR4MmfPKXh1ofsxNvqq1v9zZiM775yc/WP5aQ5XOuXAD6/V... |
706,338 | Longest Increasing Path in a Matrix | Given a matrix with n rows and m columns. Your task is to find the length of the longest increasing path in matrix, here increasing path means that the value in the specified path increases. For example if a path of length k has values a1, a2, a3, .... ak , then for every i from [2,k] this condition must hold ai> ai-1.... | geeksforgeeks | Hard | {
"class_name": "Solution",
"created_at_timestamp": 1616696075,
"func_sign": [
"int longestIncreasingPath(int matrix[][], int n, int m)"
],
"initial_code": "// Initial Template for Java\n\nimport java.util.*;\n\nclass GFG {\n public static void main(String args[]) {\n Scanner sc = new Scanner(Sy... | {
"class_name": "Solution",
"created_at_timestamp": 1616696075,
"func_sign": [
"longestIncreasingPath(matrix, n, m)"
],
"initial_code": "# Initial Template for Python 3\n# Position this line where user code will be pasted.\n\n# Your code goes here\nif __name__ == '__main__':\n t = int(input())\n for... | eJztmE2OHUUQhFlwB7apWVuoM7P+mpMgMYgFeMFmYGFLSAjEIeCW7LgAX1TXe57BaozNIGzLXth+csyrrvwioqr9y8e//fHJR/PX57/zly9+vPn27vvnz24+sxu/vfPNfNMfm+277cP2bnuzvdpebE/bw3a3fbOx2xg2uo1mo9ooNtJG2HAbm/Xd+rDerTfr1XqxntbDulvfrO3WhrVurVmr1oq1tBbW3Npmdbc6rHarzWq1Wqym1bDqVjcru5VhpVtpVqqVYiWthBW3slnulsOyWzbLalks0zIs3XKz2C2GRbdoFtWiWKRFWLgF+97N... |
714,220 | Smaller Sum | You are given an array arr of n integers. For each index i, you have to find the sum of all integers present in the array with a value less than arr[i].
Examples:
Input:
n = 3
arr = {1, 2, 3}
Output:
0 1 3
Explanation:
For 1, there are no elements lesser than itself.
For 2, only 1 is lesser than 2.
And for 3, 1 and ... | geeksforgeeks | Medium | {
"class_name": "Solution",
"created_at_timestamp": 1678707676,
"func_sign": [
"public long[] smallerSum(int n,int arr[])"
],
"initial_code": "//Initial Template for Java\nimport java.util.*;\nimport java.io.*;\n\npublic class GFG\n{\n public static void main(String args[])throws IOException\n {\n ... | {
"class_name": "Solution",
"created_at_timestamp": 1678707676,
"func_sign": [
"smallerSum(self, n : int, arr : List[int]) -> List[int]"
],
"initial_code": "class IntArray:\n def __init__(self) -> None:\n pass\n\n def Input(self, n):\n arr = [int(i) for i in input().strip().split()] #... | eJy9VEFOhEAQ9GB8R2fOG9PNMAP4EhMxHpSDF9zDbmJi1vgI/YI3/2gNMIF17WHRKDChE7qrmuqaeTl9+zg76a7LdwRXT+a+XW835oKM1C0eNisyzeO6ud00dzcP283wlalun+vW7FZ0UCMcr6XFDoQ03GptvHUMYcqYLFPO5HQg6XJ8CFJojnKylJEoQIDxSBC9JWEsIFggOSQXVFIFVr0zpPrQnzjKUFmS9ZS7JD4DsgS0p7mGAQQ4gAIaBPP92+lMoWiMMpeec+EOMpMkY9bIcYSZxrKRUCHx3Z/AHWH0wR8dFTyQckmf64dmIFkS... |
703,404 | Maximum difference of zeros and ones in binary string | Given a binary string Sconsisting of 0s and 1s. The task is to find the maximum difference of the number of 0s and the number of 1s (number of 0s – number of 1s) in thesubstrings of a string.
Examples:
Input:
S = "11000010001"
Output:
6
Explanatio:
From index 2 to index 9,
there are 7 0s and 1 1s, so number
of 0... | geeksforgeeks | Medium | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"int maxSubstring(String S)"
],
"initial_code": "//Initial Template for Java\n\nimport java.io.*;\nimport java.util.*;\n\nclass GFG {\n public static void main(String args[]) throws IOException {\n BufferedReader read... | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"maxSubstring(self, S)"
],
"initial_code": "# Initial Template for Python 3\n\nif __name__ == '__main__':\n T = int(input())\n for i in range(T):\n s = input()\n\n ob = Solution()\n answer = ob.maxSub... | eJxrYJlqwcYABhGGQEZ0tVJmXkFpiZKVgpJhTJ4BMlDSUVBKrShITS5JTYnPLy2BKTOOyVOq1VFA1WkIAvi0mWLTZUBrgMMxluZYXYPLx1g9jEOxLlbVeNxigis4SbPAEAZJ8gRcG0m6IDGN24lYvQS3CqcTjWiaRPCahcNF5ljTOnWsJBHQJLfgij+caZigVkPscU+cXtqWEfjNIikFIBmEUvaBuDEgEQybcHnZAFdWISc3Q92BMzcTlZpx2WgG0hw7RQ8AJICgSg== |
700,333 | Find Maximum value | Given an array arr[] you have to find the maximum value of abs(i – j) *min(arr[i], arr[j]) where i and j vary from 0 to n-1 and i != j.
Examples:
Input:
arr[] = [3, 2, 1, 4]
Output:
9
Explanation:
Here, a[0] = 3 and a[3] = 4 and thus result is abs(0-3)*min(3,4) = 9.
Input:
arr[] = [8, 1, 9, 4]
Output:
16
Explanati... | geeksforgeeks | Easy | {
"class_name": "Solution",
"created_at_timestamp": 1619259086,
"func_sign": [
"public int maxValue(int[] arr)"
],
"initial_code": "import java.util.ArrayList;\nimport java.util.Scanner;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n ... | {
"class_name": "Solution",
"created_at_timestamp": 1619259086,
"func_sign": [
"maxValue(self, arr)"
],
"initial_code": "if __name__ == \"__main__\":\n t = int(input().strip())\n for _ in range(t):\n arr = list(map(int, input().strip().split()))\n ob = Solution()\n print(ob.maxV... | eJytVdtqFEEQ9UHwNw7zHKTr1l2VLxFcEdEFfVnzsIGAGPwI/V+rZ12jIbVJSOZhpqd7+tSp06dqfrz89fnVi/V68yEHb78tX3YXl/vlHAttdtTADdKgDdbQG0aDN0QDtbacYdleXWw/7ref3n+93P/Zx9Y2u+vNbvl+httwuTUQjhiIjjCEIgTBCJqoHnCHD3iHG1zhAmc4ZdgiHvVWBpw0k2v9KDC9lZipgwbUoQPaoQZVqEAZSlMoCYhDBqRDDKIQgTCEimDmUQp2o7+s45xZb8fpAlK4op88YBigzF9AOQiwgJM0TdIzB5m5WX4X... |
706,274 | Maximum XOR subarray | Given an array arr[]of size,N.Find the subarray with maximum XOR. A subarray is a contiguous part of the array.
Examples:
Input:
N = 4
arr[] = {1,2,3,4}
Output:
7
Explanation:
The subarray {3,4} has maximum xor
value equal to 7.
Input:
N = 3
arr[] = {1,4,3}
Output:
7
Explanation:
There are 6 possible subarrays:... | geeksforgeeks | Hard | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"static int maxSubarrayXOR(int N, int arr[])"
],
"initial_code": "import java.io.*;\nimport java.util.*;\n\nclass GFG\n{\n public static void main(String args[])throws IOException\n {\n BufferedReader read = new Bu... | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"maxSubarrayXOR(self, N, arr)"
],
"initial_code": "# Initial Template for Python 3\n\nif __name__ == '__main__':\n t = int(input())\n for _ in range(t):\n N = int(input())\n arr = input().split()\n fo... | eJztms2KZEUQhUXc+BZJrQfJiPz3SQRbXGgv3LSz6AFBBB9C39fvxM1yQLqgexy7e6QGavJO3bzxc+JEnLzF/P7Fn1+ePos/33zOxbe/nn66e/vu/vR1OtnNneWbu5kseTJPI/VUU0uWk9npTTrd/vL29of72x+///nd/fmZdnN3+u1N+ocZvm2ppIWpnqaMGXZqsiJr/MuwXp9k0wnNRgoDTRanrHRZHeGoygemV3jpyQl7XnBR7EEXOPayM5atI/IwWMJLlWHlIetdARCS1+RczOSevD3JY8n6yBxPY6njR0bCZpHBlsJ6pDMilqmw... |
703,035 | Sorting Employees | You are given two arrays, employee and salary, where employee[i] denotes the name of the i**th employee, and salary[i] denotes the salary of the i**th employee. Your task is to sort the employee array based on their salaries in non-decreasing order. If two or more employees have the same salary, sort them alphabeticall... | geeksforgeeks | Easy | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"public List<String> sortRecords(List<String> employee, List<Integer> salary)"
],
"initial_code": "import java.io.*;\nimport java.util.*;\n\nclass Main {\n public static void main(String args[]) throws IOException {\n ... | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"sortRecords(self, employee, salary)"
],
"initial_code": "if __name__ == '__main__':\n t = int(input().strip())\n\n for _ in range(t):\n # Read and parse the employee names\n employee = input().strip().split... | eJy1Vl2OmzAQ7kOfeooRz6sqwKZVe5JKS1U5MA1OjG0ZkoatKvUQ7V361qt1sGGBjUlA6RolE5Dn+z48f/n5+vffN6/s+vSHfjx8D7jUhyr4CEGYyEdmGDDBU4SN2kCaMyM4QsZkIterZkHkM6E1wR0EeNKYVph9UYeqxSVvD2ZDlcjgxx2MJZzYkaOBWgkmMwaPuLGSdM5ggxW5fLCrpVxBJ2s9MBNCepQWdszlU8O0FgjKMLkl+UzSBXv+jUNBT1QiQ4jsFU5RWn+7eeTuEH2MGWnKAIVACV9p1x62qAyx50xKlieye1NvOC69vgfT... |
705,185 | Rotate matrix elements clockwise | Given two integers M, N, and a 2D matrix Mat of dimensions MxN, clockwise rotate the elements in it.
Examples:
Input:
M=3,N=3
Mat=[[1,2,3],[4,5,6],[7,8,9]]
Output:
4 1 2
7 5 3
8 9 6
Explanation:
Rotating the matrix clockwise gives this result.
Input:
M=2,N=3
Mat=[[1,2,3],[2,3,3]]
Output:
2 1 2
3 3 3
Explanation:
... | geeksforgeeks | Easy | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"int[][] rotateMatrix(int M, int N, int Mat[][])"
],
"initial_code": "// Initial Template for Java\n\nimport java.io.*;\nimport java.util.*;\n\nclass GFG {\n public static void main(String args[]) throws IOException {\n ... | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"rotateMatrix(self, M, N, Mat)"
],
"initial_code": "# Initial Template for Python 3\n\nimport math\n\nif __name__ == '__main__':\n t = int(input())\n for _ in range(t):\n N, M = map(int, input().strip().split(\" \"... | eJztm02O7FQSRhmwkFCNEXJE+JcN9BaQulo9gDdgUjB4SEgIxCKaTfasd9AnwnamnZm2M5MqVZYwpvReVd289v1OxBf3xpP/+PLP//3ji/zv2//yl3/++vTDy08/f376Rp70+aWU6vlFxcQl/1pLI610ogU/VlETddFSNIbVoo1oK9qJ8fvfn76Sp0+//PTpu8+fvv/3jz9/HqZl2DDhOEfMWUk/Q04XN4jvj9NxB37w+/PL029fyfwZq/4Zh+v5xWS4nl9chitWMlz5gf5afkYbp5N+kpgv/h4z9N/FNP13Lscpy6WHrOPGLIqVeCEl... |
702,914 | Closest Strings | Given a list of words followed by two words, the task to find the minimum distance between the given two words in the list of words
Examples:
Input:
S = {
"the", "quick", "brown", "fox",
"quick"
}
word1 = "the"
word2 = "fox"
Output:
3
Explanation:
Minimum distance between the
words "the" and "fox" is 3
Input... | geeksforgeeks | Easy | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"int shortestDistance(ArrayList<String> s, String word1, String word2)"
],
"initial_code": "//Initial Template for Java\n\nimport java.io.*;\nimport java.util.*;\n\nclass GFG {\n public static void main(String args[]) throws... | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"shortestDistance(self, s, word1, word2)"
],
"initial_code": "# Initial Template for Python 3\n\nif __name__ == '__main__':\n T = int(input())\n for i in range(T):\n n = int(input())\n s = list(map(str, inpu... | eJztmF1u1DAQx3ngBlxgtM8VWuc7nASJIORN3MQ0cdLEYUsREoeAE/LGKZjk75YW7W67LbRdxH7MOon9G489nhntl+fffrx4Nr9ef+fGm08LbbrRLl7RQmRGhJmxlR6IP5Lq1pRU68FSe0zrti8GWmtbzU1B0hRzy6OhbdS6Ur0ibWil7Fop4zopUwyZmdv48TKzOKKFOutUblXxrh2tUz89+XxE1yfkLTMjaUU5T+fi90K6aVy79m6pLNqkTEzKuq5WtJKG39T20pSKyl52l/e2dzjuR20zg0eZmW9unYDYaC0v/xl9pHNnVUFMpZIq... |
707,348 | All Unique Permutations of an array | Given an array arr[] of length n. Find all possible unique permutations of the array in sorted order. A sequence A is greater than sequence B if there is an index i for which Aj = Bj for all j<i andAi > Bi.
Examples:
Input:
n = 3
arr[] = {1, 2, 1}
Output:
1 1 2
1 2 1
2 1 1
Explanation:
These are the only possible un... | geeksforgeeks | Medium | {
"class_name": "Solution",
"created_at_timestamp": 1620285170,
"func_sign": [
"static ArrayList<ArrayList<Integer>> uniquePerms(ArrayList<Integer> arr , int n)"
],
"initial_code": "//Initial Template for JAVA\n\nimport java.io.*;\nimport java.util.*;\n\nclass GFG {\n public static void main(String arg... | {
"class_name": "Solution",
"created_at_timestamp": 1620285170,
"func_sign": [
"uniquePerms(self, arr, n)"
],
"initial_code": "# Initial Template for Python 3\n\nif __name__ == '__main__':\n t = int(input())\n for _ in range(t):\n n = int(input())\n arr = list(map(int, input().split())... | eJx8vE2ubLmSnVmNGogj2gkUnMZ9NrdGUkA9QA3pNdR5ysZLQIAgQWOrEdSQKu51N671LUYK+snk50YaaTSaGbnPjf/1f/7f/+//9f/9H//Pf//jv/zjX//tn3/8h9cf77/9o/78v696vf/4l9cff/9v//r3//TPv//n//hf/+2fLfH69esvmff3f/763/72j//5t3/88T/+5cWx5t/+MV6//k/9O6N9f3195OrP//frf6vf9NfY4/u//eXo15//9/X9P//O+Pv3f2+Mn7/94/lz/utPLfe/O8v377ndf0o9f47TrefPdrfW77Zaz5/t... |
710,279 | Next element with greater frequency | Given an arrayarr[ ]ofnintegers, for every element, find the closest element on it's right that has a greater frequency than its own frequency.
Examples:
Input:
n = 6
arr[] = {2 1 1 3 2 1}
Output:
1 -1 -1 2 1 -1
Explanation:
1 appears 3 times.
2 appears 2 times.
3 appears 1 time.
For arr[0] ie, 2
arr[1] ie 1 is t... | geeksforgeeks | Medium | {
"class_name": "solver",
"created_at_timestamp": 1648717059,
"func_sign": [
"static int[] print_next_greater_freq(int arr[], int n)"
],
"initial_code": "import java.util.*;\nimport java.io.*;\n\nclass GFG\n{\n public static void main (String[] args)\n {\n Scanner sc = new Scanner(System.in);... | {
"class_name": "Solution",
"created_at_timestamp": 1648717059,
"func_sign": [
"print_next_greater_freq(self,arr,n)"
],
"initial_code": "if __name__ == '__main__':\n t = int(input())\n for _ in range(t):\n n = int(input())\n arr = [int(x) for x in input().strip().split()]\n obj ... | eJy9VsFOwzAM5cCFv7B6HqhJmjbhS5AI4gA9cCk7dNIkBOIj4Fu5IRwn7mCoKR3p6qds1da852fX7evp++fZCR1XH/jl+ql46NabvriEQrjOo8TDdcUKina7bu/69v72cdPH/5wLcN0L/vy8gr1Ly3gtHLSmGBNIiQEJCirQUEMDBiyIJVhK3NggQY1EFRJKEEvk4kNSRj4nzCozifYkKpIIovDWabIPI0VHG8eP+dQS89NookYbDa4NhSgZFIpiQocGWvSEjr/JUihLhnpSkAvRkeBOEGooLMUgmuSOSlXBLzUzJo3U1I7UkZa60lBn... |
703,513 | Print Bracket Number | Given a string str, the task is to find the bracket numbers, i.e., for each bracket in str, return i if the bracket is the i**th opening or closing bracketto appear in the string.
Examples:
Input:
str = "(aa(bdc))p(dee)
"
Output:
1 2 2 1 3 3
Explanation:
The highlighted brackets in
the given string
(
aa
(
bdc
))
p
... | geeksforgeeks | Easy | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"ArrayList<Integer> bracketNumbers(String str)"
],
"initial_code": "// Initial Template for Java\n\nimport java.io.*;\nimport java.util.*;\n\nclass GFG {\n public static void main(String args[]) throws IOException {\n ... | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"bracketNumbers(self, str)"
],
"initial_code": "# Initial Template for Python 3\n\nif __name__ == '__main__':\n T = int(input())\n for i in range(T):\n S = input()\n ob = Solution()\n answer = ob.brac... | eJzNldtOwzAMhrngjpewehVLE2rSQ1qeBIkhtLVlJyi72CQkBOIh4H2J47ZoFWu6E1raTW2T2M5n/8nn5Xd5dWHb7cQ83L15s3K5Xnk34MlhKdAbgFe8LotsVeQPL+tV3QcShuXHsPTeB9Ca02rYalstKggghAhi0JBACtIHafwokAHIEGQEMrZ3ZF8D2yVpWGrGazMvMvMDY6d3bI5Qjxu5BpmATEH5oMwcBcrEGoKKQMWgNKgEVAqBD4G0t0+v9FHbAZEdHNiJkowYU2RQH8wE97+6mBAV4kJkiA3RIT5EiBkxJibFsJgXI2vyrWt2... |
700,551 | Count More than n/k Occurences | Given an array arrof size N and an element k. The task is to find the count of elements in the array that appear more than n/k times.
Examples:
Input:
N = 8
arr = [3,1,2,2,1,2,3,3]
k = 4
Output:
2
Explanation:
In the given array, 3 and 2 are the only elements that appears more than n/k times.
Input:
N = 4
arr = [2,3... | geeksforgeeks | Easy | {
"class_name": "Solution",
"created_at_timestamp": 1615736958,
"func_sign": [
"public int countOccurence(int[] arr, int n, int k)"
],
"initial_code": "/*package whatever //do not write package name here */\n\nimport java.io.*;\nimport java.util.*;\n\nclass Driverclass {\n public static void main(Strin... | {
"class_name": "Solution",
"created_at_timestamp": 1615736958,
"func_sign": [
"countOccurence(self,arr,n,k)"
],
"initial_code": "# Initial Template for Python 3\n\nimport math\n\n\ndef main():\n T = int(input())\n while T > 0:\n N = int(input())\n A = list(map(int, input().split()))\n... | eJytVUFOwzAQ5IDEN0Y5I2R77bXNS5AI4gA9cAkcWgkJgXgEvJUbYut0G7c0iAQ6EylSlN2Zna3zevz+eXJUfhcfcnP51Nx1D6tlc47Gtp01cqGHKyCBbztqu+YUzeLxYXGzXNxe36+Ww1sv8vD5FHulQtsFKHiDuEFCbjs/WpRGirqiT3WJsg2+N2LpPlrejZUPvX1XtRia1G0qR23HkxvR2odBzVyQCvoZaYeh56BEdP00PzMWivn9ALdZ9XkNyBX2TAy0hU5Jhb4wVGRl3GWqmNd0ZpdW6ZSk9MpQkStG4U/rMTa9tBkelYFxv8bq... |
709,992 | Enemy | You live in Geek land. Geek land can be seen as a grid of shape N xM.There are Kenemy at Kpositions. Each enemy blocks the row and column to which it belongs. You have to find the largest continuous area that is not blocked.No two enemies share the same row or the same column.
Examples:
Input:
N = 2
M = 2
K = 1
enemy[]... | geeksforgeeks | Medium | {
"class_name": "Solution",
"created_at_timestamp": 1650389408,
"func_sign": [
"public static int largestArea(int n,int m,int k,int[][] enemy)"
],
"initial_code": "import java.io.*;\nimport java.util.*;\nclass IntArray\n{\n public static int[] input(BufferedReader br, int n) throws IOException\n {\n... | {
"class_name": "Solution",
"created_at_timestamp": 1650389408,
"func_sign": [
"largestArea(self,n:int,m:int,k:int, enemy : List[List[int]]) -> int"
],
"initial_code": "class IntArray:\n def __init__(self) -> None:\n pass\n\n def Input(self, n):\n arr = [int(i) for i in input().strip()... | eJzNVEuOEzEUZDELjvHU6xHy8785CRJBs4As2IRZZCQkBOIQM0dkxyGoenaiaGSHDBoQUavjbj+/KldV+/vVw8+XL+z35gcGb78sH3e3d/vltSxhs0uSxG92XjCOorxFjj3fhvY2bnbqBFfCgDWPJtFjuZZl+/l2+36//XDz6W7fAVD2DWvs7pP9LV+v5YQCKqpUg5DKzpmd8ViIkSU3qESUPEEJ1riO2pOsE0/2nbYxzoSpBNQ2pV4UkwoJSCWLokCraO0NJtA6AjX2hfKoFI61w4aD2NrlW2Xl1kbEMIX1SXCVqex9AdAm/GKT/sSG... |
705,019 | Summing the Sum | Given three integers N, M, and K. Lets Sum(N) be a function that calculates twice the sum of first N natural numbers. Calculate Sum(K+Sum(K+Sum(K+....+Sum(N+K) up to M terms.
Examples:
Input:
N=1, M=2, K=3
Output:
552
Explanation:
Sum(3+Sum(3+1))=Sum(3+Sum(4))
=Sum(3+20)=Sum(23)=Sum(552)
Input:
N=2, M=2, K=2
Outpu... | geeksforgeeks | Easy | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"long modifiedSum(int N, int M, int K)"
],
"initial_code": "// Initial Template for Java\n\nimport java.io.*;\nimport java.util.*;\n\nclass GFG {\n public static void main(String args[]) throws IOException {\n Buffere... | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"modifiedSum(self, N, M, K)"
],
"initial_code": "# Initial Template for Python 3\n\nimport math\n\nif __name__ == '__main__':\n t = int(input())\n for _ in range(t):\n N, M, K = map(int, input().strip().split(\" \"... | eJy1lM1OwzAMxzkgniPKeUKJG8fxngSJIg7QA5ewQychIdBuewF4X9IPPrbVSaeKtJKjNvnFf8f27vJzf3XRj5tdmty+6qe42bZ6rbSto1XpqaNeKd28bJqHtnm8f9624wJfx/f0822ljnaZfnR7h5lIsEzQ/5/mqB+SSGBGQxUGlBlFL4C5MgZKag6tHBXLgY2zIm82yQZHAJaKnmXic6Y2kUNJECNCRpXCghzHAVACDJvVgZG9Aee9xYrm6pqOu8h3TAy+cmEm3/z3AaOVI+KYQwhkuFwHWXzmgKpbIdb83xw67QGTMatjRlCxsE8k... |
703,322 | Exceptionally odd | Given an arrayof N positive integers where all numbers occur even number of times except one number which occurs odd number of times. Find the exceptional number.
Examples:
Input:
N = 7
Arr[] = {1, 2, 3, 2, 3, 1, 3}
Output:
3
Explanation
: 3 occurs three times.
Input:
N = 7
Arr[] = {5, 7, 2, 7, 5, 2, 5}
Output:
5
E... | geeksforgeeks | Easy | {
"class_name": "Solution",
"created_at_timestamp": 1619259391,
"func_sign": [
"int getOddOccurrence(int[] arr, int n)"
],
"initial_code": "//Initial Template for Java\n\nimport java.io.*;\nimport java.util.*;\n\npublic class Main {\n\n public static void main(String[] args) throws Exception {\n ... | {
"class_name": "Solution",
"created_at_timestamp": 1619259391,
"func_sign": [
"getOddOccurrence(self, arr, n)"
],
"initial_code": "# Initial Template for Python 3\n\nif __name__ == '__main__':\n tc = int(input())\n while tc > 0:\n n = int(input())\n arr = list(map(int, input().strip()... | eJytlM1OwzAMxzkgnsPKeULNR5OGJ0GCaQfogcvYoZOQEIiH2B6SG4+A7TSileJuK51/qbq68b+xnXxdH39urvh3/403D+/qZbvbd+oOlH7cRgQaCDgiWwB8pFag2rdd+9S1z5vXfde/j55PdH6sYBxE43DgoEbzbCGZGMlLkWocFfTojGHsAJcQBShQWSGQCmgPhWsA3WTiEFlHWomhUQGhGcNYxjE145nANExkGlGTXOW1YTEnqieVz2L1DBBWnEyu4mQuWEULraho+c7iRQyWnMVwmM7cRVP9I03HJWK7gGGzyeQ8/r8JZ3fhWGKk... |
703,389 | Total distance travelled in an array | You are given an array arr[] consisting of a permutation of the set {1, 2, 3, …, n} for some positive integer n. The task is to calculate the total distance you must travel starting from the position of 1 in the array, then moving to the position of 2, and so on, until you reach the position of n.
Examples:
Input:
arr[... | geeksforgeeks | Easy | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"long distance(int[] arr)"
],
"initial_code": "// Initial Template for Java\nimport java.io.*;\nimport java.lang.*;\nimport java.util.*;\n\n//Position this line where user code will be pasted.\n\nclass GFG {\n public static ... | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"distance(self, arr)"
],
"initial_code": "# Initial Template for Python 3\n\nif __name__ == \"__main__\":\n t = int(input())\n while t > 0:\n arr = list(map(int, input().split()))\n ob = Solution()\n ... | eJydk78KwjAQhx36ID8yF8mf1rY+iWDEQTu4xA4tCKL4ELq6+Z5eSgaLXqUJgQSS77vLJbklj1cy69vqSZP1WRxc07ViCaGsoy5SiPrU1Lu23m+PXRsWpXVXWrykGBIaPKMYRkHDsJRmKAPiWMowVAaDsRw5TvVcjowlC46UqFCiwMLjf8JXYyUiOidLQbYKSk6WfMIIRv6yRs7zlU2ExYt00E1+ZUNBFGxtDM5tZlOkdxoX6YdC0eBUGaPxCXg4ptjho5VTf0zcBUm+xJv7/A0F1Got |
710,020 | Exactly one swap | Given a string S containinglowercase english alphabetcharacters. The task is to calculate the number of distinct strings that can be obtained after performingexactly one swap.
In one swap,Geek canpick two distinct index i and j (i.e 1 < i < j < |S|)of the string, then swap the characters at the position i and j.
Exampl... | geeksforgeeks | Medium | {
"class_name": "Solution",
"created_at_timestamp": 1646060454,
"func_sign": [
"long countStrings(String S)"
],
"initial_code": "//Initial Template for Java\nimport java.io.*;\nimport java.util.*; \nclass GFG{\n public static void main(String args[]) throws IOException { \n BufferedReader read =... | {
"class_name": "Solution",
"created_at_timestamp": 1646060454,
"func_sign": [
"countStrings(self, S)"
],
"initial_code": "# Initial Template for Python 3\n\nif __name__ == '__main__':\n t = int(input())\n for _ in range(t):\n S = input()\n ob = Solution()\n ans = ob.countString... | eJxrYJm6joUBDCKWAxnR1UqZeQWlJUpWCkqGMXmJCKCko6CUWlGQmlySmhKfX1qCUFQXk6dUq6OApjMpOSUVlx4DXJpItiUxKQmHFlMcWqrggBwfpaVnZGZl5+Tm5RcUFhWXlJaVV1TiMsjYCJcbEnE5GqfdONTjDEi4W3FoNMHttGQ8CJdPDfAHWlJ6Mm6nmOF0Cs5gMsZjWyJef5visYxw0jAxI2wxESkMnyNwpmdzQlZXEWW3GU4voAQATqfjzrrklRGooZZMXLjFTtEDAFyHmLg= |
702,951 | Check for subsequence | Given two strings A and B, find if A is a subsequence of B.
Examples:
Input:
A = AXY
B = YADXCP
Output:
0
Explanation:
A is not a subsequence of B
as 'Y' appears before 'A'.
Input:
A = gksrek
B = geeksforgeeks
Output:
1
Explanation:
A is a subsequence of B.
| geeksforgeeks | Easy | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"boolean isSubSequence(String A, String B)"
],
"initial_code": "//Initial Template for Java\n\nimport java.io.*;\nimport java.util.*;\nclass GfG\n{\n public static void main (String[] args)\n {\n Scanner sc = new S... | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"isSubSequence(self, A, B)"
],
"initial_code": "# Initial Template for Python 3\n\nif __name__ == '__main__':\n T = int(input())\n\n for _ in range(T):\n A, B = input().split()\n ob = Solution()\n if ... | eJxrYJm6n4cBDCJ2ABnR1UqZeQWlJUpWCkqGMXkKiQqJSjoKSqkVBanJJakp8fmlJQjZupg8pVodBTQtQD1JOPQY4NKTmJQMwqRaBdWWQoa+FDz24XQmKDiAWlPT0jMys7JzcvPyCwqLiktKy8orKqtIdgQes6grQ6rLqugD6GVPFelRgzMoqRxn1HMYdWVGkybdAF3SJo7oAJqHqpQc1ygkgswjvQwmLY0lEZHIMqiXzUDW4K1b8FVlQFfQLfnQOSHg9jbMUrqWnxmZFWAxbGkkG4uGYVmGUjflk1m65OFNVSVkly+DIFmNphb87Wja... |
702,647 | Paths to reach origin | You are standing on a point(x, y) and you want to go to the origin(0, 0)by taking steps eitherleft or down i.e. from each point you are allowed to move either in(x-1, y) or (x, y-1). Find the number of paths from point to origin.
Examples:
Input:
x = 3, y = 0
Output:
1
Explanation:
Path used was -
(3,0) --> ( 2,0... | geeksforgeeks | Medium | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"public static int ways(int n, int m)"
],
"initial_code": "//Initial Template for Java\nimport java.io.*;\nimport java.util.*;\n\n//Position this line where user code will be pasted.\n\n// Driver class\nclass Array {\n \n ... | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"ways(self, n,m)"
],
"initial_code": "# Initial Template for Python 3\n\nt = int(input())\nfor _ in range(0, t):\n x, y = list(map(int, input().split()))\n ob = Solution()\n print(ob.ways(x, y))\n print(\"~\")\n",
... | eJytk8FOwzAMhnsYPEeU84Ti1F7iPckkgjhAD1zCDp2EhJj2EON5h9dpKjvYYxWRrFz6Of5//93Nvu/vmuGsDrOmefz0b3W96f3SeSiVQnBSfu5897HuXvru9fl9058/IM4t5cilbkv1X3N3SSOzQVNihsSQFfr4tnSYSEcKTkqjgWgBLZJCm6qNeW9lUBhQX0oxp8SUNI1wdGg6bbkbgrFTmERZy2hjzHGhGUs3+yraxgyoKjEaqzxdKGW4ZGUB+RwKvpKoNiCiuKD+CWKA6l7KKUuYSdMC4yDVDROflqGawlc6QSlj9ir8X+PLTqVM... |
703,071 | Uncommon characters | Given two strings A and B consisting of lowercase english characters. Find the characters that are not common in the two strings.
Examples:
Input:
A = geeksforgeeks
B = geeksquiz
Output:
fioqruz
Explanation:
The characters 'f', 'i', 'o', 'q', 'r', 'u','z'
are either present in A or B, but not in both.
Input:
A = c... | geeksforgeeks | Easy | {
"class_name": "Solution",
"created_at_timestamp": 1619173735,
"func_sign": [
"String UncommonChars(String A, String B)"
],
"initial_code": "//Initial Template for Java\n\nimport java.io.*;\nimport java.util.*;\nclass GfG\n{\n public static void main(String args[])throws IOException\n {\n Sca... | {
"class_name": "Solution",
"created_at_timestamp": 1619173735,
"func_sign": [
"UncommonChars(self,A, B)"
],
"initial_code": "# Initial Template for Python 3\n\nif __name__ == '__main__':\n T = int(input())\n\n for tcs in range(T):\n A = input()\n B = input()\n ob = Solution()\n... | eJzNVttu1DAQ5YFHPqLa54JU+tY3/gKJIORNJsk09tjxLUkRiI+A/2WcS3cXEvVCK2rtZif2eub4zPHYP17/+vDm1dg+XrHx6esOyQS/uzrbvc9I7PMCyqrG6zUro0Yq0qa1zq9ZGdUgpfY1OnTCQ+rJa8gbXwufejuUkrQvBcrd+dkOegO5h+KLDn7GcAh27PY7+ykb6kZr9+387BR1P9zcfjJK05ZvRhYMMJQir4UVHMy6EVFGQC5YWIZnBOugkqfRdcJRN6TDGpALDiao0EoOFRDY5NZD7zVBRskotc21MsKi07QRKi/KCqVxw8ZS... |
704,595 | Longest Bitonic subsequence | Given an array of positive integers. Findthe maximum length of Bitonic subsequence.A subsequence of array is called Bitonic if it is first strictly increasing, then strictly decreasing. Return the maximum length of bitonic subsequence.Note : A strictly increasing or a strictly decreasing sequence should not be consider... | geeksforgeeks | Medium | {
"class_name": "Solution",
"created_at_timestamp": 1710841750,
"func_sign": [
"public static int LongestBitonicSequence(int n, int[] nums)"
],
"initial_code": "import java.io.*;\nimport java.util.*;\n\nclass IntArray {\n public static int[] input(BufferedReader br, int n) throws IOException {\n ... | {
"class_name": "Solution",
"created_at_timestamp": 1710841750,
"func_sign": [
"LongestBitonicSequence(self, n : int, nums : List[int]) -> int"
],
"initial_code": "class IntArray:\n\n def __init__(self) -> None:\n pass\n\n def Input(self, n):\n arr = [int(i) for i in input().strip().sp... | eJytlMtOwzAQRVnAf1x53SKPx3aSfgkSRSxoFmxCF6mEhEB8Qhcgfpex04faMlKMkpei0Z0z4+vH5/X3z81Vvu628nP/Zp679aY3CxhadmTlBSOgQoMaER4O1sxg2td1+9S3q8eXTb9PEPXHsjPvM5xhQkLBWbB8AygIMQqzFh4LkWAxJw3rFKzL3TkheOEdScdY3Mc1NGnooWMSoAdFUJ26l74lGA7wNIAmhYiylLOa879EVJ+iUpVP7E4IzjUrUJNaSI34TLeHyRjUcdfRzgSlsGNtguRRcrQ5ddn78iS9Oy2JB1O0WtqYfErLd0k9... |
711,624 | Pattern 1 | Geek is very fond of patterns. Once, his teacher gave him asquare pattern to solve. He gave Geekan integer n and asked him to build a pattern.
Help Geek to build a square pattern with the help of * such that each * is space-separated in each line.
Examples:
Input:
n = 3
Output:
* * *
* * *
* * *
Input:
n = 5
Output:
*... | geeksforgeeks | Easy | {
"class_name": "Solution",
"created_at_timestamp": 1662576504,
"func_sign": [
"void printSquare(int n)"
],
"initial_code": "import java.io.*;\nimport java.util.*;\n\nclass Main {\n // Driver code\n public static void main(String[] args) throws Exception {\n BufferedReader br =\n new Buffer... | {
"class_name": "Solution",
"created_at_timestamp": 1663239406,
"func_sign": [
"printSquare(self, N)"
],
"initial_code": "# Initial Template for Python 3\n\nif __name__ == '__main__':\n t = int(input())\n for _ in range(t):\n N = int(input())\n ob = Solution()\n ob.printSquare(N... | eJzs17Fq3EAUQFEI6fITYspkCznp/CUBC7awVbiRt9CCwdjk07PFNkmRxoXJ5XAGNW8eTHfRr88/v3y7+3T3Mh6303kft9O4WbbLGYdprM+n9X5fH45P5/06/Dot29tl+nqY/lqZ5/kfWwDA/27ZPvoFAMD7KToAFCg6ABQoOgAUKDoAFCg6ABQoOgAUKDoAFCg6ABQoOgAUKDoAFCg6ABQoOgAUKDoAFCg6ABQoOgAUKDoAFCg6ABQoOgAUKDoAFCg6ABQoOgAUKDoAFCg6ABQoOgAUKDoAFCg6ABQoOgAUKDoAFCg6ABQoOgAUKDoA... |
704,022 | Minimum number of deletions and insertions | Given two strings str1 and str2. The task is to remove or insert the minimum number of characters from/in str1 so as to transform it into str2. It could be possible that the same character needs to be removed/deleted from one point of str1 and inserted to some another point.
Examples:
Input:
str1 = "heap", str2 = "pea"... | geeksforgeeks | Medium | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"public int minOperations(String s1, String s2)"
],
"initial_code": "// Initial Template for Java\nimport java.io.*;\nimport java.util.*;\n\nclass GfG {\n public static void main(String args[]) {\n Scanner sc = new Sc... | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"minOperations(self, s1, s2)"
],
"initial_code": "# Initial Template for Python 3\n\nif __name__ == '__main__':\n T = int(input())\n\n for i in range(T):\n s1, s2 = input().split()\n ob = Solution()\n ... | eJy9lUtOwzAQhlmw4BiW1xUiKQXESZAIQs376bzsJDYCcQi4IDtuQYSqCkT/OG4rJptIHvnz7/ln/Hr6/nl28h13H+PP/RNNWCU4vSXUctja9fwgjOIkzfKClVXdtFx0/SAVUXLoO8Hbpq5KVuRZmsRRGPieu6YLQoOhCjwe+I+l4JvtVhcOe3EYfV6QeRCCFhQgWBCg+8iwI5COy/0x7p9AUm4ARGmDyDF0SQB7ZVii0Qd4CTCQDWYo06coCai2sTJscHPNtvnFYjqC4AZTrvQGvw+6UEQ8bpMmrbMqLwtm3sVQyYzaHOLMa3Nn/tSG... |
869,869 | Two Smallests in Every Subarray | Given an array of integers arr, the task is to find and return the maximum sum of the smallestandsecond smallest element among all possible subarrays of size greater than one. If it is not possible, then return -1.
Examples:
Input:
arr = [4, 3, 1, 5, 6]
Output:
11
Explanation:
Subarrays with smallest and second smalle... | geeksforgeeks | Easy | {
"class_name": "Solution",
"created_at_timestamp": 1720590580,
"func_sign": [
"public int pairWithMaxSum(int[] arr)"
],
"initial_code": "import java.io.*;\nimport java.util.*;\n\nclass GFG {\n public static void main(String[] args) throws IOException {\n BufferedReader br = new BufferedReader(n... | {
"class_name": "Solution",
"created_at_timestamp": 1720586997,
"func_sign": [
"pairWithMaxSum(self, arr)"
],
"initial_code": "if __name__ == \"__main__\":\n import sys\n input = sys.stdin.read\n\n data = input().strip().split(\"\\n\")\n t = int(data[0])\n lines = data[1:]\n\n for line i... | eJyVVMtOAzEM5ID4jlFuSAVtYufFlyBRxAF64FJ6aKVKCMRHwP/iOCshSr10c5jZPNaPsZOP86/LizMdt04+7l7d83qz27obOL9c+6ENt4Bb7Terx+3q6eFltx33r+TA+3Lt3hb4/VcAwYOREFCFo8xIMKPIPMgsyyrJfpFVmRsOfDYc9LBQ21AsilkxKUZFViTFoOgVrZS8mrS8YvR7nAyTQbfNRBAG0AAeEAekAXlAkczUbKOiS0m3WY+GtmfGb3v6CXZMJHSiTtwpdkqdcqfSqU6kaNYqjMUXG4Qg39IPMqvwzAhEoJyRRIhaxFuU... |
703,497 | Extract Maximum | Given a alphanumeric string S, extract maximum numeric value from S.
Examples:
Input:
S = 100klh564abc365bg
Output:
564
Explanation:
Maximum numeric value
among 100, 564 and 365 is 564.
Input:
S = abcdefg
Output:
-1
Explanation:
Return -1 if no numeric
value is present.
Constraints:
1 ≤ |S| ≤ 10**4
-1 ≤ output... | geeksforgeeks | Easy | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"static int extractMaximum(String S)"
],
"initial_code": "//Initial Template for Java\n\nimport java.io.*;\nimport java.util.*;\n\nclass GFG{\n public static void main(String args[]) throws IOException { \n Scanner sc... | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"extractMaximum(self,S)"
],
"initial_code": "# Initial Template for Python 3\n\nif __name__ == '__main__':\n T = int(input())\n for _ in range(T):\n S = input()\n ob = Solution()\n print(ob.extractMax... | eJydVFtOwzAQ5APuEfm7VHYebcJJkDBCsWNof9wWpaINasUh4Bb8cUHWThtU0UnSWIoUaz27s+Pxflx//dxc+XX/TT8P72xul+uS3QVMSMvdykUY5TyZTJVmo4CZzdLo0hRPi3V5OEkxaffSst0oOE2Q5UqnlKOibwrQLg7gm20FQLcCQKKxiEWSAZiPASQxVAtbYKKoydyppAAItUaixqRbmvHVm3ktt80eMW/Og4SVW/UpEr0wz5MkjkIB0tVB1JDS/uY5QiOgc4rSxIDKE9WX2ZyLEKmZoos4tNr4z/4ZsFMfzAxLNKgaKtS46EIT... |
704,477 | Perfect Numbers | Givena number N, check if a number is perfect or not. A number is said to be perfect if sum of all its factors excluding the number itself is equal to the number. Return 1 if the number is Perfect otherwise return 0.
Examples:
Input:
N =
6
Output:
1
Explanation:
Factors of 6 are 1, 2, 3 and 6.
Excluding 6 their sum ... | geeksforgeeks | Easy | {
"class_name": "Solution",
"created_at_timestamp": 1731675234,
"func_sign": [
"static int isPerfectNumber(int N)"
],
"initial_code": "// Initial Template for Java\n\nimport java.io.*;\nimport java.util.*;\n\nclass GFG {\n public static void main(String args[]) throws IOException {\n BufferedRea... | {
"class_name": "Solution",
"created_at_timestamp": 1731675234,
"func_sign": [
"isPerfectNumber(self, n)"
],
"initial_code": "# Initial Template for Python 3\n\nif __name__ == '__main__':\n t = int(input())\n for _ in range(t):\n N = int(input())\n\n ob = Solution()\n ans = ob.i... | eJxrYJm6hIUBDCLmAhnR1UqZeQWlJUpWCkqGMXmGSjoKSqkVBanJJakp8fmlJVCptMSc4tSYvLqYPKVaHQVUPUbk6LHAoamkqBSXHhNLM9I1WRiSY5WxsampgbExGfZZQoCxORmBArXVlAytEFvJij1yXAoNWNwxgk8zUBeZKc0Q6k2Qs8GJCGfc4jOFHD3gqIGFs6GxcUwMOT6HBRvY7WSFHUiniSGZwQ6ynuyghzg9JoYCx0NdADLLkBg3xE7RAwBxkX7Y |
701,190 | Tower Of Hanoi | The tower of Hanoi is a famous puzzle where we have three rods and n disks. The objective of the puzzle is to move the entire stack to another rod. You are given the number of discs n. Initially, these discs are in the rod 1. You need to print all the steps of discs movement so that all the discs reach the 3**rd rod. A... | geeksforgeeks | Medium | {
"class_name": "Solution",
"created_at_timestamp": 1731402183,
"func_sign": [
"public int towerOfHanoi(int n, int from, int to, int aux)"
],
"initial_code": "// Initial Template for Java\n\n/*package whatever //do not write package name here */\n\nimport java.io.*;\nimport java.util.*;\n\nclass Recursion... | {
"class_name": "Solution",
"created_at_timestamp": 1731402183,
"func_sign": [
"towerOfHanoi(self, n, fromm, to, aux)"
],
"initial_code": "# Initial Template for Python 3\n\nimport math\n\n\ndef main():\n T = int(input())\n\n while T > 0:\n N = int(input())\n ob = Solution()\n p... | eJy1VMFOwzAM7YHxHVXO0xTHTbLuSyYRxAF64FJ26CQkNImPYL+L5iRtqfCSjgFVlUPi9/ye7eT95ri4LcK3/VwUxd2beG53+05sSgGuBSOWpWhed81j1zw9vOy7/sxojdq14rAsJwhFCNqFBAiVNZaOGQ5ps3ItwWUCCgbXFEW/ZGhCAgZaSBOsoYYxhlF40SoIwLCmHFSy1iHGhpU78Ql03j73LgOTSsDiKZ61HbEmqzkG9Q3jNHpwApjtQGxcLOPZNsTiJSfGjhpmfPzCCKhBm6+nGj3l22kHRAV1hZIzEwOrUs4qQiDN+cyJvbiX... |
712,031 | Pattern 14 | Geek is very fond of patterns. Once, his teacher gave him a pattern to solve. He gave Geekan integer n and asked him to build a pattern.
Examples:
Input:
5
Output:
A
AB
ABC
ABCD
ABCDE
Constraints:
1<= N <= 20 | geeksforgeeks | Easy | {
"class_name": "Solution",
"created_at_timestamp": 1662630271,
"func_sign": [
"void printTriangle(int n)"
],
"initial_code": "import java.io.*;\nimport java.util.*;\n\nclass Main {\n // Driver code\n public static void main(String[] args) throws Exception {\n BufferedReader br =\n new Buff... | {
"class_name": "Solution",
"created_at_timestamp": 1663310708,
"func_sign": [
"printTriangle(self, N)"
],
"initial_code": "# Initial Template for Python 3\n\nif __name__ == '__main__':\n t = int(input())\n\n for _ in range(t):\n N = int(input().strip())\n ob = Solution()\n ob.p... | eJztW1lz0zAQ5oEZ3vgNGT93OnaOJuGJct8FylGoSyltgHK4ARIoLe3wI+D/os8JTdxI9krO2rLrTPLFlnalPXTseqzf5/9evHwu/KxdEBfrh85u0B8OnEs1x/MD8XUWak5vv9/bHvR2NveGg3Hlsh8ci8qjhVqUo+7GsSxfwe9qCNdGeH38d+P//82Ti1uTq9tTl3emr+9Gbu5F7+6fun1w+n5lpuDhbMkjSdFjWdmqtPCJwlJeJpaa7bruBy2z3kVbrJI1wgEHyeJH0dzlqEbmxAnN0AnjEeK1TP1wRnwkHcRihjUpK6FUK2tVzWc4... |
703,381 | Length of longest subarray | Given an array arr[], return the length of the longest subarray of non-negative integers.Note: Subarray here means a continuous part of the array.
Examples:
Input:
arr[] = [2, 3, 4, -1, -2, 1, 5, 6, 3]
Output:
4
Explanation :
The subarray [ 1, 5, 6, 3] has longest length 4 and contains no negative integers
Input:
ar... | geeksforgeeks | Easy | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"public int longestSubarry(int arr[])"
],
"initial_code": "// Initial Template for Java\n\n/*package whatever //do not write package name here */\n\nimport java.io.*;\nimport java.util.*;\n\n//Position this line where user code... | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"longestSubarray(self, arr)"
],
"initial_code": "# Initial Template for Python 3\nif __name__ == '__main__':\n tc = int(input())\n while tc > 0:\n arr = list(map(int, input().strip().split()))\n ob = Solutio... | eJytVEsOgjAQdWE8x6Rr0A4/0ZOYiHGhLNwgC0hMjMZD6H0FCoFWplBDB1r6fW9mXnnNP8FiVpXdqvjY39klSfOMbYFhlHCwETigaIRhx+pZ8drSaGvILGDxLY1PWXw+XvOsOZ9HyTNK2MMCGdVGXpXuGT+mgAgKGjCPAEPBW1/1mTxBwSLpIyiPdLI8RK6kYAMatU6pUYXggAse+GU3gDWEsDFEblJKxalvGycWK8tsKgoaZRE7KEVqY0PRdAfkPRkHk5i2+J2k/EUFp+EiNK2qG/mwyMNezZRuIRlcMx6dELWMkGs4OeMunjPyNpE/... |
703,845 | Sub-arrays with equal number of occurences | Given an array arr[] and two integers say, xand y, find the number of sub-arrays in which the number of occurrences of x is equal to the number of occurrences of y.
Examples:
Input:
arr[] = [1, 2, 1] , x= 1 , y = 2
Output:
2
Explanation:
The possible sub-arrays have same equal
number of occurrences of x and y are:
... | geeksforgeeks | Easy | {
"class_name": "Solution",
"created_at_timestamp": 1617814710,
"func_sign": [
"static int sameOccurrence(int arr[], int x, int y)"
],
"initial_code": "// Initial Template for Java\nimport java.io.*;\nimport java.util.*;\nimport java.util.HashMap;\n\n//Position this line where user code will be pasted.\np... | {
"class_name": "Solution",
"created_at_timestamp": 1617814710,
"func_sign": [
"sameOccurrence(self, arr, x, y)"
],
"initial_code": "# Initial Template for Python 3\n\nif __name__ == '__main__':\n tc = int(input())\n while tc > 0:\n arr = list(map(int, input().strip().split()))\n x = i... | eJzFVEsOgjAQdWE8x6RrYmihFTyJiRgXysINuoDExGg8gSu5r0NBscLIRxJn2qSQzkvnvddex2k6GelY3HCxPLFddEhiNgfGgygbto7XglnAwuMh3MThdr1P4nLzJYjY2YIPhLwKOJRATViCwoIiNYYgqm2iWkCRvao5VjrgggQFM/DAx34QJWuFQHJoSrDaQxSFaC6iiqwjiYNAkrLDoaD+pHpS2knVxHhTvvnE10FJS7OS0WDOr0IJmpSK5zq5z2/lPt7ZQMZVcnrdpQrvyvys06Kw1vMfJQz3uzg/V2gwlxnUFLIPxFBtDmPYf4sa... |
702,729 | Pairs which are Divisible by 4 | Given an array arr[] of positive integers, count the number of pairs of integers in the array that have the sum divisible by 4.
Examples:
Input:
arr[] = [2, 2, 1, 7, 5]
Output:
3
Explanation:
(2,2), (1,7) and (7,5) are the 3 pairs.
Input:
arr[] = [2, 2, 3, 5, 6]
Output:
4
Explanation:
(2,2), (2,6), (3,5) and (2,... | geeksforgeeks | Easy | {
"class_name": "Solution",
"created_at_timestamp": 1617734945,
"func_sign": [
"public static int count4Divisibiles(int arr[])"
],
"initial_code": "// Initial Template for Java\n\n/*package whatever //do not write package name here */\n\nimport java.io.*;\nimport java.util.*;\n\n//Position this line where... | {
"class_name": "Solution",
"created_at_timestamp": 1617734945,
"func_sign": [
"count4Divisibiles(self, arr )"
],
"initial_code": "# Initial Template for Python 3\nif __name__ == '__main__':\n tc = int(input())\n while tc > 0:\n arr = list(map(int, input().strip().split()))\n ob = Solu... | eJylVEEOgjAQ9KD/2PRMDNsWBN/hwQSMB+XgpXqAxMRofIT+17qKIGFJq20ITdqd3Zmd9jq+Z5MRjeXCLrKT2JlDVYo5CMwNigBEcTwUm7LYrvdV+d4Kc3PJjTgH8H1ee55XEMEMkEujmDAJNJmomIlCoOlLCRJACRj7ZgttiajBP44GMH9vzhIUaCtzbIVOILU4DARyCqBF6HwMhIxcSPVDvnaVA9fBTtlWKf9ekUpUp6bMtWCNa0g6pnJODZeeDLYkZeX8g2vYBXj6tLlUvGNZf7RApWU0YHpHiJbs+Atay3GJq9YsWP89VJ8VB1g/... |
712,699 | Triangle Path Sum | Given atrianglearray, returnthe minimum path sum to reach from top to bottom.
Examples:
Input:
n = 4
triangle = [[2],
[3,4],
[6,5,7],
[4,1,8,3]]
Output:
11
Explanation:
2
3
4
6
5
7
4
1
8 3
The minimum path sum from top to bottom is 2 + 3 + 5 + 1 = 11.
Input:
n = 1
triang... | geeksforgeeks | Medium | {
"class_name": "Solution",
"created_at_timestamp": 1668704248,
"func_sign": [
"public int minPathSum(ArrayList<ArrayList<Integer>> triangle)"
],
"initial_code": "// Initial Template for Java\n\nimport java.io.*;\nimport java.lang.*;\nimport java.math.*;\nimport java.util.*;\n\nclass GFG {\n\n public s... | {
"class_name": "Solution",
"created_at_timestamp": 1668371663,
"func_sign": [
"minPathSum(self, triangle)"
],
"initial_code": "# Initial Template for Python 3\n\n# Position this line where user code will be pasted.\n\nif __name__ == '__main__':\n t = int(input())\n for _ in range(t):\n n = i... | eJy1VD1PwzAQZUD8jifPDbLjz+OXIBHEAB1YQodUQkIgJjY2+L+cHSgk9KJC2sg5nxPfvfPzs5+P319Pjspz/sLOxYO6bVfrTp1Bmabl5tUCanm/Wl53y5uru3X3+dc37VPTqscFhiF101ZGs/GopNjKSNG2aTlWozfQQgIthLtSskFvNh2MkMcJebg8oxmECJS4i6AA4q/kQBZUg3gWaSRCSkgRKUgQUSq2gOQXm27gjQfcpL2QIGzho+6JqEUa7ASdOvNQs4UtrsuuzyaUccxuyoayyfOlMo0rEVuhQlGOBUMGeEQG4n1LsIWCOnt5... |
704,554 | Geek and its Game of Coins | Given three numbers n, x, and y, Geek and his friend are playing a coin game. In the beginning, there are n coins. In each move, a player can pick x, y, or 1 coin. Geek always starts the game. The player who picks the last coin wins the game. The task is to determine whether Geek will win the game or not if both player... | geeksforgeeks | Medium | {
"class_name": "Solution",
"created_at_timestamp": 1715546011,
"func_sign": [
"public static int findWinner(int n, int x, int y)"
],
"initial_code": "import java.io.*;\nimport java.util.*;\n\nclass GFG {\n public static void main(String[] args) throws IOException {\n BufferedReader br = new Buf... | {
"class_name": "Solution",
"created_at_timestamp": 1715546011,
"func_sign": [
"findWinner(self, n : int, x : int, y : int) -> int"
],
"initial_code": "if __name__ == \"__main__\":\n t = int(input())\n for _ in range(t):\n n = int(input())\n x = int(input())\n y = int(input())\n... | eJylVL0OgjAQduBBSGdi2qsF9UlMPOOgDC4nAyQmRuND6Iu6uVkLBjQ5ySFTSft9/X4OLtHtEY3Cs7j7xfKodlRUpZrHyiAZjQRITiWxyg9Fvinz7Xpfle2JM5I6JfEXzCGlSDMhLEOySBMGpRkU+I3pS6oU58KNxghVWk/ooQakoUCwlwphTjc1cP5Ynbb2Z6U6ta4btNJEg0zXjZYfHY7DfljWzQv0TsfP1EEee33bHzG2BIgDKd6TJmNj24FOvHy+XFC9n1//74KjyLo9DWo5mBikZXUdPwFS6JPT |
702,678 | Missing And Repeating | Given an unsorted array arr of of positive integers. One number Afrom set [1, 2,....,n] is missing and one number Boccurs twice in array. Find numbers A and B.
Examples:
Input:
arr[] = [2, 2]
Output:
2 1
Explanation:
Repeating number is 2 and smallest positive missing number is 1.
Input:
arr[] = [1, 3, 3]
Output:
3... | geeksforgeeks | Medium | {
"class_name": "Solution",
"created_at_timestamp": 1729242317,
"func_sign": [
"ArrayList<Integer> findTwoElement(int arr[])"
],
"initial_code": "import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.util.ArrayList; // Import ArrayList\nimport java.uti... | {
"class_name": "Solution",
"created_at_timestamp": 1729242317,
"func_sign": [
"findTwoElement( self,arr)"
],
"initial_code": "# Initial Template for Python 3\n\nif __name__ == '__main__':\n tc = int(input())\n while tc > 0:\n arr = list(map(int, input().strip().split()))\n ob = Soluti... | eJyllMFuwjAQRDmU/xj5jFDWSeqEL6lEqh4gBy4phyAhVUX8A+XC17JxCqpKJoYQ5RDF2rfjGa/3L8fTeOSft4N+zL/MqlpvajODkaISiJnAlNt1uajL5cfnpr4swhbVrqjM9wT/ayxiJEjxCocMOXLCyCERg0S45TQ/I6ZH18KKUlKtPUht0118tfUqMkJQfYHuf3ehvlpIDEn0ZTtSwQTZZUyLtAyma9zqXClOaalSY5XbF7swjlPEVRgpd1RF7PNuJfS57O7KqSs4ThVkwZPT6Tp1mx6nq9n3WN0JwcCxDBjURDDQpDa6J7Jjm4nw... |
700,517 | Index of an Extra Element | You have given two sorted arrays arr1[] & arr2[] of distinct elements. The first array has one element extra added in between. Return the index of the extra element.
Examples:
Input:
n = 7, arr1[] = {2,4,6,8,9,10,12}, arr2[] = {2,4,6,8,10,12}
Output:
4
Explanation:
In the first array, 9 is extra added and it's index... | geeksforgeeks | Easy | {
"class_name": "Solution",
"created_at_timestamp": 1731322769,
"func_sign": [
"public int findExtra(int arr1[], int arr2[])"
],
"initial_code": "import java.io.*;\nimport java.util.*;\n\npublic class Main {\n\n public static void main(String[] args) throws Exception {\n BufferedReader br = new ... | {
"class_name": "Solution",
"created_at_timestamp": 1731322769,
"func_sign": [
"findExtra(self,arr1,arr2)"
],
"initial_code": "if __name__ == '__main__':\n tc = int(input())\n while tc > 0:\n # Take the first array as input\n arr1 = list(map(int, input().strip().split()))\n\n # ... | eJzt2s3OHFcRxnEWXMiR1wHN+agvxIUgEcQCvGBjskgkJITERcCKHVfK/5mpF1mOJ8YWIgnuSIeOSPmx3/Pr6VPVnr/+9O///OVP7v/86h/8y6///OoPb7765utXvxiv5pdv5lhjjzNs+IiRo8a8jTnHXGPuMc+YNqaPGWPmmDXWbSx+zRprj3XGsrF8rBgrx6qxb2PPsYncY5+xbWwfO8bOsWuc2zhznDUOv+MZx8bxcWKcHKeG3YbNYWvYHsYfyIb5sBiWw2r4bfgcvobv4Wc4f14fHsNzeI24jZgj1og94oywEfw4MSJH1MjbyDly... |
711,146 | City With the Smallest Number of Neighbors at a Threshold Distance | There are n cities labeled from 0 to n-1 with m edges connecting them. Given the array edgeswhere edges[i] = [fromi, toi ,weighti]represents a bidirectional and weighted edge between cities fromiand toi, and given the integer distanceThreshold. You need to find out a city with the smallest number of cities that are rea... | geeksforgeeks | Medium | {
"class_name": "Solution",
"created_at_timestamp": 1656482103,
"func_sign": [
"int findCity(int n, int m, int[][] edges,int distanceThreshold)"
],
"initial_code": "// Initial Template for Java\n\nimport java.util.*;\nimport java.io.*;\nimport java.lang.*;\n\nclass Main {\n public static void main(Stri... | {
"class_name": "Solution",
"created_at_timestamp": 1656437729,
"func_sign": [
"findCity(self, n : int, m : int, edges : List[List[int]], distanceThreshold : int) -> int"
],
"initial_code": "# Initial Template for Python 3\n\nif __name__ == '__main__':\n T = int(input())\n for t in range(T):\n ... | eJztlj1OAzEQRikoOcRo6wjZY3s35iRIBFFACppAkUhICMQh4Dx0nItvPm8SQPKSiH+JFM+JEr8Zj2ft3O0+PO3t8HX4iDdH18357HIxbw6k8ZOZCuDE2+CbkTTTq8vp6Xx6dnKxmK9/djuZNTcjqc91W84NEtZxpTepKKwVk1ZMcWkKxRQtsSAJn2pJhYoq2eQXKrU8o7RmjGbsthS20q0rVIRO+qXHEiwx01IBxLAhVaKkShTvJPdhXO9ypQg22gpspNzZIluOyI1jJ2OOY8nl+1rVcj28T8PL9MtltqWYHTcagYMN2X7CNPvs+uT6... |
703,325 | Subset with no pair sum divisible by K | Given an array arr[] of integers. Your task is to find the maximum size of a subset such that the sum of each pair of this subset is not divisible by k.
Examples:
Input:
arr[] = [3, 7, 2, 9, 1] , k = 3
Output:
3
Explanation:
Maximum size subset whose each pair sum
is not divisible by K is [3, 7, 1] because,
3+7 = 10... | geeksforgeeks | Medium | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"static int subsetPairNotDivisibleByK(int arr[], int k)"
],
"initial_code": "// Initial Template for Java\nimport java.io.*;\nimport java.util.*;\nimport java.util.HashMap;\n\n//Position this line where user code will be pasted... | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"subsetPairNotDivisibleByK(self, arr, k)"
],
"initial_code": "# Initial Template for Python 3\n\nif __name__ == '__main__':\n tc = int(input())\n while tc > 0:\n arr = list(map(int, input().strip().split()))\n ... | eJzFVctOwzAQ5MCFvxjlXCG/Y/MllQjqAXrgEnpoJSQE4iPgf1nvuqWVkjZJeexlEifesWfH6/fLz8XVBcd8Tg+3L9Vju9qsqxtUumm14kDiEIgCtUAQ8AJOwAoYAcrD82w1Q7V8Xi3v18uHxdNmveVRTfvWtNXrDN3sGgYWDh4BNYgfmgY1tIG20A7aQwfoGjpCJxiV505lM8QUiCVzGM4ecl5DXwyMgwkwEVbB0qocbICNcJTVjKYcK6SAlCNKOWKklffxntLVWOdJ0piUznvxoSZxVR5GfiYm/oM051HwH0nmcZrJFT3PV6Jc77aP... |
703,532 | Last index of a character in the string | Given a string S and a character X, the task is to find the last index (0 based indexing) of X in string S. If no index found then the answer will be -1.
Examples:
Input:
S = "Geeks", P = 'e'
Output:
2
Explanation:
Last index of 'e'
is 2.
Input:
S = "okiyh", P = 'z'
Output:
-1
Explanation:
There is no character
as... | geeksforgeeks | Easy | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"int LastIndex(String s, char p)"
],
"initial_code": "//Initial Template for Java\n\nimport java.io.*;\nimport java.util.*;\n\nclass GFG\n{\n public static void main(String args[])throws IOException\n {\n BufferedR... | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"LastIndex(self, s, p)"
],
"initial_code": "# Initial Template for Python 3\n\nif __name__ == '__main__':\n t = int(input())\n for _ in range(t):\n s = input().strip()\n p = input().strip()[0]\n\n ob ... | eJy9VklTwjAU9uDFizfvTM/osHjBW1lT9qWFgnGcLilFJWwtlDo6/gj9v0YYFBxepMKQad502ve+t+R7Sd5OPy7OThZDPWcvt89Cjw5dR7gJCVFMc1bXUdi0FMvqKhlMFSEcEog3JIZDzPuB66x045i+Yiq8hENrCDFMRU03TPIjDF0j5obAVMd0NCNjZ+72BkNtYlpd++HxyfeMqU77yz+Y+oDneGzhOZrYFgBLYeGVIfYYZJ8OhqPxxHGnM2/ui8lUOpPNISlfKJbKlWqt3pCVZkttd/5jg6kK1SYSBWJDSEQ2ytu2hiTUs22EqQSB... |
700,367 | Smallest divisible number | Given a number N, find an integer denoting the smallest number evenly divisible by each number from 1 to n.
Examples:
Input:
N = 3
Output:
6
Explanation:
6 is the smallest number
divisible by 1,2,3.
Input:
N = 6
Output:
60
Explanation:
60 is the smallest number
divisible by 1,2,3,4,5,6.
Constraints:
1 ≤ N ≤ 25 | geeksforgeeks | Easy | {
"class_name": "Solution",
"created_at_timestamp": 1617189914,
"func_sign": [
"public static long getSmallestDivNum(int n)"
],
"initial_code": "//Initial Template for Java\n\nimport java.io.*;\nimport java.util.*;\n\npublic class GFG {\n public static void main(String[] args) throws Exception {\n ... | {
"class_name": "Solution",
"created_at_timestamp": 1617189914,
"func_sign": [
"getSmallestDivNum(self, n)"
],
"initial_code": "#Initial Template for Python 3\n\nif __name__ == '__main__':\n t=int(input())\n for tcs in range(t):\n n=int(input())\n ob = Solution()\n print(ob.getS... | eJzNUz1LxEAQtdD/EVIfMt8z6y8RPLHQFDbxijsQRLG0s9H/6ySiYjEXtTIsIWT37bz35s3j4evz0cH8nD7lx9ldfz1udtv+pOtxPWK/6vrhdjNcboeri5vd9mvrYT3296vu+3nSAkDmjigiABW0QlbnpQAoqxBFRFUJK5JskKuqBxVBJm+kNbAycRFYWrIE5D9bE1XDiZRISlwu2mdSFRgsm9FUJ6KaYi05izZFVkTgSOkUwMrezMiURd2tTNZsZVWmTPIkZ1lXhtqiiZOwi4tgcDRycvPGualszYJYCSX/mQW6ZQ8ozAmNJA+weyAE... |
702,733 | Finding-Pairs | You are given an array of character pairs and a string s. Your task is to count how many of the character pairs from the array appear in the string s.
Examples:
Input:
arr[] = [('A','G'),('d','i'),('P','o')], s = "APiod"
Output:
2
Explanation:
In the string
"APiod"
, the pairs
(d, i)
and
(P, o)
appear. Thus, t... | geeksforgeeks | Easy | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"public int countPairs(List<char[]> arr, String s)"
],
"initial_code": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n\n int ... | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"count_pairs(self, arr, s)"
],
"initial_code": "def main():\n import sys\n input = sys.stdin.read\n data = input().strip().split('\\n')\n\n t = int(data[0])\n\n index = 1\n solution = Solution()\n\n while t... | eJzVVUtv00AQ5sCJX/HJ5wpBuXGLnWfL6zjAVsjeXXvtOOtH/CqIih/ADfi/XbtNU5UE1VXSiLns7Nqa+eab14+nf349e9IJ/TTK529WqNOysF7DesX0wIXtweEYCoxke7c9hw9Fq48DTBSmodHuJYFS4Y0wTR8/YWA7GI7Gxq7tmHMynZ2cvjEfrCNYskklL6T4kpTFNaCZ5kmem1d0GOEn+cItmO77bn0/wq04j5lOM+RLFCWqGs15e6/qosyXre564ALSZ1r6XLjejsDdAfGS6XgBnWAFhel8WZTxQidp1tPl36bDCPMYC40kRZZj... |
700,497 | Smallest range in K lists | Given K sorted lists of integers,KSortedArray[]of size N each. The task is to find the smallest range that includes at least one element from each of the K lists. If more than one such range's are found, returnthe first such range found.
Examples:
Input:
N = 5, K = 3
KSortedArray[][] = {{1 3 5 7 9},
{0 2 4 6 8},
... | geeksforgeeks | Hard | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"static int[] findSmallestRange(int[][] KSortedArray,int n,int k)"
],
"initial_code": "import java.util.*;\nimport java.io.*;\nimport java.lang.*;\n\npublic class DriverClass\n{\n\tpublic static void main(String args[]) \n\t{\n... | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"smallestRange(self, KSortedArray, n, k)"
],
"initial_code": "# Initial Template for Python 3\n\nt = int(input())\nfor _ in range(t):\n line = input().strip().split()\n n = int(line[0])\n k = int(line[1])\n numbers ... | eJztmd1uFFcQhHOR14jU2muETp//w5NEZKMIEV/kZuHCSJEQKA8B78tX7QQEZjbGAdvEa6kka2emT3V1dfdo968f3z756Yf4+/kx//zycvfH4fmL890j2/n+0K3uD27NlnkxH5b5sNo0z+bdcrLMDcWGuZs382W57A/Zunkyr+bTct4fdg9sd/bn87On52e///bsxfk/Jyj8ay6/emAfHzyscXDSCSVZTdaS9WQj8Wmz3Kw0q81as95scO+nn9jkw48ftZlsJd16KcQmQyKUtsEReuSa7HM0j5x1Qc4WYWfoM61Mq9PatD5tTJvT1tyk... |
703,201 | Longest Common Substring | You are given two strings str1 and str2. Your task is to find the length of the longest common substring among the given strings.
Examples:
Input:
str1 = "ABCDGH", str2 = "ACDGHR"
Output:
4
Explanation:
The longest common substring is "CDGH" which has length 4.
Input:
str1 = "ABC", str2 = "ACB"
Output:
1
Explanatio... | geeksforgeeks | Medium | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"public int longestCommonSubstr(String s1, String s2)"
],
"initial_code": "// Initial Template for Java\n\nimport java.io.*;\nimport java.util.*;\n\nclass GFG {\n public static void main(String args[]) throws IOException {\n... | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"longestCommonSubstr(self, s1, s2)"
],
"initial_code": "# Initial Template for Python 3\n\nif __name__ == '__main__':\n t = int(input())\n\n for _ in range(t):\n S1 = input().strip()\n S2 = input().strip()\n... | eJzFVttu00AQ5YEnviLyc4VICkXqW9qkQGlJSwoEWITs9fqS2DPO7jp2gkB8BPwv60ugqJ4oqUxxJGt2NjNnLmcm+X7/Z//BvfKZHBrh4xcrhCTV1mHH2mdgO9wVnh+E01kUAyZzqXS6yPLlqn90PBiePHv+4vTl2fmr0cXl6/HVm7fvJu8/MFgt82yRaiXnCUIczaZh4HvC5Y7NoPLCoHJWIzAoMay9jiXyRHAt3M+Y6jqOLoNvDJ6U70fl2/q617kWaI/BVSAu05DPjiRmcIL5aRonarQQ0lyc2avlAH0GOhCRkV30p8U1mmujmhd2... |
704,467 | Break a number | Given a really large number N, break it into 3 whole numbers such that they sum up to the original number and find the number of ways to do so. Since this number can be very large, return it modulo 10**9+7.
Examples:
Input:
N = 2
Output:
6
Explanation:
Possible ways to break the number:
0 + 0 + 2 = 2
0 + 2 + 0 = 2
... | geeksforgeeks | Easy | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"int waysToBreakNumber(int N)"
],
"initial_code": "\nimport java.io.*;\nimport java.util.*;\n\nclass GFG\n{\n public static void main(String args[])throws IOException\n {\n BufferedReader read = new BufferedReader(... | {
"class_name": "Solution",
"created_at_timestamp": 1671212611,
"func_sign": [
"waysToBreakNumber(self, n)"
],
"initial_code": "# Initial Template for Python 3\n\nif __name__ == '__main__':\n t = int(input())\n for _ in range(t):\n n = int(input())\n\n ob = Solution()\n print(ob... | eJytlM1KxTAQhV2Iz1Gyvsh0kkkTn0Sw4kKLuKl30QuCKD6Evq8hyfQHM+0tmNWQdGZOvpzp1+VPf3UR1+1zCO7e1Ut/PA3qplJ120Pbq0Olurdj9zh0Tw+vp2E6/AyHH4dqmVGLGVrKAF5yMxJyPS8xFUWhqA3ZxsmpBNZr4xFLFcImQRQvq9ZoYyrVVFShI+BwhBuYEzor1JhBmLPkXbfFJtNFJ9xzVl++LNcq1aBRWOjCgebAcEBbLjDeEqQO6J2FHBtjHe+TN4b3G1Mj7/99f0j23m/XpXfE/KaIc3ry3L4tlTzHDUiSQtg7shCJ... |
701,199 | Possible Words From Phone Digits | Given a keypad as shown in the diagram, and an N digit number which is represented by array a[ ], the task is to list all words which are possible by pressing these numbers.
Examples:
Input:
N = 3, a[] = {2, 3, 4}
Output:
adg adh adi aeg aeh aei afg afh afi
bdg bdh bdi beg beh bei bfg bfh bfi
cdg cdh cdi ceg ceh cei... | geeksforgeeks | Medium | {
"class_name": "Solution",
"created_at_timestamp": 1616269931,
"func_sign": [
"static ArrayList <String> possibleWords(int a[], int N)"
],
"initial_code": "//Initial Template for Java\n\nimport java.util.*;\nimport java.io.*;\nimport java.lang.*;\n\nclass PhoneDigit\n{\n public static void main(String... | {
"class_name": "Solution",
"created_at_timestamp": 1616269931,
"func_sign": [
"possibleWords(self,a,N)"
],
"initial_code": "# Initial Template for Python 3\n\nimport math\n\n\ndef main():\n T = int(input())\n\n while T > 0:\n N = int(input())\n a = [int(x) for x in input().strip().spl... | eJxE280KbVuWlVEQn8HyIcoWTP/S9BUsC4IJ4t65lnM6RvQeEUaS51wrPrqV5LbaLqwNszCgwwft//3L//Zf/uu/+hf//f/+4eZP//jXP/znH3/4m7/P3/ybv8/f/fhPP/72x3/88R9+/Psf/+7Hv/3xdz/+9g//+scfnp9/er5/ff7hf/Qf//rPf/inv/7pj//7f/3D//ynP/34/eef/fyLn//n958/ffvTtz99+9O3v3z7y7e/fPvLt7/59jff/ubb337/9uO9H+/9eO/Hez/e+/Hej/d+vPfjvR/v/Xjvx3s/3vvx3o/3frz3671f... |
701,372 | Combination Sum | Given an array of integers and a sum B, find all unique combinations in the array where the sum is equal to B. The same number may be chosen from the arrayany number of times to make B.
Examples:
Input:
N = 4
arr[] = {7,2,6,5}
B = 16
Output:
(2 2 2 2 2 2 2 2)
(2 2 2 2 2 6)
(2 2 2 5 5)
(2 2 5 7)
(2 2 6 6)
(2 7 7)
(5 5 ... | geeksforgeeks | Medium | {
"class_name": "Solution",
"created_at_timestamp": 1617731110,
"func_sign": [
"static ArrayList<ArrayList<Integer>> combinationSum(ArrayList<Integer> A, int B)"
],
"initial_code": "//Initial template for JAVA\n\nimport java.util.*;\nimport java.io.*;\nimport java.lang.*;\n\nclass Driverclass\n{\n stat... | {
"class_name": "Solution",
"created_at_timestamp": 1617731110,
"func_sign": [
"combinationalSum(self,A, B)"
],
"initial_code": "# Initial Template for Python 3\n\nimport atexit\nimport io\nimport sys\n\n# Position this line where user code will be pasted.\nif __name__ == '__main__':\n test_cases = int... | eJzdfc2uLbluXoJ4kMfY6JEbuDB2UZRUlbnfwYDb8MC+Aw98cgd9AQdBgjxEHjh7VYnkR4qqtc5f9+mgcA6KlEr8p6i1VaX/8zf/8F/+63/+T//4P3/6t09/+euvP/23t5+2Xz5t9ePfG72VN36rb+2tv+1vx9v2/rZtbxu9beVt47dHJ3r/6U9vP/35P/7y53/59c//+s///a+/jkH+9qPjK9fPL3WkV7qV553olZH4WRd6Tqred6DnnNAzPsozLtpdMz2Tgu5lKPfs9XUjPZOe7mWne8npTu5yJxTfUd1XTXSvSrpTJN2pkdZKLHcq... |
704,544 | Check Tree Traversal | Given Preorder, Inorder and Postorder traversals of some tree of size N. The task is to check if they are all of the same tree or not.
Examples:
Input:
N = 5
preorder[] = {1, 2, 4, 5, 3}
inorder[] = {4, 2, 5, 1, 3}
postorder[] = {4, 5, 2, 3, 1}
Output:
Yes
Explanation:
All of the above three traversals
are of the ... | geeksforgeeks | Hard | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"static boolean checktree(int preorder[], int inorder[], int postorder[], int N)"
],
"initial_code": "import java.util.*;\nimport java.lang.*;\nimport java.io.*;\n\nclass GFG\n{\n\tpublic static void main(String args[])\n\t{\n\... | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"checktree(self, preorder, inorder, postorder, N)"
],
"initial_code": "# Initial Template for Python 3\n\n# Driver Code\nif __name__ == \"__main__\":\n t = int(input())\n for _ in range(t):\n n = int(input())\n ... | eJytVM0KgkAQ7lDvMexZAt2fQw/RucjoUHvookIKQQQ9RL1Ht16vmd01U1RYVRadFb9vvplvx8f89VnMzLV5Y7C7sXOSFTlbAQvjpFosAKavmT7m+nRIi9x9s9WXOGH3AOq4CBGAtwhCE3Wg12kfuGTwS80NELiB2gfv5GgXYCi4y04UGHtSCKtCEFqAo6HAV4twWkCQjLAMhLci6fqCUGkrEkgnSzLpTyepPDAW/4W/JH62qbJhEtHK9kpS2+xG4lYNM7J+Frw5qtXnhvC1w0gbecjQA5jUhObkUXGTNksN7BaxkZrpmZt/KvdqyLCr... |
712,176 | Find XOR of numbers from L to R. | You are given two integers L and R, your task is to find the XOR of elements of the range [L, R].
Examples:
Input:
L = 4, R = 8
Output:
8
Explanation:
4 ^ 5 ^ 6 ^ 7 ^ 8 = 8
1<=l<=r<=10**9 | geeksforgeeks | Easy | {
"class_name": "Solution",
"created_at_timestamp": 1664387363,
"func_sign": [
"public static int findXOR(int l, int r)"
],
"initial_code": "// Initial Template for Java\n\nimport java.io.*;\nimport java.util.*;\n\nclass GFG {\n public static void main(String[] args) throws IOException {\n Scann... | {
"class_name": "Solution",
"created_at_timestamp": 1664516064,
"func_sign": [
"findXOR(self, l, r)"
],
"initial_code": "# Initial Template for Python 3\n\nif __name__ == '__main__':\n t = int(input())\n for _ in range(t):\n l, r = list(map(int, input().split()))\n ob = Solution()\n ... | eJyllE1KBDEQhV3oPULWg6QqP1XxJIItLrQXbtpZ9IAgiofQvTuvqYypDDI8ehzfpgsq85G8ejWvp++fZydbXX58F1dP/n5ab2Z/4TwNE4UmZ5X4lfPj43q8nce7m4fN3A6HYXoZJv+8cr8Jtal0QggAsTsAWLm1ybWKIIoAgjimXESrqyolp8iEEHYSkUyOTYhUMyVVYUBK3WSrEiD1PiCJOeRaRehOvQ9IanLtW5HV1keOR5NLJuRTIYmicPw2sWCzi+hO1ocp6EFainXP5EGRhHlMtSqL5IwudPR+0c8e/GdF9ycEAFwjhVhUF1Zi... |
700,653 | Triplet Family | Given an array arr of integers. Find whether three numbers are such that the sum of two elements equals the third element.
Examples:
Input:
arr[] = [1, 2, 3, 4, 5]
Output:
true
Explanation:
The pair (1, 2) sums to 3.
Input:
arr[] = [5, 3, 4]
Output:
false
Explanation:
No triplets satisfy the condition.
Constraint... | geeksforgeeks | Easy | {
"class_name": "Solution",
"created_at_timestamp": 1618437728,
"func_sign": [
"public boolean findTriplet(int[] arr)"
],
"initial_code": "// Initial Template for Java\nimport java.io.*;\nimport java.lang.*;\nimport java.util.*;\n\n//Position this line where user code will be pasted.\n\nclass GFG {\n p... | {
"class_name": "Solution",
"created_at_timestamp": 1618437728,
"func_sign": [
"findTriplet(self, arr)"
],
"initial_code": "# Initial Template for Python 3\n\nif __name__ == \"__main__\":\n t = int(input())\n while t > 0:\n arr = list(map(int, input().split()))\n ob = Solution()\n ... | eJy1VMtKxEAQ9CB+R5HzIj3PzHr05h8IRkQ0giBx0SwIovgR+r9WT7LqCis6WQPdPQSmpqqrZ1523472dvJ3fMjFyWN13S2WfXWAyjSdEYERA8twXHvWIFLNULUPi/aiby/Pbpf9uKG/W7ZN99x01dMM34Bg4ZFgIpxF9DA2wYa4Aenq/OZ+E1QQUkBmxmpZLauyc6GA2RyGTGq4CB8QPKJDbZEM5gVoJAWHSHpkB0vZaYUcCromkhVmedp9Ue1MUVOtKWmaS5EnNNOI5QGO4XlGYJCs1Iz0d0ClNhBU4KEM/1TDYNRKTAlhdZ1Q3E9+... |
702,726 | Large Factorial | You are given an array A of integersof length N. You need to calculatefactorial of each number.The answer can be very large, so print it modulo 10**9+ 7.
Examples:
Input:
N = 5
A[] = {0, 1, 2, 3, 4}
Output:
1 1 2 6 24
Explanation:
Factorial of 0 is 1,
factorial of 1 is 1,factorial of 2is 2,
factorial of 3is 6 and ... | geeksforgeeks | Medium | {
"class_name": "Solution",
"created_at_timestamp": 1617950236,
"func_sign": [
"public long[] factorial(long a[], int n)"
],
"initial_code": "// Initial Template for Java\n\nimport java.io.*;\nimport java.util.*;\n\nclass Main {\n // Driver code\n public static void main(String[] args) throws Except... | {
"class_name": "Solution",
"created_at_timestamp": 1617950236,
"func_sign": [
"factorial(self,a, n)"
],
"initial_code": "# Initial Template for Python 3\n\n# Driver code\nif __name__ == \"__main__\":\n tc = int(input())\n while tc > 0:\n n = int(input())\n a = list(map(int, input().st... | eJzNVctuFDEQ5MCFv2jNOULul7vNlyCxiAPsgcuSQyIhIRB3bgj+l/LMbAZFcRZIgLQ0nl573I+qsvfz4+9fnzya7fkXOC8+TG8P55cX0zOaeHfg0h8YtW7ks88kpGTkVCmmM5r278/3ry/2b169u7xYN7ty8xKSlDU4zRPfajT1VJ8jVBIjlkKBx4sV2h0+7Q7TxzO6VoTjETUnNxXupRCKWErBgJmM6tQXMdONpBtpN7Ju5N2odqPoNio8mjeJYMRrVjylUXitxia98K0xbdzUMtFHCNaRkLE1Uxl5gtEsC1lND63RqwnRsHRqKlYs... |
705,612 | Rohan's Love for Matrix | Rohan has a special love for matrices especially for the first element of the matrix. Being good at Mathematics, he also loves to solve the different problems on matrices. So one day he started to multiplythe matrix with theoriginal matrix. The elements of theoriginal matrixaare given by[a00=1, a01=1, a10=1, a11=0].Giv... | geeksforgeeks | Medium | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"static int firstElement(int n)"
],
"initial_code": "// Initial Template for Java\nimport java.io.*;\nimport java.util.*;\n\nclass GFG {\n public static void main(String args[]) throws IOException {\n BufferedReader r... | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"firstElement(self, n)"
],
"initial_code": "# Initial Template for Python 3\nif __name__ == '__main__':\n t = int(input())\n for _ in range(t):\n n = int(input())\n\n ob = Solution()\n print(ob.firstE... | eJytlb1OAzEMxxmQeAU2qpsrZCdOYvMkSAQxQAeWwFAkJATiIeB9cX1tuauSlgM83J2H/Pzxt3Pvx59nJ0dml6f6cfXS3ZfHp2V3Met8LghmuYhZLmzWzWfd4vlxcbtc3N08PC3XBwQZBF2MubzlEjF6EAIyj5FCiJC8ed3rfDaIhLkkswY4hMROAdXDLpdgpiHNGhDvETh56CHMCIkpSQ2pKE1JwdsWaAx7N9holP7p7CmI5EOA3vPaixgTcKN6bIFXVdVP7M2kFmFf/mPldk77b/m389AKPxZ9jK2m5tZw3gRpqQeYGDm6ymztIGmQ... |
714,082 | Taxi Booking | You are going to book a taxi. There are infinite number of points 1, 2, 3... on the X axis and your current position is cur. There are N Taxis near you, and the position of those taxis is given as an array pos. Where pos[i] denotes the position of the ith taxi. You are also given an array time. Where time[i] denotes th... | geeksforgeeks | Easy | {
"class_name": "Solution",
"created_at_timestamp": 1676973232,
"func_sign": [
"public static int minimumTime(int N, int cur, int[] pos, int[] time)"
],
"initial_code": "import java.io.*;\nimport java.util.*;\nclass IntArray\n{\n public static int[] input(BufferedReader br, int n) throws IOException\n ... | {
"class_name": "Solution",
"created_at_timestamp": 1676973232,
"func_sign": [
"minimumTime(self, N : int, cur : int, pos : List[int], time : List[int]) -> int"
],
"initial_code": "class IntArray:\n def __init__(self) -> None:\n pass\n\n def Input(self, n):\n arr = [int(i) for i in inp... | eJzNVctKxDAUdSH4G5esB8mzbfwSwYoL7cJNnUUHBkTxI/Sz3PlB5t5kJpX2dtphhCnlNg3NOafn3JCPy6+fqwu6br/D4O5VPLfrTSduQKi6NXXrpKxbJaUEjcXI4btYgWi26+axa54eXjZdWh9W0sfvdSveVvAX2UUQAoM4Gn0kLu89TeTCkHJ8CpG0sTteUh/lS7BUSS8UVEuqFVU/lLOkMEJRC29PQcYPrSappDQLAg0GLLgww3BZzzPZwFSUlScmJEIepMEJ8FBByaAab0ttGNgqLHf9eJPh2mXbjcvmJzNc4t9psTERzAPTOKbT... |
703,882 | Copy Set Bits in Range | Given two numbers X and Y, and a range [L, R] where 1 <= L <= R <= 32. You have to copy the set bits of 'Y' in the range L to R in 'X'.Return this modified X.
Examples:
Input:
X = 44, Y = 3
L = 1, R = 5
Output:
47
Explanation:
Binary represenation of 44 and 3 is 1011
00
and 0000
11
. So in the range 1 to 5 there a... | geeksforgeeks | Easy | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"static int setSetBit(int x, int y, int l, int r)"
],
"initial_code": "//Initial Template for Java\nimport java.io.*;\nimport java.util.*;\n\nclass GFG{\n public static void main(String args[])throws IOException{\n Bu... | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"setSetBit(self, x, y, l, r)"
],
"initial_code": "# Initial Template for Python 3\n\nif __name__ == '__main__':\n t = int(input())\n\n for _ in range(t):\n arr = input().split()\n x = int(arr[0])\n y ... | eJytlM9KAzEQxj2IzzHsucj8zSQ+gzcvghUP2oOXtYctCKL4EPq+ZtvuFqHJbsW5ZBeSHzPf9yWf5983F2fbur3OH3dvzXO73nTNFTS0bIlFLXhMkKIHU2ECQmBcts0CmtXrevXYrZ4eXjbdcIjF2Ylt2X7kTe8L+E3cMhB6JhIYkBVRph5FCxwaCngoIBAu0jgoKxFKAZiGgsPQjCCVUdFJUCh4AamcNAXnBNFiSpma4QZcHlmFnDVZqcljflQ17A8EI6XS1AdbR3RVxn7oICnFNEncLfkfInCsEk0xWElGJnWNEtRz9lxcKbLkfqtu... |
703,278 | String formation from substring | Given a string s, the task is to check if it can be constructed by taking a substring of it and appending multiple copies of the substring together.
Examples:
Input:
s = "ababab"
Output:
1
Explanation:
It is constructed by
appending "ab" 3 times
Input:
s = "ababac"
Output:
0
Explanation:
Not possible to construct... | geeksforgeeks | Medium | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"int isRepeat(String s)"
],
"initial_code": "//Initial Template for Java\n\nimport java.io.*;\nimport java.util.*;\n\nclass GFG {\n public static void main(String args[]) throws IOException {\n BufferedReader read =\n... | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"isRepeat(self, s)"
],
"initial_code": "# Initial Template for Python 3\n\nif __name__ == '__main__':\n T = int(input())\n\n for i in range(T):\n s = input()\n\n ob = Solution()\n answer = ob.isRepeat... | eJxrYJl6lJUBDCL2ARnR1UqZeQWlJUpWCkqGMXmJSclwFJOnpKOglFpRkJpckpoSn19aglBXB5Ss1VFA0wwESVCMU7MBDs0VlVVwVFlFsvbC8tSikkpkkmTnV+EFpIdGEhziDkrcoYEBSTYjJz8vvbikKDMvHRuLjNhNSoJhkjUXpRakJpbgIkk2DhEsMTFAEiXRkhpMqNGMHkhUiDlg1MVQYAjZ8V9RCcmTGGkRKZNSnsowUgb2ZEd2hiaYnYksUEiNAkhhhsUcMss3sC+IyAmkeDl2ih4A4VIVcQ== |
712,069 | Maximum Nesting Depth of the Parentheses | A string is a valid parentheses string (denoted VPS ) if is meets any one of the following:
It is an empty string "", or a single character not equals to "(" or ")" ,
It can be written as AB (A concatenated with B ). We can similarly define the nesting depth depth (S) of any VPS S as follows:
depth ("") = 0
depth (C)... | geeksforgeeks | Easy | {
"class_name": "Solution",
"created_at_timestamp": 1663911489,
"func_sign": [
"public static int maxDepth(String s)"
],
"initial_code": "import java.io.*;\nimport java.util.*;\n\nclass GFG {\n public static void main(String[] args) throws IOException {\n Scanner sc=new Scanner(System.in);\n ... | {
"class_name": "Solution",
"created_at_timestamp": 1663739167,
"func_sign": [
"maxDepth(self, s)"
],
"initial_code": "# Initial Template for Python 3\n\nif __name__ == '__main__':\n t = int(input())\n\n for _ in range(t):\n s = input()\n ob = Solution()\n print(ob.maxDepth(s))\... | eJy9VdtOwkAQ9cHE32j6NLPDuhRaCv6FbyRAjEIFpBZU7gTjR+j/OtsCIdHdconOQzttsmfOzDmdflx+1a8u0qjfctJYuf1kNBm7N47rNRMHwKOSgLIEXwXIQaCjolOAkK9uwXGj+Shqj6PO3XAy3hwOmsl7M3HXBecHIuij6fk01dkmN6L5FjSAe3pgXm3qaHoRPWY0u9RDAX16OolkA1ZrbCE2QCcraLSQnw04ZQu9OS2YxlJTmgmY0DRjNxAx355lYiRnA82CpUFZRuEja0MVlCGKKqoaUtEEWjODajQBUFY+UoASKgQhw6V4m4JF... |
713,978 | Update Queries | You are given an array of n elements, initially all a[i] = 0. Qqueries need to be performed. Each query contains three integers l, r, and x and you need to change all a[i] to (a[i] | x) for all l≤i ≤ r.
Examples:
Input:
N=3, Q=2
U=[[1, 3, 1],
[1, 3, 2]]
Output:
a[]={3,3,3}
Explanation:
Initially, all elements of t... | geeksforgeeks | Medium | {
"class_name": "Solution",
"created_at_timestamp": 1675772979,
"func_sign": [
"int [] updateQuery(int N, int Q, int [][]U)"
],
"initial_code": "//Initial Template for Java\n\nimport java.util.*;\nimport java.io.*;\nimport java.lang.*;\n\nclass GFG{\n\tpublic static void main(String [] args) throws IOExce... | {
"class_name": "Solution",
"created_at_timestamp": 1675772979,
"func_sign": [
"updateQuery(self, N, Q, U)"
],
"initial_code": "# Initial Template for Python 3\n\nif __name__ == \"__main__\":\n for _ in range(int(input())):\n n, q = map(int, input().split())\n U = []\n for i in ran... | eJzdVEtOwzAQZcGCY4y8rlDGnzjtSZAwYgFZsDFdpBISAvUQcB123AuP7URtw7gUogo1M6pcd/pm8vz81ufvnxdn8bn6CIvrZ/Hgl6tOLECg8wjpA7Cix3kxA9E+Ldu7rr2/fVx1ubQC51/Dry8z2AYwCcCAkra27P8VwmYyYFiBiuNUPap0vqavmkeGPswQLHzGzQsGMdJxAsGwoDLHxIAECWlrLx9lNDUIiFuzwqJgwCWdf1ZnGlYWoDQ0BWGZNE4Qkg4KaUhXFjDsNqQvS/BzehcW3FI9xjSUNgY3eW5IjYkIDJODNPG+mNgWa+iL... |
700,533 | Maximum Bipartite Matching | There are M job applicants and N jobs. Each applicant has a subset of jobs that he/she is interseted in. Each job opening can only accept one applicant and a job applicant can be appointed for only one job. Given a matrix G where G(i,j) denotes i**thapplicant is interested in j**thjob. Find an assignment of jobs to app... | geeksforgeeks | Medium | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"public int maximumMatch(int[][] G)"
],
"initial_code": "//Initial Template for Java\n\nimport java.util.*;\nimport java.lang.*;\nimport java.io.*;\nclass GFG\n{\n public static void main(String[] args) throws IOException\n ... | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"maximumMatch(self, G)"
],
"initial_code": "# Initial Template for Python 3\n\nif __name__ == '__main__':\n T = int(input())\n for i in range(T):\n m, n = map(int, input().strip().split())\n G = []\n ... | eJztWMFKxDAQ9eBPeBCG4HGRJN1li18iWPGgPXiJe+iCIIIfof9rOk27STOztHahu24WsqTpZOa9l2baydflz83VBf7ur23n4UO8ms22EncgssKsYFUYBRKwFcZ1QLaj2G1G0cCzXcKyvsZbtQ2adxadr8KsYe35CP2Etn4UD4oD0oYi7nYDYgGifN+Uz1X58vS2rRxVy9KCtTDE5wI8CXRh8p0EFFnHqoUgebm6aXLnTNleH3E4ORju6RKFoSwDWcMghKUHMhqOLXtr0zVe5ZptT2OFMuStRIHU+9bdl51gTWsT6RLhj1hGFgy7nGKm... |
710,025 | Levels Of Game | You are playing a game. At each level of the game, you have to choose one of the roads to go to the next level. Initially, you have h amount of health and mamount of money.If you take the first road then health decreases by 20 and money increase by 5.If you take the second road then your health decreases by 5 and money... | geeksforgeeks | Medium | {
"class_name": "Solution",
"created_at_timestamp": 1650389561,
"func_sign": [
"public static int maxLevel(int h,int m)"
],
"initial_code": "import java.io.*;\nimport java.util.*;\nclass IntArray\n{\n public static int[] input(BufferedReader br, int n) throws IOException\n {\n String[] s = br... | {
"class_name": "Solution",
"created_at_timestamp": 1650389561,
"func_sign": [
"maxLevel(self, h:int,m:int) -> int"
],
"initial_code": "class IntArray:\n def __init__(self) -> None:\n pass\n\n def Input(self, n):\n arr = [int(i) for i in input().strip().split()] # array input\n ... | eJylkj8KwjAUxh16kEfmKnlJQxtPIlhx0AwusUMLgigeQg/g5jF9OigOnzY1EAiEX74/L6fscstGzzW7ymG+V5vYdK2akuI6MrHKSYVdE1ZtWC+3Xfu+PNZRHXL6JCqtSTagLHvAOWIIAcRocgBxAGFxZ6A7VwKs9J5kJ4eyBBlk0JFF9pC7QkLB8io0KNZUwCZQIGbNWMvAIr4YHCODUt5DUT6TiP7UhoWK9GuACIYdDRAEtvGvS3+ob6xeL6fCmoZPkv+OsjhP7rQkZro= |
701,151 | First Set Bit | Given an integerN. The task is to return the position of first set bit found from the right side in the binary representation of the number.Note: If there is no set bit in the integer N, then return 0 from the function.
Examples:
Input:
N = 18
Output:
2
Explanation:
Binary representation of 18 is 010010,the first se... | geeksforgeeks | Easy | {
"class_name": "Solution",
"created_at_timestamp": 1618483437,
"func_sign": [
"public static int getFirstSetBit(int n)"
],
"initial_code": "//Initial Template for Java\n\nimport java.util.*;\nimport java.lang.*;\nimport java.io.*;\n\nclass Main {\n \n \n\tpublic static void main (String[] args) {\n... | {
"class_name": "Solution",
"created_at_timestamp": 1618483437,
"func_sign": [
"getFirstSetBit(self,n)"
],
"initial_code": "# Initial Template for Python 3\n\nimport math\n\n# Position this line where user code will be pasted.\n\n\ndef main():\n T = int(input())\n\n while T > 0:\n n = int(inp... | eJytlE0KwjAQhV30ICXrIvmbZOpJBCsutAs30UUFQRQPoVt33tNUqyj0BRSzCm2/eXlvJj1m52s2uK/xJW4mO7EM600jRrlQVZCiyEW9Xdfzpl7MVpumeyWrcKiC2Bf55/dKWibvAKUVwIwhstZoxDnAOa8ks7OI84Aj49jLUiFBA/0Zq5X3mpEiw2C6BcCyj9NV0EQRBtAjzt5QI6q0seQ8x9Ile0cx3x8KxYfasTUUayHTvYd/pdWOEU4sIRo1kWI65RcO40aqj/n9FmodJgcfm6RvXd4b+6/OdvfnfT7RYdJ9Svwq8Hi+u0jCzyCm... |
700,408 | Rat in a Maze Problem - I | Consider a rat placed at (0, 0) in a square matrix mat of order n* n. It has to reach the destination at (n - 1, n - 1). Find all possible paths that the rat can take to reach from source to destination. The directions in which the rat can move are 'U'(up), 'D'(down), 'L' (left), 'R' (right). Value 0 at a cell in the m... | geeksforgeeks | Medium | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"public ArrayList<String> findPath(int[][] mat)"
],
"initial_code": "// Initial Template for Java\n\nimport java.util.*;\n\nclass Rat {\n public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);... | {
"class_name": "Solution",
"created_at_timestamp": 1722276232,
"func_sign": [
"findPath(self, m: List[List[int]]) -> List[str]"
],
"initial_code": "# Main function to read input and output the results\nif __name__ == \"__main__\":\n t = int(input().strip())\n for _ in range(t):\n n = int(inp... | eJzVVDsOwjAMZWDjElHmgpyBhbkjUyckghigA0vo0EpIfMQh4L4kaUPVTz5tANGkUi0r8vPzs30fPy+TkTyrjBvrMz6wJEvxAmFC2ZwygvILlAESV5rSI/zCLPzlW4IDhONTEu/SeL89ZmkRMYqiMOQfZTfK8DVArWgyXAUCql6ivAWwBk0gCUTE/9Iww9ajVryKJDiR5IBLfiRqZEJtBrUloCcrYd04tgA35TVxzOsZGrnpGwQUzXc6hdeAFnroB530mxK7YqSlcHXFbO1pxnEfA3tndBgDKEUjqhmg1xjY6HXeKZ9fEG7rSJ8oDCpT... |
705,695 | Assignment Problem | You are the head of a firm and you have to assign jobs to people. You have N persons working under you and you have N jobs that are to be done by these persons. Each person has to do exactly one job and each job has to be done by exactly one person. Each person has his own capability (in terms of time taken) to do any ... | geeksforgeeks | Hard | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"static int assignmentProblem(int Arr[], int N)"
],
"initial_code": "//Initial Template for Java\n\nimport java.io.*;\nimport java.util.*;\n\nclass GFG {\n public static void main(String args[]) throws IOException {\n ... | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"assignmentProblem(self, Arr, N)"
],
"initial_code": "# Initial Template for Python 3\n\nif __name__ == '__main__':\n t = int(input())\n for _ in range(t):\n N = int(input())\n Arr = list(map(int, input().sp... | eJzdVztuFEEUJCDmDE8bW2he9+sfJ0FiEQE4IBkIbAkJgTgEXJGMO1BVjSUTNDYWoDWrCVarUb/6vZrZTw+/fHv0QJ+nX/Hl2fvD6/3t5cXhiR38uMdx78l6tjpsJPNiKVlNNsIcV7biVqsNt9KtZvx+OLPD+bu35y8vzl+9eHN5cXVWz8f943E/fDizn0eU4z6K5c1is7pZCcvJUljD3GE1LDBls96sFQLA9O6WhvVuoxMG7vHKm0taTY+0mF6PO47FUBwFFgGCmTDAOsCoWAewai7uYJ0z1WgA0K1xokWTIG5jWG5WgLZY23gnRas8... |
712,035 | Pattern 17 | Geek is very fond of patterns. Once, his teacher gave him a pattern to solve. He gave Geekan integer n and asked him to build a pattern.
Examples:
Input:
4
Output:
A
ABA
ABCBA
ABCDCBA
Constraints:1<= N <= 20 | geeksforgeeks | Easy | {
"class_name": "Solution",
"created_at_timestamp": 1662630677,
"func_sign": [
"void printTriangle(int n)"
],
"initial_code": "import java.io.*;\nimport java.util.*;\n\nclass Main {\n // Driver code\n public static void main(String[] args) throws Exception {\n BufferedReader br =\n new Buff... | {
"class_name": "Solution",
"created_at_timestamp": 1663316956,
"func_sign": [
"printTriangle(self, N)"
],
"initial_code": "# Initial Template for Python 3\n\nif __name__ == '__main__':\n t = int(input())\n\n for _ in range(t):\n N = int(input().strip())\n ob = Solution()\n ob.p... | eJztndmSG0kVhrmAG55CoWsHoX3xnYdhGIZ9H5gajFYwi9xAFxiMHTwE78UroXYvOiplVmaVasuTX0XYPq3NdTL///sldVXlf776+f++/rWvfPG2/+pwk972n/f60+QwTA6j5DBODpPkcPyx/6zX37252W1ud9uXr9Pbhwe+SA7vk0Pv+M+Ljx7qux96H3568dE3n278cOv9zb2H24//fCwecP+Ih4c8Pqb39KC74ltPj++/e9YT+3vczeHg+Oe4o6OBdWd7j9v9/3RffnT64fH/fPzh49OP4n9/+vGT0w33P3/7dMvDDZ+ebnq85Tun... |
705,437 | Area of intersection of two circles | Given the coordinates of the centres of two circles (X1, Y1) and (X2, Y2) as well as the radii of the respective circles R1 and R2.Find the floor of the area of their intersection.Note:Use the value of Pi as 3.14
Examples:
Input:
X1=0,Y1=0,R1=4
X2=6,Y2=0,R2=4
Output:
7
Explanation:
The intersecting area equals 7.252... | geeksforgeeks | Easy | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"long intersectionArea(double X1, double Y1, double R1, double X2, double Y2,\ndouble R2)"
],
"initial_code": "// Initial Template for Java\n\nimport java.io.*;\nimport java.util.*;\n\nclass GFG {\n public static void main(S... | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"intersectionArea(self,X1,Y1,R1,X2,Y2,R2)"
],
"initial_code": "# Initial Template for Python 3\n\nimport math\n\nif __name__ == '__main__':\n t = int(input())\n for _ in range(t):\n X1, Y1, R1, X2, Y2, R2 = map(int... | eJzdVUtOwzAQZcGKU1hZN2jGn7HNSZAIYgFZsAldtBISAnEIuCE7LoGbr5PYiamQQLhVOrXHM/PefPJ6+v55dlKvyw8nXD1l99V2v8suWMaLChgwhG6N/wxio6f6E+Vd6OVsw7LycVve7sq7m4f9rnWCnBtBlqwhMFqRFlRUL0UlQIPlkktSHI1FI+vt7HnD5iHabnmSt9viaD5rcRAqDqglmNohRNzmHhN5kJVV0RkZmPJETznE6RqjTcScrJWImhyH5NgL4sAxDl9kMXyLXif2xayCQplyUayytk53UkrqaBYRQDzrcqnO5VBsrT/G... |
703,911 | Factorial Number | For a given number N, findwhether it is a factorial number or not.A Factorial number is a number which is equal to the factorial value of other numbers.
Examples:
Input:
N = 6
Output:
1
Explanation:
6 is factorial of 3
Input:
N = 5
Output:
0
Explanation:
no number's factorial is 5.
Constraints:
1 <= N <= 100000 | geeksforgeeks | Easy | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"static int isFactorial(int N)"
],
"initial_code": "//Initial Template for Java\n\nimport java.io.*;\nimport java.util.*;\n\nclass GFG\n{\n public static void main(String args[])throws IOException\n {\n BufferedRea... | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"isFactorial(self, N)"
],
"initial_code": "# Initial Template for Python 3\n\nif __name__ == '__main__':\n t = int(input())\n for _ in range(t):\n N = int(input())\n\n ob = Solution()\n print(ob.isFac... | eJxrYJnazcIABhEtQEZ0tVJmXkFpiZKVgpJhTJ6hko6CUmpFQWpySWpKfH5pCUKqLiZPqVZHAVW9kQmJGgyNDEjUYY5DvQEO9cZmRhYWBqTaAtGFy/s47bK0NDQjwzKINlJtMyLRGhNzSwMDQzOSnWdkQnaww3WT7De4EeYIM8hxh7mlMSyEDUgPYjTd5PoGhAxJzUsQuw1BGN0BYHES3WBiDs5t+JMAvuiAhgVF4WBoaGRIyO7YKXoAZ2dmbw== |
702,672 | Number of matches | In a knockout tournament, there are n players, each with a unique rating represented by an array arr[]. In each round: - The 1st player plays against the 2nd player, the 3rd player plays against the 4th, and so on. - The player with the higher rating wins the match and moves to the next round. - If there is an odd n... | geeksforgeeks | Easy | {
"class_name": "Solution",
"created_at_timestamp": 1617361068,
"func_sign": [
"public static int[] getAnswer(int arr[])"
],
"initial_code": "// Initial Template for Java\n\n/*package whatever //do not write package name here */\n\nimport java.io.*;\nimport java.lang.*;\nimport java.util.*;\n\nclass GFG {... | {
"class_name": "Solution",
"created_at_timestamp": 1617361068,
"func_sign": [
"getAnswer(self, arr, answer)"
],
"initial_code": "# Initial Template for Python 3\ndef main():\n T = int(input())\n\n while T > 0:\n arr = [int(x) for x in input().strip().split()]\n n = len(arr)\n\n ... | eJy1VUFOhEAQ9GDiC7x5qHDemB6GgcaXmIjxoBy84B7YxMRofIT+155pSXCzPQsa51IQpoueqmp4P/28ODtJ6/pcLm5eisdhuxuLKxSuG1yxQdE/b/v7sX+4e9qN34+oG966oXjdYG8/pQUy6hycWYmS4AkVIRBqQkNgQksQUpOuhIOHYhXxSGNtWgqs0CjUCkGhUvAKpYKlRoWfjZTmKVswGtQI0qxPe62jLecMFEWL2kUJc3JNXKYH8tRLZ0E6bKTTVrjgZL8USa20FOBquAaO4Vp523JfZvdhuv9XrxSUhZWFlYWVhZWFlYWVhZWF... |
701,192 | Smallest Positive Missing Number | You are given an integer arrayarr[]. Your task is to find the smallest positive numbermissing from the array.
Examples:
Input:
arr[] = [1, 2, 3, 4, 5]
Output:
6
Explanation:
Smallest positive missing number is 6.
Input:
arr[] = [0, -10, 1, 3, -20]
Output:
2
Explanation:
Smallest positive missing number is 2.
Con... | geeksforgeeks | Medium | {
"class_name": "Solution",
"created_at_timestamp": 1731130209,
"func_sign": [
"public int missingNumber(int[] arr)"
],
"initial_code": "import java.io.*;\nimport java.util.*;\n\npublic class Main {\n public static void main(String[] args) throws IOException {\n BufferedReader br = new BufferedR... | {
"class_name": "Solution",
"created_at_timestamp": 1731130209,
"func_sign": [
"missingNumber(self,arr)"
],
"initial_code": "# Initial Template for Python 3\n\nimport math\n\n\ndef main():\n T = int(input())\n while T > 0:\n arr = [int(x) for x in input().strip().split()]\n ob = Soluti... | eJytkz1OA0EMhSngHk9Tx8ie/6Gk4wZIgChgC5okxUZCQkgcAu7LZHcDSjKDMivGxW5hf7afnj/Ov24uzoZ3e51/7t7Uy3K96dUVlNwvhaEZhmEZjuEZgREZiSHMagHVva67p757flxt+t869b7APokEpEEGZEEO5EEBFEEJJE0kgc5hYHO4HB6+Uh5K5Q4BESnPDxGIhhiIhbiWGXLtMMO2+w5XqbfFHXh4SMMbP3Fi2pFawcWyuBPvMKRC0WVhf5qXFYJ4SIDkSVP2RQtbN7Kha6OX3eXG/cnudNjTErECSyer2eb1idBka8b/3VpL... |
702,995 | Stuffs Division | You are given an array arr[] where each element represents the amount of goodies currently held by students. Each student at index ishould receive exactly iamount of goodies (1-based indexing) for a fair distribution, with no wastage allowed. Your task is to determine whether it is possible to redistribute the goodies ... | geeksforgeeks | Easy | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"public boolean possible(int[] arr)"
],
"initial_code": "// Initial Template for Java\nimport java.io.*;\nimport java.lang.*;\nimport java.util.*;\n\n//Position this line where user code will be pasted.\n\nclass GFG {\n publ... | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"possible(self, arr)"
],
"initial_code": "# Initial Template for Python 3\n\nif __name__ == \"__main__\":\n t = int(input())\n while t > 0:\n arr = list(map(int, input().split()))\n ob = Solution()\n ... | eJztVMFKxDAU9ODBmzfPQ87L0iR9aeuXCFZEtIIgdXFbEETxI/R/ne3roSzboukueDAPOqVJXt+bmeTj+Ovs5KgbF6d8uXw1D/Wqbcw5jC1rm3QD//gn0CxgqpdVddtUd9dPbdMLdX/zuK7K+r2szdsCWwrCwSOFICBDjoK5RtI0z+1YlqIbsNsRUZBDHxF7RdmQaDJ6Ovt2umeukCkEBVFIFbyCU4hpWrAjotT01NHSEAJHaXP4gJS5KC/1ZS8UJRFYxyWcsuJhM34rEq6Po4yWyWmdwJJT/t6Nqj7hH6+8u6Gb99u+hM38gTj4fcM/... |
702,811 | Mr Modulo and Pairs | Mr. Modulo comes up with another problem related to modulo and this time he has an array of integers arr[] and an integer k, he is interested in finding all the possible pairs arr[i] and arr[j] in the array arr[] such that arr[i] % arr[j] = k. The array given will have distinct elements.You are required to return the n... | geeksforgeeks | Medium | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"public int printPairs(List<Integer> arr, int k)"
],
"initial_code": "// Initial Template for Java\n\n// Initial Template for Java\n\nimport java.io.*;\nimport java.util.*;\n\n//Position this line where user code will be pasted... | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"printPairs(self, arr, k)"
],
"initial_code": "def main():\n t = int(input())\n for _ in range(t):\n arr = list(map(int, input().strip().split()))\n k = int(input())\n ob = Solution()\n print(o... | eJy9lLFOwzAQhhkYeIxfmSsU27GdsLDxDEgEMUAGltAhlSohEA8B74vz34WpVknT9ob/2sT13/vO56/Ln7urC8b9bfrw8F689uvNUNygMG1vSgYkG80WDUNSDZsWFisU3XbdPQ/dy9PbZtA9Qtt/tn3xscLujb2kyAwryTAjSEqrZVXGwuUsrKt8ADWCWoPagJocRjWgWlAdqBVtx/e5ysqMLZE4oolCKBomL9+8vHPy0DYjvTjTY6KnbagZiAwEBjwDFQOOAcsYazOMjK+xueLqGHwFqgPVgmpALUFtQE1HY9QIahh9+Zu5THfVG6Xe... |
704,213 | Perfect Sum Problem | Given an array arr of size nof non-negative integers and an integer sum, the task is to countall subsets of the given array with a sum equal to a given sum.
Examples:
Input:
n = 6, arr = [5, 2, 3, 10, 6, 8], sum = 10
Output:
3
Explanation:
{5, 2, 3}, {2, 8}, {10} are possible subsets.
Input:
n = 5, arr = [2, 5, 1, 4... | geeksforgeeks | Medium | {
"class_name": "Solution",
"created_at_timestamp": 1619006521,
"func_sign": [
"public int perfectSum(int arr[],int n, int sum)"
],
"initial_code": "//Initial Template for Java\n\nimport java.io.*;\nimport java.util.*;\nclass GfG\n{\n public static void main(String args[])\n {\n Scanner sc = n... | {
"class_name": "Solution",
"created_at_timestamp": 1619006521,
"func_sign": [
"perfectSum(self, arr, n, sum)"
],
"initial_code": "# Initial Template for Python 3\n\nif __name__ == '__main__':\n T = int(input())\n for i in range(T):\n n, sum = input().split()\n n, sum = int(n), int(sum... | eJytVEFOwzAQ5FBx4ROrnCu069ixw0uQCOIAOXAJPaRSJVSJR8B/mTWpVBo7cqsmTpTYszPjiZ2v1c/d7U08Hld4ePqs3ofNdqweqDLdIEyGu8HR7MSYI2EMehJLNUkAlFoy6PZk8AZYS4IR7emGak1Vv9v0r2P/9vKxHQ8qAg5rLAD7NR3JSzeA0PHkgmomq+/UMHmmADFWBySQqslCriFPQUU5KyfWp5Tg0bvjiQpPzcSmc4jNaMuz+7ZN0SONAJH/RrMsTTKLGHdBGmpbHQMhVp3jAkiAEsCk1XpcyqOTA84AZ1w+tJZDCMnYCEX5... |
713,589 | Balloon Everywhere | Bob is very fond of balloons. Once he visited an amusement park with his mother. The mother told Bob that she would buy him a balloon only if he answer her problem right. She gave Bob a stringS [contains only lowercase characters]and asked him to use the characters of string to formas many instances of the word "balloo... | geeksforgeeks | Easy | {
"class_name": "Solution",
"created_at_timestamp": 1673953354,
"func_sign": [
"public int maxInstance(String s)"
],
"initial_code": "// Initial Template for Java\n\nimport java.util.*;\nimport java.lang.*;\nimport java.io.*;\n\n// Position this line where user code will be pasted.\n\nclass GFG {\n pub... | {
"class_name": "Solution",
"created_at_timestamp": 1673953354,
"func_sign": [
"maxInstance(self, s : str) -> int"
],
"initial_code": "if __name__ == \"__main__\":\n t = int(input())\n for _ in range(t):\n s = input()\n obj = Solution()\n res = obj.maxInstance(s)\n print(... | eJyllElOwzAUhlm094i8rirSdsVJkDCq7MQd6MMv0ARSEIhD0NN015PVQ9uERE5kk0XyMrzh+/07P4P9cXhjjvuDCh4+yVpmRU7uIhJTyTljAIhSUklGERFlJpJcpHMs8uqrb/XyaxQ1UhmU5gTO1FtHqkQEANWasZC2ng0nGtM0A42Kmlbhamo9vi6Yqbh53zPZzD1fR65LEUA1oWTYweYSpPRuxniSisVytX7awLPE7OV1mxdv7+Xuw7sUt+75e3FWmfZbicYWyVvAUC9yuwvi6za4VPqPx4yfWoailT26FXJCWqG8xfG3SEsVSoN0... |
700,353 | Interleaved Strings | Given strings A, B, and C, find whether C is formed by an interleaving of Aand B.
Examples:
Input:
A = YX, B = X, C =XXY
Output:
0
Explanation:
XXY is not interleaving of YX and X.
Input:
A = XY, B = X, C = XXY
Output:
1
Explanation:
XXY is interleaving of XY and X.
Constraints:
1 ≤ length of A, B ≤ 300
1 ≤ leng... | geeksforgeeks | Medium | {
"class_name": "Solution",
"created_at_timestamp": 1617123739,
"func_sign": [
"public boolean isInterLeave(String a,String b,String c)"
],
"initial_code": "//initial code\nimport java.util.*;\nimport java.lang.*;\nclass InterLeaveString\n{\n public static void main(String[] args)\n {\n Scann... | {
"class_name": "Solution",
"created_at_timestamp": 1641055290,
"func_sign": [
"isInterleave(self, A, B, C)"
],
"initial_code": "# Initial Template for Python 3\n\nif __name__ == '__main__':\n t = int(input())\n for i in range(t):\n arr = input().strip().split()\n if Solution().isInter... | eJzVVc1OwzAM5sCBx7ByntAKN25xuvGzjf9BAgUO0AOXsEMnISEQDwHvi5OwKKvabilDCLd1G7exv3x23Pf1z3xjzYq8pYfrF/aoJ9OC7QDbzjRH4AI4CjppZJ6tiTQ3BhQpOMURhUhT1gGWP0/y+yJ/uHuaFt+uupl+y7TTidXstQNBrC3nrNff3ds/gMFwdHh0fHJ6dj4GPsDhSNDQvDQm+mBssJiAMLsRHIuSBjUQkgBCRXAvgF6s9/KVaekFlBeQSkkVKqnikSQhDY4FsDRcXEp1VfmqbKz/vDE3FUCADt64hir0gNykIzoYsY2x... |
705,151 | Row with minimum number of 1's | Given a 2D binary matrix(1-based indexed) a of dimensions nxm , determine the row that contains the minimum number of 1's.Note: The matrix contains only 1's and 0's. Also, if two or more rows contain the minimum number of 1's, the answer is the lowest of those indices.
Examples:
Input:
n = 4,m = 4
a = [[1, 1, 1, 1],
... | geeksforgeeks | Easy | {
"class_name": "Solution",
"created_at_timestamp": 1729917875,
"func_sign": [
"int minRow(int mat[][])"
],
"initial_code": "// Initial Template for Java\n\nimport java.io.*;\nimport java.util.*;\n\nclass GFG {\n public static void main(String args[]) throws IOException {\n BufferedReader read =... | {
"class_name": "Solution",
"created_at_timestamp": 1729917875,
"func_sign": [
"minRow(self,a)"
],
"initial_code": "# Initial Template for Python 3\n\nimport math\n\nif __name__ == '__main__':\n t = int(input())\n for _ in range(t):\n N, M = map(int, input().strip().split(\" \"))\n mat... | eJydVMtOwzAQ5FCJ31j5XCFvHqXqlyBRxIHmwCX0kEoIREX/ofwvfsTrdxOnqVLH3pn1jCf9Xf1d7u/U5+lLDJ6/2Xt/PA1sB6zd9xvY7HsEuuwDBy4fuLmCFe6uyB8ieITWAFEvohniOEQD8alsP/RmW8loOjgbwQCLLtYoECPuSUyAUypJqxUYVFrVWTgpxBieqUxuKTG5ha3dArkWULqtMazgyZZ+u9GnKQhbA+s+j93b0B1eP06DDdhZHJ+61+peOTPsZw1OGkVBo6PjnWPolpetGhqqSg1aG+8gJXGIo2OcUqe1oKMuUKTdFm2y... |
712,680 | Unique Binary Tree Requirements | Geek wants to know the traversals required to construct a unique binary tree.Given a pair of traversal, return true if it is possible to construct unique binary tree from the given traversals otherwise return false.
Examples:
Input:
a = 1, b=2
Output:
1
Explanation:
We can construct binary tree using inorder travers... | geeksforgeeks | Easy | {
"class_name": "Solution",
"created_at_timestamp": 1668490265,
"func_sign": [
"public static boolean isPossible(int a, int b)"
],
"initial_code": "//Initial Template for Java\n\nimport java.util.*;\nimport java.lang.*;\nimport java.math.*;\nimport java.io.*;\n\nclass GFG {\n public static void main(St... | {
"class_name": "Solution",
"created_at_timestamp": 1668490581,
"func_sign": [
"isPossible(self, a, b)"
],
"initial_code": "# Initial Template for Python 3\n\nif __name__ == \"__main__\":\n t = int(input())\n for _ in range(0, t):\n a, b = input().split()\n a = int(a)\n b = int(... | eJy1VctOwzAQ5MCBT+iNlc8Vil9p6ZcgYcQBcuBiekilSlURH9H+L/bGStrSddeE5mAlSjI7OzNef9/u7+9u8HqahJvnjfjwy1UrFiC08wqk8xqU8xasmIJo1svmrW3eXz9XbfosfPHlfLdWuIrtFA5wbHgbIQYwBQHbQM1AvIhuEhwCG7CRKge4oiFVJIy4VM+Zn+u+WyQlU98mAmrQbGYXWc4OZR0k0ElbrmWUJlRzQyUZC0vAmGBhWSh7ptBRZkxnhioTMIM+T8Cy7yUlsktPL6LJFqsY+p0tL6tevN/+JRKh4zoymUHweQ6P2SDy... |
702,832 | Strange Sort | Given an array arr[] of non-negative integers. Sort the array in ascending order such that the element at the Kth position in the unsorted array stays unmoved and all other elements are sorted.
Examples:
Input:
arr[] = [3, 12, 30, 79, 2] , k=2
Output:
[2, 12, 3, 30, 79]
Explanation:
The element at the 2nd position (1... | geeksforgeeks | Easy | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"void strangeSort(int[] arr, int k)"
],
"initial_code": "// Initial Template for Java\n\nimport java.io.*;\nimport java.util.*;\n\npublic class Main {\n\n public static void main(String[] args) throws Exception {\n Bu... | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"strangeSort(self,arr, k)"
],
"initial_code": "# Initial Template for Python 3\n\nif __name__ == '__main__':\n tc = int(input())\n while tc > 0:\n arr = list(map(int, input().strip().split()))\n k = int(inpu... | eJzNVktuE0EQZcEFuEHL6whN9b85CRKDWEAWbIYsEgkJBXEIuBY77sOrT9vjxG1MSEKstD2ZeVX1qup19Xx7/uPXi2fyef0TF2++bD4uF1eXm1duE+aFHE3ycUl/mnwc+RBTdq2WnKLj61Kd3CtO7gUn335e2Iui5QY5Abdui2f4c3jAz/DAnuGPn/FNLFzNS5mXHt7tu+w81IkFMF/4R1jJB1ymzZnbnH++OH9/ef7h3aerS8t269MytWwsN82m52bxOhsr0bx8lVw5H6NuLjWDw/z2U7DM1dXKfGVnCZndrmIrRpqsetlcn7lVUz2X... |
703,833 | Semi Prime | Given a positive integer n. Find whether a number is a semiprime or not.Note:A semiprime is a natural number that is a product of two prime numbers .
Examples:
Input:
N=35
Output:
1
Explanation:
35=7x5.So 35 is a semi-prime.
Input:
8
Output:
0
Explanation:
8 is not a semi prime.
Constraints:
1<=N<=10**9 | geeksforgeeks | Easy | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"int checkSemiprime(int N)"
],
"initial_code": "// Initial Template for Java\n\nimport java.io.*;\nimport java.util.*;\n\nclass GFG {\n public static void main(String args[]) throws IOException {\n BufferedReader read... | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"checkSemiprime(self,N)"
],
"initial_code": "# Initial Template for Python 3\n\nif __name__ == '__main__':\n t = int(input())\n for _ in range(t):\n N = int(input())\n ob = Solution()\n print(ob.check... | eJxrYJmayMIABhFRQEZ0tVJmXkFpiZKVgpJhTJ6Zko6CUmpFQWpySWpKfH5pCUKqLiZPqVZHAVW9oSmJGkwsSdRgZESqBnMcGgxwaDDHpQGnp40MSdVhYkyyt0m1w9iIZDvMwRECjkZ84YAr4IBuxBsauPQBXYovJeDSBrSIsJ24YwCbh2NiSA0zY1zJEbdnqWk7KItSzQXG5AWAsTkxiSV2ih4AjNhe8Q== |
705,190 | Geek and knots | Given two walls A, B with M, N hooks respectively. You are given K ropes. By using one rope you can connect one hook on wall A with another hook on wall B. One hook can connect with only one rope.Find the number of different ways you can use all the K ropes.
Two ways that use theexact same set of hooks from wall A and ... | geeksforgeeks | Medium | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"static int knots(int M, int N, int K)"
],
"initial_code": "//Initial Template for Java\n\nimport java.io.*;\nimport java.util.*;\nimport java.math.*;\n\nclass GFG{\n public static void main(String args[])throws IOException\... | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"knots(self, M, N, K)"
],
"initial_code": "# Initial Template for Python 3\n\nif __name__ == '__main__':\n t = int(input())\n for _ in range(t):\n M, N, K = [int(x) for x in input().split()]\n ob = Solution(... | eJydlE0KwjAQhV30IEPWRTJJUxtPIlhxoV24qV20IIjiIfQc7jyf6Y8VxJfS9o9C+uXNm3n0Fjxewaw5Vk/3sj6LQ15UpViS4DRncqcISWSnItuV2X57rMrv8jXNxSWkH0ZKSf1jEow13TIiO83xpHFYd4+sVpGGgjF0SGzIAGphYnchOUm67ipgrXWsiiz26SySQtJacxyZxEYA186sQtJ4KJ5horY2SopRoTAB3rRCMTmQufYDT3bYHx7FkiOVcDIcP1W7mGC8ib4/+362bcHAkNEWfQentfBfBQO/ns9Wm/v8DZLvY5o= |
703,861 | Skip the work | Given an array A[ ] denoting the time taken to complete N tasks, determine the minimum amount of time required to finish the tasks considering that you can skip any task, butskipping two consecutive tasks is forbidden.
Examples:
Input:
N = 2
A[] ={10,20}
Output:
10
Explanation:
we can take time of
10 units and skip 2... | geeksforgeeks | Medium | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"public int minAmount(int A[] , int N)"
],
"initial_code": "//Initial Template for Java\n\nimport java.io.*;\nimport java.util.*;\nclass GfG\n{\n public static void main(String args[])\n {\n Scanner sc = new Scanner... | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"minAmount(self, A, n)"
],
"initial_code": "# Initial Template for Python 3\n\nif __name__ == '__main__':\n t = int(input())\n for _ in range(t):\n n = int(input())\n A = list(map(int, input().strip().split(... | eJyllEFLw0AQhT3o/xj2XCSzm90m/hLBFQ+ag5e1hxQKYunNmyf9v75ZajXgK5qGQJYk8+W9ebPZnX+8XZzV4/oVi5tn91hW69FdidNcYi7aiG9EowQsoluIGzar4X4cHu6e1uP+1djkss3FvSxkCki5BEkSpROA1JN67Ug97uPLshRvBOmlZQSmwB6oF+0gwkfzYjj4gZ7QMD8toQVIgp+e1CVStsQJC5CPYmsEcxEIoK9BKDzg4+hjNdERio+sFz4XXzXs4wAmAgSiigaCCz3D2XgcEFOwtqLJuu5ZjxNLrDWvjURw6oUmzgAmK540... |
703,803 | Candy Packets | Given a number N denoting candies. Find how many packetsare needed to contain the number if 1st packetcan contain 1 candy, 2nd packetcan contain 2 candies, 3rd packetcan contain 4 candies and so on.
Examples:
Input:
N = 2
Output:
2
Explanation:
Put 1 candy in first packet.
Put 1 candy in second packet.
Thus two,pack... | geeksforgeeks | Easy | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"static long countPackets(long N)"
],
"initial_code": "//Initial Template for Java\n\nimport java.io.*;\nimport java.util.*;\n\nclass GFG {\n public static void main(String args[]) throws IOException {\n BufferedReade... | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"countPackets(self,N)"
],
"initial_code": "# Initial Template for Python 3\n\nif __name__ == '__main__':\n t = int(input())\n for _ in range(t):\n N = int(input())\n ob = Solution()\n print(ob.countPa... | eJydk0EKwjAQRV30ICXrIpkkk7aeRDCioEXcxC5aEETxEHpfmxoXXfxq7SaF8Cb//5m5J89DMuu/5bb7WV3E0ddtIxapIOeJRZaK6lxXu6bab05tE++M8zfnxTVLh4AmADAASEpA5JBQGiAkAaOkKRCjAGNkidxDpnMD/RDKzDJriyCYgtKGJ1NlkVs2gFIoPZIETSEmpEfxdB6GX/6CO/Zf+oHKhBLR9NRJtmNtgVEZSVilHVH57udYU0fGJ1QmhluB3u1DHmb8j/SwXHGK0fZ/tK8f8xdGa1xR |
704,694 | Count the number of ways to tile the floor of size n x m using 1 x m size tiles | Given a floor of size n x m and tiles of size 1 x m. The problem is to count the number of ways to tile the given floor using 1 x m tiles. A tile can either be placed horizontally or vertically.Both n and m are positive integers and 2 < = m.
Examples:
Input:
n = 2, m = 3
Output:
1
Expanation:
There is only one way t... | geeksforgeeks | Medium | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"public int countWays(int n, int m)"
],
"initial_code": "//Initial Template for Java\n\nimport java.util.*;\nimport java.lang.*;\nimport java.io.*;\nclass GFG\n{\n public static void main(String[] args) throws IOException\n ... | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"countWays(self, n, m)"
],
"initial_code": "# Initial Template for Python 3\n\nif __name__ == '__main__':\n T = int(input())\n for i in range(T):\n n, m = input().split()\n n = int(n)\n m = int(m)\n ... | eJydU8sKwjAQ9NAPCTkXaXbNY/0SwYoH7cFL7aEFQQQ/Qv/XNFZEyDbEvaSQmZ3ZyfZePIdiEWrT+o/tVZ7abujlWkhVt0qALIVsLl1z6Jvj/jz030t5K8UvHFg4xOAoMAeuqrFYCTLWKAc4x30fOaLaC2qO4GIMIqE5CR2NbTJHYzFEjPOE5YQYPDdKdBLvyyadgSMAY8HOx86tkfWFsIrOF7Ifj6z8A0t5npj4wDZIvAbHUoZcVYFJqn+24W8Xdn5jkSo0ZHQ0PeR/L+WQVNq+t12HRrnmpy46Qds9li+jMU0/ |
702,946 | Remaining String | Given a string s without spaces, a character ch and an integer count. Your task is to return the substring that remains after the character ch has appeared count number of times.Note: Assume upper case and lower case alphabets are different. “”(Empty string) should be returned if it is not possible, or the remaining su... | geeksforgeeks | Easy | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"public String printString(String s, char ch, int count)"
],
"initial_code": "// Initial Template for Java\n\nimport java.io.*;\nimport java.util.*;\n\nclass GFG {\n public static void main(String args[]) throws IOException ... | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"printString(self, s, ch, count)"
],
"initial_code": "# Initial Template for Python 3\n\nif __name__ == '__main__':\n T = int(input())\n for i in range(T):\n s = input()\n ch = input()[0]\n count = in... | eJztW9tOwkAQ9cEPIX0mBmJ48cW0VPF+v7R1jaEXoFyWAi2UGhM/Qj/HNz/MgkRjQoEF7AXOCRkmOz3LbDLM7M7C6+b75+7GENKHrzw8cya1HJvbSXFZQouqphsQ6ycIVQnNcukUZ7iWodmG/tR07FFgRO0cREQxwb2kU38ThAcAwIqDUNevBpmAcjAuLxQH8N8IzbGwIs9xEBGVFm0QYEEbjvG1Z8gslStmtVZv0KblV6PgPcvkCaBBg7aqGqH+KxdUvqL3D1r4ETG9nLTaHdvp9ty+BwsssMACyyyW7214huW0KEmSLMuKovA8LwhC... |
704,973 | Pasha and Primes | Given an array of N integers and another array R containing Q queries(of l and r). Answer all Q queries asking the number of primes in the subarray ranging from l to r (both inclusive).Note: A is 0-based but the queries will be 1-based.
Examples:
Input:
N=5,Q=3
A={2,5,6,7,8}
R={{1,3},{2,5},{3,3}}
Output:
2 2 0
Explan... | geeksforgeeks | Medium | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"ArrayList<Integer> primeRange(int N, int Q, int A[], int R[][])"
],
"initial_code": "// Initial Template for Java\n\nimport java.io.*;\nimport java.util.*;\n\nclass GFG {\n public static void main(String args[]) throws IOEx... | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"primeRange(self,N,Q,A,R)"
],
"initial_code": "# Initial Template for Python 3\n\nimport math\n\nif __name__ == '__main__':\n t = int(input())\n for _ in range(t):\n N, Q = map(int, input().strip().split(\" \"))\n ... | eJy1VsuO00AQ5MCJr2j5vELTPW++BIkgDpADF7OHrLQC7Qr+Af6X6p5xoo0Ya8M6tuJ44nFXdU11T36+/vPrzSs73n/HzYcf09f59u4wvaOJdzM7irgysSfOxJXEk1TyTD5TYAoej4mdXjHTU97NycaBwm6ebmja39/uPx/2Xz59uzsskRHWTqbd/IhpDzd0Bhz19egI2BIVL2SKnpKjXKl4qmDjFBnEXMU0fAvARWmExgiPo9JJQyIIuMaikNdgiQoBAmSEOFhQpqLZJgWUYXhHeo5SlPa6B4NMA41NXQDErjHeyPZDUALFbkciI76d... |
702,954 | Max value after m range operation | Given an array arr of size n, with all initial values set to 0, the task is to perform a series of range increment operations as described below:
Examples:
Input:
n = 5, a[] = [0, 1, 2], b[] = [1, 4, 3], k[] = [100, 100, 100]
Output:
200
Explanation:
Initially, arr = [0, 0, 0, 0, 0]
After the first operation: arr = ... | geeksforgeeks | Medium | {
"class_name": "Solution",
"created_at_timestamp": 1728666671,
"func_sign": [
"public int findMax(int n, int[] a, int[] b, int[] k)"
],
"initial_code": "import java.util.*;\n\npublic class Main {\n public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n\n i... | {
"class_name": "Solution",
"created_at_timestamp": 1728666671,
"func_sign": [
"find_max(self, n, a, b, k)"
],
"initial_code": "if __name__ == \"__main__\":\n t = int(input()) # Read the number of test cases\n\n for _ in range(t):\n n = int(input()) # Read the size of the array\n\n #... | eJzNVcGOwiAQ9WBivPgNL5yNKbRV65eYiNmD9rAX1kNNTIzGj9D/tWUsca1gqbsqkL4Ghsmb4Q0c2qdet6XbtJP/zLbsW63WGZuAcanyEejBA91YHyzdrNJFli6/ftZZaUmrUu2lYrs+bpyUqwE4BEJEiDHECGMkUiVFC6CBEwiCkCAiiAmGBCOCMUHuhqPSrWStPAuKlZ5TRKWbqPBH6M6sjXJcMBaIivhDDU28O/Nx58juTr40HzbGpVxt2515NOdt4rua9XQo9NbLp15owhmaoDJ8thK9FP5kSdk43prVtZNKJfVML1LwKJB/Uo01... |
703,399 | Remove Duplicates from unsorted array | Given an array arr of integers which may or may not contain duplicate elements. Your task is to remove duplicate elements.
Examples:
Input:
arr[] = [1, 2, 3, 1, 4, 2]
Output:
[1, 2, 3, 4]
Explanation:
2 and 1 have more than 1 occurence.
Input:
arr[] = [1, 2, 3, 4]
Output:
[1, 2, 3, 4]
Explanation:
There is no dup... | geeksforgeeks | Easy | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"static ArrayList<Integer> removeDuplicate(int arr[])"
],
"initial_code": "// Initial Template for Java\n\nimport java.io.*;\nimport java.lang.*;\nimport java.util.*;\n\nclass Main {\n public static void main(String args[]) ... | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"removeDuplicate(self, arr)"
],
"initial_code": "# Initial Template for Python 3\n\nif __name__ == \"__main__\":\n t = int(input())\n while t > 0:\n arr = list(map(int, input().split()))\n ob = Solution()\n ... | eJy1VUtOwzAQZYE4x8jrGvmXxOUkSASxgCzYhC5SCQmBOARckh03YPxCK9FkRi1VHekpn3nzfXbezz+/L86wrr/45ubFPPar9WCuyPi2946q6WUWZLrnVXc/dA93T+thY8/Gbf/W9uZ1QRM/ngJFSsyvqaFMS/JOdjSxlhxX7KYsWpYFzMAGWAMrYAJGYAB6ILgZ3AxuBjfXUnqnjCnUGdwYkwIwAhOwAtbABpjH5IC/mR5DFtpwZEqiUthC1IVCY8kU0RTZFOEkXahbfcm6qko1XBahUHJkGS0/WH5n+ZP9ayGrZR9PQh5RbEbUOqj3... |
714,325 | Total Cuts | You are given an array A of N integers and an integer K, and your task is to find the total number of cuts that you can make such that for each cut these two conditions are satisfied
1. A cut divides an array into two parts equal or unequal length (non-zero).
2. Sum of the largest element in the left part and the small... | geeksforgeeks | Easy | {
"class_name": "Solution",
"created_at_timestamp": 1679290094,
"func_sign": [
"public static int totalCuts(int N, int K, int[] A)"
],
"initial_code": "import java.io.*;\nimport java.util.*;\nclass IntArray\n{\n public static int[] input(BufferedReader br, int n) throws IOException\n {\n Stri... | {
"class_name": "Solution",
"created_at_timestamp": 1679290094,
"func_sign": [
"totalCuts(self, N : int, K : int, A : List[int]) -> int"
],
"initial_code": "class IntArray:\n def __init__(self) -> None:\n pass\n\n def Input(self, n):\n arr = [int(i) for i in input().strip().split()] #... | eJy1lc1KxEAQhBUEfYwi50W65yeZ8UkEIx50D17iHrIgiOJD6Pvak3V3WTalUdcMQ3KYqe76qiGvJ+9np0fDc3lsH1dP1X23WPbVBSptOxXb0TYcPAIiajRIyFCpZqjmj4v5bT+/u3lY9p+3fNu9tF31PMOuVL1Si9gsIhCJQGMCru1KI8maqE0iEIlAJJw14IgdqEId1EMDNEJraANN0AzHzCZSqDCLhZ3YXXhBEERBLWgESZCtnJSStu2A2gm1IxpZIWVYC5JCBtvltouoCRHL64zUoASD4wyPRyYyNZEx82nwXnrJNGiWkh8UIgSM... |
702,983 | Palindrome Sentence | Given a single sentence s, check if it is a palindrome or not. Ignore white spaces and any other character you may encounter.
Examples:
Input:
s = race car.
Output:
1
Explanation:
processing str gives us
"racecar" which is a palindrome.
Input:
s = hello world.
Output:
0
Explanation:
processing str gives us
"hellow... | geeksforgeeks | Easy | {
"class_name": "Solution",
"created_at_timestamp": 1731309703,
"func_sign": [
"public boolean sentencePalindrome(String s)"
],
"initial_code": "import java.io.*;\nimport java.util.*;\n\nclass GFG {\n public static void main(String args[]) throws IOException {\n Scanner sc = new Scanner(System.i... | {
"class_name": "Solution",
"created_at_timestamp": 1731309703,
"func_sign": [
"sentencePalindrome(self, s)"
],
"initial_code": "# Initial Template for Python 3\n\nif __name__ == \"__main__\":\n t = int(input())\n for tc in range(t):\n s = input()\n ob = Solution()\n if ob.sente... | eJytkkFLxDAQhT3o/3jmHBa8epGCi/TgKvSgYESm21EX0qS0aauI4I/Q/2uari6CIs1uLxko882bee9t/+PxYC981+SLmxexMlXrxDHEkTIJSjIShEqP75IMaYlL/5R0qIyQEPxU8dJxcWdbt269J92w//sq8RO4sPijxdXtrx1X1GDlwugatg6FQ4qG+pPp85NcM3qPTOXIwFznNJ2TOa5gDYxFxa6JuMS8Izmcc5DBjJzZ72nCeh1HbHZez3DRa5BjlM8o2ZFGb+tyOurU4sHL4SDszBYxd0ZGxpFXg0WSJRFB4Y6930UxeO5rE+1R... |
704,853 | Knight Walk | Given a square chessboard, the initial position of Knight and position of a target. Find out the minimum steps a Knight will take to reach the target position.If it cannot reach the target position return -1.
Examples:
Input:
N=6
knightPos[ ] = {4, 5}
targetPos[ ] = {1, 1}
Output:
3
Explanation:
Knight takes 3 step ... | geeksforgeeks | Medium | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"public int minStepToReachTarget(int KnightPos[], int TargetPos[], int N)"
],
"initial_code": "import java.util.*;\nimport java.lang.*;\nimport java.io.*;\nclass GFG\n{\n public static void main(String[] args) throws IOExcep... | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"minStepToReachTarget(self, KnightPos, TargetPos, N)"
],
"initial_code": "T = int(input())\nfor i in range(T):\n N = int(input())\n KnightPos = list(map(int, input().split()))\n TargetPos = list(map(int, input().split(... | eJylk0sKwjAQhl3oPYasi0zSpFq9iGDEhXbhJnbRgiAFD6H3dVptVez0WUj4A8k3/zx6mz7Ws0nxbTSJ7VWcXJwmYgVCWicR0TqDCCYX+RHyTXggokscHZLouD+nyfuF72vrROZBHUWCbCcEQcATKh8GJQnJMFSjB/wkMsqDJqH5PJY8IgxDoGWdAjXEwst8mUw/QhFXkwGdC8nWwPcbqqgMwsKQoA3o0G8aTIlQphKsjT9Aa/dq7mvkwnLW64JyE/BD78gbFrbrq+8hGWWzc9r9frCmFlnqytg29SgWYxy7oIq0Rba7z5+7JH7I |
701,276 | Unit Area of largest region of 1's | Given a grid of dimension nxmcontaining 0s and 1s. Find the unit area of the largest region of 1s.
Region of 1's is a group of 1's connected 8-directionally (horizontally, vertically, diagonally).
Examples:
Input:
grid = {{1,1,1,0},{0,0,1,0},{0,0,0,1}}
Output:
5
Explanation:
The grid is-
1 1 1
0
0 0
1
0
0 0 0
... | geeksforgeeks | Medium | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"public int findMaxArea(int[][] grid)"
],
"initial_code": "import java.util.*;\nimport java.lang.*;\nimport java.io.*;\nclass GFG\n{\n public static void main(String[] args) throws IOException\n {\n BufferedReader ... | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"findMaxArea(self, grid)"
],
"initial_code": "if __name__ == '__main__':\n T = int(input())\n for i in range(T):\n n, m = map(int, input().split())\n grid = []\n for _ in range(n):\n a = li... | eJztWktu20AM7aIHGWgdFKRjBUhPEqAKski9yEbJwgYCFC1yiOYI2fWQtSWPxN+TrUWduJgYgcej4SP5huRwDL98fv1Tfer+bt62g28/qof2abOuvqaKm7ZOddNyou2LE++G3A2pabuZ3Yd+AfcLaL+WqotUrZ6fVvfr1fe7x806Yy6b9lfTVj8vkta0TMsenjMiCYXDIwR7CWB5K7w3NhvcjylDZos5uzVO7MfC13gljSs5sVCjSCH5aMQkqUhonTQJ0LC4RjTUiYed9OYYN6VRw6LeDk5+kTGTlFuswVlhiMiShklFYq8cC3lmDDtD... |
705,474 | Overlapping rectangles | Given two rectangles, find if the given two rectangles overlap or not. A rectangle is denoted by providing the x and y coordinates of two points: the left top corner and the right bottom corner of the rectangle. Two rectangles sharing a side are considered overlapping. (L1 and R1 are the extreme points of the first rec... | geeksforgeeks | Easy | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"int doOverlap(int L1[], int R1[], int L2[], int R2[])"
],
"initial_code": "// Initial Template for Java\n\nimport java.io.*;\nimport java.util.*;\n\nclass GFG {\n public static void main(String args[]) throws IOException {\... | {
"class_name": "Solution",
"created_at_timestamp": 1615292571,
"func_sign": [
"doOverlap(self, L1, R1, L2, R2)"
],
"initial_code": "# Initial Template for Python 3\n\nimport math\n\nif __name__ == '__main__':\n t = int(input())\n for _ in range(t):\n p = [0] * 2\n q = [0] * 2\n ... | eJzVVUtOxDAMZcGGW0RZT1DSjwScBIkiFtAFmzKLGWkkBOIQcCZ2nAk7aVOndT5lR+wZWYmbPtvP7sf518/FmV2332DcvcrnYX88yBsh627QwljVogUxrdC4p0UFogwqSDcYPS1BzOtpEUuR88AmLt6UOyH7075/PPRPDy/Hw4gLXvgOMMi/fNsJArxyIA3RCrUbFI90Eh5cBIZ7tYkAgOfxDnutalFBQgDZ+NkMshEkIbI5amhx4X5hsJwzbqcKSm5/qO5wjglFLWPKQOaZwF5QUH0Tj6/2aMeAVIUk1haxCd8L1Jh4sNypQs8w2AVl... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.