Monojit Pal

Death certificate needs bribe. Marriage certificate needs bribe. Home registration needs bribe. Vehicle registration needs bribe. Water registration needs bribe. Electricity address change needs bribe. GST registration needs bribe. Police needs bribe Judge needs bribe Passport verification needs bribe. In-short , they’re not government officers They’re scumbag idiots. System needs change. No one cares. 😭

I went to a medical store. I asked for ORS. He gave me ORSL. I said, “This is not ORS.” He said, “Ok, keep it aside, I’ll give you another.” Then he gave me the original ORS. People don’t have much knowledge, so they may end up buying ORSL instead of ORS. Why is this kind of misleading product still available in the market?

🔥 Day 34 of #geeksforgeeks160 🔗 Allocate Minimum Pages 🧠 Used Binary Search to minimize the max pages any student gets while ensuring contiguous book allocation 📚 Valid only when students ≤ books ⚡ TC: O(n log(sum - max)), SC: O(1) #gfg160 #geeksforgeeks #geekstreak2025

🔥 Day 33 of #geeksforgeeks160 🔗 Aggressive Cows 🧠 Used Binary Search and Greedy approach to find the maximum possible minimum distance between cows placed in stalls. ⚡ TC: O(n log d), SC: O(1) #gfg160 #geeksforgeeks #geekstreak2025

🔥 Day 32 of #geeksforgeeks160 🔗 K-th Element of Two Sorted Arrays 🧠 Used Binary Search on the smaller array to find the K-th element in O(log(min(n, m))) time ⚡ TC: O(log(min(n, m))), SC: O(1) #gfg160 #geeksforgeeks #geekstreak2025

🔥 Day 31 of #geeksforgeeks160 🔗 Peak Element 🧠 Find any peak element (greater than neighbors) using Binary Search 📌 Smartly handled edges (first/last elements as -∞) ⚡ TC: O(log n), SC: O(1) #gfg160 #geeksforgeeks #geekstreak2025

🔥 Day 30 of #geeksforgeeks160 🔗 Search in Rotated Sorted Array 🧠 Given a rotated sorted array, find the index of a target element 📌 Used an optimized Binary Search by checking sorted halves ⚡ TC: O(log n), SC: O(1) #gfg160 #geeksforgeeks #geekstreak2025

🔥 Day 29 of #geeksforgeeks160 🔗 Sorted and Rotated Minimum 🧠 Find the minimum element in a sorted and rotated array 📌 Used Binary Search to locate pivot point efficiently ⚡ TC: O(log n), SC: O(1) #gfg160 #geeksforgeeks #geekstreak2025

🔥 Day 28 of #geeksforgeeks160 🔗 Number of Occurrence in Sorted Array 🧠 Given a sorted array, find the number of times a target appears 📌 Used Binary Search to find the first and last occurrence ⚡ TC: O(log n), SC: O(1) #gfg160 #geeksforgeeks #geekstreak2025

🔥 Day 27 of #geeksforgeeks160 🔗 Merge Without Extra Space 🧠 Given two sorted arrays, merge them in-place without using extra space 📌 Used the Gap Method to simulate Shell Sort-style swapping ⚡ TC: O((n+m) log(n+m)), SC: O(1) #gfg160 #geeksforgeeks #geekstreak2025

🔥 Day 26 of #geeksforgeeks160 🧩 Non-overlapping Intervals 🧠 Remove minimum intervals to make the rest non-overlapping 📌 Greedy approach: Always pick the interval with the earliest end time ⚡ TC: O(N log N), SC: O(1) #gfg160 #geeksforgeeks #geekstreak2025

🔥 Day 25 of #geeksforgeeks160 🧩 Insert Interval 📌 Insert a new interval into a list of non-overlapping, sorted intervals 🔁 Add before, merge overlaps, then append the rest ⚡ TC: O(N), SC: O(N) #gfg160 #geeksforgeeks #geekstreak2025

🔥 Day 24 of #geeksforgeeks160 🧩 Merge Overlapping Intervals 🧠 Sort intervals by start, then merge if current overlaps with last 🛠️ If no overlap, add; if overlap, extend end of previous ⚡ TC: O(N log N), SC: O(N) #gfg160 #geeksforgeeks #geekstreak2025

🔥 Day 23 of #geeksforgeeks160 📊 Count Inversions in an Array 🧠 Inversion: arr[i] > arr[j] with i < j 🔁 Use Merge Sort to count during merge step ⚡ TC: O(N log N), SC: O(N) #gfg160 #geeksforgeeks #geekstreak2025

🔥 Day 22 of #geeksforgeeks160 📊 Find the H-Index 🧠 H-index is max H such that H papers have ≥ H citations 🔁 Traverse from high to low and return when count ≥ i ⚡ TC: O(N), SC: O(N) #gfg160 #geeksforgeeks #geekstreak2025

🔥 Day 21 of #geeksforgeeks160 🔁 Strings Rotations of Each Other 🧠 Trick: s2 is a rotation of s1 if s2 exists in s1 + s1 ⚡ TC: O(N), SC: O(1) using built-in contains or KMP #gfg160 #geeksforgeeks #geekstreak2025 ♻️ Repost due to typo in day number

🔥 Day 20 of #geeksforgeeks160 🔁 Check if Strings are Rotations of Each Other 🔍 Use s1 + s1 and check if it contains s2 using KMP ⚡ Efficient string search with TC: O(N + M), SC: O(M) #gfg160 #geeksforgeeks #geekstreak2025

🔥 Day 19 of #geeksforgeeks160 🔍 Search Pattern (KMP Algorithm) 🧩 Use LPS (Longest Prefix Suffix) array to skip characters smartly 🎯 Efficiently find all occurrences of a pattern in text ⚡ TC: O(N + M), SC: O(M) #gfg160 #geeksforgeeks #geekstreak2025

🔥 Day 18 of #geeksforgeeks160 🔍 Search Pattern in a String 🧩 Use LPS to avoid rechecking characters 🎯 Efficient pattern matching in O(N + M) time 📄 Returns all starting indices of pattern matches ⚡ TC: O(N + M), SC: O(M) #gfg160 #geeksforgeeks #geekstreak2025

🔥 Day 17 of #geeksforgeeks160 🔍 First Non-Repeating Character in a String 🧩 Count character frequencies, then return the first with count = 1 🚫 If none found, return '$' ⚡ TC: O(N), SC: O(1) #gfg160 #geeksforgeeks #geekstreak2025