Change JPEG Compression with Python and Pillow

🐍 Day 117 — Hyperparameter Tuning Day 117 of #python365ai ⚙️ Tune model settings to improve performance. Example: from sklearn.model_selection import GridSearchCV 📌 Why this matters: Small changes can significantly improve results. 📘 Practice task: Tune one parameter in a model. #python365ai #HyperparameterTuning #ML #Python

Two sum: Using dictionary (Optimized Solution) Instead of checking every pair: For each number, calculate what number is required. Formula to calculate required : required = target - current_number  Time complexity → O(n) #Python #LogicBuilding #ProblemSolvingSkills #Beginners

Day 53/100 – #100DaysOfCode 🚀 Solved LeetCode #125 – Valid Palindrome (Python). Today I practiced string cleaning and validation to check whether a given string is a palindrome. Approach: 1) Traverse the string and keep only alphanumeric characters. 2) Convert all characters to lowercase. 3) Build a cleaned string. 4) Compare the string with its reverse. 5) If both are equal, return True; otherwise, return False. Time Complexity: O(n) Space Complexity: O(n) Learning how preprocessing simplifies string problems 💪 #LeetCode #Python #DSA #Strings #ProblemSolving #100DaysOfCode

🎥 Project Explanation Video Here is my explanation for Iris Flower Classification project using Machine Learning. 🔗 GitHub Link: https://lnkd.in/gKwJNFrr #DataScience #MachineLearning #Python #CodeAlpha

Verify Alien Dictionary: Custom Order Comparison Check if words are lexicographically sorted using custom alphabet ordering. Build char-to-index map from order string. Compare adjacent word pairs character-by-character using custom ordering. Early exit when mismatch found or prefix condition violated. Comparison Logic: HashMap enables O(1) custom order lookup. Prefix check handles "apple" vs "app" case (longer must come after). Break on first mismatch since rest doesn't matter for ordering. Time: O(n × k) where k = avg word length | Space: O(1) — fixed 26 chars #StringComparison #CustomOrdering #HashMap #LexicographicOrder #Python #AlgorithmDesign #SoftwareEngineering

#Python f-strings are the best: - Put an f before the opening ' or " - Creates a regular string - Expressions in {} are evaluated/interpolated x = 5 y = 7 f'{x} + {y} = {x+y}' # 5 + 7 = 12 x = [1,2] y = [3,4] f'{x} + {y} = {x+y}' # [1, 2] + [3, 4] = [1, 2, 3, 4]

Generated Gray Code sequence using bit manipulation. Used formula: G(i) = i ^ (i >> 1) to ensure each consecutive pattern differs by only one bit. Efficiently generated all 2^n patterns and formatted them into fixed-length binary strings. Time Complexity: O(2^n) Space Complexity: O(2^n) #geekstreak60 #npci #bitmanipulation #python

Python Clarity Series – Episode 25 Topic: Mutable vs Immutable Function Behavior 📌 Why did my list change after function call? def modify(lst): lst.append(100) a = [1, 2] modify(a) print(a) Output: [1, 2, 100] 👉 Lists are mutable → changes reflect outside Now: def modify(x): x = x + 10 a = 5 modify(a) print(a) Output: 5 👉 Integers are immutable → no change outside 💡 Rule: Mutable → changes persist Immutable → changes don’t This confusion causes logic errors. #PythonBasics #FunctionConcepts #StudentClarity #python #clarity

This video discusses about features and syntax of library and builtin functions in Python. Full details of map, filter, shuffle, random, range, seed etc. functions have been explained.

Day 55/100 – #100DaysOfCode 🚀 Solved LeetCode #205 – Isomorphic Strings (Python). Today I practiced hashmap (dictionary) usage to check whether two strings follow the same pattern. Approach: 1) Create two hashmaps to store character mappings in both directions. 2) Traverse both strings together using zip(). 3) Check if the current mapping is consistent in both maps. 4) If any mismatch is found, return False. 5) Otherwise, update the mappings and continue. 6) If all mappings are valid, return True. Time Complexity: O(n) Space Complexity: O(n) Understanding how bidirectional mapping ensures consistency 💪 #LeetCode #Python #DSA #HashMap #Strings #ProblemSolving #100DaysOfCode