Posts by Manan Kumar
Author Biographical Info: Hey! I am Manan Kumar.
Pursuing a Bachelor's in Computer Science from Monash University, Melbourne.
Aspiring Data scientist.
Always looking to expand my horizons and learn new things!
Using Stacks to solve Desert Crossing Problem in Python
In this tutorial, we are going to take a look at a Desert Crossing problem, how we can use stacks in order to solve that problem and simultaneously learn about stacks in Python. .... Read More
Use Backtracking to find all Palindromic Bitlists of a given length in Python
In this tutorial, we are going to take up the task of finding all the palindromic bitlists of a given length ‘n’ using the backtracking approach in Python. For this purpose, we.... Read More
Magic Square Identification in Python
In this tutorial, we are going to learn how to identify whether a given matrix is a magic square or not in Python. First, let’s take a look at what we mean by a magic square in t.... Read More
Construct a String from another String using Suffix Trie in Python
In this tutorial, we are going to take a look at the task of making a string from substrings of another string using a data structure known as Suffix Trie in Python. Specifically, .... Read More
Find all Bridges of a Graph in Python
This tutorial will show you how to find all bridges of a graph in Python. Before we go forward, let me tell you about bridges of the graph in brief. Bridges of a graph are the edge.... Read More
Determine Whether A Given Undirected Graph is Two-Colorable in Python
What does Two-Colorable mean for a graph? A two-colorable graph is a graph in which each vertex can be assigned a color (out of any two given colors, here we will assume these colo.... Read More
Robot in a Hallway Problem using Dynamic Programming in Python
What is Dynamic programming? Dynamic programming is a powerful optimization technique in computer science. The dynamic approach is applicable to a lot of real-world problems. The b.... Read More
Implementing Quick Select in Python
If I ask you to think about an algorithm to find the kth smallest element in a list of integers, your answer would probably be this: sort the list first and then extract the elemen.... Read More