Emily Rosemary Collins

💡 Problem Formulation: You are tasked with finding the most frequently occurring number after incrementing each element in an array by one, multiple times, determined by a given value K. For example, if your input array is [1,2,3] and K is 2, you would increment each element in the array 2 times, resulting in [3,4,5], … Read more

💡 Problem Formulation: You are given an array of integers and a number k. The challenge is to maximize the sum of numbers by removing exactly k elements from either end of the array. For instance, given the array [1, 2, 3, 4, 5] and k = 2, the maximum sum we can get by … Read more

💡 Problem Formulation: The challenge is to create a Python program that generates a matrix of integers, where each cell contains the Manhattan distance to the nearest zero in the matrix. To clarify, the Manhattan distance between two points (x1, y1) and (x2, y2) is abs(x1 – x2) + abs(y1 – y2). For instance, given … Read more

💡 Problem Formulation: The task is to identify the longest sublist within a given list of integers where the sublist first strictly increases and then strictly decreases. For example, given the input [5, 2, 8, 6, 3, 6, 9, 5], the desired output would be 5, representing the length of the sublist [2, 8, 6, … Read more

💡 Problem Formulation: The challenge is to determine the longest continuous sequence of ‘1’ bits in a binary string after flipping up to ‘k’ bits valued ‘0’ to ‘1’. For instance, given the binary string ‘110100110’ and the ability to flip ‘k = 2’ bits, the optimal flip would result in ‘110111110’, yielding a longest … Read more

💡 Problem Formulation: Finding the length of the longest sign alternating subsequence within a list of numbers entails identifying a sequence where each number alternates in sign (positive to negative or vice versa) compared to the number directly before it. For instance, given the list [1, -2, 3, -4, 5, -6], the longest sign alternating … Read more

💡 Problem Formulation: Finding the smallest sum of a pair of numbers that is greater than a specified target number is a common problem in algorithm design and programming. For instance, given a list [5, 20, 16, 11, 10] and a target sum 21, the lowest sum of pairs that exceeds the target is 22 … Read more

💡 Problem Formulation: In an election, each vote is represented by a candidate ID, and the task is to determine the candidate who has received the majority of the votes—more than half of the total casted votes. Given an array of voter IDs as input, the goal is to output the ID of the majority … Read more

💡 Problem Formulation: This article provides a comprehensive guide on how to compute the number of ways to make a certain amount of money with coins of fixed denominations in Python. For example, given the coins [1, 2, 5] and the target amount 5, the program should output 4, as there are four combinations to … Read more

💡 Problem Formulation: The task is to identify the longest substring within a given string where each character appears at least k times. For example, given the input string “aabbcc” and k = 2, the longest valid substring would be “aabbcc” itself since all characters meet the frequency criteria. However, for k = 3, the … Read more

💡 Problem Formulation: Imagine you have a linked list with numeric values, and you need to rearrange the nodes so that all nodes less than a certain value k come before nodes equal to or greater than k. For example, given a linked list 1 -> 4 -> 3 -> 2 -> 5 -> 2 … Read more

💡 Problem Formulation: Given a list of integers and a non-negative integer k, the task is to find the length of the longest contiguous sublist where the difference between the maximum and minimum elements is less than or equal to k. For instance, given the list [1, 3, 5, 2, 8] and k = 3, … Read more