FAMRO LLC’s Post

🚀 Day 13 of My Python + DSA Journey Today’s problem focused on frequency counting 👇 ✅ Majority Element (#169) 💡 Majority Element Find the element that appears more than n/2 times 🔍 Approach: Used hashmap → counted frequency and returned element exceeding n/2 ⏱ O(n) time | O(n) space 🔥 What I learned today: • Hashmaps make counting problems simple • Frequency-based logic is very common in arrays • Early exit improves efficiency Getting faster at recognizing patterns ⚡ #Day13 #LeetCode #Python #DSA #CodingJourney #100DaysOfCode

Did you know you can use #Python's `bisect` module to do a binary search? Here's a fun example using school grade latters and matching them with grade letters:

🚀 Day 14 of My Python + DSA Journey Tried a different approach today and optimized my solution 👇 ✅ Majority Element II (#229) 💡 Majority Element II Find elements appearing more than n/3 times 🔍 Approach: Used Boyer-Moore Voting Algorithm → tracked candidates and validated counts ⏱ O(n) time | O(1) space 🔥 What I learned today: • Same problem can have multiple approaches • Optimization reduces space from O(n) → O(1) • Smart algorithms > brute-force thinking Learning to not just solve… but solve better ⚡ #Day14 #LeetCode #Python #DSA #CodingJourney #100DaysOfCode

Python 3.13 (Where things get exciting) Introduces an experimental "free-threaded" build (PEP 703). This version allows running Python without the GIL. Threads can now execute in parallel on multiple CPU cores. #Python #Threading #Concurrency #Multiprocessing

Day 50/60 #geekstreak60 Solved Intersection of Two Sorted Arrays today. A simple yet important problem that highlights the efficiency of the two-pointer approach — allowing us to find common elements in O(n + m) time while handling duplicates smartly. Problems like these may look basic, but they strengthen core DSA thinking and improve logic with every step. 💻 #geekstreak60 #npci #DSA #Python #ProblemSolving #CodingJourney

Python 🐍 3.14.4 Just Released This release includes several break fixes, including a few related to multiprocessing and asyncio subprocesses. For the full list, see as follows. #python #programming #python3144 #asyncio #multiprocessing https://lnkd.in/g-8qUX_Q

Day 110 Same pattern, new constraint. #Day110 🧩 90. Subsets II How today went: • Very similar to the basic Subsets problem • First step: sort the array • While iterating, skip duplicate elements to avoid repeating subsets • Use the same backtracking pattern: append → recurse → pop What I learned: The core pattern stays the same — only the duplicate handling logic changes. This small condition makes a big difference. Backtracking is becoming more predictable now. #LeetCode #DSA #Python #Backtracking #Recursion #LearningInPublic #Consistency

Want to set the time on a #Python #Pandas series of datetimes to midnight? Use dt.normalize: df['x'].dt.normalize() You get back series of datetime values, but all times are 00:00:00.

🚀 Tackled the Mean of Range in Array problem today using prefix sums for efficient query handling. Optimized to answer each query in constant time, ensuring platform‑ready performance and hidden test case compliance. #Geekstreak2026 #Geekstreak60 #GFG #Coding #Python #DSA #ProblemSolving #GeeksforGeeks #POTD Problem Link : https://lnkd.in/gE8qbfG6 Solution Link : https://lnkd.in/grPTmTvj

Generate a #Python #Pandas DatetimeIndex of datetime values, specifying the frequency, by passing freq and a code: pd.date_range(start='2026-03-01', end='2026-05-01', freq='8h') This returns a 184-element DatetimeIndex with evenly-spaced datetime values in that period.