Interview questions the community wrote.

Count Subarrays With Sum K

Prefix Sum and Hash Map

Two Movies for the Flight

Hash Set

Linked List Cycle

Fast and Slow Pointers

3Sum

Sorting + Two Pointers

First Bad Version

Invert Binary Tree

Recursion

Majority Element

Boyer-Moore Voting

Container With Most Water

Two Pointers

Subarray Sum Equals K

Prefix Sum + Hash Map

Count Pairs Matching Sum and Difference Conditions

Hash Map

Minimum Coins with Limited Inventory

Bounded Knapsack

Maximize Maximum Subarray Sum with K Swaps

Greedy / Kadane's Algorithm