Sugash
@sugash.bsky.social
My God Evolves✨
Software Dev | Tech enthusiast | Movie Reviewer | Coder | 22
Software Dev | Tech enthusiast | Movie Reviewer | Coder | 22
X users (formerly called twitter ) please don't come to bluesky.
January 12, 2025 at 4:20 AM
X users (formerly called twitter ) please don't come to bluesky.
Merry Christmas ! Have a great #Christmas eve 🎄🎁
December 25, 2024 at 12:30 PM
Merry Christmas ! Have a great #Christmas eve 🎄🎁
Rotate Image | Rotate Matrix | #GFG #GFGPOTD #CodeChallenge #100DaysofCode
Explanation: www.youtube.com/watch?v=ktuh...
Explanation: www.youtube.com/watch?v=ktuh...
December 21, 2024 at 5:59 PM
Rotate Image | Rotate Matrix | #GFG #GFGPOTD #CodeChallenge #100DaysofCode
Explanation: www.youtube.com/watch?v=ktuh...
Explanation: www.youtube.com/watch?v=ktuh...
December 21, 2024 at 10:39 AM
#Day5 #GFGPOTD #GFG
Kth element of two arrays ,my brute force approach will be joining the two arrays and then sort them and return the kth element index and this comes time complexity of O((n+m)⋅log(n+m) but using binary search we can reduce this time complexity and optimise it .
#100DaysofCode
Kth element of two arrays ,my brute force approach will be joining the two arrays and then sort them and return the kth element index and this comes time complexity of O((n+m)⋅log(n+m) but using binary search we can reduce this time complexity and optimise it .
#100DaysofCode
December 16, 2024 at 5:17 AM
#Day5 #GFGPOTD #GFG
Kth element of two arrays ,my brute force approach will be joining the two arrays and then sort them and return the kth element index and this comes time complexity of O((n+m)⋅log(n+m) but using binary search we can reduce this time complexity and optimise it .
#100DaysofCode
Kth element of two arrays ,my brute force approach will be joining the two arrays and then sort them and return the kth element index and this comes time complexity of O((n+m)⋅log(n+m) but using binary search we can reduce this time complexity and optimise it .
#100DaysofCode
#DAY4: SOLVED THIS PEAK ELEMENT first by brute force of linear search checking the prev and next element is lesser than the curr element and iterating throught the array but takes O(N) complexity so implemented binary search to solve it in O(logN) #100daysofCode #100Days #100daysCodingChallenge
December 15, 2024 at 10:46 AM
#DAY4: SOLVED THIS PEAK ELEMENT first by brute force of linear search checking the prev and next element is lesser than the curr element and iterating throught the array but takes O(N) complexity so implemented binary search to solve it in O(logN) #100daysofCode #100Days #100daysCodingChallenge
DAY 2 : SOLVED #GFG #POTD
In this we can simple sort it and return the minimum of the array. Like basically taking mini of arr takes O(N) so instead we can use binary search algorithm to find the mini of the array which takes the time complexity of O(logN).
#100daysofCode #100DaysofCodeChallenge
In this we can simple sort it and return the minimum of the array. Like basically taking mini of arr takes O(N) so instead we can use binary search algorithm to find the mini of the array which takes the time complexity of O(logN).
#100daysofCode #100DaysofCodeChallenge
December 13, 2024 at 2:10 AM
DAY 2 : SOLVED #GFG #POTD
In this we can simple sort it and return the minimum of the array. Like basically taking mini of arr takes O(N) so instead we can use binary search algorithm to find the mini of the array which takes the time complexity of O(logN).
#100daysofCode #100DaysofCodeChallenge
In this we can simple sort it and return the minimum of the array. Like basically taking mini of arr takes O(N) so instead we can use binary search algorithm to find the mini of the array which takes the time complexity of O(logN).
#100daysofCode #100DaysofCodeChallenge
Todays GFG POTD
Number of occurrence
Given a sorted array, arr[] and a number target, you need to find the number of occurrences of target in arr[].
Solved using the having a counter variable and increasing when looping finds a match with the target
#100daysofCodeChallenge #100daysofCode
Number of occurrence
Given a sorted array, arr[] and a number target, you need to find the number of occurrences of target in arr[].
Solved using the having a counter variable and increasing when looping finds a match with the target
#100daysofCodeChallenge #100daysofCode
December 12, 2024 at 7:43 AM
Todays GFG POTD
Number of occurrence
Given a sorted array, arr[] and a number target, you need to find the number of occurrences of target in arr[].
Solved using the having a counter variable and increasing when looping finds a match with the target
#100daysofCodeChallenge #100daysofCode
Number of occurrence
Given a sorted array, arr[] and a number target, you need to find the number of occurrences of target in arr[].
Solved using the having a counter variable and increasing when looping finds a match with the target
#100daysofCodeChallenge #100daysofCode
Reposted by Sugash
The United States of Broligarchy: How Billionaires Took Over Our Government and Rigged the System
thelefthook.substack.com/p/the-united...
thelefthook.substack.com/p/the-united...
December 7, 2024 at 3:19 AM
The United States of Broligarchy: How Billionaires Took Over Our Government and Rigged the System
thelefthook.substack.com/p/the-united...
thelefthook.substack.com/p/the-united...
I recently watched this movie , i know its late . But this one is the most light hearted movie that I ever watched . "I want to eat your pancreas" best one . Must watchable if u did watch it yet . #anime #moviereview
December 7, 2024 at 5:00 AM
I recently watched this movie , i know its late . But this one is the most light hearted movie that I ever watched . "I want to eat your pancreas" best one . Must watchable if u did watch it yet . #anime #moviereview