Hello friends my name is Tushar and today I’m going to talk about N-queen problem. So you’re given an NxN board and there are N queens You have to find any placement of these queens on the board so that they do not attack each other. For example we have 4×4 board and this is […]
Hello friends! And, welcome to another tutorial on GeeksforGeeks. In this video we are going to understand the program which merges two binary trees by doing node sum. First, let us take an example. The merge rule is that if two nodes overlap, then sum node values up as the new value of the merged […]
Hello friends! And, welcome to another tutorial on GeeksforGeeks. In this video we are going to understand the program which helps us in ifnding the Largest value in each level of Binary Tree. First, let us take an example. The idea is to perform iterative level order traversal of the binary tree using queue. While […]
Hi and welcome to GeeksforGeeks, in this tutorial we will learn how to check whether a number is odd or even that is represented by a binary array. Let’s look at this example, suppose we have this array and we checking from 1st to 3rd. That is, we get 101, which is 5. So, the […]
In this problem we’re going to look at the naive multiplication algorithm from lecture. Let’s say we’re computing naive( 63, 12). At some point in the executionâ€”so we’ll pause hereâ€” we’ll have x=20 and y=12. The question is, what is z?
UTF-8 is perhaps the best hack, the best single thing that’s used that can be written down on the back of a napkin, and that’s how was it was put together. The first draft of UTF-8 was written on the back of a napkin in a diner and it’s just such an elegant hack that […]
Hello! My name is Elia and I am a student at Code Chrysalis. This week we started our final team projects. My team is working on an app that uses image recognition technology to search for similar products on Amazon. The other team is working on a language learning app that uses speech-to-text and translation APIs. […]