LeetCode Daily Challenge: Happy Strings

Day 67 of 365 Days of code the infamous brainrot number Qn 1) Reorder list You are given the head of a singly linked-list. The positions of a linked list of length = 7 for example, can intially be represented as: [0, 1, 2, 3, 4, 5, 6] Reorder the nodes of the linked list to be in the following order: [0, 6, 1, 5, 2, 4, 3] Notice that in the general case for a list of length = n the nodes are reordered to be in the following order: [0, n-1, 1, n-2, 2, n-3, ...] You may not modify the values in the list's nodes, but instead you must reorder the nodes themselves. approach: use 5 pointers(scary :")) #365daysOfCode #NeetCode  #leetcode  #DSA  #python #LeetCode #ProblemSolving  #Algorithms #365dayschallenge

LeetCode POTD 💫: Trying to be consistent with POTDs 🫠 Description: You are given two strings, str1 and str2, of lengths n and m, respectively. A string word of length n + m - 1 is defined to be generated by str1 and str2 if it satisfies the following conditions for each index 0 <= i <= n - 1: -> If str1[i] == 'T', the substring of word with size m starting at index i is equal to str2, i.e., word[i..(i + m - 1)] == str2. -> If str1[i] == 'F', the substring of word with size m starting at index i is not equal to str2, i.e., word[i..(i + m - 1)] != str2. Return the lexicographically smallest possible string that can be generated by str1 and str2. If no string can be generated, return an empty string "". Here's my solution: https://lnkd.in/g6B2-GWz #Python #DSA #Leetcode #DailyChallenge

🚀 #100DaysOfCode – Day 52 📌 Problem: Sort Colors (LeetCode 75) 💡 Problem Idea: You are given an array containing only 0s, 1s, and 2s, representing three colors. The task is to sort the array in-place so that all 0s come first, then 1s, and then 2s. ⚡ Key Insight: Instead of using a sorting algorithm, we can solve this in one pass using three pointers. We maintain three regions: Left pointer → position for next 0 Right pointer → position for next 2 Current pointer (i) → traverses the array 🎯 Approach (Dutch National Flag Algorithm): If element is 0 → swap with left, move both left and i If element is 1 → just move i If element is 2 → swap with right, decrease right 📈 Complexity: Time Complexity: O(n) Space Complexity: O(1) (in-place sorting) ✅ Efficient because the array is processed only once. 💭 Learning: This problem is a great example of how pointer techniques can optimize sorting problems without using built-in sort functions. #DSA #LeetCode #Python #CodingJourney #ProblemSolving #Algorithms #100DaysOfCode #LinkedInLearning

LeetCode Problem 3070: "Count submatrices with top left element and sum less than k": You are given a 0-indexed integer matrix grid and an integer k. Return the number of submatrices that contain the top-left element of the grid, and have a sum less than or equal to k. Approach: use Prefix sum to calculate the total value of submatrix including the top left element upto a given cell. This approach is optimal and straightforward. #Python #DSA #LeetCode #ProblemSolving #CompetitiveProgramming #DailyCoding

🚀 DSA Practice – Check if a String is a Palindrome Today I worked on a fundamental string challenge: Determining whether a given string is a palindrome. 📌 Problem Statement: Given a string s, verify if it reads the same backward as forward. A palindrome is a sequence that is identical even when its order is reversed. 🧠 My Approach: 1️⃣ Clean the Data: Convert the string to a uniform case (lowercase) to ensure the comparison is case-insensitive. 2️⃣ Reverse and Compare: Use Python’s powerful slicing technique s[::-1] to create a reversed version of the string. 3️⃣ Verification: Compare the original string with the reversed one. If they match, it's a palindrome; otherwise, it's not. ⚙️ Example: Input: "madam" → Output: True Input: "hello" → Output: False 📊 Complexity: Time Complexity: $O(n)$ (where $n$ is the length of the string, as we traverse it to reverse). Auxiliary Space: $O(n)$ (to store the reversed version of the string). 💻 Language Used: Python This problem is a great way to practice string slicing and understanding how data is stored and compared in memory. It's a stepping stone toward more complex "Two-Pointer" string problems! #DSA #Python #CodingPractice #ProblemSolving #Strings #Palindrome #LearningInPublic

