DSA Interview Questions

Question 1

Find the longest subarray with at most K distinct characters.

Accepted Answer

**Core Approach:**

- O(N) time and O(1) space solution usually preferred.
- Discuss brute-force vs optimized approaches.

*Detailed algorithm breakdown coming soon.*

Question 2

Given an array, find the maximum sum of a subarray with exactly K elements where no two elements are adjacent.

Accepted Answer

**Core Approach:**

- O(N) time and O(1) space solution usually preferred.
- Discuss brute-force vs optimized approaches.

*Detailed algorithm breakdown coming soon.*

Question 3

Implement a data structure that supports insert, delete, getRandom, and getMedian in O(1) time.

Accepted Answer

**Core Approach:**

- O(N) time and O(1) space solution usually preferred.
- Discuss brute-force vs optimized approaches.

*Detailed algorithm breakdown coming soon.*

Question 4

Find the smallest window in a string containing all characters of another string.

Accepted Answer

**Core Approach:**

- O(N) time and O(1) space solution usually preferred.
- Discuss brute-force vs optimized approaches.

*Detailed algorithm breakdown coming soon.*

Question 5

Given an array of integers, find all triplets that sum to zero with no duplicates.

Accepted Answer

**Core Approach:**

- O(N) time and O(1) space solution usually preferred.
- Discuss brute-force vs optimized approaches.

*Detailed algorithm breakdown coming soon.*

Question 6

Find the maximum product subarray in an array with both positive and negative numbers.

Accepted Answer

**Core Approach:**

- O(N) time and O(1) space solution usually preferred.
- Discuss brute-force vs optimized approaches.

*Detailed algorithm breakdown coming soon.*

Question 7

Implement a queue using stacks with O(1) amortized operations.

Accepted Answer

**Core Approach:**

- O(N) time and O(1) space solution usually preferred.
- Discuss brute-force vs optimized approaches.

*Detailed algorithm breakdown coming soon.*

Question 8

Find the longest palindromic substring in O(n) time using Manacher's algorithm.

Accepted Answer

**Core Approach:**

- O(N) time and O(1) space solution usually preferred.
- Discuss brute-force vs optimized approaches.

*Detailed algorithm breakdown coming soon.*

Question 9

Given two strings, find the minimum number of operations to convert one to another.

Accepted Answer

**Core Approach:**

- O(N) time and O(1) space solution usually preferred.
- Discuss brute-force vs optimized approaches.

*Detailed algorithm breakdown coming soon.*

Question 10

Find the kth smallest element in a sorted matrix.

Accepted Answer

**Core Approach:**

- O(N) time and O(1) space solution usually preferred.
- Discuss brute-force vs optimized approaches.

*Detailed algorithm breakdown coming soon.*

DSA Questions