Populate Inorder Successor for all nodes
Given a Binary Tree, complete the function to populate the next pointer for all nodes. The next pointer for every […]
2181. Merge Nodes in Between Zeros
You are given the head of a linked list, which contains a series of integers separated by 0‘s. The beginning and end of the linked list will have Node.val ==
Vertical Width of a Binary Tree
Given a Binary Tree. You need to find and return the vertical width of the tree. Examples : Input: 1
2058. Find the Minimum and Maximum Number of Nodes Between Critical Points
A critical point in a linked list is defined as either a local maxima or a local minima. A node is a local maxima if the current node has
Duplicate Subtrees
Given a binary tree, your task is to find all duplicate subtrees from the given binary tree. Duplicate Subtree : Two
1509. Minimum Difference Between Largest and Smallest Value in Three Moves
You are given an integer array nums. In one move, you can choose one element of nums and change it to any value. Return the
Remove all occurences of duplicates in a linked list
Given a sorted linked list, delete all nodes that have duplicate numbers (all occurrences), leaving only numbers that appear once
350. Intersection of Two Arrays II
Given two integer arrays nums1 and nums2, return an array of their intersection. Each element in the result must appear as many times as
linked list of strings forms a palindrome
Given a linked list with string data, check whether the combined string formed is palindrome. If the combined string is
1550. Three Consecutive Odds
Given an integer array arr, return true if there are three consecutive odd numbers in the array. Otherwise, return false. Example 1: Input: arr
Make Binary Tree From Linked List
Given a Linked List Representation of Complete Binary Tree. The task is to construct the Binary tree and print the
1579. Remove Max Number of Edges to Keep Graph Fully Traversable
Alice and Bob have an undirected graph of n nodes and three types of edges: Type 1: Can be traversed by Alice