MD DANISH SHAKIL’s Post

Day 4 of #problemsolving in Leetcode Today's Challenge is to Solve the Longest Subarray With Maximum Bitwise AND #problemsolving LeetCode #completedtask

Day 15/100 #100DaysOfCode Challenge on LeetCode 🚀 Permutations-II "Optimized permutation generation by sorting the array and using a set to skip duplicate swaps, preventing redundant permutations. This avoids post-processing and ensures unique results during recursion." Feel free to connect on LeetCode https://lnkd.in/dKwbNgvU and share your progress, tips, and favorite problems #DrGViswanathan #VITBhopal #VITBhopalLion #LeetCode #DSA #100DaysOfCode

🐣Week 1 Day 1 of #Leetcode Today I Have Did Some Qustion Practices on leetcode This week, under the expert guidance of Love Babbar Sir ,Vishwa Mohan sir , Sandeepak Singh sir,Mithun S sir. Key Highlights: 1.🍇 Majority Elements. 2.🐍Merge Sorted Array. 3.🦐 Remove Duplicate Form Sorted Array. 4.🤿Rotate Array. This Qustion was incredibly informative, providing a strong foundation in Problem solving and how to use it effectively in real-world scenarios.

Day 7 of #100daysofcode Question: Maximum SubArray Approach: Iteratively find the maximum subarray sum by discarding negative subarrays and updating the overall maximum. Platform: LeetCode #day7 #drviswanathan #vitbhopal

LeetCode Biweekly Contest 134:-I successfully solved two question in leetcode Biweekly contest 134. Descriptio1:-Checks adjacent triples of colors and increments the count if they form an alternating group and iterating through the vector,returns the total count of alternating groups. Description2:-sorts enemy powers and iterates through them. If initial energy is less than the current power, it uses energy from the strongest enemy to defeat weaker ones. Otherwise, it calculates how many times it can defeat the current enemy and updates points and remaining energy.

#100daysofleetcodechalleng #problemsolving Day 21 Today's problem is " Next Permutation" Today Solved leetcode problem medium level leetcode problem no -.31 #problemsolving #leetcode problems #100daysofcodechallenge#problemsolving #2024

Day 18/100 #100DaysOfCode Challenge on LeetCode 🚀 1️⃣ Index of first occurrence in string The initial approach skips characters in main_string due to incorrect incrementing of i inside the inner loop. It also checks only the last character of key_string for a match, instead of comparing the entire substring. Feel free to connect on LeetCode https://lnkd.in/dKwbNgvU and share your progress, tips, and favorite problems #DrGViswanathan #VITBhopal #VITBhopalLion #LeetCode #DSA #100DaysOfCode

Day 96 of #100DayOfCodingChallenge: Permutations II ( LEETCODE || Problem 47 ) Given a collection of numbers, nums, that might contain duplicates, return all possible unique permutations in any order.   #100DaysOfCode #codingchallenges #Drgviswanathan #vitbhopal #leetcode #Cpp

🚀 Day 73 of 100: LeetCode Challenge - Swapping Nodes in a Linked List. 🔍 Problem: Today’s challenge is "Swapping Nodes in a Linked List" (LeetCode Problem 1721). The goal is to swap the k-th node from the beginning with the k-th node from the end of the list.

🚀 Leetcode Daily Challenge 📅 14th Mar 2024 Post Part-II (Intuition and Solution) Intuition: 1. As we iterate through the array, we maintain a running sum currSum. 2. The idea behind using a hashmap is to keep track of the frequencies of cumulative sums encountered so far. 3. Whenever currSum - goal is found in the hashmap, it means there exists a subarray whose sum is goal. We add the frequency of currSum - goal to the subarray_count. 4. By updating the hashmap with the current sum's frequency, we are essentially building a record of cumulative sums encountered so far. #comment the Time Complexity and Space Complexity for this approach. #dailycodingchallenge #leetcode #problem #solution