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
Author: Logan
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.
How to find if two Binary trees are mirror images?
Mirror images mean right and left child of the two trees are interchanged. Thus, left child of first tree is right child of second tree. Traverse the Tree 1 and Tree 2 in Inorder fashion and store the node values of each Tree 1 & Tree 2 in two different arrays.
Time & Space complexity [Cheat Sheet]
Time Complexity is the number of primitive operations executed on a particular input. It measures the amount of time an algorithm takes to complete as a function of the length of the input.
DFS (Depth-First Search) in Binary Trees and Graphs
DFS (Depth-First Search) is an algorithm for traversing a graph. DFS starts from source vertex (graph) or root (in trees) and then visits an unvisited adjacent node v. After that it checks if node v has any adjacent node which is unvisited. If it reaches a leaf node or any node having no unvisited adjacent node. It backtracks and continue traversing other nodes.