Stories, Tutorials
& Life Tips
Deep dives on coding, health, recipes, travel and everything in between.
π Explore Reading Paths
Follow curated journeys from beginner to expert
Introduction to Dynamic Programming
Dynamic programming is both a mathematical optimization method and a computer programming method. The method was developed by Richard Bellman in the 1950s and has found applications in numerous fieldsβ¦
Income Tax Double Benefits - Tax-Exempted returns
Here are few such tax savers that not only help you save tax but also help you earn tax-free income. But, not all are thβ¦
Friday's total lunar eclipse will be longest blood moon visible this century, until 2123
The full moon will turn blood red on July 27 as the longest total lunar eclipse of the century takes place in the skies β¦
Find Minimum Path Sum in a given 2D Array.
Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum oβ¦
Calculate all Unique Path count can be taken by Robot.
A robot is located at the top-left corner of a m x n grid ( 'Start' ). The robot can only move either down or right at β¦
Find Total Number of Set Having given Combination Sum.
You are given a set of candidates (without duplicates) and a target number (target), you have to find all unique coβ¦
Maximize House Robbery Amount that can be made.
Given that you are a professional robber who is planning to rob houses along a street. Constraint given is that each houβ¦
Find total ways to reach the nth stair using step 1, 2 or 3.
A frog is jumping up a staircase with n steps and can hop either 1 step, 2 steps, or 3 steps at a time. Implement a metβ¦
Find a Single Occurrence Number in an Array, Given all other numbers occurred twice.
You have been given a non-empty array of integers in which every element appears twice except for one. You have to Find β¦
Find Longest Sub-string without any Repeating characters.
A substring is a contiguous sequence of characters within a string. For instance, "the best of" is a substring of "It waβ¦
Implement Quick Sort Using C-Sharp.
Quicksort (sometimes called partition-exchange sort) is an efficient sorting algorithm, serving as a systematic method fβ¦
Implement Merge Sort Using C-Sharp
In computer science, merge sort (also commonly spelled mergesort) is an efficient, general-purpose, comparison-based sorβ¦
Humble Beginnings
A wise man once said a picture is worth a thousand words. And in the current age of technology, a GIF is worth hundreds β¦
Generate all the possible k-ary strings of length and digit upto k
You have been given an integer n that corresponds to the length of the array and k which corresponds to the digit value β¦
Generate all possible strings of n bits.
You have been given an integer n that corresponds to the number of bits in an array. the task is to print all the possibβ¦