Problems

# Status Problem Level Completes Likes
142

Graph – Print all paths between source and destination

Medium % 0
145

Sum of all sub arrays in O(n) Time

Hard % 0
147

Text Justification Problem (OR Word Wrap Problem)

Hard % 0
148

Dynamic Programming - Egg Dropping Problem

Hard % 0
149

Nuts & Bolts Problem (Lock & Key problem)

Beginner % 0
150

Divide and Conquer - Rearrange array elements in special order

Medium % 0
151

Remove Duplicates from a string

Medium % 0
152

Find median of two sorted arrays of same size

Medium % 0
153

Dynamic programming – Minimum Jumps to reach to end

Hard % 0
154

Dynamic programming – Printer Problem

Hard % 0
155

Dynamic programming - Remove Boxes Problem

Hard % 0
156

Find two non-repeating numbers in an array in O(n) time and O(1) space

Hard % 0
157

Separate even and odd integers in a given array

Beginner % 0
158

Find local minimum or local maximum in O(1).

Medium % 0
159

Separate 0’s and 1’s in a given array

Beginner % 0
160

Majority Element- Boyer–Moore majority vote algorithm

Medium % 0
161

Find the local minima in a given array

Medium % 0
162

Stock Single Sell Problem - O(n) Solution

Hard % 1
163

Maximum Subarray OR Largest Sum Contiguous Subarray Problem – Divide and Conquer

Hard % 0
164

Maximum difference between two elements where larger element appears after the smaller element

Medium % 0
165

Find the two repeating elements in a given array | 6 Approaches

Medium % 0
166

Find two elements whose sum is closest to zero

Medium % 0
167

Find the element which appears maximum number of times in the array.

Medium % 0
168

Find duplicates in an given array in O(n) time and O(1) extra space.

Medium % 0
169

Find the last repeating character in a given string.

Beginner % 0
170

Find longest Snake sequence in a given matrix

Medium % 0
171

Dynamic Programming - Count all paths in 2D Matrix with Obstructions in it

Medium % 0
172

Dynamic Programming - Count all paths from top left to bottom right of a mXn matrix

Medium % 0
173

Dynamic Programming - Edit Distance Problem

Hard % 1
174

Dynamic Programming - Coin In a Line Game Problem

Hard % 0
175

Dynamic Programming - Box Stacking Problem

Hard % 0

Graph – Print all paths between source and destination

Sum of all sub arrays in O(n) Time

Text Justification Problem (OR Word Wrap Problem)

Dynamic Programming - Egg Dropping Problem

Nuts & Bolts Problem (Lock & Key problem)

Divide and Conquer - Rearrange array elements in special order

Remove Duplicates from a string

Find median of two sorted arrays of same size

Dynamic programming – Minimum Jumps to reach to end

Dynamic programming – Printer Problem

Dynamic programming - Remove Boxes Problem

Find two non-repeating numbers in an array in O(n) time and O(1) space

Separate even and odd integers in a given array

Find local minimum or local maximum in O(1).

Separate 0’s and 1’s in a given array

Majority Element- Boyer–Moore majority vote algorithm

Find the local minima in a given array

Stock Single Sell Problem - O(n) Solution

Maximum Subarray OR Largest Sum Contiguous Subarray Problem – Divide and Conquer

Maximum difference between two elements where larger element appears after the smaller element

Find the two repeating elements in a given array | 6 Approaches

Find two elements whose sum is closest to zero

Find the element which appears maximum number of times in the array.

Find duplicates in an given array in O(n) time and O(1) extra space.

Find the last repeating character in a given string.

Find longest Snake sequence in a given matrix

Dynamic Programming - Count all paths in 2D Matrix with Obstructions in it

Dynamic Programming - Count all paths from top left to bottom right of a mXn matrix

Dynamic Programming - Edit Distance Problem

Dynamic Programming - Coin In a Line Game Problem

Dynamic Programming - Box Stacking Problem