Category: competitive programming
Matrix Summation Hackerrank Solution
The below algorithm is used to transform the matrix and we will use it for Matrix Summation. We need to find the original matrix, given…
A company is repainting its office – HackerRank Solution
Problem You can find the problem statement here. Explanation Subarrays with a sum less than or equal to 7 are Length 1 – [2], [3],…
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…
Minimum number of transformation steps required to make all elements of an array equal
Problem definition Given an array of N elements, our task is to find the minimum number of transformations that we can perform to make all…
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…
Vending Machine with Python Code
This blog will discuss how we can build a Vending Machine with Python Code (console app). The Vending Machine with Python code is a small…
Top 20 Array Coding Questions for Online Assessment
Hey everyone! Today we’re going to discuss the top 20 array coding questions which are most frequently asked in online assessments (and interviews) by top…