Suman Saha’s Post

𝗣𝘆𝘁𝗵𝗼𝗻 𝗗𝗮𝗶𝗹𝘆 𝗖𝗵𝗮𝗹𝗹𝗲𝗻𝗴𝗲 | 𝗛𝗮𝗰𝗸𝗲𝗿𝗥𝗮𝗻𝗸 – 𝗙𝗶𝗻𝗱 𝗮 𝗦𝘁𝗿𝗶𝗻𝗴 | 𝗗𝗮𝘆 𝟭𝟳 This Python question looks easy—and that’s why people fail it. Day 17 of my Python Daily Challenge 🚀 Today’s task sounded straightforward: 👉 Given a string 👉 Find how many times a substring appears Most people instantly think of .count() 😅 But interviews care about how you think 👇 • Overlapping substrings matter • Traversing left to right matters • Logic > shortcuts 💡 Interview pattern from Day 17: If you rely only on built-ins, you miss what the question is actually testing. Understanding 𝘀𝘁𝗿𝗶𝗻𝗴 𝘁𝗿𝗮𝘃𝗲𝗿𝘀𝗮𝗹 beats memorizing methods. Did you think of .count() first? Be honest 👇 #Python #HackerRank #DailyCoding #ProblemSolving #InterviewPrep #LearnInPublic #Consistency

𝗣𝘆𝘁𝗵𝗼𝗻 𝗗𝗮𝗶𝗹𝘆 𝗖𝗵𝗮𝗹𝗹𝗲𝗻𝗴𝗲 | 𝗛𝗮𝗰𝗸𝗲𝗿𝗥𝗮𝗻𝗸 – 𝗪𝗵𝗮𝘁’𝘀 𝗬𝗼𝘂𝗿 𝗡𝗮𝗺𝗲? | 𝗗𝗮𝘆 𝟭𝟱 This beginner Python problem reveals who understands functions. Day 15 of my Python Daily Challenge 🚀 Today’s task looked too easy: 👉 Read first name 👉 Read last name 👉 Print a greeting But interviews test more than output 👇 • Do you understand𝗳𝘂𝗻𝗰𝘁𝗶𝗼𝗻 𝗽𝗮𝗿𝗮𝗺𝗲𝘁𝗲𝗿𝘀? • Do you know when to return vs print? • Can you format strings cleanly and confidently? 💡 𝗜𝗻𝘁𝗲𝗿𝘃𝗶𝗲𝘄 𝗽𝗮𝘁𝘁𝗲𝗿𝗻 𝗳𝗿𝗼𝗺 𝗗𝗮𝘆 𝟭𝟱: Clean code isn’t about complexity. It’s about𝗰𝗹𝗲𝗮𝗿 𝗿𝗲𝘀𝗽𝗼𝗻𝘀𝗶𝗯𝗶𝗹𝗶𝘁𝘆 in functions. That’s why I’m revisiting Python fundamentals daily — because small concepts decide big outcomes. Have you ever confused print() and return() before? 👇 #Python #HackerRank #DailyCoding #ProblemSolving #InterviewPrep #LearnInPublic #Consistency

𝗣𝘆𝘁𝗵𝗼𝗻 𝗗𝗮𝗶𝗹𝘆 𝗖𝗵𝗮𝗹𝗹𝗲𝗻𝗴𝗲 | 𝗛𝗮𝗰𝗸𝗲𝗿𝗥𝗮𝗻𝗸 – 𝗦𝘁𝗿𝗶𝗻𝗴 𝗩𝗮𝗹𝗶𝗱𝗮𝘁𝗼𝗿𝘀 | 𝗗𝗮𝘆 𝟭𝟴 These 5 Python methods quietly decide many interview answers. Day 18 of my Python Daily Challenge 🚀 Today’s problem looked basic: 👉 Check if a string has letters 👉 Digits 👉 Uppercase 👉 Lowercase But interviews test how you check 👇 • Using any() vs looping manually • Understanding what each validator actually returns • Reading problem statements precisely 💡 𝗜𝗻𝘁𝗲𝗿𝘃𝗶𝗲𝘄 𝗽𝗮𝘁𝘁𝗲𝗿𝗻 𝗳𝗿𝗼𝗺 𝗗𝗮𝘆 𝟭𝟴: Built-in methods aren’t shortcuts. They’re 𝘀𝗶𝗴𝗻𝗮𝗹𝘀 that you understand the language. If you can explain why a method works, you’re already ahead. Which string method do you forget most often? 👇 #Python #HackerRank #DailyCoding #ProblemSolving #InterviewPrep #LearnInPublic #Consistency

