Min Cost Climbing Stairs

Easy 20 pts New · no attempts yet csharp

Topics

Company

Min Cost Climbing Stairs — Mphasis interview prep · 1-D Dynamic Programming

Classic interview problem #746.

Input (stdin)

Line 1: cost per step

Output (stdout)

Minimum cost to reach top

Your program must read from stdin and write the answer to stdout (no extra debug text).

Examples

Sample

Input

10 15 20

Output

Static hints

Input format: Line 1: cost per step
DSA Interview 150 — 1-D Dynamic Programming
Problem #746
Frequently asked at Mphasis
1-D Dynamic Programming

Toolliyo Coach

Stuck? Get a nudge — not the answer

Progressive help: Nudge → Guide → Approach. Full solution stays behind the Solution tab.

Your solution

Editor is open — no login wall to practice.

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;

class Program
{
    static int[] Ria(string line = null)
    {
        line ??= Console.ReadLine();
        if (string.IsNullOrWhiteSpace(line)) return Array.Empty<int>();
        return line.Trim().Split(new[] { ' ', ',', '\t' }, StringSplitOptions.RemoveEmptyEntries)
            .Select(int.Parse).ToArray();
    }
    static string[] Rsa()
    {
        int n = int.Parse(Console.ReadLine());
        var arr = new string[n];
        for (int i = 0; i < n; i++) arr[i] = Console.ReadLine();
        return arr;
    }
    static void W(params object[] parts) => Console.WriteLine(string.Join(" ", parts));
    static void Wb(bool v) => Console.WriteLine(v ? "true" : "false");
    static void Wi(int v) => Console.WriteLine(v);
    static void Ws(string v) => Console.WriteLine(v);

static void Main()
    {
        // Read from stdin (see problem statement for format)
        // Line 1: cost per step

}
}

Ready — edit the code above and click Run or Submit.

Official solution

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;

class Program
{
    static int[] Ria(string line = null)
    {
        line ??= Console.ReadLine();
        if (string.IsNullOrWhiteSpace(line)) return Array.Empty<int>();
        return line.Trim().Split(new[] { ' ', ',', '\t' }, StringSplitOptions.RemoveEmptyEntries)
            .Select(int.Parse).ToArray();
    }
    static string[] Rsa()
    {
        int n = int.Parse(Console.ReadLine());
        var arr = new string[n];
        for (int i = 0; i < n; i++) arr[i] = Console.ReadLine();
        return arr;
    }
    static void W(params object[] parts) => Console.WriteLine(string.Join(" ", parts));
    static void Wb(bool v) => Console.WriteLine(v ? "true" : "false");
    static void Wi(int v) => Console.WriteLine(v);
    static void Ws(string v) => Console.WriteLine(v);

    static void Main()
    {
var cost = Ria();
int a = cost[0], b = cost[1];
for (int i = 2; i < cost.Length; i++) {
    int c = cost[i] + Math.Min(a, b);
    a = b; b = c;
}
Wi(Math.Min(a, b));
    }
}

Prefer Coach (Nudge → Guide → Approach) before revealing. No forced signup.

Explanation

Step 1 / 1

Mphasis interview context: Min Cost Climbing Stairs is a Easy 1-D Dynamic Programming problem — Define state dp[i] and transition from smaller subproblems.

Use the animation above to step through each move before writing code.

Pattern: 1-D Dynamic Programming

Read from stdin, write to stdout. Classic interview problem #746.

Prev Next All problems