# Status Problem Level Completes Likes 106 Print Right View of a given binary tree Medium % 0 107 In a Binary Tree, Check if Two nodes has the same parent or are siblings Medium % 0 108 In a Binary Tree, Check if two nodes are Cousins Medium % 0 109 Check if Two BST's are Identical Beginner % 0 110 Print Paths from root to all leaf nodes in a binary tree. Medium % 0 111 Print All The Permutations Of a String Hard % 0 112 Print All Nodes Between Two Given Levels Medium % 0 113 Find the maximum width of a binary tree Medium % 0 114 Level Order Traversal in Zig Zag pattern OR Print in Spiral Pattern Hard % 0 115 Determine whether given binary tree is binary search tree(BST) or not Medium % 1 116 Find the Size of the Binary Tree Beginner % 0 117 Given two binary trees, check if one binary tree is a subtree of another Medium % 0 118 Print a path from Root to Node in Binary Tree Medium % 0 119 Inorder Successor in Binary Tree Medium % 0 120 Inorder Successor in Binary Search Tree without Using Parent link Hard % 0 121 Inorder Successor in Binary Search Tree Using Parent link Hard % 0 122 Sorted Array to Binary Search Tree of Minimal Height Medium % 1 123 In a Binary Tree, Create Linked Lists of all the nodes at each depth. Hard % 0 124 Level Order Traversal, Print each level in separate line. Medium % 0 125 Find whether a Given Binary Tree is Balanced? Medium % 0 126 Get the Height of a Node in a Binary Tree Medium % 0 127 Find the Maximum Depth OR Height of a Binary Tree Beginner % 1 128 Reverse a Linked List - Part 2 Medium % 0 129 Swap Every Kth Node in a LinkedList Medium % 0 130 Find the n'th Node from the end of a given Linked List Beginner % 0 131 Find the Loop in a Linked list, find its length and Break the Loop Medium % 0 132 Reverse a Linked List Beginner % 0 133 Count All Paths from Top left to bottom right in Two Dimensional Array including Diagonal Paths Medium % 1 134 Print All Paths from Top left to bottom right in Two Dimensional Array Medium % 0 135 Merge or Combine Two Sorted Linked Lists Medium % 0 136 Print All Elements of Two Dimensional Array in Spiral Medium % 0 137 Quick Sort Implementation Medium % 0 138 Find Whether Given String is palindrome or Not. Beginner % 0 139 Find a peak element in a Given Array Beginner % 0 140 Merge Sort - Updated - Most Efficient ways to Implement Medium % 1 Print Right View of a given binary tree In a Binary Tree, Check if Two nodes has the same parent or are siblings In a Binary Tree, Check if two nodes are Cousins Check if Two BST's are Identical Print Paths from root to all leaf nodes in a binary tree. Print All The Permutations Of a String Print All Nodes Between Two Given Levels Find the maximum width of a binary tree Level Order Traversal in Zig Zag pattern OR Print in Spiral Pattern Determine whether given binary tree is binary search tree(BST) or not Find the Size of the Binary Tree Given two binary trees, check if one binary tree is a subtree of another Print a path from Root to Node in Binary Tree Inorder Successor in Binary Tree Inorder Successor in Binary Search Tree without Using Parent link Inorder Successor in Binary Search Tree Using Parent link Sorted Array to Binary Search Tree of Minimal Height In a Binary Tree, Create Linked Lists of all the nodes at each depth. Level Order Traversal, Print each level in separate line. Find whether a Given Binary Tree is Balanced? Get the Height of a Node in a Binary Tree Find the Maximum Depth OR Height of a Binary Tree Reverse a Linked List - Part 2 Swap Every Kth Node in a LinkedList Find the n'th Node from the end of a given Linked List Find the Loop in a Linked list, find its length and Break the Loop Reverse a Linked List Count All Paths from Top left to bottom right in Two Dimensional Array including Diagonal Paths Print All Paths from Top left to bottom right in Two Dimensional Array Merge or Combine Two Sorted Linked Lists Print All Elements of Two Dimensional Array in Spiral Quick Sort Implementation Find Whether Given String is palindrome or Not. Find a peak element in a Given Array Merge Sort - Updated - Most Efficient ways to Implement 1 2 3 4 5