𝗣𝘆𝘁𝗵𝗼𝗻 𝗜𝗻𝘁𝗲𝗿𝘃𝗶𝗲𝘄 𝗣𝗮𝘁𝘁𝗲𝗿𝗻𝘀 | 𝗶𝘁𝗲𝗿𝘁𝗼𝗼𝗹𝘀.𝗽𝗲𝗿𝗺𝘂𝘁𝗮𝘁𝗶𝗼𝗻𝘀() | 📅 𝗗𝗮𝘆 𝟮𝟲 If you’re writing 3 nested loops for permutations, stop. Day 26 of my Python interview prep journey 🚀 𝗧𝗼𝗱𝗮𝘆’𝘀 𝗰𝗵𝗮𝗹𝗹𝗲𝗻𝗴𝗲: 👉 Generate all permutations of a string 👉 Of fixed length k 👉 In lexicographic order Most people try to brute-force this with loops 😵💫 That’s where Python quietly flexes. 💡 Interview pattern from today: When the problem says “𝘢𝘭𝘭 𝘢𝘳𝘳𝘢𝘯𝘨𝘦𝘮𝘦𝘯𝘵𝘴” → 𝘵𝘩𝘪𝘯𝘬 𝘪𝘵𝘦𝘳𝘵𝘰𝘰𝘭𝘴.𝘱𝘦𝘳𝘮𝘶𝘵𝘢𝘵𝘪𝘰𝘯𝘴. from 𝗶𝘁𝗲𝗿𝘁𝗼𝗼𝗹𝘀 import 𝗽𝗲𝗿𝗺𝘂𝘁𝗮𝘁𝗶𝗼𝗻𝘀 𝗪𝗵𝘆 𝘁𝗵𝗶𝘀 𝗺𝗮𝘁𝘁𝗲𝗿𝘀 𝗶𝗻 𝗶𝗻𝘁𝗲𝗿𝘃𝗶𝗲𝘄𝘀: • Shows knowledge of Python’s standard library • Avoids unnecessary complexity • Reads like intent, not effort Python rewards clarity over cleverness. Knowing what tool to use is the real skill. 📌 𝗗𝗮𝘆 𝟮𝟲 𝘁𝗮𝗸𝗲𝗮𝘄𝗮𝘆: If the problem smells like combinations or arrangements — 👉 itertools is your first stop. #Python #HackerRank #InterviewPrep #ProblemSolving #DailyCoding #LearnInPublic #Consistency

𝗣𝘆𝘁𝗵𝗼𝗻 𝗗𝗮𝗶𝗹𝘆 𝗖𝗵𝗮𝗹𝗹𝗲𝗻𝗴𝗲 | 𝗛𝗮𝗰𝗸𝗲𝗿𝗥𝗮𝗻𝗸 – 𝗶𝘁𝗲𝗿𝘁𝗼𝗼𝗹𝘀.𝗽𝗿𝗼𝗱𝘂𝗰𝘁() | 𝗗𝗮𝘆 𝟮𝟱 Nested loops are optional if you know this. Day 25 of my Python Daily Challenge 🚀 𝗧𝗼𝗱𝗮𝘆’𝘀 𝘁𝗮𝘀𝗸: 👉 Generate all pairs from two lists 👉 Maintain correct order 👉 No missing combinations Most people instantly write nested loops. And yes — that works. But interviews reward awareness, not effort 👇 💡 𝗜𝗻𝘁𝗲𝗿𝘃𝗶𝗲𝘄 𝗽𝗮𝘁𝘁𝗲𝗿𝗻 𝗳𝗿𝗼𝗺 𝗗𝗮𝘆 𝟮𝟱: • Cartesian product is a concept, not just loops • itertools.product() expresses intent clearly • Cleaner code = stronger signal to interviewers Python isn’t about writing more code. It’s about knowing what already exists. Do you still default to nested loops for combinations? 👀 #Python #HackerRank #DailyCoding #ProblemSolving #InterviewPrep #LearnInPublic #Consistency

𝗣𝘆𝘁𝗵𝗼𝗻 𝗗𝗮𝗶𝗹𝘆 𝗖𝗵𝗮𝗹𝗹𝗲𝗻𝗴𝗲 | 𝗛𝗮𝗰𝗸𝗲𝗿𝗥𝗮𝗻𝗸 – 𝗦𝘁𝗿𝗶𝗻𝗴 𝗦𝗽𝗹𝗶𝘁 & 𝗝𝗼𝗶𝗻 | 𝗗𝗮𝘆 𝟭𝟰 This Python string task looks trivial—until interviews ask why. Day 14 of my Python Daily Challenge 🚀 Today’s challenge was all about strings: 👉 Split a sentence 👉 Modify the format 👉 Join it back cleanly Sounds easy… until you realize 👇 • split() returns a list, not a string • join() works only on 𝗶𝘁𝗲𝗿𝗮𝗯𝗹𝗲𝘀 𝗼𝗳 𝘀𝘁𝗿𝗶𝗻𝗴𝘀 • Order and delimiter matter more than people think 💡 𝗜𝗻𝘁𝗲𝗿𝘃𝗶𝗲𝘄 𝗽𝗮𝘁𝘁𝗲𝗿𝗻 𝗳𝗿𝗼𝗺 𝗗𝗮𝘆 𝟭𝟰: Many bugs come from 𝘁𝘆𝗽𝗲 𝗰𝗼𝗻𝗳𝘂𝘀𝗶𝗼𝗻, not complex logic. If you understand how data changes form, string problems become simple. Have you ever mixed up split() and join() in an interview? 👇 #Python #HackerRank #DailyCoding #ProblemSolving #InterviewPrep #LearnInPublic #Consistency

