Optimizing Range Sum Queries with 2D Prefix Sums

Day 49 of Python with DSA 🚀 Today’s problem helped me deeply understand how linked lists differ from arrays. When asked to splice nodes, the goal is not to create new data — it’s to manipulate pointers and reuse existing memory. The more I practice, the more I improve at writing efficient, interview-ready solutions. Discipline + consistency = growth 💪 #Day49 #Python #DSA #LinkedList #ProblemSolving #SDE#CodingJourney

Longest Common Span with Equal Sum in Two Binary Arrays: Reduced the problem using a difference array + prefix sum + hashmap, converting it into a longest zero-sum subarray pattern. Time Complexity: O(n) Small optimizations. Stronger fundamentals. Consistency compounds. #geekstreak60 #npci #DataStructures #Algorithms #ProblemSolving #Python #CodingJourney

🚀 Day 14/30 – Search Insert Position (Binary Search in Python) Today’s problem: LeetCode 35 – Search Insert Position We’re given: A sorted array of distinct integers A target value If the target exists → return its index. If not → return the index where it should be inserted.SoarX Constraint: O(log n) runtimeConsistency > Motivation 💪 #30DaysOfCode #BinarySearch #python #DSA #Algorithms #CodingChallenge #LeetCode

🚀 LeetCode Practice: Problem #144 – Binary Tree Preorder Traversal I recently solved LeetCode 144, a fundamental tree traversal problem that strengthens understanding of recursion and depth-first search (DFS). 📌 Problem Statement Given the root of a binary tree, return the preorder traversal of its nodes’ values. Preorder Traversal Order: #LeetCode #Python #DSA #BinaryTree #TreeTraversal #DepthFirstSearch #DFS #Recursion #ProblemSolving #CodingPractice #100DaysOfCode #InterviewPreparation #SoftwareEngineering #DeveloperJourney #TechCommunity #DataStructures #CodingInterview #LearnToCode

Solved the Largest Number from Array problem using a greedy approach with custom sorting in Python. Key insight: compare a+b vs b+a instead of normal numeric sorting. Time Complexity: O(n log n). Strengthening my understanding of comparators, string manipulation, and algorithmic thinking through consistent practice. #geekstreak60 #npci #DSA #Python #ProblemSolving #GreedyAlgorithm #CodingPractice #AlgorithmicThinking

Solved the Largest Number from Array problem using a greedy approach with custom sorting in Python. Key insight: compare a+b vs b+a instead of normal numeric sorting. Time Complexity: O(n log n). Strengthening my understanding of comparators, string manipulation, and algorithmic thinking through consistent practice. #geekstreak60 #npci #DSA #Python #ProblemSolving #GreedyAlgorithm #CodingPractice #AlgorithmicThinking

feb-22-26 LeetCode 762 – Prime Number of Set Bits in Binary Representation Solved today’s problem! ✅ The task is to count numbers in a given range [left, right] whose number of set bits (1s in binary form) is a prime number. ⚡ Complexity: Time: O(n log n) Space: O(1) A simple yet powerful problem combining binary operations and number theory 🔥 #LeetCode #DailyCoding #BitManipulation #Python #ProblemSolving #CodingJourney

Day 11/100 – Python & Machine Learning Revision 🚀 Today I revised: 23. Modules & Packages: import, from, pip, and Virtual environments 24. Useful Libraries:- datetime, os, sys, math, random, and collections 📌 Code & notes :- https://lnkd.in/dmFHqCrK #100DaysOfPython #MachineLearning #AIML #Python #LearningInPublic

📌Python Sets – Symmetric Difference I learned about the Symmetric Difference operation in Python sets. 🧩What is Symmetric Difference? It returns a new set containing elements that are present in either of the sets, but NOT in both. ✅ Using symmetric_difference() method ✅ Using ^ operator (shortcut method) ✅ Common elements are automatically removed 🧩 Example: set3 = set1.symmetric_difference(set2) # or set3 = set1 ^ set2 🔎 Key Concept: 🔹It removes the common elements (intersection). 🔹It keeps only unique, non-overlapping values. Set operations are very useful for comparing and analyzing datasets efficiently #Python #PythonSets #DataAnalytics #LearningJourney #CodingPractice #Upskilling

Today I learned about the Two Pointer Algorithm It’s an efficient technique that helps reduce time complexity by using two indices instead of nested loops. I’m excited to explore how this approach improves performance in problems like arrays, strings, and searching tasks. #DSA #Algorithms #TwoPointer #Python