## Leetcode problem Longest Palindromic Substring (two solutions)

Longest palindromic substring is a quite easy problem- -especially if you have some experience in competitive programming, We are given a string S with lengths up to 1000 and we should find the longest palindromic substring. A substring, which is a palindrome, So it reads the same backwards. First let’s Read more…

## 8 BIT CPU Algorithms

Hi there before we get started building our CPU I thought it would be good to go through a little exercise showing what a computer can and cannot do for you. A computer is a machine that will run algorithms , the questions are can we create an algorithm for Read more…

## Get level of a node in binary tree | Iterative approach | GeeksforGeeks

Hello friends! And, welcome to another tutorial on GeeksforGeeks. In this video we are going to understand the program which helps us in fnding the level of a node in a binary tree iteratively. First, let us take an example. For example, consider the following tree. If the input key Read more…

## Linear Time BuildHeap

Okay, this is a quick video on building a binary heap, in worst-case linear time, with an elegant proof. Before watching the video, you should understand the introduction to heaps video, where we saw the insertion and heapify methods. Of course, we can build a heap by iterated insertion, that Read more…

## Leetcode problem question Longest Palindromic Substring (two solutions)

Longest palindromic substring is a quite easy problem- -especially if you have some experience in competitive programming, We are given a string S with lengths up to 1000 and we should find the longest palindromic substring. A substring, which is a palindrome, So it reads the same backwards. First let’s Read more…

## How to use Leetcode EFFECTIVELY… and STOP grinding

What’s up everyone! Sam here from Byte-by-Byte.com and in this video I’m gonna show you exactly how to use LeetCode and solve the problems as effectively as possible so that you’re no longer just grinding random problems over and over again. And that you’re not forgetting the problem that you Read more…

## Find maximum (or minimum) in Binary Tree | GeeksforGeeks

Hello friends! And, welcome to another tutorial on GeeksforGeeks. In this video we are going to understand the program which finds the maximum and minimum element in a binary tree. First, let us see an example. As you can see, in this example, the maximum element in the tree is Read more…

## c++ program for binary search example

BINARY SEARCH FULL PROGRAM WORKING SAVE THE PROGRAM

## Find the closest element in Binary Search Tree | GeeksforGeeks

Hello friends! And, welcome to another tutorial on GeeksforGeeks. In this video we are going to understand the program which Find the closest element in Binary Search Tree FIrst, let us take an example Now, let us see the approach. Next, let us see the algorithm. Let us also have Read more…

## Check whether a binary tree is a full binary tree or not | Iterative Approach | GeeksforGeeks

Hello friends! And, welcome to another tutorial on GeeksforGeeks. In this video we are going to understand the program which helps us in checking whether a binary tree is a full binary tree or not. First, let us see what exactly a full tree mean A full binary tree is Read more…