{"previous": null, "next": 2, "count": 30, "total": 2963, "solved": 0, "unsolved": 0, "results": [{"id": 701236, "problem_name": "Indexes of Subarray Sum", "problem_type": 1, "problem_level": 1, "slug": "subarray-with-given-sum-1587115621", "accuracy": "16.5%", "all_submissions": 1953923, "marks": 4, "difficulty": "Medium", "tags": {"company_tags": ["Amazon", "Facebook", "Google", "Visa"], "topic_tags": ["Arrays", "Prefix Sum", "Searching", "sliding-window"]}, "content_type": 1, "problem_url": "https://www.geeksforgeeks.org/problems/subarray-with-given-sum-1587115621/1", "topic_order": null, "visibility_type": 1, "batch_slug": null, "track_slug": null, "solved_status": 0}, {"id": 701889, "problem_name": "Missing in Array", "problem_type": 1, "problem_level": 0, "slug": "missing-number-in-array1416", "accuracy": "29.59%", "all_submissions": 1791716, "marks": 2, "difficulty": "Easy", "tags": {"company_tags": ["Flipkart", "Morgan Stanley", "Accolite", "Amazon", "Microsoft", "D-E-Shaw", "Ola Cabs", "Payu", "Visa", "Intuit", "Adobe", "Cisco", "Qualcomm", "TCS", "NPCI"], "topic_tags": ["Arrays", "Searching", "Bit Magic"]}, "content_type": 1, "problem_url": "https://www.geeksforgeeks.org/problems/missing-number-in-array1416/1", "topic_order": null, "visibility_type": 1, "batch_slug": null, "track_slug": null, "solved_status": 0}, {"id": 703089, "problem_name": "Second Largest", "problem_type": 1, "problem_level": 0, "slug": "second-largest3735", "accuracy": "26.72%", "all_submissions": 1650797, "marks": 2, "difficulty": "Easy", "tags": {"company_tags": ["SAP Labs", "Rockstand"], "topic_tags": ["Arrays", "Searching"]}, "content_type": 1, "problem_url": "https://www.geeksforgeeks.org/problems/second-largest3735/1", "topic_order": null, "visibility_type": 1, "batch_slug": null, "track_slug": null, "solved_status": 0}, {"id": 701215, "problem_name": "Kadane's Algorithm", "problem_type": 1, "problem_level": 1, "slug": "kadanes-algorithm-1587115620", "accuracy": "36.28%", "all_submissions": 1298978, "marks": 4, "difficulty": "Medium", "tags": {"company_tags": ["Zoho", "Flipkart", "Morgan Stanley", "Accolite", "Amazon", "Microsoft", "Samsung", "Snapdeal", "24*7 Innovation Labs", "Citrix", "D-E-Shaw", "FactSet", "Hike", "Housing.com", "MetLife", "Ola Cabs", "Oracle", "Payu", "Teradata", "Visa", "Walmart", "Adobe", "Google", "Arcesium"], "topic_tags": ["Arrays", "Dynamic Programming"]}, "content_type": 1, "problem_url": "https://www.geeksforgeeks.org/problems/kadanes-algorithm-1587115620/1", "topic_order": null, "visibility_type": 1, "batch_slug": null, "track_slug": null, "solved_status": 0}, {"id": 701393, "problem_name": "Minimum Jumps", "problem_type": 1, "problem_level": 1, "slug": "minimum-number-of-jumps-1587115620", "accuracy": "11.91%", "all_submissions": 1106660, "marks": 4, "difficulty": "Medium", "tags": {"company_tags": ["Moonfrog Labs", "Flipkart", "Amazon", "Microsoft", "Housing.com", "Walmart", "Adobe", "Google", "NPCI"], "topic_tags": ["Arrays", "Greedy"]}, "content_type": 1, "problem_url": "https://www.geeksforgeeks.org/problems/minimum-number-of-jumps-1587115620/1", "topic_order": null, "visibility_type": 1, "batch_slug": null, "track_slug": null, "solved_status": 0}, {"id": 701210, "problem_name": "Array Leaders", "problem_type": 1, "problem_level": 0, "slug": "leaders-in-an-array-1587115620", "accuracy": "29.94%", "all_submissions": 1076899, "marks": 2, "difficulty": "Easy", "tags": {"company_tags": ["Payu", "Adobe", "Amazon"], "topic_tags": ["Arrays"]}, "content_type": 1, "problem_url": "https://www.geeksforgeeks.org/problems/leaders-in-an-array-1587115620/1", "topic_order": null, "visibility_type": 1, "batch_slug": null, "track_slug": null, "solved_status": 0}, {"id": 700437, "problem_name": "Duplicates in Limited Range Array", "problem_type": 1, "problem_level": 0, "slug": "find-duplicates-in-an-array", "accuracy": "18.95%", "all_submissions": 937977, "marks": 2, "difficulty": "Easy", "tags": {"company_tags": ["Paytm", "Zoho", "Flipkart", "Amazon", "D-E-Shaw", "Qualcomm"], "topic_tags": ["Arrays"]}, "content_type": 1, "problem_url": "https://www.geeksforgeeks.org/problems/find-duplicates-in-an-array/1", "topic_order": null, "visibility_type": 1, "batch_slug": null, "track_slug": null, "solved_status": 0}, {"id": 703444, "problem_name": "Minimize the Heights", "problem_type": 1, "problem_level": 1, "slug": "minimize-the-heights3351", "accuracy": "15.06%", "all_submissions": 893440, "marks": 4, "difficulty": "Medium", "tags": {"company_tags": ["Microsoft", "Adobe"], "topic_tags": ["Arrays", "Greedy"]}, "content_type": 1, "problem_url": "https://www.geeksforgeeks.org/problems/minimize-the-heights3351/1", "topic_order": null, "visibility_type": 1, "batch_slug": null, "track_slug": null, "solved_status": 0}, {"id": 702382, "problem_name": "Sort 0s, 1s and 2s", "problem_type": 1, "problem_level": 1, "slug": "sort-an-array-of-0s-1s-and-2s4231", "accuracy": "50.58%", "all_submissions": 890737, "marks": 4, "difficulty": "Medium", "tags": {"company_tags": ["Paytm", "Flipkart", "Morgan Stanley", "Amazon", "Microsoft", "OYO Rooms", "Samsung", "Snapdeal", "Hike", "MakeMyTrip", "Ola Cabs", "Walmart", "MAQ Software", "Adobe", "Yatra.com", "SAP Labs", "Qualcomm"], "topic_tags": ["Arrays", "Sorting"]}, "content_type": 1, "problem_url": "https://www.geeksforgeeks.org/problems/sort-an-array-of-0s-1s-and-2s4231/1", "topic_order": null, "visibility_type": 1, "batch_slug": null, "track_slug": null, "solved_status": 0}, {"id": 703043, "problem_name": "Longest Subarray with Sum K", "problem_type": 1, "problem_level": 1, "slug": "longest-sub-array-with-sum-k0809", "accuracy": "24.64%", "all_submissions": 878405, "marks": 4, "difficulty": "Medium", "tags": {"company_tags": ["Amazon"], "topic_tags": ["Arrays", "Hash", "Map", "Prefix Sum"]}, "content_type": 1, "problem_url": "https://www.geeksforgeeks.org/problems/longest-sub-array-with-sum-k0809/1", "topic_order": null, "visibility_type": 1, "batch_slug": null, "track_slug": null, "solved_status": 0}, {"id": 701220, "problem_name": "Majority Element", "problem_type": 1, "problem_level": 1, "slug": "majority-element-1587115620", "accuracy": "27.82%", "all_submissions": 861257, "marks": 4, "difficulty": "Medium", "tags": {"company_tags": ["Flipkart", "Accolite", "Amazon", "Microsoft", "D-E-Shaw", "Google", "Nagarro", "Atlassian"], "topic_tags": ["Arrays", "Searching", "Greedy"]}, "content_type": 1, "problem_url": "https://www.geeksforgeeks.org/problems/majority-element-1587115620/1", "topic_order": null, "visibility_type": 1, "batch_slug": null, "track_slug": null, "solved_status": 0}, {"id": 701747, "problem_name": "Kth Smallest", "problem_type": 1, "problem_level": 1, "slug": "kth-smallest-element5635", "accuracy": "35.17%", "all_submissions": 852658, "marks": 4, "difficulty": "Medium", "tags": {"company_tags": ["VMWare", "Accolite", "Amazon", "Microsoft", "Snapdeal", "Hike", "Adobe", "Google", "ABCO", "Cisco"], "topic_tags": ["Arrays", "Searching", "Sorting"]}, "content_type": 1, "problem_url": "https://www.geeksforgeeks.org/problems/kth-smallest-element5635/1", "topic_order": null, "visibility_type": 1, "batch_slug": null, "track_slug": null, "solved_status": 0}, {"id": 701226, "problem_name": "Count Inversions", "problem_type": 1, "problem_level": 1, "slug": "inversion-of-array-1587115620", "accuracy": "16.93%", "all_submissions": 806466, "marks": 4, "difficulty": "Medium", "tags": {"company_tags": ["Flipkart", "Amazon", "Microsoft", "MakeMyTrip", "Adobe", "BankBazaar", "Myntra"], "topic_tags": ["Arrays", "Divide and Conquer", "Sorting"]}, "content_type": 1, "problem_url": "https://www.geeksforgeeks.org/problems/inversion-of-array-1587115620/1", "topic_order": null, "visibility_type": 1, "batch_slug": null, "track_slug": null, "solved_status": 0}, {"id": 701213, "problem_name": "Rotate Array", "problem_type": 1, "problem_level": 1, "slug": "rotate-array-by-n-elements-1587115621", "accuracy": "37.06%", "all_submissions": 791467, "marks": 4, "difficulty": "Medium", "tags": {"company_tags": ["Amazon", "Microsoft", "MAQ Software", "Codenation"], "topic_tags": ["Arrays"]}, "content_type": 1, "problem_url": "https://www.geeksforgeeks.org/problems/rotate-array-by-n-elements-1587115621/1", "topic_order": null, "visibility_type": 1, "batch_slug": null, "track_slug": null, "solved_status": 0}, {"id": 700219, "problem_name": "Undirected Graph Cycle", "problem_type": 1, "problem_level": 1, "slug": "detect-cycle-in-an-undirected-graph", "accuracy": "30.13%", "all_submissions": 784107, "marks": 4, "difficulty": "Medium", "tags": {"company_tags": ["Flipkart", "Amazon", "Microsoft", "Samsung", "MakeMyTrip", "Oracle", "Adobe"], "topic_tags": ["DFS", "Graph", "union-find"]}, "content_type": 1, "problem_url": "https://www.geeksforgeeks.org/problems/detect-cycle-in-an-undirected-graph/1", "topic_order": null, "visibility_type": 1, "batch_slug": null, "track_slug": null, "solved_status": 0}, {"id": 701217, "problem_name": "Array Search", "problem_type": 1, "problem_level": -1, "slug": "search-an-element-in-an-array-1587115621", "accuracy": "40.95%", "all_submissions": 772750, "marks": 1, "difficulty": "Basic", "tags": {"company_tags": [], "topic_tags": ["Arrays", "Searching"]}, "content_type": 1, "problem_url": "https://www.geeksforgeeks.org/problems/search-an-element-in-an-array-1587115621/1", "topic_order": null, "visibility_type": 1, "batch_slug": null, "track_slug": null, "solved_status": 0}, {"id": 701203, "problem_name": "Equilibrium Point", "problem_type": 1, "problem_level": 0, "slug": "equilibrium-point-1587115620", "accuracy": "28.13%", "all_submissions": 771167, "marks": 2, "difficulty": "Easy", "tags": {"company_tags": ["Amazon", "Adobe", "Google", "Facebook", "Microsoft", "Uber"], "topic_tags": ["Prefix Sum", "Arrays"]}, "content_type": 1, "problem_url": "https://www.geeksforgeeks.org/problems/equilibrium-point-1587115620/1", "topic_order": null, "visibility_type": 1, "batch_slug": null, "track_slug": null, "solved_status": 0}, {"id": 701331, "problem_name": "Parenthesis Checker", "problem_type": 1, "problem_level": 0, "slug": "parenthesis-checker2744", "accuracy": "28.56%", "all_submissions": 759677, "marks": 2, "difficulty": "Easy", "tags": {"company_tags": ["Flipkart", "Amazon", "Microsoft", "OYO Rooms", "Snapdeal", "Oracle", "Walmart", "Adobe", "Google", "Yatra.com"], "topic_tags": ["Strings", "Stack", "STL"]}, "content_type": 1, "problem_url": "https://www.geeksforgeeks.org/problems/parenthesis-checker2744/1", "topic_order": null, "visibility_type": 1, "batch_slug": null, "track_slug": null, "solved_status": 0}, {"id": 700238, "problem_name": "First Occurrence in Sorted", "problem_type": 1, "problem_level": 0, "slug": "binary-search-1587115620", "accuracy": "44.32%", "all_submissions": 754638, "marks": 2, "difficulty": "Easy", "tags": {"company_tags": ["Infosys", "Oracle", "Wipro", "Linkedin", "Qualcomm", "TCS", "Cognizant", "Accenture"], "topic_tags": ["Arrays", "Searching", "Divide and Conquer"]}, "content_type": 1, "problem_url": "https://www.geeksforgeeks.org/problems/binary-search-1587115620/1", "topic_order": null, "visibility_type": 1, "batch_slug": null, "track_slug": null, "solved_status": 0}, {"id": 702678, "problem_name": "Missing And Repeating", "problem_type": 1, "problem_level": 0, "slug": "find-missing-and-repeating2512", "accuracy": "24.83%", "all_submissions": 735236, "marks": 2, "difficulty": "Easy", "tags": {"company_tags": [], "topic_tags": ["Bit Magic"]}, "content_type": 1, "problem_url": "https://www.geeksforgeeks.org/problems/find-missing-and-repeating2512/1", "topic_order": null, "visibility_type": 1, "batch_slug": null, "track_slug": null, "solved_status": 0}, {"id": 701368, "problem_name": "Minimum Platforms", "problem_type": 1, "problem_level": 1, "slug": "minimum-platforms-1587115620", "accuracy": "26.84%", "all_submissions": 691316, "marks": 4, "difficulty": "Medium", "tags": {"company_tags": ["Paytm", "Amazon", "Microsoft", "D-E-Shaw", "Hike", "Walmart", "Adobe", "Google", "Boomerang Commerce", "Zillious", "Atlassian", "NPCI", "Morgan Stanley"], "topic_tags": ["Arrays", "Greedy", "Sorting", "Binary Search"]}, "content_type": 1, "problem_url": "https://www.geeksforgeeks.org/problems/minimum-platforms-1587115620/1", "topic_order": null, "visibility_type": 1, "batch_slug": null, "track_slug": null, "solved_status": 0}, {"id": 704213, "problem_name": "Count Subsets with Sum", "problem_type": 1, "problem_level": 1, "slug": "perfect-sum-problem5633", "accuracy": "20.58%", "all_submissions": 680042, "marks": 4, "difficulty": "Medium", "tags": {"company_tags": ["Amazon", "Microsoft", "Tesco"], "topic_tags": ["Dynamic Programming"]}, "content_type": 1, "problem_url": "https://www.geeksforgeeks.org/problems/perfect-sum-problem5633/1", "topic_order": null, "visibility_type": 1, "batch_slug": null, "track_slug": null, "solved_status": 0}, {"id": 703297, "problem_name": "Largest in Array", "problem_type": 1, "problem_level": -1, "slug": "largest-element-in-array4009", "accuracy": "67.48%", "all_submissions": 675546, "marks": 1, "difficulty": "Basic", "tags": {"company_tags": ["Infosys", "Oracle", "Wipro", "Morgan Stanley"], "topic_tags": ["Arrays"]}, "content_type": 1, "problem_url": "https://www.geeksforgeeks.org/problems/largest-element-in-array4009/1", "topic_order": null, "visibility_type": 1, "batch_slug": null, "track_slug": null, "solved_status": 0}, {"id": 703954, "problem_name": "Prime Number", "problem_type": 1, "problem_level": 0, "slug": "prime-number2314", "accuracy": "22.2%", "all_submissions": 666740, "marks": 2, "difficulty": "Easy", "tags": {"company_tags": ["VMWare", "Amazon", "SAP Labs"], "topic_tags": ["Mathematics", "Prime Number"]}, "content_type": 1, "problem_url": "https://www.geeksforgeeks.org/problems/prime-number2314/1", "topic_order": null, "visibility_type": 1, "batch_slug": null, "track_slug": null, "solved_status": 0}, {"id": 700512, "problem_name": "Peak in Array", "problem_type": 1, "problem_level": 1, "slug": "peak-element", "accuracy": "38.86%", "all_submissions": 655367, "marks": 4, "difficulty": "Medium", "tags": {"company_tags": ["Accolite", "Amazon", "Visa", "Adobe", "Google"], "topic_tags": ["Arrays", "Searching", "Binary Search"]}, "content_type": 1, "problem_url": "https://www.geeksforgeeks.org/problems/peak-element/1", "topic_order": null, "visibility_type": 1, "batch_slug": null, "track_slug": null, "solved_status": 0}, {"id": 701431, "problem_name": "0 - 1 Knapsack Problem", "problem_type": 1, "problem_level": 1, "slug": "0-1-knapsack-problem0945", "accuracy": "31.76%", "all_submissions": 627896, "marks": 4, "difficulty": "Medium", "tags": {"company_tags": ["Flipkart", "Morgan Stanley", "Amazon", "Microsoft", "Snapdeal", "Oracle", "Payu", "Visa", "Directi", "GreyOrange", "Mobicip", "NPCI"], "topic_tags": ["Dynamic Programming"]}, "content_type": 1, "problem_url": "https://www.geeksforgeeks.org/problems/0-1-knapsack-problem0945/1", "topic_order": null, "visibility_type": 1, "batch_slug": null, "track_slug": null, "solved_status": 0}, {"id": 701595, "problem_name": "Reverse a String", "problem_type": 1, "problem_level": -1, "slug": "reverse-a-string", "accuracy": "69.49%", "all_submissions": 622907, "marks": 1, "difficulty": "Basic", "tags": {"company_tags": [], "topic_tags": ["Strings"]}, "content_type": 1, "problem_url": "https://www.geeksforgeeks.org/problems/reverse-a-string/1", "topic_order": null, "visibility_type": 1, "batch_slug": null, "track_slug": null, "solved_status": 0}, {"id": 703092, "problem_name": "Two Sum - Pair with Given Sum", "problem_type": 1, "problem_level": 0, "slug": "key-pair5616", "accuracy": "30.61%", "all_submissions": 621880, "marks": 2, "difficulty": "Easy", "tags": {"company_tags": ["Zoho", "Flipkart", "Morgan Stanley", "Accolite", "Amazon", "Microsoft", "FactSet", "Hike", "Adobe", "Google", "Wipro", "SAP Labs", "CarWale"], "topic_tags": ["Arrays", "Hash"]}, "content_type": 1, "problem_url": "https://www.geeksforgeeks.org/problems/key-pair5616/1", "topic_order": null, "visibility_type": 1, "batch_slug": null, "track_slug": null, "solved_status": 0}, {"id": 700218, "problem_name": "Directed Graph Cycle", "problem_type": 1, "problem_level": 1, "slug": "detect-cycle-in-a-directed-graph", "accuracy": "27.88%", "all_submissions": 621640, "marks": 4, "difficulty": "Medium", "tags": {"company_tags": ["Flipkart", "Amazon", "Microsoft", "Samsung", "MakeMyTrip", "Oracle", "Goldman Sachs", "Adobe", "BankBazaar", "Rockstand", "NPCI"], "topic_tags": ["Graph"]}, "content_type": 1, "problem_url": "https://www.geeksforgeeks.org/problems/detect-cycle-in-a-directed-graph/1", "topic_order": null, "visibility_type": 1, "batch_slug": null, "track_slug": null, "solved_status": 0}, {"id": 700174, "problem_name": "Left View of Binary Tree", "problem_type": 1, "problem_level": 0, "slug": "left-view-of-binary-tree", "accuracy": "33.74%", "all_submissions": 620659, "marks": 2, "difficulty": "Easy", "tags": {"company_tags": ["Paytm", "Flipkart", "Accolite", "Amazon", "OYO Rooms", "Samsung", "Snapdeal", "MakeMyTrip", "Ola Cabs", "Adobe", "Qualcomm", "Twitter", "Knowlarity", "Open Solutions", "NPCI"], "topic_tags": ["Tree"]}, "content_type": 1, "problem_url": "https://www.geeksforgeeks.org/problems/left-view-of-binary-tree/1", "topic_order": null, "visibility_type": 1, "batch_slug": null, "track_slug": null, "solved_status": 0}], "is_logged_in": false, "applied_filters": {"sortBy": ["submissions"]}}