Chinmay S N

All Paid Courses — 100% FREE (Part 3) I'm giving you access to 81+ free courses. 👌👇 1. Social Media Marketing 2. Android App Development 3. Facebook Ads 4. SEO 5. Google Ads 6. Content Writing 7. Graphic Designing 8. Video Editing 9. Web Development 10. Hacking and more with 73+ courses. To get, just: - Comment "SEND" - Like & Retweet - Follow me (so that I can DM)

@DivyanshT91162 Send

Fix Pine Script Errors Many Pine Script scripts fail due to small logic or execution issues. I help traders debug, fix errors, stop repainting, and build clean custom indicators and strategies. Post your code if you need help.

Portfolio's live Have a look chinmaysn.vercel.app (Open to suggestions) ✌️🙂

@abdool_moh csneelagiri2020@gmail.com

Every one should read these 3 books atleast once in their lifetime. You can start in 2026. Drop your email if you want soft copies.

@Cipher_twt Hi

Twitter is cool. But it’s 100x better when you connect with people who code If you’re into tech, AI, DSA, Web development, Web3 or programming, say hi

Hi

Day 49 of #gfg160 📊 Counted subarrays with sum = k using prefix sum + hashmap in O(n)! Tracked (currSum - k) freq to find valid subarrays at each step 💡 #geekstreak2025 @geeksforgeeks

@Archiagg26 meeee

Anyone interested in doing a national level hackathon?

@Archiagg26 lets connect? linkedin.com/in/chinmaysn

Hi! I’m looking forward to #connect with people who are interested in :- 👨‍💻 DSA 💻 Leetcode 💼 MERN Stack 🤖 AIML ✅ Software Development #letsconnect and grow

I’m grateful to IntrnForte for the opportunity to work on a real-world machine learning project that strengthened my skills in classification, model evaluation, and deployment. Github: github.com/ChinmaySN/cust…

Day 47 of #gfg160 🧠 🔍 Longest Consecutive Subsequence in O(n)? ✔ Convert to set ✔ Skip non-starters ✔ Count streaks forward Simple, clean & linear! #geekstreak2025 @geeksforgeeks

Day 46 of #gfg160 💻 Union of 2 arrays with duplicates Python’s set FTW—fast, readable, elegant. #geekstreak2025 @geeksforgeeks

Day 45 of #gfg160 Problem: Find the intersection of 2 arrays (no duplicates). 💡 Convert to sets & loop once for clarity + speed. #geekstreak2025 @geeksforgeeks

Day 44 of #gfg160 Back from sem exams & solved "Find All Triplets with Zero Sum" 💥 Used hashing to avoid O(n³) — tracked indices to find valid -(arr[j]+arr[k]). #geekstreak2025 @geeksforgeeks

Day 43 of #gfg160 Missed a few days due to internals — back now! 💡Count pairs with sum = target using a hash map. ❗Use count += hmap[target - arr[i]] not count += 1 to capture all valid duplicates! @geeksforgeeks #geekstreak2025

Day 42 of #gfg160 💡 Two Sum with a twist: return indices if a valid pair exists. ✅ Use a hash map for O(1) lookups 🔍 Check if target - arr[i] exists and index ≠ i ⏱️ Time: O(n), Space: O(n) #geekstreak2025 @geeksforgeeks

Day 41 of #gfg160 💡 Problem: Set Matrix Zeroes Use the 1st row & column as flags to track 0s and avoid extra space. Watch out for the 0th row/col — track them with flags separately! 🧠 Space: O(1) #geekstreak2025 @geeksforgeeks

Day 40 of #gfg160 🔍 Problem: Search in a strictly sorted 2D matrix 💡 Logic: Check if x lies within a row's bounds If yes, do a binary search Early return = no wasted checks! ⏱️ TC: O(n + log m) #geekstreak2025 @geeksforgeeks