DP — Target SumThis is a really interesting problem which might look like a difficulty level — LC hard at first look, but once you understand the…Oct 9, 2022Oct 9, 2022
DP — Count of Subsets With A Given SumThis is a really standard DP problem and crucial interview question which lays foundation(underlying intuition) for many other intersting…Oct 9, 20221Oct 9, 20221
Dynamic Programming — Equal Sum Partition ProblemSo the leetcode link for this problem is — https://leetcode.com/problems/partition-equal-subset-sum/ in which the problem states as —Oct 8, 2022Oct 8, 2022
Building A Career as a Recruiter in Human ResourcesThis article is guided for the MBA students who are aspiring to become an HR executive in future.Jul 10, 2022Jul 10, 2022
Dynamic Programming — Subset Sum ProblemSo, if you have read my previous post on the Knapsack problem, the Subset Sum Problem is a variation of the 0/1 Knapsack problem.Apr 24, 2022Apr 24, 2022
Dynamic Programming — 0/1 Knapsack ProblemSo, I have just recently started learning DP. So here I am posting my notes here with each problem I am learning so far. Please feel free…Apr 24, 2022Apr 24, 2022
AWS EC2: Exploring Instance TypesWhat is EC2 Instance Types: EC2 Instance type determines the hardware configuration of the host computer on which the EC2 instance we are…Jul 13, 2021Jul 13, 2021
Published inAWS in Plain EnglishAWS — EC2 and Its Pricing OptionsA guide to AWS EC2 pricing options.Jul 13, 2021Jul 13, 2021
Design a distributed key-value store that is highly consistent and is network partition tolerant.Requirements: This is the first part of any system design interview, coming up with the features which the system should support. As an…Aug 14, 20202Aug 14, 20202
Published inThe StartupIntroduction to Data Intensive Applications & ReliabilityWe call an application data-intensive if data is its primary challenge — the quantity of data, the complexity of data, or the speed at…Jan 3, 2020Jan 3, 2020
