Articles on Trending Technologies

Technical articles with clear explanations and examples

Analyzing Census Data in Python

Yaswanth Varma
Yaswanth Varma
Updated on 25-Mar-2026 881 Views

Census data is information collected by the government to understand population characteristics including age, gender, education, and housing. This data helps governments understand current scenarios and plan for the future. In this article, we will learn how to analyze census data in Python using libraries like pandas, numpy, and matplotlib. Sample Census Dataset We'll use sample census data with the following structure: age ...

Read More

Maximum Product Subarray in Python

Arnab Chakraborty
Arnab Chakraborty
Updated on 25-Mar-2026 1K+ Views

The Maximum Product Subarray problem asks us to find a contiguous subarray within an integer array that has the largest product. For example, in the array [2, 3, -2, 4], the subarray [2, 3] gives the maximum product of 6. This problem is tricky because negative numbers can turn a small product into a large one when multiplied by another negative number. We need to track both maximum and minimum products at each position. Algorithm We use dynamic programming to solve this problem ? Create two arrays: max_products and min_products to track maximum and minimum ...

Read More

Construct Binary Tree from Inorder and Postorder Traversal in Python

Arnab Chakraborty
Arnab Chakraborty
Updated on 25-Mar-2026 318 Views

Building a binary tree from its inorder and postorder traversal sequences is a classic tree construction problem. The key insight is that the postorder traversal gives us the root node (last element), while the inorder traversal helps us identify left and right subtrees. 3 9 20 15 7 ...

Read More

Construct Binary Tree from Preorder and Inorder Traversal in Python

Arnab Chakraborty
Arnab Chakraborty
Updated on 25-Mar-2026 1K+ Views

Constructing a binary tree from preorder and inorder traversal sequences is a classic problem in tree algorithms. The key insight is that the preorder traversal gives us the root nodes in order, while the inorder traversal helps us determine the left and right subtrees. 3 9 20 15 7 ...

Read More

Word Search in Python

SaiKrishna Tavva
SaiKrishna Tavva
Updated on 25-Mar-2026 7K+ Views

In Python, word search refers to finding if a given word exists in a 2D grid. The word can be formed by sequentially connecting adjacent cells horizontally or vertically. This problem is commonly solved using backtracking and Depth-First Search (DFS) algorithms. Algorithm Overview The word search algorithm follows these key steps: Iterate through each cell in the 2D grid For each cell matching the first character, start a DFS search Use backtracking to explore all four directions (up, down, left, right) ...

Read More

Subsets in Python

Arnab Chakraborty
Arnab Chakraborty
Updated on 25-Mar-2026 1K+ Views

Generating all possible subsets of a given set is a fundamental problem in computer science, also known as finding the power set. For a set like [1, 2, 3], the power set contains all combinations: [[], [1], [2], [3], [1, 2], [1, 3], [2, 3], [1, 2, 3]]. We can solve this using a recursive backtracking approach where each element can either be included or excluded from a subset. Recursive Backtracking Approach The algorithm works by making binary choices for each element − include it (1) or exclude it (0) from the current subset. Algorithm Steps ...

Read More

Set Matrix Zeroes in Python

Arnab Chakraborty
Arnab Chakraborty
Updated on 25-Mar-2026 2K+ Views

The Set Matrix Zeroes problem requires us to modify a matrix in-place such that if any element is 0, its entire row and column become 0. This is a classic matrix manipulation problem that can be solved efficiently using constant extra space. Problem Understanding Given a matrix, if an element is 0, we need to set the entire row and column containing that element to 0. For example ? 1 0 1 1 1 1 1 1 1 The output becomes ? ...

Read More

Simplify Path in Python

Arnab Chakraborty
Arnab Chakraborty
Updated on 25-Mar-2026 1K+ Views

In Unix-style file systems, we often need to simplify absolute file paths to their canonical form. A canonical path is the shortest string representing the absolute path, following specific rules for directory navigation. Canonical Path Rules Path must always begin with a slash / There must be only a single slash / between two directory names Last directory name (if it exists) must not end with a trailing / Single period . refers to the current directory Double period .. moves up one level to the parent directory For example, "/home/", "/../" and "/home//user/" should ...

Read More

Spiral Matrix II in Python

Arnab Chakraborty
Arnab Chakraborty
Updated on 25-Mar-2026 2K+ Views

The Spiral Matrix II problem involves generating a square matrix filled with numbers from 1 to n² in spiral order. Starting from the top-left corner, we fill the matrix by moving right, down, left, and up in a spiral pattern until all positions are filled. Algorithm The spiral filling process follows these steps: Initialize boundary variables: row1, col1 (top-left) and row2, col2 (bottom-right) Create an n×n matrix filled with zeros Fill the matrix in four directions: right → down → left → up After completing each spiral layer, adjust the boundaries inward Continue until all n² ...

Read More

Merge Intervals in Python

Arnab Chakraborty
Arnab Chakraborty
Updated on 25-Mar-2026 1K+ Views

Merging intervals is a common problem where we combine overlapping intervals in a collection. For example, if we have intervals [[1, 3], [2, 6], [8, 10], [15, 18]], the result after merging overlapping intervals would be [[1, 6], [8, 10], [15, 18]] because [1, 3] and [2, 6] overlap and merge into [1, 6]. Algorithm Steps The approach uses sorting and a stack-based method ? If the interval list is empty, return an empty list Sort intervals by their start time Initialize a stack ...

Read More
Showing 1–10 of 61,304 articles
« Prev 1 2 3 4 5 6131 Next »
Advertisements