Tridib Samanta

Pinned

Best Time to Buy and Sell Stock with K transactions

Read the problem statement here. Example: prices = [3, 2, 6, 5, 0, 3], k = 2 The key points mentioned in the problem statement are: 1. prices array contains the cost price of the stock on each day. 2. Maximum number of transactions is limited to k. 3. A stock can be…

Dynamic Programming

6 min read

Best Time to Buy and Sell Stock with K transactions

Dynamic Programming

6 min read

May 10, 2022

Leetcode 140. Word Break II — Solution Explanation

Read the problem statement here. Building the recursive logic step by step: We can only make valid partitions. valid partitions — For the current string we break / partition the string only at those indices such that the substring from the starting index upto the partition index is present in the given dictionary wordDict. Ex.: s =…

Leetcode

3 min read

Leetcode

3 min read

Mar 10, 2021

RESTful Web Services — An Introduction

REST (Representational State Transfer) is an architectural style introduced by Roy Thomas Fielding which is used to develop and consume web services. RESTful web services are designed to use a stateless communication protocol - HTTP (Hypertext Transfer Protocol). Using only four HTTP request methods -GET, POST, PUT, DELETE, we can…

Rest Api

3 min read

Rest Api

3 min read

Feb 22, 2021

Calvins Game | INOI1301 | Editorial

Read the problem statement here. Analyzing the problem statement you might be wondering that — If on the right side of the square ‘k’, we have some consecutive positive integers, say at the (k+1)’th index and (k+2)’th index, then Calvin can move one step forward and backward for infinite time…

Competitive Programming

4 min read

Competitive Programming

4 min read