This document discusses two algorithms for solving the Two Sum problem from LeetCode: an O(n^2) nested loop solution and an O(n) hash table solution. It also presents a coding interview question to find the maximum prime factor of a given number N and provides a solution using a while loop to iteratively check for divisibility.

2. LeetCode – Two Sum (Easy)

3. 𝑂(𝑛2
) 𝑠𝑜𝑙𝑢𝑡𝑖𝑜𝑛
class Solution:
def twoSum(self, nums: List[int], target: int) -> List[int]:
for i in range(len(nums)):
for j in range(i+1, len(nums)):
if target == nums[i] + nums[j]:
return [i,j]

4. 𝑂 𝑛 𝑠𝑜𝑙𝑢𝑡𝑖𝑜𝑛
class Solution:
def twoSum(self, nums, target):
"""
:type nums: List[int]
:type target: int
:rtype: List[int]
"""
h = {}
for i, num in enumerate(nums):
n = target - num
if n not in h:
h[num] = i
else:
return [h[n], i]

5. Coding Interview
Q.
Write a code for finding a maximum prime factor
of given natural number N.

6. Coding Interview - solution
def find_prime_factor(N):
div=2
while N>1:
if N%div == 0:
N = N/div
else:
div += 1
return div

7. Thank You