Advanced Competitive Programming Concepts
These are the articles, dedicated specifically to advanced competitive programming concepts. Modular Multiplicative Inverse, Nth Catalan Number.
Message Queuing System | Producer-Consumer Problem
A message queuing system serves as an intermediary layer between producers and consumers allowing them to work independently and asynchronously.
Subset Sum Problem | Meet in the Middle
Meet in the Middle is used to optimize brute-force solutions for problems where the input size is too large for direct approaches.
Partition Equal Subset Sum – LeetCode Solution [Medium]
Given an integer array determine if you can partition the array into two subsets such that the sum of the elements in both subsets is equal.
Two Sum Problem | Two-Pointer Technique
This method involves sorting the array and then using two pointers to identify a pair of numbers whose sum equals the target.
What is Two’s Complement Method?
Two’s complement method simplifies arithmetic operations and hardware design in digital systems by allowing subtraction to be handled as addition.
Visualizing Efficient Sorting Algorithms
These algorithms are more suitable for large datasets compared to basic sorting methods because of their better time complexity.
Visualizing Popular Sorting Algorithms
Computer science students are generally introduced to algorithms through sorting algorithms, as they provide a foundational understanding of algorithmic behavior and efficiency.
Z-Buffer Algorithm
The algorithm efficiently determines visible surfaces by maintaining depth values and updating only when a closer object appears.
The Monty Hall Problem: A Mathematical Paradox
The problem is deceptively simple yet counterintuitive, making it a classic example of how human intuition can sometimes conflict with mathematical reasoning.
Counting Inversions using Fenwick Tree
Fenwick Trees can efficiently track and count inversions in real-time and even for a continuous stream of data.