---
title: "drashy sesodia (@DrewDrashy) | Hashnode"
description: "Software Developer. Read the latest articles by drashy sesodia on Hashnode."
url: "https://hashnode.com/@DrewDrashy"
---

@DrewDrashy

# drashy sesodia

@DrewDrashy · Joined May 2025

Software Developer

### [Implementing Reliable Background Location Tracking in Expo on Android](https://addition-of-k-for-each-interval.hashnode.dev/implementing-reliable-background-location-tracking-in-expo-on-android?utm_source=hashnode&utm_medium=feed)

Learn how to implement reliable background location tracking in Expo on Android with this step-by-step guide, tackling permissions and Gradle errors

4 min read · [addition-of-k-for-each-interval.hashnode.dev](https://addition-of-k-for-each-interval.hashnode.dev/implementing-reliable-background-location-tracking-in-expo-on-android?utm_source=hashnode&utm_medium=feed)

[Jun 23, 2025](https://hashnode.com/posts/implementing-reliable-background-location-tracking-in-expo-on-android/6859193376880a8d5b1cd82f)

### [Efficient Solution for “Number of Ways to Assign Edge Weights I” on LeetCode](https://addition-of-k-for-each-interval.hashnode.dev/efficient-solution-for-number-of-ways-to-assign-edge-weights-i-on-leetcode?utm_source=hashnode&utm_medium=feed)

Problem Summary You are given a tree with n nodes rooted at node 1, and each edge initially has a weight of 0. The task is to assign each edge a weight of either 1 or 2. The cost of a path is defined as the sum of edge weights along the path. Use the...

3 min read · [addition-of-k-for-each-interval.hashnode.dev](https://addition-of-k-for-each-interval.hashnode.dev/efficient-solution-for-number-of-ways-to-assign-edge-weights-i-on-leetcode?utm_source=hashnode&utm_medium=feed)

[May 28, 2025](https://hashnode.com/posts/efficient-solution-for-number-of-ways-to-assign-edge-weights-i-on-leetcode/6836d6121c8efb431960eaad)

### [Efficient Range Addition in Arrays Using Difference Array (C++)](https://addition-of-k-for-each-interval.hashnode.dev/efficient-range-addition-in-arrays-using-difference-array-c?utm_source=hashnode&utm_medium=feed)

Learn how to perform fast range updates in arrays using the difference array technique in C++. This optimized DSA method is perfect for Leetcode-style probl

3 min read · [addition-of-k-for-each-interval.hashnode.dev](https://addition-of-k-for-each-interval.hashnode.dev/efficient-range-addition-in-arrays-using-difference-array-c?utm_source=hashnode&utm_medium=feed)

[May 27, 2025](https://hashnode.com/posts/efficient-range-addition-in-arrays-using-difference-array-c/6835f7e783704cf3a3f166fa)