LeetCode POTD 💫: Description: A string originalText is encoded using a slanted transposition cipher to a string encodedText with the help of a matrix having a fixed number of rows rows. originalText is placed first in a top-left to bottom-right manner. encodedText is then formed by appending all characters of the matrix in a row-wise fashion. Given the encoded string encodedText and number of rows rows, return the original string originalText. Note: originalText does not have any trailing spaces ' '. The test cases are generated such that there is only one possible originalText. Here's my solution: https://lnkd.in/g2EMmfzE #Python #DSA #Leetcode #DailyChallenge

📒 Comparing Performance After Optimization in django-mariadb-vector Since version v0.2.0, the 'django-mariadb-vector' library includes several optimization options. Here are the results from performance tests. 🔋Benefits 'orjson' vs 'json' 🔸 Up to ~20× faster compared to the standard `json` library on generate vector data 🔸 Up to ~8× faster compared to the standard `json` library on response vector data 🔋Benefits of 'binary' on response vector data 🔸 Up to ~16× faster compared to the standard `json` library 🔸 About ~2× faster compared to `orjson` 🔗 https://lnkd.in/d82cnBMn ⚠️ Note: Performance was measured using 20,000 iterations (3 runs) with randomly generated vectors of dimension 3072. #django #python #mariadb #vector #django-mariadb-vector #optimization #json #orjson #rust

Third PR merged, a feature addition to skore's ImpurityDecreaseDisplay. :probabl. PR: https://lnkd.in/evSrq9GD The problem: ImpurityDecreaseDisplay.frame() returned raw per-split rows with no way to aggregate across them. Other display classes in the suite already had this. ImpurityDecreaseDisplay was the odd one out. Added an aggregate parameter. When set, per-split rows collapse into importance_mean and importance_std, replacing the split column. Also made _plot_matplotlib pass aggregate=None explicitly to keep plotting behavior unambiguous. Opened this as a draft initially because I wasn't sure how aggregation should behave for the comparison-cross-validation report type. Left the question in the PR description, the maintainers clarified, I updated, it shipped. #opensource #python #skore #scikitlearn #machinelearning

🚀 Day 39/100 – LeetCode Challenge Today’s problem: 406. Queue Reconstruction by Height This problem focuses on applying a Greedy approach with sorting to reconstruct a queue based on height and positional constraints. 🔍 Key Insight: Sort people by height in descending order and k value in ascending order, then insert each person at their respective index. 💡 What I learned: Importance of sorting strategy in greedy problems How insertion at a specific index can maintain constraints Thinking from the perspective of "who affects whom" (taller vs shorter) 🧠 Approach: Sort the array → (-height, k) Insert each person at index k 💻 Code (Python): class Solution: def reconstructQueue(self, people): people.sort(key=lambda x: (-x[0], x[1])) queue = [] for p in people: queue.insert(p[1], p) return queue ⏱️ Time Complexity: O(n²) Consistency is the key — showing up every day and improving step by step. #Day39 #LeetCode #100DaysOfCode #DSA #Python #CodingChallenge #GreedyAlgorithm #SoftwareDevelopment

🚀 Day 75 of #100DaysOfCode 🔥 LeetCode 179 – Largest Number 💡 Problem: Given a list of non-negative integers, arrange them such that they form the largest possible number. 🧠 Key Insight: Normal sorting won't work here ❌ We need a custom comparator based on string concatenation. 👉 Compare: - ""a + b"" vs ""b + a"" - Whichever gives a larger value should come first. ⚙️ Approach: 1. Convert numbers to strings 2. Sort using custom comparison logic 3. Join the result 4. Handle edge case (like "[0,0] → "0"") ⚡ Complexity: - Time: O(n log n) - Space: O(n) 🎯 Result: ✅ Accepted ⚡ Runtime: 0 ms (100%) 📌 Lesson Learned: Sometimes sorting logic depends on combination, not value. #LeetCode #Python #CodingJourney #DSA #100DaysOfCode #Sorting #ProblemSolving