Sujay Kumar KS

Hello X 👋 I'm a Cloud Engineer learning Python to move toward AI and automation. Starting today I'll share what I learn every day. Day 10 already completed 🐍 Follow along if you're learning Python too. #Python #LearnInPublic

This is Day 19, not 18

Day 18 - Adv. Recursion What I learnt today is: *How to use recursion properly *How to tackle recursion problems 1. Print All Substrings 2. Sum of List 3. Check Palindrome #Python #BuildInPublic #AI

Backtracking Imagine you are in a maze, you go in one way, if that path is wrong, you revert and choose other path i.e Backtracking. Steps : 1. Choose (take a step) 2. Explore (recursive call) 3. Un-choose (undo step) *Needed when there are multiple possibilities.

3. Check Palindrome *If length of word is 1 or less than 1, then it it is pallindrome. *Compare first element with last element, if equal, then recursively goto inner elements and repeat comparing until middle element. *If word is same from bot sides, it is Pallindrome.

@vinx_codes Done

@sujay15012003 Fb

Looking to connect with people in tech Whether you're into: Frontend • Backend • Full Stack DevOps • AI/ML • Data Science UI/UX • Freelancing • Startups IF YOU'RE INTO TECH... LET'S CONNECT

Example - 3 : Pallindrome using Recursion *Check if 1st and last element are same * Similarly, check for 2nd and last second element till you appear to mid element. * Recursively cut down the length of list from both side. Eg : s = "madam" s[1:-1] = "ada"

Using similar method Example - 2 : Sum of List elements Keep the 1st element, and recursively call remaining elements until last element and add them.

Day 18 of my Python journey 🐍 Third Day of learning Function and Recursion... It is complicated topic in Python. This is how I learnt it. This is where most beginners struggle 📷#Python #BuildInPublic #AI

Example - 3 : Pallindrome using Recursion *Check if 1st and last element are same * Similarly, check for 2nd and last second element till you appear to mid element. * Recursively cut down the length of list from both side. Eg : s = "madam" s[1:-1] = "ada"

Using similar method Example - 2 : Sum of List elements Keep the 1st element, and recursively call remaining elements until last element and add them.

Example - 1: Sum of Numbers Combination of 3 steps : 1. digit = num % 10 [Gives remainder] 2. total += digit [Summation] 3. num = num // 10 [Gives floor quotient]

1. Recursion = 3 Simple Rules Every problem has: • Base case (where it stops) • Work (what to do now) • Recursive call (smaller problem) 👉 That’s it. Everything fits this pattern.

🟡 3️⃣ Factorial (Recursion) Problem: Factorial of n = n × (n-1) × (n-2) ... × 1 Example: 5! = 5 × 4 × 3 × 2 × 1 = 120

🟢 2️⃣ Maximum of 3 Numbers: Find largest among 3 numbers Logic: Compare step by step Explanation: Check who is bigger than the other two Return that number 👉 Think like: “Who is the strongest among 3?”

Day 17 of my Python journey 🐍 Today was tough… but powerful. I started learning: • Functions (properly) • Recursion This is where coding becomes real problem solving. I’m using AI to learn faster 🚀 Here’s what I learned 👇🧵 #Python #BuildInPublic #AI