Yati Gautam’s Post

Excited to share that I’ve successfully finished one of the projects of my internship at Codexcue! 🚀 During those 7 days, I had the opportunity to work on ✉️ Spam Email Classification project: Developing a classifier to distinguish between spam and non-spam emails. Reflection: Working on the Spam Email Classification project was both challenging and rewarding, providing invaluable insights into practical applications of into practical applications of machine learning for text classification. My main objective was to build a classifier capable of distinguishing spam emails from legitimate ones.Focused on cleaning and transforming the raw text to data. Using techniques such as Tokenization, TF-IDF Vectorization, and removal of stopwords.As well as Model Selection ,Experimentation & Evaluation Metrics. https://lnkd.in/gUQEbPHS #MachineLearning #DataScience #Internship #CareerGrowth #Codexcue #ArtificialIntelligence

🚀 Days 15 & 16 of My 45-Day DSA Challenge 🚀 The past two days have been an exhilarating deep dive into advanced problem-solving techniques! 🎯 I tackled challenges involving sliding windows, double pointers, greedy algorithms, and dynamic programming from Arsh Goyal's DSA sheet. Each of these areas presented unique problems that tested and expanded my understanding of these essential concepts. I'm thrilled with the progress and can't wait to see where this journey takes me next! 🔗 Check out my solutions here: https://lnkd.in/gh3WVkVS #CrackYourInternship #CrackYourPlacement #ArshDSASheet #DSAChallenge

🚀 Day 2 of My 45-Day DSA Challenge 🚀 I'm delighted to share that I've completed the second day of my challenge, tackling the following three problems on LeetCode from the curated DSA sheet by Arsh Goyal: 1. Merge Sorted Array (Problem 88) Concepts: Arrays, Two Pointers Solution: Merged two sorted arrays by iterating from the end, ensuring efficient in-place merging. 2. Majority Element (Problem 169) Concepts: Arrays, Hash Maps, Boyer-Moore Voting Algorithm Solution: Approach 1: Used a hash map to count frequencies and identify the majority element. Approach 2: Implemented the Boyer-Moore Voting Algorithm to efficiently find the majority element with linear time complexity. 3. Move Zeroes (Problem 283) Concepts: Arrays, Two Pointers Solution: Moved all non-zero elements to the front of the array while keeping their relative order, then filled the remaining positions with zeros. Looking forward to continuing this journey and sharing more updates! 💪 GitHub repo : https://lnkd.in/gh3WVkVS #CrackYourInternship #CrackYourPlacement #ArshDSASheet

🚀 Day 13 of My 45-Day DSA Challenge 🚀 Today was a productive day focusing on searching, sorting, and cycle detection in graphs from the dsa sheet of Arsh Goyal! Each problem was a great exercise in applying algorithms and deepening my understanding of core concepts. Looking forward to tackling more challenges and making further progress! 🔗 GitHub repo : https://lnkd.in/gh3WVkVS #CrackYourInternship #CrackYourPlacement #ArshDSASheet #DSAChallenge

#connections #Day 3 DSA Sheet by Arsh I have to consistently solve 4 to 5 problems in a day to fulfil the challenge's criteria. This opportunity will help me to increase my practice in DSA. The level of questions is excellent. Why join? Joining the DSA Sheet by Arsh Goyal Bhaiya is a significant step towards enhancing our problem-solving skills and deepening our understanding of data structures and algorithms. This structured approach provides a comprehensive set of high-quality questions that challenge us to think critically and apply various techniques effectively. By committing to solving 4 to 5 problems daily, I aim to cultivate a consistent practice routine, which is crucial for mastering DSA concepts. Engaging with this challenge not only helps me track my progress but also fosters a strong foundation for future coding interviews and competitive programming. Participating in this challenge is an excellent opportunity to improve my skills in a focused and disciplined manner. Today I solved 4 problems 1. 122. Best Time to Buy and Sell Stock II===> Leetcode 2. 974. Subarray Sums Divisible by K=====> Leetcode 3. 26. Remove Duplicates from Sorted Array===> Leetcode 4. 11. Container With Most Water===> Leetcode (Took help from Youtube) My GitHub repo- https://lnkd.in/gfEahC9S #CrackYourInternship #CrackYourPlacement

I'm taking on the #CrackYourInternship #CrackYourPlacement Challenge! Over the next 45-60 days, I'm going to be laser-focused on leveling up my Data Structures and Algorithms (DSA) skills. I'll be tackling 4+ questions DAILY from the renowned DSA Sheet by Arsh, a treasure trove of 280+ questions frequently asked in interviews at top product-based companies. Why am I doing this? Sharpen my DSA problem-solving abilities & stay on track and motivated with daily practice. Want to see my progress? Check out my GitHub repos: https://lnkd.in/ePRG5fsw Follow my LeetCode profile: https://lnkd.in/eegiGZfe Follow my GFG profile: https://lnkd.in/exxfsqiT Whether you're prepping for internships or placement, or just want to improve your coding skills, I invite you to join me on this journey! Let's #CrackYourInternship and #CrackYourPlacement together! #DSA #CodingChallenge #InterviewPrep #TechCareer #ArshDSASheet #GitHub #BuildInPublic #TechCommunity #LearningJourney #ReviseWithArsh

