# Status Problem video Level Completes Likes 152 Breadth-First Search/Traversal in a Graph Beginner % 1 151 Breadth-First Search/Traversal in a Binary Tree Beginner % 0 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 103 Delete X Nodes After Y Nodes In a Linked List Beginner % 0 94 Depth First Search/Traversal in Binary Tree Beginner % 0 91 Check if Array is Consecutive Integers Beginner % 0 87 Find Intersection of Two Sorted Arrays Beginner % 0 68 Transforming a Binary Tree into its Mirror Image Beginner % 0 67 Printing Nodes without Siblings in a Binary Tree Beginner % 0 60 Determine if Two BSTs are Identical Beginner % 0 52 Find Common Numbers in Three Sorted Arrays Beginner % 0 47 Find the Size of the Binary Tree Beginner % 0 36 Find the Maximum Depth OR Height of a Binary Tree Beginner % 1 32 Binary Search Tree (BST) Complete Implementation. Beginner % 0 29 Delete a Node in the Middle of a Linked List Without Access to Head Node Beginner % 0 28 Determine the Nth Node from the Tail in a Linked List Beginner % 0 Breadth-First Search/Traversal in a Graph Breadth-First Search/Traversal in a Binary Tree 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 Delete X Nodes After Y Nodes In a Linked List Depth First Search/Traversal in Binary Tree Check if Array is Consecutive Integers Find Intersection of Two Sorted Arrays Transforming a Binary Tree into its Mirror Image Printing Nodes without Siblings in a Binary Tree Determine if Two BSTs are Identical Find Common Numbers in Three Sorted Arrays Find the Size of the Binary Tree Find the Maximum Depth OR Height of a Binary Tree Binary Search Tree (BST) Complete Implementation. Delete a Node in the Middle of a Linked List Without Access to Head Node Determine the Nth Node from the Tail in a Linked List 1 2 3 4 5 6 7
