KeshariPiyush24

SMALLEST INFORMATION UNIT:
1 NIBBLE = 4 BITS
1 BYTE = 8 BITS
1 KILOBYTE (KB) = 8 KILOBITS = 1,024 BYTES = 2¹⁰ BYTES
1 MEGABYTE (MB) = 8 MEGABITS = 1,048,576 BYTES = 2²⁰ BYTES
1 GIGABYTE (GB) = 8 GIGABITS = 1,073,741,824 BYTES = 2³⁰ BYTES
1 TERABYTE (TB) = 8 TERABITS = 1,099,511,627,776 BYTES = 2⁴⁰ BYTES
1 PETABYTE (PB) = 8 PETABITS = 1,125,899,906,842,624 BYTES = 2⁵⁰ BYTES

Programming Languages Levels:

KeshariPiyush24

Sorting a Stack using Recursion

Intuition

The core idea behind sorting a stack using recursion is to:

1. Remove elements from the stack one by one.
2. Recursively sort the remaining stack.
3. Insert the removed element at the correct position in the sorted stack.

KeshariPiyush24

Reversing a Stack using Recursion

Intuition

The core idea behind reversing a stack using recursion is to:

1. Remove elements from the stack one by one.
2. Recursively reverse the remaining stack.
3. Insert the removed element at the bottom of the reversed stack.

KeshariPiyush24

Prime Number Testing: Methods, Complexity, and Implementations

1. Basic Concept

A prime number is a natural number greater than 1 that is only divisible by 1 and itself.

2. Efficient Prime Testing Methods

2.1 6k ± 1 Method

KeshariPiyush24

Question: 349. Intersection of Two Arrays

Intution:

Time Complexity: $$O(Nlog(M))$$

Space Complexity: $$O(1)$$

Solution:

KeshariPiyush24

Question: Row with max 1s

Intution: Not exactly binary search but we can utilize the fact that it the row is sorted. We have to use 2 pointers approach.

Time Complexity: $$O(n + m)$$

Space Complexity: $$O(1)$$

Solution:

KeshariPiyush24

Question: Frequency In A Sorted Array

Intution:

Time Complexity: $$O(log(n))$$

Space Complexity: $$O(1)$$

Solution:

KeshariPiyush24

Question: Implement Lower Bound

Intution:

Time Complexity: $$O(log(n))$$

Space Complexity: $$O(1)$$

Solution:

KeshariPiyush24

Question: Implement Upper Bound

Intution:

Time Complexity: $$O(log(n))$$

Space Complexity: $$O(1)$$

Solution:

KeshariPiyush24

Question: 153. Find Minimum in Rotated Sorted Array

Intution:

Time Complexity: $$O(log(n))$$

Space Complexity: $$O(1)$$

Solution: