LeetCode 1980: Find Unique Binary String in Python

You can fit the most common Bayesian regression models in Python using a consistent syntax (similar to brms in R) using the bambi package. It utilizes PyMC to do the simulations. It's remarkably easy and straightforward to use - you just adjust the family name to the right model type. Here are a few examples. More instructions are available here: https://lnkd.in/eGSG3-Bk #statistics #datascience #analytics #rstats #python #peopleanalytics #technology #ai

LeetCode POTD 💫: Description: Given an integer n, return the decimal value of the binary string formed by concatenating the binary representations of 1 to n in order, modulo 10**9 + 7. Here are my solutions: Using String Manipulation: https://lnkd.in/g4UpENeF Using Bit Manipulation: https://lnkd.in/gw9PZc7n #Python #DSA #Leetcode #DailyChallenge

LeetCode Problem 1461: "Check if a binary string contains all binary codes of size k": Given a binary string s and an integer k, return true if every binary code of length k is a substring of s. Otherwise, return false. Approach: I simply used a sliding window and a hash map where hash map stores the seen substrings of size k. Two pointers keep track of each substring of size k. A count variable is initialized to 0 which is incremented each time when a unique unseen substring of size k is seen, if this count reaches the max possible number of unique binary codes of size k (i.e. 2^k) the function returns True else False. #LeetCode #Python #BitManipulation #Strings #SlidingWindow #DataStructures #Algorithms #CompetitiveProgramming #ProblemSolving #OptimalSolution

sqrt() calculates the square root of a number. After calculating the root, the result participates in the rest of the arithmetic expression. 📌 Answer: B) 6 #Python #MathFunctions #PythonChallenge #LearningInPublic #CodingPractice

Day 6 of #LearnInPublic Today I worked on the problem: First Non-Repeating Element in an Array. I implemented two approaches in Python: 1️⃣ Hash Map Approach (Using defaultdict) • Count frequency of each element • Traverse again to find the first element with frequency = 1 Time Complexity: O(n) Space Complexity: O(n) 2️⃣ Brute Force Approach • Compare every element with the rest of the array Time Complexity: O(n²) Space Complexity: O(1) Key takeaway: Using a hash map trades extra space for a significant improvement in time complexity. Small daily improvements compound over time. #Python #DataStructures #Algorithms #LearnInPublic #CodingJourney

Today’s challenge: Finding the longest span with equal sum in two binary arrays. Key insight: Transform the problem into tracking prefix sum differences and use a hashmap to detect repeating sums — reducing complexity to O(n). #geekstreak60 #npci #Python #DSA #Algorithms #ProblemSolving #CodingJourney #Consistency #TechGrowth #DeveloperLife

LeetCode #226 – Invert Binary Tree | Python Implementation I implemented a recursive DFS approach that swaps left and right children at every node. Core Insight: Tree inversion is distributive — inverting a tree equals swapping its root's children and inverting each subtree independently. Recursion handles this naturally in O(n) time. Time: O(n) | Space: O(h) where h = tree height (recursion stack) #LeetCode #DataStructures #Python #BinaryTree #Recursion #DFS #CodingInterview #SoftwareEngineering

What if you could improve LLM responses without training bigger models? That’s the idea behind Inferscale 0.1.1. A lightweight Python package that applies inference-time scaling techniques to produce higher-quality outputs—perfect for developers working within tight compute budgets. It’s simple, effective, and ready to use. Explore the repo and README: https://lnkd.in/giq8KJ5g Let me know what you think! #ArtificialIntelligence #LLM #Python #OpenSourceProject #AIInnovation #DeepLearning

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

Learn in Public — Day 11 Today I explored multiple ways to compute the Greatest Common Divisor (GCD) in Python. Implemented several approaches: • Brute force approach using iteration • Recursive subtraction-based GCD • Optimized recursive version • Euclidean algorithm using modulo • Python's built-in math.gcd() function Key takeaway: The Euclidean Algorithm is significantly more efficient than the naive approach because it reduces the problem size quickly using modulo operations. This exercise helped me understand how the same problem can be solved with different algorithmic strategies — each with different time complexities and performance trade-offs. Consistently learning and improving every day. #LearnInPublic #Python #Algorithms #DataStructures #CodingJourney #SoftwareEngineering #ProblemSolving