#dsawithpython 검색 결과

atulshady

2023. 6. 2.

Day2: It's June 2. Today I learnt about why big O Notation is used in industries and done some examples to find out order of growth of some snippet codes. #60dayschallage. #day2 #DsawithPython #LearningWithLeapfrog

MeShady__'s tweet image. Day2:
It's June 2. Today I learnt about why big O Notation is used in industries and done some examples to find out order of growth of some snippet codes.
#60dayschallage.
#day2 #DsawithPython
#LearningWithLeapfrog

Bhumi Pandey

@BhumiPandey06

. 7. 2.

LeetCode 344 : Reverse String Reverse the characters of a string in-place using O(1) space. Learned: Classic two-pointer swap Pythonic solution vs. interview-expected approach #TwoPointers #DSAwithPython @akshaymarch7

Bhumi Pandey

@BhumiPandey06

. 7. 3.

LeetCode 283 - Move Zeroes Move all 0s to the end of the array, keeping order of others. Used two-pointer approach: one scans, one swaps. Brute → Optimal (O(n), in-place). Teaches clean in-place logic and pointer control! #LeetCode #DSAwithPython #LearnInPublic #akshaysaini

Kamran Khan Alwi

@KhanKamranAlwi

. 5. 26.

🎯 Takeaways ✅ Reversing is key in many LL problems ✅ Use slow-fast for splitting ✅ Combine techniques → e.g., reverse + compare = palindrome check! 📅 Tomorrow: Merge lists + Add numbers #DevCommunity #CodingChallenge #DSAwithPython #LeetCode

Bhumi Pandey

@BhumiPandey06

. 7. 1.

Started my DSA grind again — this time with structured prep. Following Akshay Saini’s roadmap + Python for problem-solving. Kicked things off with Array-based questions from LeetCode. Learning brute → better → optimal Focused on interview mindset #DSAwithPython #AkshaySaini

Bhumi Pandey

@BhumiPandey06

. 7. 2.

LeetCode 88 – Merge Sorted Array Task: Merge two sorted arrays, in-place, with extra space at the end of one. Brute: Create a new array Optimal: Start filling from the back using two pointers #DSAwithPython #InPlaceAlgo #LeetCodeChallenge

Bhumi Pandey

@BhumiPandey06

. 7. 3.

LeetCode 485 - Max Consecutive Ones Find max number of consecutive 1s in a binary array. Simple pass with a counter → track & reset on 0. Great warm-up for sliding window & array traversal skills. #LearnInPublic #LeetCode #DSAwithPython

Bhumi Pandey

@BhumiPandey06

. 7. 4.

Recursion – Sum of Array Elements Final task of the day: Find sum of elements in an array using recursion. Pattern: sum(arr) = arr[0] + sum(arr[1:]) Base case: empty array = 0 Thinking in terms of base + subproblem #DSAwithPython #Recursion #LearningInPublic