𝗣𝘆𝘁𝗵𝗼𝗻 𝗗𝗮𝗶𝗹𝘆 𝗖𝗵𝗮𝗹𝗹𝗲𝗻𝗴𝗲 | 𝗛𝗮𝗰𝗸𝗲𝗿𝗥𝗮𝗻𝗸 – 𝗰𝗼𝗹𝗹𝗲𝗰𝘁𝗶𝗼𝗻𝘀.𝗖𝗼𝘂𝗻𝘁𝗲𝗿() | 𝗗𝗮𝘆 𝟮𝟯 This Python tool replaces an entire frequency loop. Day 23 of my Python Daily Challenge 🚀 𝗧𝗼𝗱𝗮𝘆’𝘀 𝗽𝗿𝗼𝗯𝗹𝗲𝗺 𝗳𝗲𝗹𝘁 𝗽𝗿𝗮𝗰𝘁𝗶𝗰𝗮𝗹: 👉 Track shoe sizes 👉 Handle multiple customers 👉 Calculate total earnings 𝘠𝘰𝘶 𝘤𝘰𝘶𝘭𝘥 𝘴𝘰𝘭𝘷𝘦 𝘵𝘩𝘪𝘴 𝘸𝘪𝘵𝘩 𝘭𝘰𝘰𝘱𝘴 𝘢𝘯𝘥 𝘥𝘪𝘤𝘵𝘪𝘰𝘯𝘢𝘳𝘪𝘦𝘴… or you could think like Python 👇 𝗧𝗵𝗲 𝗿𝗲𝗮𝗹 𝗶𝗻𝘁𝗲𝗿𝘃𝗶𝗲𝘄 𝗹𝗲𝘀𝘀𝗼𝗻: • Counter handles frequency cleanly • Updates reflect real-world inventory logic • Less code ≠ less clarity 💡 𝗜𝗻𝘁𝗲𝗿𝘃𝗶𝗲𝘄 𝗽𝗮𝘁𝘁𝗲𝗿𝗻 𝗳𝗿𝗼𝗺 𝗗𝗮𝘆 𝟮𝟯: Strong candidates know when to stop reinventing logic and start using the right data structure. That’s how clean, scalable solutions are written. Have you used Counter in real problems before? 👇 #Python #HackerRank #DailyCoding #ProblemSolving #InterviewPrep #LearnInPublic #Consistency

✨ New Python Tutorial is Live! ✨ 🔍 Ever wondered how Python finds emails, phone numbers, or patterns hidden inside text? That magic starts with Regular Expressions (Regex). In this new video from my Python Full Course playlist on All About CS, we dive into Python Regex Basics (Part 1) — explained step by step, with real use cases and live coding. 🔑 What you’ll learn in this video: ✅ What Regular Expressions really are (without fear 😄) ✅ How to use Python’s re module ✅ Special characters & quantifiers that unlock regex power ✅ Practical examples like word extraction & email validation ✅ A challenge task to test your understanding 📌 Perfect for beginners, interview prep, and anyone dealing with text, data cleaning, or validation in Python. 🎥 Watch the video here 👉 https://lnkd.in/df-vnNPv 💬 Drop a comment if Regex ever confused you — or tell me which Python topic you want next! #python #regex #programming #learnpython #codingskills #softwaredevelopment #AllAboutCS #pythontutorial #developerjourney

🚀 Python with DSA – Day 51 Today’s focus: Recursion & Backtracking (Subsets – Basics) 🧠🐍 ✅ Revised recursion fundamentals (base case & recursive call) ✅ Understood backtracking as try → explore → undo ✅ Solved the Subsets problem using include/exclude strategy ✅ Debugged a common mistake: parameter mismatch in recursive calls ✅ Learned how to explain recursion clearly in interviews 💡 Key takeaway: For every element, we have two choices – include or exclude. This simple idea builds powerful solutions in backtracking. 📌 On to the next step: handling duplicates & advanced backtracking problems. Consistency > Motivation. One day at a time. 💪 #Python #DSA #Recursion #Backtracking #LearningInPublic #LeetCode #ProblemSolving #SoftwareEngineering

LeetCode #128 – Longest Consecutive Sequence | Python Implementation I implemented a HashSet-based approach to find the longest consecutive sequence in O(n) time without sorting. The key insight is identifying sequence starts: if a number has no left neighbor (n-1 not in set), it marks the beginning of a potential sequence. From there, we count consecutive elements by checking n+1, n+2, and so on until the sequence breaks. This avoids redundant work by only initiating sequences from their true starting points. This pattern is essential in time-series analysis, event stream processing, and database query optimization for range detection. Key Takeaway: The "sequence start" check is what makes this O(n) instead of O(n²). Each element is visited at most twice: once in the outer loop and once during sequence counting. Recognizing when to skip unnecessary iterations is crucial for optimizing nested-loop patterns. Time: O(n) | Space: O(n) #LeetCode #DataStructures #Python #HashSet #Arrays #CodingInterview #ProblemSolving #SoftwareEngineering