In this series ‘Dynamic Programming in Go’, we discuss various solutions using DP and come across concepts as we go. In the post #2 we discussed a concept called ‘Tabulation’: https://hitesh-pattanayak.medium.com/dynamic-programming-in-go-2-climbing-stairs-46597d61157c In a post #1 to that we discussed a concept called ‘Memoization’: https://hitesh-pattanayak.medium.com/dynamic-programming-in-go-1-fibonacci-68d2b7f1b616

In this series ‘Dynamic Programming in Go’, we discuss various solutions using DP and come across concepts as we go. In the post #2 we discussed a concept called ‘Tabulation’: https://hitesh-pattanayak.medium.com/dynamic-programming-in-go-2-climbing-stairs-46597d61157c In a post #1 to that we discussed a concept called ‘Memoization’: https://hitesh-pattanayak.medium.com/dynamic-programming-in-go-1-fibonacci-68d2b7f1b616

In this series ‘Dynamic Programming in Go’, we discuss various solutions using DP and come across concepts as we go. In the post #1 we discussed a concept called ‘Tabulation’: https://hitesh-pattanayak.medium.com/dynamic-programming-in-go-2-climbing-stairs-46597d61157c In a post #2 to that we discussed a concept called ‘Memoization’: https://hitesh-pattanayak.medium.com/dynamic-programming-in-go-1-fibonacci-68d2b7f1b616

In this series ‘Dynamic Programming in Go’, we discuss various solutions using DP and come across concepts as we go. In the previous post we discussed a concept called ‘Tabulation’: https://hitesh-pattanayak.medium.com/dynamic-programming-in-go-2-climbing-stairs-46597d61157c In a post prior to that we discussed a concept called ‘Memoization’: https://hitesh-pattanayak.medium.com/dynamic-programming-in-go-1-fibonacci-68d2b7f1b616

The requirement is to find out number of paths that are available to climb given number of stairs provided you can climb at best 3 stairs at once. Naive Method Naive Method: Test

The requirement is to find Nth Fibonacci number. Naive Method Naive Method: Test

Plan is to design a command line app to estimate package cost and estimate delivery time. Requirement #1: Estimate Package Cost Functional requirement Plan is to estimate the cost of a package based on the given: Weight of package. Distance of the package delivery. Offer code opted. Offer Criteria

Functional Requirements Get Short URL on receiving a long url. Redirect/Fetch the long url on receiving the short url. Length of the URL should be 7 excluding the domain. Non Functional Requirements Highly Available. Ultra low latency TTL support is not considered for this use case. Scale Considering that we…