## Overview – Intro to Theoretical Computer Science

This course has 7 units, and I’m now going to give you a brief overview of what we have planned. The first 3 units will introduce you to challenging problems, and I’m going to do this by telling you about some problems that are really relevant in practice, yet very, Read more…

## Find the maximum path sum between two leaves of a binary tree | GeeksforGeeks

Hello friends! And, welcome to another tutorial on GeeksforGeeks. In this video we are going to understand the program which helps us in Finding the maximum path sum between two leaves of a binary tree..First let us take an example. In this binary tree, the maximum path sum will be Read more…

## Print Ancestors of a given node in Binary Tree | GeeksforGeeks

Hello friends! And, welcome to another tutorial on GeeksforGeeks. In this video we are going to understand the program which helps us in finding the ancestors of a given node in a binary tree. FIrst , let us see an example In this example, the ancestors of 7 are nodes Read more…

## Get Level of a node in a Binary Tree | GeeksforGeeks

Hello friends! And, welcome to another tutorial on GeeksforGeeks. In this video we are going to understand the program which helps us in getting the level of a node in a binary tree. First us see an example. In this example, if input key is 3, then function should return Read more…

## POI problem Movie-goer (Polish Olympiad in Informatics)

Hi, here’s a problem, Movie-goer from Polish Olympiad. There are N days, each day there is one movie and every movie has some particular score assigned. Your task is to find a consecutive sequence of days to maximize the total score of those movies that you see exactly once during Read more…

## Print leftmost and rightmost nodes of a Binary Tree | GeeksforGeeks

Hello friends! And, welcome to another tutorial on GeeksforGeeks. In this video we are going to understand the program which prints the leftmost and rightmost nodes of a binary tree. First, let us take an example. In this example, the output will be 15,10,20,8,25 which are the leftmost and rightmost Read more…

## Convert a Binary Tree into Doubly Linked List in spiral fashion | GeeksforGeeks

Hello friends! And, welcome to another tutorial on GeeksforGeeks. In this video we are going to understand the program which converts a binary tree into Doubly Linked List in spiral fashion..First, let us take an example.. As you can see, we have printed the elements of this tree in a Read more…

## Codeforces problem NEKO’s Maze Game (div1A)

In Codeforces problem, Neko’s maze game, there is a grid with height 2 and width N We start in cell (1,1) and want to reach the last, the opposite corner (2, N) and we want to say if it’s possible to get there without visiting forbidden cells. Every time, from Read more…

## 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…