Edit Distance – LeetCode Solution [Hard]
Given two strings word1 and word2 (in lowercase alphabets), return the minimum number of operations required to convert word1 to word2.
How to find if a Tree is a subtree of the given tree in C++
Given the roots of two binary trees root and rootSub, check if there is a subtree of root with the same structure and node values as rootSub.
A subtree of a tree T is a tree S consisting of a node in T and all of its descendants in T.
How to print ancestors of a node in Binary tree using C++
You’re given a root of a binary tree and a key k. You need to print the ancestors of k in the given binary tree.
Finding the Diameter of a Binary Tree – LeetCode Solution [Easy]
The diameter of a binary tree is the length of the longest path between any two nodes
How to delete a node from a Linked list without head pointer in C++
You are given a pointer to a node of a linked list which is to be deleted. You neither have a head pointer nor the pointer to the previous node.
Given a sorted Alien dictionary, find order of characters
In an alien language, surprisingly, they also use English lowercase letters, but possibly in a different order. The order of the alphabet is some permutation of lowercase letters.
Linked List
A Linked List is a data structure in which the objects are arranged in a linear order. Unlike Arrays, you cannot access any element directly through its index.
Stock Span Problem – LeetCode Solution [Medium]
The stock span problem is a financial problem defined as the maximum number of consecutive days (starting from today and going backward)
How to find the maximum height of a Binary tree – LeetCode Solution [Easy]
Given the root of a binary tree, return its maximum depth.
A binary tree’s maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.
Topological Sort [Hackerearth]
A Topological sort of a Directed-Acyclic graph G is a linear ordering of all its vertices such that if G contains an edge E (u, v), then u appears before v in the ordering. And if the graph is not acyclic, then no linear ordering is possible.