---
title: "Discussion on \"Recursion, Memoization and Dynamic Programming : Min Steps to reduce a number to 1\" | Hashnode"
description: "Discussion on \"Recursion, Memoization and Dynamic Programming : Min Steps to reduce a number to 1\". Given a number, you need to tell the minimum number of steps required to reduce the number down to 1.\nThe following 3 operations are allowed.\n 1) subtract 1 \n 2) if divisible by 2 divide it by 2 \n 3) if divisible by 3 divide it by 3 \nAt first, you mi..."
url: "https://hashnode.com/posts/minstepsto1/5fda5151d296552b0648987d"
---

[Feed](https://hashnode.com/feed) /

Discussion

# [Recursion, Memoization and Dynamic Programming : Min Steps to reduce a number to 1](https://vineethm.hashnode.dev/minstepsto1?utm_source=hashnode&utm_medium=feed)

Given a number, you need to tell the minimum number of steps required to reduce the number down to 1. The following 3 operations are allowed. 1) subtract 1 2) if divisible by 2 divide it by 2 3) if divisible by 3 divide it by 3 At first, you mi...

Dec 16, 2020 · 7 min read · vineethm.hashnode.dev  
Updated Feb 3, 2021  
Read the article

-   [#competitive-programming](https://hashnode.com/tag/competitive-programming)
-   [#cpp](https://hashnode.com/tag/cpp)
-   [#algorithms](https://hashnode.com/tag/algorithms)

## Written by

[M.Vineeth](https://hashnode.com/@vineethm1627)

@vineethm1627 · India

  
[View profile](https://hashnode.com/@vineethm1627)

Data Structures and Algorithms 💯

## Responses

Markdown supported · ⌘↵ to post

No responses yet.