Sunidhi Bansal

Sunidhi Bansal

809 Articles Published

Articles by Sunidhi Bansal

809 articles

Why does Python sometimes take so long to start on Windows?

Sunidhi Bansal
Sunidhi Bansal
Updated on 26-Mar-2026 2K+ Views

Python startup time on Windows can be noticeably slower compared to other operating systems. This is due to several Windows-specific factors and Python's architecture that can impact initial loading performance. Windows-Specific Startup Issues Several factors contribute to slow Python startup on Windows ? Windows Defender scanning: Real-time antivirus scanning can slow down Python executable loading and module imports DLL loading overhead: Windows has higher overhead for loading dynamic libraries compared to Unix systems File system performance: NTFS can be slower than Linux filesystems for many small file operations Registry lookups: Python performs Windows registry queries during ...

Read More

Python Challenges to Develop Your Skills

Sunidhi Bansal
Sunidhi Bansal
Updated on 26-Mar-2026 399 Views

Python is ranked among the most popular programming languages due to its simplicity and versatility. Whether you're a beginner learning the basics or an intermediate programmer looking to advance your skills, coding challenges provide an excellent way to strengthen your programming logic and build practical experience. Python Challenges for Beginners 1. Basic Calculator Create a simple calculator that performs basic arithmetic operations. This project helps you practice operators, conditional statements, and functions. def calculator(): print("Select operation:") print("1. Add") print("2. Subtract") ...

Read More

Maximum factors formed by two numbers in Python

Sunidhi Bansal
Sunidhi Bansal
Updated on 25-Mar-2026 2K+ Views

We are given an array of integers and need to find the maximum number of factors formed by multiplying any two distinct numbers from the array. This involves calculating all possible products of pairs and then counting factors for each product. Problem Understanding Example 1 For array [3, 2, 10] ? Input: [3, 2, 10] Products: 3×2=6, 3×10=30, 2×10=20 Factors: 6→{1, 2, 3, 6} (4 factors), 30→{1, 2, 3, 5, 6, 10, 15, 30} (8 factors), 20→{1, 2, 4, 5, 10, 20} (6 factors) Output: Maximum factors = 8 Example 2 For ...

Read More

Array Partition I in Python

Sunidhi Bansal
Sunidhi Bansal
Updated on 25-Mar-2026 2K+ Views

Given an array of 2n integers, we need to group them into n pairs such that the sum of minimum values from each pair is maximized. This is known as the Array Partition I problem. Problem Understanding For an array like [1, 2, 3, 4], we can form pairs in different ways ? (1, 2) and (3, 4) → min(1, 2) + min(3, 4) = 1 + 3 = 4 (1, 4) and (2, 3) → min(1, 4) + min(2, 3) = 1 + 2 = 3 (1, 3) and (2, 4) → min(1, 3) + ...

Read More

Print elements that can be added to form a given sum

Sunidhi Bansal
Sunidhi Bansal
Updated on 16-Mar-2026 276 Views

This program finds and prints elements from a given array that can be added together to form a specified sum. The algorithm uses a greedy approach where it iterates through the array and selects elements that don't exceed the remaining sum value. Algorithm The greedy algorithm works as follows − START STEP 1 → Take number of elements and array values from user STEP 2 → Take the target sum from user STEP 3 → For i = 0 to n-1 STEP 4 → If (current_sum - array[i]) >= 0 then ...

Read More

Content Spoofing

Sunidhi Bansal
Sunidhi Bansal
Updated on 16-Mar-2026 614 Views

Content Spoofing is a type of attack where malicious programmers present a fake website as legitimate to users through text injection or HTML injection. When web applications fail to properly validate user-supplied data, attackers can inject additional parameters that modify the displayed content, leading users to pages that appear authentic but are designed to steal sensitive information. Content spoofing attacks exploit insufficient input validation and output encoding in web applications. The attacker manipulates URL parameters or form data to alter the content displayed to users, creating convincing replicas of legitimate pages to harvest credentials, personal information, or financial data. ...

Read More

C Program to Redeclaration of global variable

Sunidhi Bansal
Sunidhi Bansal
Updated on 15-Mar-2026 863 Views

In C programming, variable redeclaration refers to declaring a variable more than once in the same scope. The behavior of redeclaration varies between global and local variables, and differs between C and C++. Understanding these differences is crucial for avoiding compilation errors. Syntax // Global variable redeclaration int var; int var; // Allowed in C without initialization // Local variable redeclaration int main() { int var; int var; // Not allowed in C } Global Variable Redeclaration Without Initialization C allows ...

Read More

Maximum distinct lines passing through a single point in C

Sunidhi Bansal
Sunidhi Bansal
Updated on 15-Mar-2026 295 Views

In computational geometry, finding the maximum number of distinct lines passing through a single point is a common problem. Given N lines defined by pairs of coordinates (x1, y1) and (x2, y2), we need to find how many lines with different slopes can pass through a single point. Syntax int maxDistinctLines(int n, int x1[], int y1[], int x2[], int y2[]); Approach We represent each line using the slope formula y = mx + c, where m is the slope calculated as − For non-vertical lines: slope = (y2 - y1) / (x2 ...

Read More

Maximum given sized rectangles that can be cut out of a sheet of paper in C

Sunidhi Bansal
Sunidhi Bansal
Updated on 15-Mar-2026 525 Views

We are given the dimensions of a sheet of paper, its Length L and Breadth B. Also, we are given the dimensions of a smaller rectangle, its length l and breadth b. The goal is to find the maximum number of smaller rectangles that can be cut out of the sheet of paper. We will follow these steps − First, try horizontal alignment: divide the sheet length L by rectangle length l, and sheet breadth B by rectangle breadth b, then multiply to get the count. Then try vertical alignment (rotate the rectangle 90°): divide sheet length ...

Read More

Maximum number of candies that can be bought in C

Sunidhi Bansal
Sunidhi Bansal
Updated on 15-Mar-2026 902 Views

We are given an array of candies[] of length stored in 'size'. Each element candies[i] has a number for candies of type i. The goal is to buy as many candies as possible for any amount of money. The conditions are as given − If you purchase X[i] of type i (0

Read More
Showing 1–10 of 809 articles
« Prev 1 2 3 4 5 81 Next »
Advertisements