Aniruddha Patil’s Post

🔍 Exciting Achievement from Day 3 of the 30 Days of Coding Contest with TCP Club, NIT Raipur! 🔍 I'm thrilled to announce that I've successfully tackled the DSA question presented on Day 3 of the coding contest organized by TCP Club at NIT Raipur. 🌟 The challenge was to find the missing number from an array. In solving this problem, I delved into the fascinating world of bitwise manipulation and utilized the XOR operator to efficiently find the missing element in the array. 💡💻 This experience not only honed my problem-solving skills but also expanded my knowledge of advanced algorithms. Participating in this contest has been an enriching journey of continuous learning and growth. 🚀 Looking forward to more exciting challenges ahead and further exploration of the world of coding! 💪🌱 #30daysofcodewithTCP2024 #TCPNITRR2024 #codeustavanitrr2023 #DSA #CodingContest #ProblemSolving #BitwiseManipulation Turing Club Of Programmers

🎉 Exciting Achievement from Day 5 of the 30 Days of Coding Contest with TCP Club, NIT Raipur! 🎉 I'm thrilled to announce that I've successfully tackled the DSA question presented on Day 5 of the coding contest organized by TCP Club at NIT Raipur. 🌟 The challenge was to sort an array containing 0s, 1s, and 2s. In solving this problem, I delved into the intricacies of accessing and modifying elements within an array, devising an efficient algorithm to sort the array in linear time. 💡💻 This experience not only honed my problem-solving skills but also deepened my understanding of array manipulation in DSA. Participating in this contest has been an enriching journey of continuous learning and growth. 🚀 Looking forward to more stimulating challenges ahead and further exploration of the fascinating world of coding! 💪🌱 #30daysofcodewithTCP2024 #TCPNITRR2024 #codeustavanitrr2023 #DSA #CodingContest #ProblemSolving #ArrayManipulation Turing Club Of Programmers

🚀 Day 18 of the TCP Coding Challenge at NIT Raipur 2024! 🌟 Today's Challenge: 215. Kth Largest Element in an Array. 🔗 Link : (https://lnkd.in/dD8zfXmd). ✅ Successfully Completed! #TCPCodingChallenge #NITRaipur Let's keep coding! 💻💡 #30DaysOfCodeWithTCP2024 #CodeUtsavNitRR2024 🎉 #TCPNITRR2024

🎉 Exciting Update from Day 7 of the 30 Days of Coding Contest with TCP Club, NIT Raipur! 🎉 I'm thrilled to announce that I've successfully tackled the DSA question presented on Day 7 of the coding contest organized by TCP Club at NIT Raipur. 🌟 The challenge was to find the indexes of the first and last occurrences of a given element X in a sorted array with possibly duplicate elements. This problem provided an excellent opportunity to deepen my understanding of the Binary Search algorithm. By efficiently implementing Binary Search and handling duplicate elements, I was able to find the desired indexes with optimal time complexity. Binary Search is a fundamental algorithm known for its efficiency in searching sorted arrays, and this problem further reinforced its importance in problem-solving. Participating in this contest has been a fantastic learning experience, allowing me to sharpen my skills and gain valuable insights into various DSA concepts. Looking forward to more intriguing challenges ahead and continued growth in the world of coding! 💻💡 #30daysofcodewithTCP2024 #TCPNITRR2024 #codeustavanitrr2024 #DSA #BinarySearch #ProblemSolving #CodingContest Turing Club Of Programmers

📚 Exciting News from Day 4 of the 30 Days of Coding Contest with TCP Club, NIT Raipur! 📚 I'm thrilled to share that I've successfully cracked the DSA question presented on Day 4 of the coding contest organized by TCP Club at NIT Raipur. 🌟 The challenge was to determine if a given string is an acronym of words. In solving this problem, I delved into the intricacies of accessing elements in an array of strings, devising an efficient algorithm to check for acronym validity. 💡💻 This experience not only enhanced my problem-solving abilities but also deepened my understanding of string manipulation in DSA. Participating in this contest has been an enriching journey of continuous learning and growth. 🚀 Looking forward to more stimulating challenges ahead and further exploration of the fascinating world of coding! 💪🌱 #30daysofcodewithTCP2024 #TCPNITRR2024 #codeustavanitrr2023 #DSA #CodingContest #ProblemSolving #StringManipulation Turing Club Of Programmers

