## How to Convert Binary Tree to Mirror Tree (Inverted)

Do you want to know how to convert Binary Tree To Mirror Tree? In this article, you will learn to convert a Binary Tree to Its Mirror or Inverted view. What is Mirror Tree? When you are having a given binary tree, then the mirror of that tree would be that all the left children … Read more

## Kadane’s Algorithm: Maximum Sum Subarray Problem

Do you want to solve the Maximum Sum Subarray problem in an optimized way? Today you will learn Kadane’s algorithm that lets you solve this difficult algorithm question in the most optimized and fastest way. You’re probably trying to solve the “Maximum Subarray Problem” and ran into Kadane’s Algorithm but couldn’t figure out how it … Read more

## How to Find Diameter Of Binary Tree?

Find Diameter of Binary Tree is the most frequently asked software interview question nowadays. It tests your skill and understanding of the Binary Tree and its height calculation. What is Diameter of the Binary Tree? The number of nodes on the longest path between two end nodes is the diameter (also known as width) of … Read more

## Kruskal’s Algorithm Minimum Spanning Tree Complete Guide

Are you looking to understand Kruskal’s Algorithm to construct a Minimum Spanning tree for any given undirected or directed graph? In this article, I will provide a complete guide with code to understand Kruskal’s Algorithm. A spanning tree of a connected and undirected graph is a subgraph that is a tree that binds all of … Read more

## Check If String is Palindrome Using Recursion

Are you looking for recursive a program that checks whether a String is a Palindrome? In this article, I will show you how you can check if the string is palindrome using recursion. What is Palindrome String? A palindromic string is a string if read from head to end or end to head remains the … Read more

## QuickSort in C++ Implementation and Examples

Are you looking for Implementation of QuickSort in C++? In this article, I will go through the QuickSort implementation in C++ and provide you detailed knowledge about the algorithm of this sorting type. QuickSort, like Merge Sort, is a Divide and Conquer algorithm. It selects a pivot element and partitions the specified array around that … Read more

## Find First And Last Position of Element in Sorted Array

Find First And Last Position of Element in Sorted Array is a classic coding interview question asked by many big companies such as Google, Facebook, etc. This question is based on Binary Search. Given an array of integers sorted in ascending order, find the starting and ending position of a given target value. If target is not found in the … Read more

## N-ary Tree Level Order Traversal Solution Python C++

N-Ary Tree level Order Traversal is a frequently asked question during a Coding Interview. It assesses your knowledge of Bread First Search by requiring you to solve the question using the iteration method. Otherwise, if the interviewer asked you to solve it using DFS, you must use recursion. In this post, I’ll go over the … Read more