Category: data structures and algorithms
Download 1000+ Projects, All B.Tech & Programming Notes, Job, Resume & Interview Guide, and More – Get Your Ultimate Programming Bundle!
Introduction Hello friends and welcome again today, I will give you something that will help you throughout your programming journey, no matter whether you are…
Maximum Subarray Sum: Kadane’s Algorithm
Hello there, if you are looking for Kadane’s Algorithm you must have come across the question: Largest sum contiguous subarray or Maximum Subarray Sum, by…
HackerRank Day 12 Solution in Python: Inheritance
Today we will see the HackerRank Day 12 Solution in Python. The problem is named Inheritance which is part of 30 Days of code on…
HackerRank Day 11 Solution in Python: 2D Arrays
Today we will see the HackerRank Day 11 Solution in Python. The problem is named 2D Arrays which is part of 30 Days of code…
HackerRank Day 10 Solution in Python: Binary Numbers
Today we will see the HackerRank Day 10 Solution in Python. The problem is named Binary Numbers which is part of 30 Days of code…
Maximum Product Subarray in O(N) Time – Leetcode Solution
Hi everyone! In this post, we are going to discuss a very famous DSA problem known as the Maximum Product Subarray. It is a leetcode…
NxNxN Matrix in Python 3
A 3d matrix(NxNxN) can be created in Python using lists or NumPy. Numpy provides us with an easier and more efficient way of creating and…
Boruvka’s Algorithm in Python
Introduction In this blog post, we will learn how to code Boruvka’s Algorithm in Python. Algorithms are at the heart of computer science. They are…
Roti Prata SPOJ Problem Solution – Complete Solution Approach with C++ and Java Code
This post contains Roti Prata SPOJ problem explanation, solution approach, C++ and Java solution of Roti Prata SPOJ Problem
Lee Algorithm in Python | Solution to Maze Routing Problem in Python
Introduction Definition: The Lee algorithm is one feasible solution for maze routing problems based on a breadth-first search. It always gives an optimal solution, if…