Problems

Problem: Given an array of integers, write a function to determine if there exists a pair of integers in the array such that their sum is equal to a given target value. If such a pair exists, return True; otherwise, return False. Function signature: fun has_pair_with_sum(nums: List[int], target: int) -> bool: Explanation: The problem asks … Read more

Problem: Given a list of strings, write a function to find the longest common prefix among them. If there is no common prefix, return an empty string. Function signature: def longest_common_prefix(strs: List[str]) -> str: Explanation: The problem asks us to find the longest common prefix among a given list of strings. We can solve this … Read more

Problem Explanation: You are given an array of coin denominations and a target amount. Write a function to determine the minimum number of coins required to make up the target amount. You may use each coin denomination an unlimited number of times. Example: Explanation: The minimum number of coins required to make up the target … Read more

Problem Explanation: Given two arrays A and B of equal length N, write a function that returns an array C of length N where C[i] represents the number of occurrences of A[i] in array B. Example: Expected Time and Space Complexity: O(N) time complexity and O(N) space complexity, where N is the length of the … Read more

Problem Explanation: You are given an array of integers. Your task is to find the largest possible sum of a subset of the given array, such that no two elements in the subset are adjacent to each other. Example: Input: [2, 5, 3, 1, 7, 9, 10] Output: 22 (Subset: 2, 3, 7, 10) Expected … Read more

Problem Explanation: Given a 2D grid map of ‘1’s (land) and ‘0’s (water), count the number of islands. An island is surrounded by water and is formed by connecting adjacent lands horizontally or vertically. You may assume all four edges of the grid are all surrounded by water. Example: Expected Time Complexity: O(m*n), where m … Read more

Problem Explanation: Given an array of integers, find the length of the longest subarray with a sum of 0. Example: Input: [1, -2, 3, 4, -2, 2, -8, 1, 2, 3] Output: 8 (the subarray is [-2, 3, 4, -2, 2, -8, 1, 2]) Expected Time Complexity: O(n) Expected Space Complexity: O(n) Constraints: Kotlin Solution: