Extended Euclidean Algorithm

4

75 
Mathematical 
lock

 
Basic 
Possible paths between 2 vertices

31

12.91 
DFS  Graph 
lock

 
Medium 
Level of Nodes

0

0 
BFS  Graph 
lock

 
Medium 
Height Using Parent Array

0

0 
Tree 
lock

 
Medium 
Merge three sorted arrays

0

0 
Arrays  Sorting 
lock

 
Medium 
Minimum absloute difference between adjacent elements in a circular array

0

0 
Arrays 
lock

 
Easy 
A difference of values and indexes

0

0 
 
lock

 
Medium 
Fair Coin Toss

0

0 
Mathematical 
lock

 
Medium 
Median of Two sorted arrays

0

0 
Arrays 
lock

 
Hard 
Minimum number to make median X

0

0 
 
lock

 
Hard 
The Newtonian Tree

0

0 
Tree 
lock

 
Hard 
The QuadNacci Number using DP

0

0 
 
lock

 
Easy 
Smaller on Left

1666

8.2 
Arrays  Map  set 
lock

 
Medium 
Series Completion

0

0 
 
lock

 
Medium 
Number of edges

0

0 
Mathematical 
lock

 
Easy 
A Game of Doubles

0

0 
logicalthinking  Mathematical 
lock

 
Medium 
Number Equivalence

0

0 
Mathematical 
lock

 
Medium 
Transfer the material

0

0 
 
lock

 
Medium 
N term of series

0

0 
 
lock

 
Medium 
Game of Powers

0

0 
Mathematical 
lock

 
Medium 
Mean and Median

0

0 
Mathematical 
lock

 
Easy 
Number of possible squares

0

0 
Mathematical 
lock

 
Medium 
Average of N consecutive numbers

0

0 
Mathematical 
lock

 
Medium 
Area Manipulation

0

0 
Mathematical 
lock

 
Easy 
The rotating axle

0

0 
 
lock

 
Easy 
Print Distinct Elements

0

0 
 
lock

 
Easy 
Removing consecutive duplicates  2

0

0 
 
lock

 
Easy 
Removing consecutive duplicates

0

0 
 
lock

 
Easy 
Stack Operations

0

0 
 
lock

 
Easy 
Separate chaining in Hashing

0

0 
 
lock

 
Easy 
Quadratic Probing in Hashing

0

0 
 
lock

 
Easy 
Linear Probing in Hashing

0

0 
 
lock

 
Easy 
Boundary traversal of matrix

0

0 
 
lock

 
Easy 
Reversing the rows of a Matrix

0

0 
 
lock

 
Easy 
Reversing the columns of a Matrix

0

0 
 
lock

 
Easy 
More Problems of Difficulty Level:
School
Basic
Easy
Medium
Hard
