All Posts

1575 articles

dsa2 min read

Generate all n! permutations using backtracking with used[] array or in-place swap. Handles duplicates by sorting + skipping.

May 12, 2025Read →

dsa2 min read

Generate all 2^n subsets of a set using backtracking (include/exclude) and bit masking. Handles duplicates with sorting + skip.

May 11, 2025Read →

dsa2 min read

Master recursion and backtracking for DSA interviews: 7 core patterns, time complexity analysis, pruning strategies, and top 30 problems.

May 10, 2025Read →

dsa4 min read

Complete reference for math and number theory DSA patterns: algorithm selection guide, complexity table, and top 25 interview problems.

April 29, 2025Read →

dsa4 min read

Apply the inclusion-exclusion principle to count elements satisfying union of conditions. Solves divisibility, coverage, and derangement problems.

April 28, 2025Read →

Page 282 of 315