Are you struggling to understand how Navigation Component in Android deals with the Back Stack when transitioning between fragments? If so, you’re not alone. The good news is that the framework provides two powerful attributes, popUpTo and popUpToInclusive, to help simplify the process. In this article, we’ll explore how these…

Let’s quickly understand why do we need a splash-screen in our apps, startup of any android application can be divided into three types,

Here’s the problem statement -> link Hmm, let’s get started with our little stock market today. Here are some of the rules to ponder, You can make at most ‘k’ transactions. You cannot engage in multiple transactions. (i.e. Harshad Mehta, if you have bought a stock, before buying any new…

There are a lot of articles/documentations on the internet that start with the defintion of upper_bound() & lower_bound(), but I don’t want to indulge in all that bare talking. We’ll come to the defintions, but not right now. Lets dive directly into the examples : let’s consider a sorted array : 10, 20, 30, 40, 50 and now let’s find upper_bound() for the following values : val : 30, upper_bound : 40, index = 3

There are a couple of ways to solve this problem, more widely used is the one using a Heap Data Structure. Whose TC: O(N*N*logk), and SC: O(k), where k is the size of Heap that we maintain during the process. But what intrigued me into writing the solution of this…

You must be wondering what makes this so hard, just chuck a node and that’s it. Well, not that easy..not that easy. The major issue is to delete a node in such a way that the property of Binary Search Tree is also preserved. Let’s dive straight and understand what makes a normal ‘Binary Tree’ a ‘Binary Search Tree’. A Binary Search Tree is a tree, where, for a node(A) the value of it’s left child(L) is smaller than the value of node(A) and the value of right child(R) is greater than the value…

Here’s my quick two cents on how to solve this problem: RECURSIVE APPROACH Let’s consider an example, suppose we’re given with a set [1,2,3] and we’ve to get all of it’s unique subsets, let’s take a very intuitive approach to it: [1,2,3], for every element that appears in this set, I have…

Before starting out, I promise you three things: you’ll have a better understanding of the concept of overflow, you’ll get an intuitive idea on Serialization of nodes in a Binary Tree, you’ll get accustomed to a hack. Without further ado, let’s begin. Question> Given the root of a binary tree…

Ever wondered how those Linux gurus write boggling commands on the command line and how it gets the job done? — Ever been in situations where you copied code to do something on your Linux machine, but never had a chance to understand what this weird looking fella ‘|’ meant? Then you are on the wrong page gentleman, go study those huge ass Linux Manual pages and learn it for yourself…