The Wayback Machine - https://web.archive.org/web/20191120225118/https://practice.geeksforgeeks.org/recent.php
x
×

Problem Name Topic Tags lock Company Tags Level
Set bits in N 0 0 lock - Basic
Pangram check 0 0 lock - Basic
Pattern searching 0 0 lock - Easy
Heapify the vector 0 0 lock - Basic
Permutations of string 0 0 lock - Basic
Remove from vector 0 0 lock - Basic
Sort and reverse 0 0 lock - Basic
upper and lower bounds of an element 0 0 lock - Basic
Rotate vector by K places 0 0 lock - Easy
Search in Vector 0 0 lock - Basic
Tie Breaker 0 0 lock - Medium
Elected candidate 0 0 lock - Easy
Insertion in deque 0 0 lock - Basic
Vector insertion 0 0 lock - Basic
Pairing elements 0 0 lock - Basic
Make pair 0 0 lock - Basic
Vector fill 0 0 lock - Basic
Find element in Set using find 0 0 lock - Basic
Find element in Set using Count 0 0 lock - Easy
Vector Accumulate 0 0 lock - Easy
Vector min_element 0 0 lock - Easy
Vector max_element 0 0 lock - Basic
Sorted Frequency 0 0 lock - Basic
Distinct Sorted 0 0 lock - Basic
Maximize Number of Toys 0 0 lock - Basic
Forward List Insert 0 0 lock - Basic
Sort Vector of Pairs 0 0 lock - Basic
Reverse a String 0 0 lock - Basic
Panagram Checking 0 0 lock - Basic
Uppercase to Lowercase 0 0 lock - Easy
Lowercase to Upercase 0 0 lock - Basic
Missing Characters in Panagram 0 0 lock - Basic
Vowels in String 0 0 lock - Easy
Length of String 0 0 lock - Basic
Levelorder in BST 0 0 lock - Basic
More Problems of Difficulty Level: School Basic Easy Medium Hard
Problem Name Topic Tags lock Company Tags Level
Pairs of Adjacent elements 0 0 lock - Easy
Articulation Point 0 0 lock - Hard
test 0 0 lock - Easy
Largest Sum Contiguous Subarray in Range 55 39.99 lock - Hard
Range LCM Queries 7 71.43 lock - Medium
Range GCD Queries 51 52.93 lock - Medium
Range Min Max Queries 195 23.1 lock - Medium
Range Sum Queries 336 20.59 lock - Medium
Renaming Cities 168 30.95 lock - Medium
Search Query for Strings 316 32.67 lock - Easy
Optimal Strategy For A Game 5790 42.57 lock Amazon | Google | Hike | Linkedin | Microsoft | Salesforce Medium
Kth smallest element 75 80.02 lock - Medium
Kth largest element 110 54.57 lock - Medium
Smaller on Right 675 24.96 lock - Medium
Queue Operations 1 100 lock - Basic
Distinct Pattern Search 151 64.88 lock - Easy
Naive Pattern Search 302 37.75 lock - Easy
Intersection of two sorted arrays 131 42.01 lock - Easy
Union of Two Sorted Arrays 266 15 lock - Easy
Maximum Product of Increasing Subsequence of Size 3 779 7.73 lock - Medium
Nearly sorted 67 61.18 lock - Medium
K Most occurring elements 138 30.42 lock - Medium
Extended Euclidean Algorithm 90 53.34 lock - Basic
Possible paths between 2 vertices 790 17.89 lock - Medium
Level of Nodes 100 38.01 lock - Medium
Height Using Parent Array 0 0 lock - Medium
Merge three sorted arrays 64 51.56 lock - Medium
Minimum adjacent difference in a circular array 269 49.11 lock - Easy
A difference of values and indexes 518 15.7 lock - Medium
Fair Coin Toss 0 0 lock - Medium
Median of Two sorted arrays 2200 28.08 lock D-E-Shaw | Linkedin | Ola Cabs | Samsung Hard
Minimum number to make median X 864 11.14 lock - Hard
The Newtonian Tree 0 0 lock - Hard
The QuadNacci Number using DP 0 0 lock - Easy
Smaller on Left 2730 13.43 lock - Medium
More Problems of Difficulty Level: School Basic Easy Medium Hard