Technical Keeda

Each time you can either climb  1  or  2  steps. In how many distinct ways can you climb to the top?   Climbing Stairs leetcode problem solution DP- Problem statement- Link - https://leetcode.com/problems/climbing-stairs/ You are climbing a staircase. It takes  n  steps to reach the top.   Example 1: Input: n = 2 Output: 2 Explanation: There are two ways to climb to the top. 1. 1 step + 1 step 2. 2 steps Example 2: Input: n = 3 Output: 3 Explanation: There are three ways to climb to the top. 1. 1 step + 1 step + 1 step 2. 1 step + 2 steps 3. 2 steps + 1 step   Constraints: 1 <= n <= 45 Solution - This problem can be solved by using dp. Since we know we can climb 1 step or 2 step at a time so our current solution depends on n-1 or n-2 steps solution, let's say we are at ith stair. we can react at ith stair from i-1 th stair and i-2th stair. Here is my code-

 Magical Candy Store november long challenge problem solution code with explaination- Magical Candy Store November long challenge problem solution code with explanation Let's Read the problem statement. Chef and Chefu are at a magical candy store playing a game with the following rules: There are two candy counters; each of them stores an infinite number of candies. At any time, only one of the counters is open and the other is closed. Exactly one player is present at each of the counters. Initially, Chef is at the open counter and Chefu is at the closed counter. There is a sequence of  N N   distinct  integers  A 1 , A 2 , … , A N A 1 , A 2 , … , A N . The game consists of  R R  turns; in the  i i -th turn, the open counter offers only  C = A ( i − 1 ) % N + 1 C = A ( i − 1 ) % N + 1  candies to the player present at this counter. This player should choose a positive number of candies  M M  to accept, where  1 ≤ M ≤ C 1 ≤ M ≤ C . If this player accepts an odd number of candies, th