#75HardCoding - Twitter Hashtag

about 22 hours ago

Day 26/75 #75HardCoding | P-4 Floor and Ceil in Unsorted Array • Brute Force: O(n) TC | O(1) SC (Linear search) • Optimal: O(n log n) TC | O(1) SC (Sort+Binary Search) Details below👇 #DSA #DataStructures #Cplusplus #LeetCode #GeeksforGeeks #SoftwareEngineering #Consistency

Muskanm_1227's tweet photo. Day 26/75 #75HardCoding | P-4

Floor and Ceil in Unsorted Array

• Brute Force: O(n) TC | O(1) SC (Linear search)
• Optimal: O(n log n) TC | O(1) SC (Sort+Binary Search)

Details below👇
#DSA #DataStructures #Cplusplus #LeetCode #GeeksforGeeks #SoftwareEngineering #Consistency https://t.co/W4DcbrbDla

1

2

0

8

Misa Codes @Muskanm_1227

about 22 hours ago

Day 26/75 #75HardCoding | P 2 & 3 Implement Lower Bound & Upper Bound • Lower Bound: O(log n) TC | O(1) SC • Upper Bound: O(log n) TC | O(1) SC Mastering the subtle conditional shifts that redefine search space boundaries. Details below. #100DaysOfCode #DSA #LeetCode #Cpp

Muskanm_1227's tweet photo. Day 26/75 #75HardCoding | P 2 & 3

Implement Lower Bound & Upper Bound

• Lower Bound: O(log n) TC | O(1) SC
• Upper Bound: O(log n) TC | O(1) SC

Mastering the subtle conditional shifts that redefine search space boundaries. Details below.

#100DaysOfCode #DSA #LeetCode #Cpp https://t.co/j5cCUOf0A1

1

6

0

31

Misa Codes @Muskanm_1227

about 23 hours ago

Day 26/75 #75HardCoding | P-1 Find First and Last Position of Element in Sorted Array • Optimal:O(log n)TC | O(1)SC Modifying standard binary search boundaries into independent dual tracking registers to find bound frequencies. Details below. #100DaysOfCode #DSA #LeetCode #Cpp

Muskanm_1227's tweet photo. Day 26/75 #75HardCoding | P-1

Find First and Last Position of Element in Sorted Array
• Optimal:O(log n)TC | O(1)SC

Modifying standard binary search boundaries into independent dual tracking registers to find bound frequencies. Details below.
#100DaysOfCode #DSA #LeetCode #Cpp https://t.co/czrnRckBCy

1

4

0

25

Misa Codes @Muskanm_1227

2 days ago

Day 25/75 #75HardCoding Search Insert Position •Optimal: O(log n)TC | O(1)SC Not feeling my best physically these days, so stepping back from heavy Mediums to prioritize recovery while keeping the daily habit alive.Log binary tracking logic below. #100DaysOfCode #DSA #LeetCode

Muskanm_1227's tweet photo. Day 25/75 #75HardCoding

Search Insert Position
•Optimal: O(log n)TC | O(1)SC

Not feeling my best physically these days, so stepping back from heavy Mediums to prioritize recovery while keeping the daily habit alive.Log binary tracking logic below.
#100DaysOfCode #DSA #LeetCode https://t.co/bFFO4pwem4

1

3

0

15

Misa Codes @Muskanm_1227

3 days ago

Day 24/75 #75HardCoding | 🔍Binary Search • Optimal: O(log n) TC | O(1) SC Ditching linear scans on sorted data. Implementing a classic divide-and-conquer approach to slash lookup times down to logarithmic complexity. #DSA #DataStructures #Cpp #LeetCode #Consistency

Muskanm_1227's tweet photo. Day 24/75 #75HardCoding |

🔍Binary Search
• Optimal: O(log n) TC | O(1) SC

Ditching linear scans on sorted data. Implementing a classic divide-and-conquer approach to slash lookup times down to logarithmic complexity.

#DSA #DataStructures #Cpp #LeetCode #Consistency https://t.co/7yxQ8xTeaI

2

0

18

Misa Codes @Muskanm_1227

4 days ago

Day 23/75 #75HardCoding | Part 2 Merge Intervals • Brute Force: O(n log n + n^2)TC | O(n)SC • Optimal: O(n log n)TC | O(n)SC Refining interval overlap checking from a quadratic lookup scan down to a single linear pass. #DSA #DataStructures #Cplusplus #LeetCode #Consistency

Muskanm_1227's tweet photo. Day 23/75 #75HardCoding | Part 2

Merge Intervals

• Brute Force: O(n log n + n^2)TC | O(n)SC
• Optimal: O(n log n)TC | O(n)SC

Refining interval overlap checking from a quadratic lookup scan down to a single linear pass.

#DSA #DataStructures #Cplusplus #LeetCode #Consistency https://t.co/13Xa3Lu3p5

1

0

10

Misa Codes @Muskanm_1227

4 days ago