🚀 Day 15 of the TCP Coding Challenge at NIT Raipur 2024! 🌟 Today's Challenge: 141. Linked List Cycle 🔗 Link : (https://lnkd.in/d92YhRfQ). ✅ Successfully Completed! Approach :: Using Fast and Slow Pointers (Floyd's Cycle Detection) #TCPCodingChallenge #NITRaipur Let's keep coding! 💻💡 #30DaysOfCodeWithTCP2024 #CodeUtsavNitRR2024 🎉 #TCPNITRR2024

I am incredibly proud to announce the successful completion of the "Problem Solving Through Programming in C " course offered by National Programme on Technology Enhanced Learning (NPTEL) NPTEL which is an initiative by seven Indian Institutes of Technology (IIT Bombay, Delhi, Guwahati, Kanpur, Kharagpur, Madras and Roorkee) and Indian Institute of Science (IISc)🏆💼. This comprehensive program has equipped me with a solid foundation in C programming and advanced coding techniques. #coding #certification #CProgramming

🚨 Update from Day 8/30 of the TCP Club, NIT Raipur Coding Contest! 🚨 Encountered a tough problem: determining the maximum days to make 'm' bouquets. Tried brute force with O(n^2) complexity, but hit Time Limit Exceeded due to large inputs. Next step? Optimizing with Binary Search! Stay tuned as I tackle this challenge head-on. 💪💻 #30daysofcodewithTCP2024 #TCPNITRR2024 #codeustavanitrr2024 #ProblemSolving #CodingContest #BinarySearch rch Turing Club Of Program

🚀 Day 17 of the TCP Coding Challenge at NIT Raipur 2024! 🌟 Today's Challenge: Implement different operations on a queue q . 🔗 Link : (https://lnkd.in/dUkADNVp). ✅ Successfully Completed! #TCPCodingChallenge #NITRaipur Let's keep coding! 💻💡 #30DaysOfCodeWithTCP2024 #CodeUtsavNitRR2024 🎉 #TCPNITRR2024

🚀 Exciting Update from Day 6 of the 30 Days of Coding Contest with TCP Club, NIT Raipur! 🚀 I'm thrilled to share that I've successfully tackled the DSA question presented on Day 6 of the coding contest organized by TCP Club at NIT Raipur. 🌟 The challenge was to sort an array using the Merge Sort algorithm. Here are the steps to sort an array using Merge Sort: 1. **Divide**: Divide the unsorted array into two halves recursively until each sub-array contains only one element. 2. **Conquer**: Merge the divided sub-arrays back together in a sorted manner. This is done by comparing elements from the two sub-arrays and placing them in sorted order into a temporary array. 3. **Combine**: Repeat the merging process until all sub-arrays are merged into a single sorted array. Merge Sort is a classic example of a divide-and-conquer algorithm, known for its stability and efficient time complexity. Time Complexity: Merge Sort has a time complexity of O(n log n), where n is the number of elements in the array. This makes it one of the most efficient sorting algorithms, especially for large datasets. Space Complexity: Merge Sort has a space complexity of O(n) due to the additional space required for the temporary array used in the merging process. Participating in this contest has been an enriching journey of continuous learning and growth. 🌱 Looking forward to more stimulating challenges ahead and further exploration of the fascinating world of DSA! 💻💡 #30daysofcodewithTCP2024 #TCPNITRR2024 #codeustavanitrr2024 #DSA #CodingContest #MergeSort #ProblemSolving Turing Club Of Programmers