Dsa_100_Days_Challenge’s Post

Day 3: Practice more on two pointer technique 👉 Practice Problems 🔹Problem-1 https://lnkd.in/gxXymJxa 🔹Problem-2 https://lnkd.in/gN3rqHn5 🔹 Problem-3 https://lnkd.in/g5hPGQP9 🔹Problem-4 https://lnkd.in/gVn29AvY 🔹Problem-5 https://rb.gy/1sawn0 #dsa #100days_dsa_challenge Dsa_100_Days_Challenge

🔥 Day 5 of DSA Revision & Arsh DSA Sheet Challenge is DONE! 🔥 Today, I worked on the "Best Time to Buy and Sell Stock II" and "Subarray Sums Divisible by K" problems. These challenges helped me improve my array manipulation and number theory skills while focusing on finding the most efficient solutions. 💻💡 Excited to keep moving forward and tackle even more problems on this DSA journey. Let's keep pushing! 💪 Explore the tasks: https://lnkd.in/gSvqaSAQ && https://lnkd.in/gbPBtVqB #DSA #Day5 #CodingJourney #ArshDSASheet #ProblemSolving #leetcode

Day 39: On Dsa_100_Days_Challenge today i have practiced this problem problem: https://lnkd.in/guMJghJ7 #dsa #100daysofcode

16.04.2024 Day 4 of 100 days DSA challenge. Hey Everyone ! Today I solved a few very basic problems which helps in improving problem solving skills. 1. Counting the number of digits in an Integer. 2. Reverse a number. 3. Check for Palindrome. 4. GCD or HCF. 5. Armstrong Numbers. 6. Print all Divisors. 7. Check for prime. I polished all the basic concepts and improved my logical thinking by a little bit. I think I did most of the prerequisites required and I'll start with basic Recursion tomorrow. 𝘒𝘦𝘦𝘱 𝘵𝘩𝘦 𝘊𝘶𝘦 𝘢𝘯𝘥 𝘙𝘦𝘸𝘢𝘳𝘥, 𝘙𝘦𝘱𝘭𝘢𝘤𝘦 𝘵𝘩𝘦 𝘳𝘰𝘶𝘵𝘪𝘯𝘦.

How to revise DSA: - Look at a question - 100% confidence If you instantly can remember the way it is solved, skip - 70%, know the approach, try coding only the important bits and dry run against some cases - 50%, having some confusion in head, code and run - <30% treat it as new As simple as that & You're good to go 👍🏼

today is 1st day of 100 days of dsa I was able to solve easy-level question in leetcode finding longest common prefix #100daysofdsa

🚀 Day 08/30 DSA Challenge 🚀 1. Number of 1 Bits Approach Loop through Bits: Initialize a counter variable (count) to keep track of the number of set bits. Use a loop to iterate through each bit of the 32-bit representation of n. Check Set Bit: In each iteration, check if the least significant bit of n is set (equal to 1) using the bitwise AND operation (n & 1). If the least significant bit is set, increment the count. Right Shift: Right shift n by 1 position in each iteration to move to the next bit. Return Count: After the loop, return the final count, which represents the number of set bits in the binary representation of n. Complexity Time complexity: O(1) Space complexity: O(1) #leetcode #dsa #ProblemSolving

Day 53: On Dsa_100_Days_Challenge today i have practiced this problem Problem: https://lnkd.in/g7QHVrME #dsa #100daysofcode

🚀 Day 10/30 DSA Challenge 🚀 1. Valid Anagram Given two strings s and t, return true if t is an anagram of s, and false otherwise. An Anagram is a word or phrase formed by rearranging the letters of a different word or phrase, typically using all the original letters exactly once.   Example 1: Input: s = "anagram", t = "nagaram" Output: true Example 2: Input: s = "rat", t = "car" Output: false #leetcode #dsa #ProblemSolving

Day 83/100 Solving DSA questions 190)Search a 2D Matrix 191)Find Peak Element #dsa #leetcode