🚀 Day 5 of My 45-Day DSA Challenge 🚀 I'm delighted to share that I've completed the fifth day of my challenge, tackling the following three problems on LeetCode from the curated DSA sheet by Arsh Goyal. 1. Remove Duplicates from Sorted List (Problem 83) Concepts: linked list , pointers , loop Solution: The approach iterates through the linked list, comparing each node with its next node. If duplicate nodes are found, the next node is deleted and the current node's next pointer is updated; otherwise, it moves to the next node. 2. Remove Linked List Elements (Problem 203) Concepts: linked list , pointers , loops Solution: The approach iterates through the linked list, first removing all nodes from the head that have the given value val. Once the head is correctly positioned, it iterates through the rest of the list, removing any subsequent nodes with the value val by updating pointers to bypass the deleted nodes. Looking forward to continuing this journey and sharing more updates! 💪 GitHub repo : https://lnkd.in/gh3WVkVS #CrackYourInternship #CrackYourPlacement #ArshDSASheet

🚀 Day 10-11 of My 45-Day DSA Challenge 🚀 Here's the summary of the problems solved in these two days from Arsh Goyal DSA sheet. 1. Binary Tree Inorder Traversal (Problem 94) Concepts: trees, tree traversal-dfs , recursion 2. Symmetric Tree (Problem 101) Concepts: trees, tree traversal , bfs , queue , recursion 3. Maximum Depth of Binary Tree (Problem 104) Concepts: trees , depth-first search 4. Convert Sorted Array to Binary Search Tree (Problem 108) Concepts: trees , creating tree 5. Balanced Binary Tree (Problem 110) Concepts: trees ,recursion 6. Path Sum (Problem 112) Concepts: trees , recursion 7. Invert Binary Tree (Problem 226) Concepts: trees , recursion 8. Sum of Left Leaves (Problem 404) Concepts: trees , recursion Looking forward to continuing this journey and sharing more updates! 💪 GitHub repo : https://lnkd.in/gh3WVkVS #CrackYourInternship #CrackYourPlacement #ArshDSASheet

#connections #Day 4 DSA Sheet by Arsh I have to consistently solve 4 to 5 problems daily to fulfil the challenge's criteria. This opportunity will help me to increase my practice in DSA. The level of questions is excellent. Why join? Joining the DSA Sheet by Arsh Goyal Bhaiya is a significant step towards enhancing our problem-solving skills and deepening our understanding of data structures and algorithms. This structured approach provides a comprehensive set of high-quality questions that challenge us to think critically and apply various techniques effectively By committing to solving 4 to 5 problems daily, I aim to cultivate a consistent practice routine, which is crucial for mastering DSA concepts. Engaging with this challenge helps me track my progress and fosters a strong foundation for future coding interviews and competitive programming. Participating in this challenge is an excellent opportunity to improve my skills in a focused and disciplined manner. Today I solved 4 problems 1. 54. Spiral Matrix===> Leetcode (Took help from Youtube) 2. 560. Subarray Sum Equals K =====> Leetcode 3. 1423. Maximum Points You Can Obtain from Cards===> Leetcode 4. 18. 4Sum===> Leetcode (Took help from Youtube) 5. 15. 3Sum ===> Leetcode (Took help from Youtube) My GitHub repo- https://lnkd.in/gfEahC9S #CrackYourInternship #CrackYourPlacement

🚀 Day 12 of My 45-Day DSA Challenge 🚀 Here's the summary of the problems that I solved today from Arsh Goyal 's DSA sheet. 1. Same Tree (Problem 100) Concepts: trees, tree traversal , recursion 2. Binary Tree Paths (Problem 257) Concepts: trees, tree traversal-dfs , recursion 3. Minimum Absolute Difference in BST (Problem 530) Concepts: trees, in-order traversal , recursion 4. Diameter of Binary Tree (Problem 543) Concepts: trees, tree traversal , recursion 5. Subtree of Another Tree (Problem 572) Concepts: trees, tree traversal , recursion 6. Merge Two Binary Trees (Problem 617) Concepts: trees, tree traversal , recursion 7. Range Sum of BST (Problem 938) Concepts: trees, tree traversal , recursion 8. Count BST nodes that lie in a given range (gfg) Concepts: trees, tree traversal , recursion Looking forward to continuing this journey and sharing more updates! 💪 GitHub repo : https://lnkd.in/gh3WVkVS #CrackYourInternship #CrackYourPlacement #ArshDSASheet