#StaircaseProblem - Twitter Hashtag

11 months ago

Day 118 ✅ | #gfg160 Challenge @geeksforgeeks 🔁 Solved: Min Cost Climbing Stairs 🎯 Goal: Reach the top with minimum cost using 1 or 2 steps at a time. 🎯 Used bottom-up DP #Python #DSA #100DaysOfCode #GeekStreak2025 #DynamicProgramming #StaircaseProblem

muzamilnaik_'s tweet photo. Day 118 ✅ | #gfg160 Challenge @geeksforgeeks
🔁 Solved: Min Cost Climbing Stairs
🎯 Goal: Reach the top with minimum cost using 1 or 2 steps at a time.
🎯 Used bottom-up DP

#Python #DSA #100DaysOfCode #GeekStreak2025 #DynamicProgramming #StaircaseProblem https://t.co/CrdvzvkT69

1

12

0

97

Vikas Shukla @vik_7_

about 1 year ago

🚀 Day [117] of #gfg160dayschallenge @geeksforgeeks 🏆 Today's Problem: Ways to Reach the n’th Stair 💡 Key Takeaway: Use dynamic programming or the Fibonacci sequence to count the number of ways to reach the top in O(N) time. #DSA #DP #Recursion #StaircaseProblem

vik_7_'s tweet photo. 🚀 Day [117] of #gfg160dayschallenge @geeksforgeeks
🏆 Today's Problem: Ways to Reach the n’th Stair
💡 Key Takeaway: Use dynamic programming or the Fibonacci sequence to count the number of ways to reach the top in O(N) time.
#DSA #DP #Recursion #StaircaseProblem https://t.co/GNwBuX5u3R

0

2

0

Bishwa Bandhu Parmar @bishwabandhu06

about 1 year ago

🚀 #Day 117 of My GeeksforGeeks 160 Days Coding Challenge! 💻 Problem: Ways to Reach the n'th Stair 🔗 GitHub: https://t.co/A7CVWXdVc5 #ProblemSolving #DynamicProgramming #StaircaseProblem #CodingChallenge #GeeksforGeeks #Algorithms #Learning 🚀

bishwabandhu06's tweet photo. 🚀 #Day 117 of My GeeksforGeeks 160 Days Coding Challenge!

💻 Problem: Ways to Reach the n'th Stair

🔗 GitHub: https://t.co/A7CVWXdVc5

#ProblemSolving #DynamicProgramming #StaircaseProblem #CodingChallenge #GeeksforGeeks #Algorithms #Learning 🚀 https://t.co/oRKRERRPVU

0

11

0xHiTek @0xHiTech

almost 3 years ago

Challenge 10 - Number of Ways to Reach Stairs: Write a Python function that calculates the number of distinct ways to reach the top of a staircase with 'n' steps. You can take one or two steps at a time. #StaircaseProblem #DynamicProgramming #PythonAlgorithm

0xHiTech's tweet photo. Challenge 10 - Number of Ways to Reach Stairs: Write a Python function that calculates the number of distinct ways to reach the top of a staircase with 'n' steps. You can take one or two steps at a time. #StaircaseProblem #DynamicProgramming #PythonAlgorithm https://t.co/Cth11haXOE

0

29

Top Tweets for #StaircaseProblem

Last Seen Hashtags on Sotwe

Trends for you

Most Popular Users