Open in app

Sign In

Write

Sign In

Abhishek Gururani
Abhishek Gururani

44 Followers

Home

About

Pinned

What’s new in Kotlin for Android, #GoogleIO 2023

Last year in 2022, Kotlin completed 5 whole years as the officially supported language for Android Development. Here’s a list of 4 new updates to the Android Kotlin Ecosystem that were announced in Google IO ’23. Kotlin compiler version 2.0 If you’re a Kotlin developer, you might be excited to hear that the language…

Android

3 min read

What’s new in Kotlin for Android, #GoogleIO 2023
What’s new in Kotlin for Android, #GoogleIO 2023
Android

3 min read


Apr 28

How to use popUpTo and popUpToInclusive in Navigation Framework?

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…

Android

4 min read

How to use popUpTo and popUpToInclusive in Navigation Framework?
How to use popUpTo and popUpToInclusive in Navigation Framework?
Android

4 min read


Sep 30, 2022

Google’s recommended way to implement Splash-Screen in your Android App

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,

Android

3 min read

Google’s recommended way to implement Splash-Screen in your Android App
Google’s recommended way to implement Splash-Screen in your Android App
Android

3 min read


Sep 10, 2022

Leetcode : Best Time To Buy And Sell Stock IV

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…

3 min read

Leetcode : Best Time To Buy And Sell Stock IV
Leetcode : Best Time To Buy And Sell Stock IV

3 min read


Aug 3, 2022

Demystifying S.T.L. functions upper_bound() & lower_bound();

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

C

3 min read

Demystifying S.T.L. functions upper_bound() & lower_bound();
Demystifying S.T.L. functions upper_bound() & lower_bound();
C

3 min read


Aug 2, 2022

How to find Kth smallest element in a Sorted Matrix!?

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…

3 min read

3 min read


Apr 17, 2022

How to delete node in a Binary Search Tree

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…

4 min read

How to delete node in a Binary Search Tree
How to delete node in a Binary Search Tree

4 min read


Apr 10, 2022

How to print all unique subsets of a set, using recursion and bit-manipulation.

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…

Subsets

4 min read

How to print all unique subsets of a set, using recursion and bit-manipulation.
How to print all unique subsets of a set, using recursion and bit-manipulation.
Subsets

4 min read


Mar 30, 2022

Maximum Width of a Binary Tree || <The most intuitive solution>

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…

Leetcode

4 min read

Maximum Width of a Binary Tree || Most intuitive solution
Maximum Width of a Binary Tree || Most intuitive solution
Leetcode

4 min read


Mar 25, 2022

Piping on Linux 101

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…

Linux

5 min read

Piping on Linux 101
Piping on Linux 101
Linux

5 min read

Abhishek Gururani

Abhishek Gururani

44 Followers

I write articles on Android Development, and problem solving.

Following
  • Enrique López-Mañas

    Enrique López-Mañas

  • Rajiv Ranjan Singh

    Rajiv Ranjan Singh

  • Ban Markovic

    Ban Markovic

  • Sergii Zhuk

    Sergii Zhuk

See all (5)

Help

Status

Writers

Blog

Careers

Privacy

Terms

About

Text to speech

Teams