Skip to content
the poor coder

Leetcode - 2 Keys Keyboard Solution

Poor Man
Published
Updated
Reading time
1 min read

Initially on a notepad only one character 'A' is present. You can perform two operations on this notepad for each step:

  1. Copy All: You can copy all the characters present on the notepad (partial copy is not allowed).
  2. Paste: You can paste the characters which are copied last time.

Given a number n. You have to get exactly n 'A' on the notepad by performing the minimum number of steps permitted. Output the minimum number of steps to get n 'A'.

Example 1:

Text
Input: 3
Output: 3
Explanation:
Intitally, we have one character 'A'.
In step 1, we use Copy All operation.
In step 2, we use Paste operation to get 'AA'.
In step 3, we use Paste operation to get 'AAA'.

Note:

  1. The n will be in the range [1, 1000].

Solution in Python#

Python
class Solution:
    def minSteps(self, n: int) -> int:        
        f = 2
        factors = 0
        while f <= n:
            if not n%f:
                n//=f
                factors += f
            else:
                f+=1
        return factors

Keep going

2021

Leetcode - Triangle Solution

Given a triangle array, return the minimum path sum from top to bottom. For each step, you may move to an adjacent number of the row below. More formally, if you are on index i on the current row, you may move to either…

ESC