Emily Rosemary Collins

💡 Problem Formulation: The challenge is to find the maximum sum of a contiguous subset within a list of numbers. This is commonly known as the Maximum Subarray Problem or Kadane’s algorithm. For example, given the input list [-2, -3, 4, -1, -2, 1, 5, -3], the contiguous sublist with the maximum sum is [4, … Read more

💡 Problem Formulation: In binary tree data structures, it is sometimes crucial to ascertain whether all leaf nodes reside at the same depth. This condition is important for certain applications such as balanced trees which affect algorithmic performance. We aim to check if all leaves of a binary tree end at the same level. The … Read more

💡 Problem Formulation: Given a string, our goal is to find the length of the longest subsequence that is an anagram of another subsequence within the same string. For instance, if our input is “abba”, the longest anagram subsequence is “ab” (or “ba”), and therefore the desired output is 2. Method 1: Counting and Comparison … Read more

💡 Problem Formulation: Traversing a binary tree in a level-wise alternating fashion means visiting nodes level by level, starting from the root, but with the direction of traversal switching between levels. Assume we have an input binary tree, the desired output would be a list containing nodes’ values alternating between left-to-right and right-to-left order for … Read more

💡 Problem Formulation: Converting a linked list to a binary search tree (BST) in Python is a common algorithmic problem that involves reorganizing data from a linear data structure to a hierarchical one. The input is typically a singly linked list with nodes sorted in ascending order. The desired output is a balanced BST, where … Read more

💡 Problem Formulation: In Python, developers often need to identify the length of the longest sublist where all elements are distinct. For instance, given the input [5, 1, 3, 5, 2, 3, 4, 1], the longest distinct sublist could be [5, 2, 3, 4] or [1, 3, 5, 2], and the desired output would be … Read more

💡 Problem Formulation: Given an unsorted array of integers, the goal is to find the length of the longest consecutive elements sequence. For example, if the input array is [100, 4, 200, 1, 3, 2], the longest consecutive elements sequence is [1, 2, 3, 4], and the desired output is 4. Method 1: Using Sorting … Read more

💡 Problem Formulation: We need to find the maximum possible sum of a circular sublist within a given list of integers. In a “circular sublist”, we consider the list to wrap around; meaning, elements at the end of the list can be combined with those at the start. For example, in the list [2, -3, … Read more

💡 Problem Formulation: Imagine we have a list of numbers in Python, and we can increment any sublist of that list up to k times. The challenge is to find the longest sublist where all elements are equal after at most k increments. For instance, with the input list [1, 2, 3, 4] and k=3, … Read more

💡 Problem Formulation: The challenge involves calculating the possible number of strings that can be constructed adhering to certain specified grammar rules. These rules dictate the sequence and type of characters that could form a valid string. Given a grammar consisting of variables, terminals, and production rules, the task is to implement a program in … Read more

💡 Problem Formulation: Imagine you are given an array representing a series of hills, where each element corresponds to the height of a hill. Your task is to find the minimum number of height increments on individual hills necessary to ensure that each subsequent hill is equal to or taller than the previous one, thus … Read more

💡 Problem Formulation: You are given a list of stacks where each stack contains integer elements. The challenge is to maximize the sum by popping exactly k elements from any stacks. For example, given stacks [[2, 3, 1], [5, 4], [9, 7]] and k = 3, the maximum sum is achieved by popping 9 + … Read more