Article Categories
- All Categories
-
Data Structure
-
Networking
-
RDBMS
-
Operating System
-
Java
-
MS Excel
-
iOS
-
HTML
-
CSS
-
Android
-
Python
-
C Programming
-
C++
-
C#
-
MongoDB
-
MySQL
-
Javascript
-
PHP
-
Economics & Finance
Programming Articles
Page 572 of 2547
Set Matrix Zeroes in Python
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 MoreSimplify Path in Python
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 MoreSpiral Matrix II in Python
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 MoreMerge Intervals in Python
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 MoreJump Game in Python
The Jump Game is a classic dynamic programming problem where we need to determine if we can reach the last index of an array. Each element represents the maximum jump length from that position. Given an array like [2, 3, 1, 1, 4], we start at index 0 and can jump at most 2 positions. From index 1, we can jump at most 3 positions, and so on. The goal is to reach the last index. Algorithm Steps The greedy approach works backwards from the last index ? n := length of array A − ...
Read MoreCombination Sum in Python
The combination sum problem involves finding all unique combinations in a given array where the numbers sum to a target value. Numbers can be reused unlimited times. For example, with candidates [2, 3, 6, 7] and target 7, the solutions are [[7], [2, 2, 3]]. Recursive Approach We'll use a recursive backtracking approach that explores all possible combinations ? class Solution: def combinationSum(self, candidates, target): result = [] self.solve(candidates, target, 0, [], result) ...
Read MoreNext Permutation in Python
The next permutation method rearranges numbers into the lexicographically next greater permutation. If no greater permutation exists, it returns the smallest possible permutation (sorted in ascending order). The solution must be in-place without using extra memory. Examples 1, 2, 3 → 1, 3, 2 3, 2, 1 → 1, 2, 3 1, 1, 5 → 1, 5, 1 Algorithm Steps The algorithm follows these key steps − Step 1: Find the largest index i where nums[i] < nums[i+1] Step 2: If no such index exists, reverse the entire array Step ...
Read MoreParsing XML with DOM APIs in Python
The Document Object Model (DOM) is a cross-language API from the World Wide Web Consortium (W3C) for accessing and modifying XML documents. Unlike SAX parsers that process XML sequentially, DOM loads the entire document into memory as a tree structure, allowing random access to any element. The DOM is extremely useful for random-access applications. SAX only allows you a view of one bit of the document at a time, while DOM provides complete access to the entire document structure simultaneously. Basic DOM Parsing Here is the easiest way to quickly load an XML document and create a ...
Read MoreMultithreaded Priority Queue in Python
The Queue module in Python allows you to create thread-safe queue objects for multithreaded applications. A priority queue processes items based on their priority rather than insertion order, making it ideal for task scheduling and resource management. Queue Methods The Queue module provides several methods to control queue operations ? get() − Removes and returns an item from the queue put() − Adds an item to the queue qsize() − Returns the number of items currently in the queue empty() − Returns True if queue is empty; otherwise, False full() − Returns True if queue is ...
Read MoreSending an HTML e-mail using Python
When you send a text message using Python, all the content is treated as simple text. Even if you include HTML tags in a text message, it is displayed as simple text and HTML tags will not be formatted according to HTML syntax. However, Python provides the option to send an HTML message as actual HTML content. While sending an email message, you can specify a MIME version, content type and character set to send an HTML email that renders properly in email clients. Basic HTML Email Structure To send HTML email, you need to set the ...
Read More