Emily Rosemary Collins

💡 Problem Formulation: Given a sequence of numbers, how do we maximize the result by optimally inserting arithmetic operators (addition, subtraction, multiplication, division) between them? For example, given the input sequence [2, 1, 2], the maximum value is achieved by calculating 2 + 1 * 2 = 4. Method 1: Brute Force with Permutations This … Read more

💡 Problem Formulation: Currency arbitrage involves taking advantage of the price differences in various money markets by buying a currency cheap in one market and selling it for a higher price in another. A program to detect currency arbitrage opportunities seeks to identify these price discrepancies in real-time. For instance, if $1 converts to €0.9, … Read more

💡 Problem Formulation: Finding the k largest sum pairs in a given array involves pairing elements from the array to create possible sums and then identifying the pairs that result in the highest sums. Specifically, in Python, if we’re given an array like [1, 4, 3, 2] and a number k=2, we want to find … Read more

💡 Problem Formulation: If you’ve been challenged with finding the shortest number of additional characters required to transform any given string into a palindrome, you’re in the right place. Consider the input string “abc”. The desired output would be 2, since adding “bc” in reverse order would result in “abcba”, a valid palindrome. Method 1: … Read more

💡 Problem Formulation: Given a string, the challenge is to find the length of the longest substring that contains exactly k distinct characters. For instance, if the input is “abcba” and k is 2, the longest substrings with 2 distinct characters are “abc” and “bcb“, both with a length of 3. Hence, the desired output … Read more

💡 Problem Formulation: In various scenarios within data processing and algorithm design, it becomes necessary to identify sublists within a list of integers where the sum of the elements is zero. The specific challenge addressed in this article is to find the length of the longest such sublist. Given an input list such as [1, … Read more

💡 Problem Formulation: Finding the longest path in a Directed Acyclic Graph (DAG) without repeating nodes is a classical problem in computer science. This task involves identifying a path following the graph’s edges in one direction (since it’s directed) and maximizing the path’s length without traversing the same node more than once. For example, given … Read more

💡 Problem Formulation: We are looking to find the longest arithmetic subsequence within a given list of numbers in Python. For instance, given the list [3, 6, 9, 12], the longest arithmetic subsequence is the sequence itself with a common difference of 3, hence the output should be 4. Method 1: Dynamic Programming Dynamic Programming … Read more

💡 Problem Formulation: Finding the largest sum of three non-overlapping sublists with the same sum in an array can be a challenging task. This problem entails writing a program that takes an array as input and outputs the maximum sum that can be obtained from three non-overlapping sublists, where each sublist has the same total … Read more

💡 Problem Formulation: Given a matrix of integers, the goal is to find the length of the longest increasing path, where increasing path refers to a series of values that increase with each step in any of the four cardinal directions (up, down, left, right). For instance, in matrix [ [9, 9, 4], [6, 6, … Read more

💡 Problem Formulation: The task is to devise a program that calculates the length of the longest common subsequence (LCS) shared by three given strings. For instance, given strings “abcdefgh”, “abefgk”, and “bcegkl”, a longest common subsequence is “beg”, with a length of 3. This article explores five different methods to solve this problem in … Read more

💡 Problem Formulation: Given a sequence of numbers, we aim to find the length of the longest alternating subsequence, where each element in the subsequence differs in sign (+/-) from its preceding element. For example, from the list [1, -2, 6, 4, -3], the longest alternating subsequence would be [1, -2, 4, -3], with the … Read more