Mystic Sniper

[Mystic Sniper @albion_codes]

@ShlokGS @ComeBackFPS @KunjRaut17 Yeah just get it dude just get it have your way enjoy bbg

[Mystic Sniper @albion_codes]

@RitumbharaB Would you be kind enough to drop you journey and routine including your exercises and diet as well my friend does pilates and all so I am asking for her

[Mystic Sniper @albion_codes]

@ShlokGS @ValorantUpdated @arbiterstudio @KunjRaut17 My man u got this hope u r the lucky 1 🛐

[Mystic Sniper @albion_codes]

@rnshrutii Which domain are you currently in or interested in? Let's connect

[Mystic Sniper @albion_codes]

Day 23 of pursuing DSA
Solved LeetCode problem No. 26:
Remove duplicates from sorted array-
brute force with TC- O(nlogn)
optimal with TC- O(n)
#DSA #LeetCode #CodingJourney #LearnInPublic #consistency

[Mystic Sniper @albion_codes]

Day 22 of pursuing DSA
Solved LeetCode Problem No. 88 - Merge Sorted Arrays with TC = O(m+n)
Problem No. 31 - Next Permutation with TC = O(n) with a unique and interesting logic and approach
#DSA #LeetCode #CodingJourney #LearnInPublic #consistency

[Mystic Sniper @albion_codes]

Day 21 of pursuing DSA
Solved LeetCode Problem No. 75- Sort Colors
1- Using counting sort (Two Pass Algo)
2- DNF (Dutch National Flag) Algo (One Pass Algo)
both having TC = O(n)
#DSA #LeetCode #CodingJourney #LearnInPublic #consistency

[Mystic Sniper @albion_codes]

Day 20 of pursuing DSA
Understood what is sorting, how bubbleSort, selectionSort, and insertionSort sorts the elements in ascending /descending order.
#DSA #CodingJourney #LearninginPublic #consistency

[Mystic Sniper @albion_codes]

Day 19 of pursuing DSA
Solved another variation of Book Allocation using binarySearch,
Aggressive Cow's problem with TC- O(n-logn)
similar logic with little bit of its own twists,
but challenging.
#DSA #CodingJourney #codingChallenge #ProblemSolving #learningInPublic

[Mystic Sniper @albion_codes]

Day 18 of pursuing DSA
Solved the Painters Problem = variation of Book Allocation
TC = O(log(n)*n)
The approach was similar but the logic was great.
#DSA #CodingJourney #codingChallenge #LearnInPublic #consistency

[Mystic Sniper @albion_codes]

Day 17 of pursuing DSA
Understood the the Book allocation problem using Binary Search . The most challenging question I had come across till now. Had a difficult time solving this question and in the handling of edge cases.
#DSA #CodingJourney #LearnInPublic #consistency

[Mystic Sniper @albion_codes]

@PurnimaaVats @LeetCode @geeksforgeeks @striver_79 Recently started out with DSA looking forward to the day when I am able to solve a POTD all by myself 💪🗿

[Mystic Sniper @albion_codes]

Day 16 of pursuing DSA
Solved LeetCode problem no. 540 = Single Element in Sorted Array using Binary Search approach with time complexity O(logn) and optimized the solution for the edge cases
#DSA #LeetCode #CodingJourney #LearnInPublic #consistency

[Mystic Sniper @albion_codes]

Day 15 of pursuing DSA
Solved 2 LeetCode problems using binary search concept.
Problem no. 33: Search in rotated sorted array with TC- O(logn)
Problem no.852: Peak index in mountain array with TC- O(logn)
#DSA #LeetCode #CodingJourney #consistency

[Mystic Sniper @albion_codes]

Day 14 of pursuing DSA
Understood the Binary Search algorithm, it's real like example, both iterative and recursive methods and their time and space complexity, discussed the optimization due to overflow.
#DSA #CodingJourney #LearninginPublic #consistency

[Mystic Sniper @albion_codes]

Day 13 of pursuing DSA
Understood concept of Pointers, calculating memory address, pointer to pointer reference, pass by reference using pointers & alias, dereference operator, NULL pointer, array pointer, pointer arithmetic.
#DSA #CodingJourney #LearninginPublic #consistency

[Mystic Sniper @albion_codes]

Day 12 of pursuing DSA
Solved the Product of Array Except self problem on LeetCode using 3 approaches
1 - Brute Force O(n^2)
2 - Optimal - TC = O(3n), SC = O(n)
3 - Optimal with reduced SC by avoiding extra storage arrays and TC = same
#DSA #LeetCode #CodingJourney #consistency

[Mystic Sniper @albion_codes]

Day 11 of pursuing DSA
Tackled and learned another concept of the container with most water which also problem number 11 on LeetCode. Was able yo figure out Brute Force approach by myself - O(n^2)
The new thing was the 2 pointer approach - O(n)
#DSA #LeetCode #Coding #consistency

[Mystic Sniper @albion_codes]

Day 11 of pursuing DSA
Understood Binary Exponentiation and used it on LeetCode Q. 50) Pow(x,n) with time complexity of O(logn).
Completed LeetCode Q. 121) Best Time to buy and sell stock to return Max Profit using O(n) time.
#DSA #CodingJourney #consistency #LeetCode

[Mystic Sniper @albion_codes]

Day 10 of pursuing DSA
Implemented Pair Sum question using:
1 Brute Force - O(n^2)
2 Two Pointer - O(n)
Completed Majority Element Problem on LeetCode using:
1 Brute Force - O(n^2)
2 Sorted Array - O(nlogn + n)
3 Moore's Voting - O(n)
#DSA #CodingChallenge #consistency #LeetCode