MR CodeBlocks Problems Tracks Mock Tests Compiler

Login

// practice ground

Problems

#	Title	Topics	Difficulty
51	Unique Paths	Dynamic Programming Math	Medium
52	First Non-Repeating Character	Hashing Strings	Easy
53	Sieve of Eratosthenes	Math	Medium
54	GCD of an Array	Math	Easy
55	LCM of Two Numbers	Math	Easy
56	Sliding Window Maximum	Arrays Heaps / Priority Queue	Hard
57	0/1 Knapsack	Dynamic Programming	Hard
58	Edit Distance	Dynamic Programming Strings	Hard
59	Longest Common Subsequence	Dynamic Programming Strings	Medium
60	Search in Rotated Sorted Array	Arrays Binary Search	Medium
61	Check Prime Number	Math	Easy
62	Reverse a Linked List	Linked List	Easy
63	Detect Cycle in a Linked List	Linked List Two Pointers	Medium
64	Merge Two Sorted Linked Lists	Linked List Sorting	Medium
65	Middle of the Linked List	Linked List Two Pointers	Easy
66	Remove Nth Node From End of List	Linked List Two Pointers	Medium
67	Palindrome Linked List	Linked List Two Pointers	Easy
68	Implement Queue using Stacks	Design Queues Stacks	Medium
69	Design Circular Queue	Arrays Design Queues	Medium
70	Generate Binary Numbers using a Queue	Queues	Medium
71	Reverse a Queue	Queues	Easy
72	Maximum Sum Subarray of Size K	Arrays Sliding Window	Easy
73	Longest Substring Without Repeating Characters	Hashing Sliding Window Strings	Medium
74	Minimum Size Subarray Sum	Arrays Sliding Window	Medium
75	Generate Parentheses	Backtracking Recursion	Medium

Showing 51–75 of 100

Prev 1 2 3 4 Next