Day 23/75 #75HardCoding | Part 1 Merge Sorted Array • Brute Force: O((m + n) log(m + n)) TC | O(1) SC • Optimal: O(m + n) TC | O(1) SC Overcoming sorting overhead by u#LeetCode back-to-front pointer placement. #DSA #DataStructures #Cplusplus #LeetCode #SoftwareEngineering

Muskanm_1227's tweet photo. Day 23/75 #75HardCoding | Part 1

Merge Sorted Array

• Brute Force: O((m + n) log(m + n)) TC | O(1) SC
• Optimal: O(m + n) TC | O(1) SC

Overcoming sorting overhead by u#LeetCode back-to-front pointer placement.

#DSA #DataStructures #Cplusplus #LeetCode #SoftwareEngineering https://t.co/9pvORwZO3J

1

0

11

Misa Codes @Muskanm_1227

5 days ago

Day 22/75 #75HardCoding Count Subarrays with Given XOR • Brute: O(n^2) TC | O(1) SC • Optimal: O(n) TC | O(n) SC Swapping nested window scans for optimal prefix hash mapping to track bitwise operations in linear time. #DSA #Cplusplus #GeeksforGeeks #LeetCode #Consistency

Muskanm_1227's tweet photo. Day 22/75 #75HardCoding

Count Subarrays with Given XOR

• Brute: O(n^2) TC | O(1) SC
• Optimal: O(n) TC | O(n) SC

Swapping nested window scans for optimal prefix hash mapping to track bitwise operations in linear time.

#DSA #Cplusplus #GeeksforGeeks #LeetCode #Consistency https://t.co/cB86eG6qQb

1

0

13

Misa Codes @Muskanm_1227

6 days ago

Day 21/75 #75HardCoding | Part 2 Longest Consecutive Subsequence • Brute Force: O(n^3) TC | O(1) SC • Better: O(n log n) TC | O(1) SC • Optimal: O(n) TC | O(n) SC Optimizing sequence searches using hashing mechanics. 👇 #DataStructures #Cpp #GeeksforGeeks #DSA #LeetCode

Muskanm_1227's tweet photo. Day 21/75 #75HardCoding | Part 2

Longest Consecutive Subsequence

• Brute Force: O(n^3) TC | O(1) SC
• Better: O(n log n) TC | O(1) SC
• Optimal: O(n) TC | O(n) SC

Optimizing sequence searches using hashing mechanics. 👇
#DataStructures #Cpp #GeeksforGeeks #DSA #LeetCode https://t.co/2EaaqanNWA

1

0

25

Misa Codes @Muskanm_1227

6 days ago

Day 21/75 #75HardCoding | Part 1 Best Time to Buy and Sell Stock • Brute Force: O(n^2) TC | O(1) SC • Optimal: O(n) TC | O(1) SC Breaking down the linear transition path from a nested time limit bottleneck down to a single-pass solution below.👇 #100DaysOfCode #DSA #LeetCode

Muskanm_1227's tweet photo. Day 21/75 #75HardCoding | Part 1

Best Time to Buy and Sell Stock

• Brute Force: O(n^2) TC | O(1) SC
• Optimal: O(n) TC | O(1) SC

Breaking down the linear transition path from a nested time limit bottleneck down to a single-pass solution below.👇
#100DaysOfCode #DSA #LeetCode https://t.co/zwcuN1ltvG

1

2

0

29

Misa Codes @Muskanm_1227

7 days ago

Day 20/75 #75HardCoding | Part 2 152. Maximum Product Subarray • Brute: O(n²) TC | O(1) SC (Nested loops) • Optimal: O(n) TC | O(1) SC (Prefix & Suffix tracking) #DSA #DataStructures #Cplusplus #LeetCode #SoftwareEngineering #Consistency #ContinuousLearning

Muskanm_1227's tweet photo. Day 20/75 #75HardCoding | Part 2

152. Maximum Product Subarray

• Brute: O(n²) TC | O(1) SC (Nested loops)
• Optimal: O(n) TC | O(1) SC (Prefix & Suffix tracking)

#DSA #DataStructures #Cplusplus #LeetCode #SoftwareEngineering #Consistency #ContinuousLearning https://t.co/7d0zyIzhIA

1

0

15

Misa Codes @Muskanm_1227

7 days ago

Day 20/75 #75HardCoding | Part 1 229. Majority Element II • Brute: O(n²) TC | O(1) SC (Nested loops) • Better: O(n) TC | O(n) SC (Hashing) • Optimal: O(n) TC | O(1) SC (Boyer-Moore Voting) Details below #100DaysOfCode #DSA #DataStructures #Cpp #LeetCode #SoftwareEngineering

Muskanm_1227's tweet photo. Day 20/75 #75HardCoding | Part 1

229. Majority Element II

• Brute: O(n²) TC | O(1) SC (Nested loops)
• Better: O(n) TC | O(n) SC (Hashing)
• Optimal: O(n) TC | O(1) SC (Boyer-Moore Voting)

Details below
#100DaysOfCode #DSA #DataStructures #Cpp #LeetCode #SoftwareEngineering https://t.co/LLeJdG79b2

1

2

0

21

Top Tweets for #75HardCoding

Last Seen Hashtags on Sotwe

Trends for you

Most Popular Users