# Status Problem video Level Completes Likes 150 Sort Names by their Last Names Beginner % 0 147 Introduction To Backtracking Programming Beginner % 0 146 Dynamic Programming - Stairs Climbing Puzzle Beginner % 1 144 Introduction To Dynamic Programming - Fibonacci Series Beginner % 1 141 Find the Single Occurrence Element in an Array (Odd One Out) Beginner % 1 139 Find Missing Numbers in Sequences - XOR Method Beginner % 1 138 Find the Maximum Value in a Binary Tree Beginner % 0 136 Verifying Mirror Binary Trees Beginner % 1 130 Find and Print Full Nodes in a Binary Tree Beginner % 0 128 Magic Index - Find Index In Sorted Array Such That A[i] = i Beginner % 0 127 Numbers Palindrome in Both Decimal and Octal Beginner % 0 124 Create a Specific Triangle Pattern from an Array Beginner % 0 122 Goldbach's Conjecture Beginner % 0 120 Convert Decimal to Irreducible Fraction (Simplified Form) Beginner % 0 119 Clock Angle Problem Beginner % 1 115 Graph Representation - Adjacency Matrix and Adjacency List Beginner % 2 113 Towers Of Hanoi Beginner % 0 111 Find Unique Number in Array with Duplicates (Except One) Beginner % 1 110 Tricky Sorting: Sort 3 Numbers Without If Statements (or Only Max()) Beginner % 0 109 Find Greatest Common Divisor (GCD) Efficiently with Euclidean Algorithm Beginner % 0 Sort Names by their Last Names Introduction To Backtracking Programming Dynamic Programming - Stairs Climbing Puzzle Introduction To Dynamic Programming - Fibonacci Series Find the Single Occurrence Element in an Array (Odd One Out) Find Missing Numbers in Sequences - XOR Method Find the Maximum Value in a Binary Tree Verifying Mirror Binary Trees Find and Print Full Nodes in a Binary Tree Magic Index - Find Index In Sorted Array Such That A[i] = i Numbers Palindrome in Both Decimal and Octal Create a Specific Triangle Pattern from an Array Goldbach's Conjecture Convert Decimal to Irreducible Fraction (Simplified Form) Clock Angle Problem Graph Representation - Adjacency Matrix and Adjacency List Towers Of Hanoi Find Unique Number in Array with Duplicates (Except One) Tricky Sorting: Sort 3 Numbers Without If Statements (or Only Max()) Find Greatest Common Divisor (GCD) Efficiently with Euclidean Algorithm 1 2 3 4 5 6 7 8 9 10 11 12