Hello **Programmers/Coders,** Today we are going to share ** solutions of Programming problems of HackerRank, Algorithm Solutions of Problem Solving Section in Java**. At Each Problem with Successful submission with

**all Test Cases Passed,**you will get an score or marks. And after solving maximum problems, you will be getting stars. This will highlight your profile to the recruiters.

In this post, you will find the solution for **Greedy Florist** **in Java-HackerRank Problem**. We are providing the **correct and tested solutions** of coding problems present on **HackerRank**. If you are not able to solve any problem, then you can take help from our Blog/website.

Use “Ctrl+F” To Find Any Questions Answer. & For Mobile User, You Just Need To Click On Three dots In Your Browser & You Will Get A “Find” Option There. Use These Option to Get Any Random Questions Answer.

**Introduction To Algorithm**

The word **Algorithm** means “a process or set of rules to be followed in calculations or other problem-solving operations”. Therefore Algorithm refers to a set of rules/instructions that step-by-step define how a work is to be executed upon in order to get the expected results.

**Advantages of Algorithms:**

- It is easy to understand.
- Algorithm is a step-wise representation of a solution to a given problem.
- In Algorithm the problem is broken down into smaller pieces or steps hence, it is easier for the programmer to convert it into an actual program.

** Link for the Problem** – Greedy Florist – Hacker Rank Solution

Greedy Florist– Hacker Rank Solution

**Problem:**

A group of friends want to buy a bouquet of flowers. The florist wants to maximize his number of *new* customers and the money he makes. To do this, he decides he’ll multiply the price of each flower by the number of that customer’s previously purchased flowers plus 1. The first flower will be original price,

**Function Description**

Complete the *getMinimumCost* function in the editor below.

getMinimumCost has the following parameter(s):

*int c[n]:*the original price of each flower*int k:*the number of friends

**Returns**

– *int:* the minimum cost to purchase all flowers

**Input Format**

The first line contains two space-separated integers and , the number of flowers and the number of friends.

The second line contains space-separated positive integers , the original price of each flower.

**Constraints**

**Sample Input 0**

3 3 2 5 6

**Sample Output 0**

13

**Explanation 0**

**Sample Input 1**

3 2 2 5 6

**Sample Output 1**

15

**Explanation 1**

Greedy Florist – Hacker Rank Solution

import java.io.*; import java.math.*; import java.security.*; import java.text.*; import java.util.*; import java.util.concurrent.*; import java.util.regex.*; public class Solution { // Complete the getMinimumCost function below. static int getMinimumCost(int k, int[] c) { Arrays.sort(c); int ans=0; int count=1; int noOfFriendsRem=k; for (int i = c.length-1; i >-1; i--) { if (noOfFriendsRem==0) { noOfFriendsRem=k; count++; } ans+=c[i]*count; noOfFriendsRem--; } return ans; } private static final Scanner scanner = new Scanner(System.in); public static void main(String[] args) throws IOException { BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv("OUTPUT_PATH"))); String[] nk = scanner.nextLine().split(" "); int n = Integer.parseInt(nk[0]); int k = Integer.parseInt(nk[1]); int[] c = new int[n]; String[] cItems = scanner.nextLine().split(" "); scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?"); for (int i = 0; i < n; i++) { int cItem = Integer.parseInt(cItems[i]); c[i] = cItem; } int minimumCost = getMinimumCost(k, c); bufferedWriter.write(String.valueOf(minimumCost)); bufferedWriter.newLine(); bufferedWriter.close(); scanner.close(); } }

cialis 40mg brand tadalafil 40mg us over the counter erectile dysfunction pills

order duricef pills buy epivir sale order finasteride for sale

diflucan 200mg for sale fluconazole buy online cipro 1000mg canada

where can i buy metronidazole bactrim usa cephalexin 250mg price

buy cleocin pills for sale buy erythromycin 500mg online cheap fildena 100mg us

nolvadex cheap rhinocort allergy spray ceftin 250mg uk

bimatoprost uk cost careprost cheap trazodone 50mg

buy suhagra 100mg generic buy sildalis pill sildalis for sale online

buy accutane online cheap amoxil order zithromax 500mg over the counter

azithromycin order online order gabapentin 600mg online gabapentin brand

buy generic lasix for sale ventolin inhalator online order generic ventolin

buy altace tablets cost glimepiride 1mg etoricoxib 60mg cost

vardenafil 20mg without prescription vardenafil 10mg canada hydroxychloroquine 200mg brand

mesalamine 400mg without prescription purchase asacol generic oral irbesartan 300mg

olmesartan medication cost depakote 500mg order depakote online

order clobetasol for sale order temovate for sale order cordarone 200mg online

buy temovate cheap buy generic cordarone 100mg buy cordarone pills for sale

buy generic acetazolamide order imdur 40mg for sale order imuran 50mg sale

purchase lanoxin pill order molnupiravir 200 mg online purchase molnupiravir without prescription

What’s up mates, good post and pleasant arguments

commented at this place, I am genuinely enjoying by these.

My website : mp3 juice

naproxen 500mg cost order lansoprazole 30mg pill buy prevacid cheap

brand albuterol 100mcg cost pantoprazole 20mg buy phenazopyridine 200mg online

No matter if some one searches for his required thing, thus he/she desires\r\nto be available that in detail, thus that thing is maintained over here.\r\n\r\nFeel free to surf to my webpage : ytmp3

singulair 5mg ca order montelukast 5mg pills dapsone medication

order olumiant 2mg purchase glucophage generic purchase lipitor without prescription

nifedipine 10mg price buy generic nifedipine 30mg order fexofenadine 180mg generic