oanaunciuleanu
Knapsack Problem in JAVA
You must introduce values into a knapsack. With n items given with weights and values, return the maximum sum of values of the subset...
top of page
Caută
oanaunciuleanu
How to print maximum number of A’s using given four keys in JAVA
Imagine you have a special keyboard with the following keys: Key 1: Prints 'A' on screen Key 2: (Ctrl-A): Select screen Key 3: (Ctrl-C):...
oanaunciuleanu
Find the minimum cost to reach the destination using a train in JAVA
There are n stops on a journey. The train starts from station 0 and ends the journey at station n-1. All the ticket costs are given in an...
oanaunciuleanu
Find the minimum number of coins that make a given value in JAVA
Given a certain amount of money that we have, we want to change the money into coins. What is the minimum number of coins required to...
oanaunciuleanu
Find the length of the longest consecutive path from a given starting character in JAVA
Given a matrix of characters, find the length of the longest path starting from a character, in such a way that the characters are...
oanaunciuleanu
Count the ways to reach the n’th stair in JAVA
You receive as an input a number representing sections. Each section is composed of two plots, on either side of the road. You must find...
oanaunciuleanu
Count the possible ways to construct buildings in JAVA
You receive as an input a number representing sections. Each section is composed of two plots, on either side of the road. You must find...
oanaunciuleanu
Count of n digit numbers whose sum of digits equals to a given sum in JAVA
Starting from two received variables: digits and sum, find how many numbers having that amount of digits have the required sum of their...
oanaunciuleanu
Count the number of ways to reach a given score in a game in JAVA
For a game that has the possibility for the players to score 3, 5 or 10 points, find in how many ways we can reach a certain total score....
oanaunciuleanu
Count the number of binary strings without consecutive 1’s
Starting from a given length, find all the possible distinct binary strings of that length, in such a way that there are no consecutive...
oanaunciuleanu
Compute the sum of digits in all numbers from 1 to n in JAVA
You are given a limit and have to find the sum of all numbers from one to that limit. Solution: 1. static int sumOfDigitsFrom1ToN(int...
oanaunciuleanu
Collect maximum points in a grid using two traversals in JAVA
Using a grid of cells that holds values, try to find the maximum number of points that can be summed by using two traversals. The first...
oanaunciuleanu
Coin Change in JAVA
You are given an integer array of coin values and an integer representing the total amount of money. Return the number of possible ways...
oanaunciuleanu
Boolean Parenthesization Problem in JAVA
Given a Boolean expression with the following symbols: 'T' ---> true 'F' ---> false And the following operators filled between symbols: & ...
oanaunciuleanu
Binomial Coefficient in JAVA
Write a function that accepts two parameters n and k, and returns the value of the Binomial Coefficient C(n, k). Solution: 1. static...
oanaunciuleanu
Minimum Cost Path in Matrix
In a matrix you have to find the minimum cost path to reach the last cell from the first one, meaning that starting from the top left...
oanaunciuleanu
Minimum Cost Polygon Triangulation in C++
Having a given polygon, divide it using triangulation between all points, having the minimum cost. This means that we have to divide the...
oanaunciuleanu
Maximum Length Chain of Pairs in C++
The maximum length chain of pairs is a variation of the longest increasing subsequence problem. We have to find the pairs of numbers that...
oanaunciuleanu
Longest Increasing Sub-sequence in C++
Using this algorithm we can find the longest increasing subsequence from a given array. This means that we will find the numbers that are...
oanaunciuleanu
Longest common subsequence algorithm in C++
Having two strings, you have to find the longest common subsequence. This means that you have to find how many letters are found in both...
bottom of page