Minimum amount of tiles needed to cover points on a line Suppose we have n points evenly spaced on a line, say 1 length unit apart. Every point has a ...

One of the professors of mine asked this question; He wants us to: Show that the greedy choice of taking the largest weight items into the bag firs ...

I have an algorithm that I am not sure whether to classify as a greedy algorithm or a brute force algorithm. I feel like it is most likely greedy, ...

I have a setup like this The first part of the question is to implement a function that generates a complete binary tree (i.e. two arrays) with a giv ...

I got assigned to solve this problem: Given number of products sold in specific stores, is there a way to find from which stores to buy all products w ...

I am needing to implement this greedy algorithm in python, but am having trouble understanding how to find the 'processor' for which M[j] is the least ...

If you see the above graph, no nodes next to each other has the same color. I created a grid graph with diagonal edges across nodes using networkx p ...

I have given the mentioned problem quite a thought but was not able to come up with a working solution on my own. So I found the following solution, b ...

We have an allocation problem: each node is a fuel source, and every edge contains a number of evenly spaced out lamps (think of them as being 1  ...

Suppose I have an array, arr = [2, 3, 5, 9] and k = 2. I am supposed to find subsequences of length k such that no two elements in each subsequence ar ...

I have implemented algorithm for Welsh-Powell graph coloring. Task is that you have txt document with lines of 2 numbers, in which the first one repre ...

Unable to come up with a formal proof of optimality for algorithm A for the given problem. Have convinced myself that it is possible to execute some o ...

The problem statement is as follows: There are N people standing in a row. The ith person is standing in the ith position. In how many ways can we arr ...

use python to implement this algorithm the input should be a nested lsit. e.g.: job = [[0,1],[1,5],[2,3],[2,5],[5,7]] expected result is: [[[0, 1], ...

Here's the question I'm trying to solve, https://codeforces.com/contest/1712/problem/C You are given an array of 𝑛 positive integers 𝑎1,𝑎2,…,𝑎𝑛. ...

according to https://cses.fi/problemset/task/1085 the simplest method to partition the array is to start from left to right and as long as if you can ...

I have this algorithm. How can I do it faster than O(n^2) ? Here is the algorithm : We are given an array of size k in one operation we choose the s ...

I am reading The Introduction of Algorithm by Thomas and Charles, 3rd Edition. when coming to the greedy algo section for Huffman codes - Correctness ...

My code is inspired by the following article which contains the code-sample which determines the maximum number of activities that can be performed us ...

I am solving a question on LeetCode , Here is the Link I got the solution but I wanted to know what wrong I am doing here , There are some testCases ...