Geeksforgeeks

Error

×

Leaderboard

Showing:

Handle | Score |
---|---|

@Ibrahim Nash | 6560 |

@blackshadows | 6400 |

@mb1973 | 5777 |

@Quandray | 5271 |

@akhayrutdinov | 5111 |

@saiujwal13083 | 5074 |

@kirtidee18 | 4356 |

@sanjay05 | 3762 |

@mantu_singh | 3638 |

@gfgaccount | 3601 |

@marius_valentin_dragoi | 3525 |

Complete Leaderboard | |

Handle | Score |

@anish5256 | 991 |

@vimleshpratapsingh321 | 980 |

@skj7 | 871 |

@akhileshkumar562002 | 862 |

@pradeeppatidar1999 | 840 |

@kanewilliamson123 | 837 |

@pd420786 | 813 |

@infilooop | 800 |

@bunnybug320 | 796 |

@smitabose7826 | 784 |

@virgat | 768 |

Complete Leaderboard |

Given an array **A[ ]** denoting the time taken to complete **N **tasks, determine the minimum amount of time required to finish the tasks considering that you can skip any task, but **skipping two consecutive tasks is forbidden**.

**Example 1:**

**Input:**
N = 2
A[] ={10,20}
**Output:** 10
**Explanation**: we can take time of
10 units and skip 20 units time.

â€‹**Example 2:**

**Input**:
N = 4
A[] = {10,5,7,10}
**Output:** 12
**Explanation**: we can skip both the
tens and pick 5 and 7 only.

**Your Task:**

You don't need to read input or print anything. Your task is to complete the function **minAmount() **which accepts array **A[] **and its size **N** as input parameter and returns minimum amount of time required to finish the tasks.

**Expected Time Complexity: **O(N)

**Expected Auxiliary Space: **O(1)

**Constraints:**

1 <= N <= 10^{6}

Login to report an issue on this page.

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

YesLoading...

Skip the work

...