interview

Master the 0-1 Knapsack problem with clean DP semantics and understand why backwards iteration is required in space-optimized solutions. Learn the snapshot mental model that transfers to other DP problems.

Master LeetCode problem 96 using dynamic programming to count unique BST structures. Learn the elegant divide-and-conquer approach, understand Catalan numbers, and see how fixing the root node reveals recursive substructure in this classic combinatorial problem.

Master LeetCode 968: Binary Tree Cameras with a clear bottom-up strategy. Learn the state-based approach, interview-ready code, and step-by-step walkthroughs that ensure you understand both intuition and implementation.

Learn the sliding window technique through the classic Minimum Size Subarray Sum problem. Understand how two pointers can optimize O(n²) brute force to O(n) efficiency.

Decode the elegant layer-by-layer approach to generating spiral matrices. Learn how to think in concentric rings and avoid complex edge cases with clean, scalable code.

Explore the evolution of sum problems from 2Sum to generalized KSum through real-world analogies, code evolution, and optimization techniques.

Difference between GraphQL and REST (Representational State Transfer)

This is a React interview for a junior developer position (Question Part).

Study Notes about Event Loop (Meessage Loop) in Web development