Mohibullah Mohim

Mohibullah Mohim Hello, This is who, whom u know. Poke me for what u want to know. REACT || NODE JS || EXPRESS JS || MONGODB
called mern stack I have no any speciality yet.
(1)

23/06/2026

🚀 Day 30 of
Mission: 100 Days Problem Solving

āφāϜāϕ⧇āϰ Problem: From a string, how many time to make 'balloon'

🧠 Topic: āĻāĻ•āϟāĻŋ string āĻĨ⧇āϕ⧇ balloon word āĻ•āϤ āĻŦāĻžāϰ āĻŦāĻžāύāĻžāύ⧋ āϝāĻžā§ŸāĨ¤




21/06/2026

🚀 Day 28 of
Mission: 100 Days Problem Solving

āφāϜāϕ⧇āϰ Problem: Maximum icecreem bar buy using coins

🧠 Topic: āĻāĻ•āϟāĻŋ costs of array, āϝ⧇āĻ–āĻžāύ⧇ āĻ•āĻŋāϛ⧁ numbers āĻĻ⧇āĻ“ā§ŸāĻž āφāϛ⧇,
āφāĻŦāĻžāϰ coins (valid for buying) āĻĻā§‡ā§ŸāĻž āφāϛ⧇āĨ¤āϏ⧇āχ āĻ•ā§Ÿā§‡āύ āĻĻāĻŋ⧟āĻž āĻ•āϤāϗ⧁āϞāĻž āĻŦāĻžāϰ āĻ•āĻŋāύāĻž āϝāĻžāĻŦ⧇āĨ¤




20/06/2026

🚀 Day 27 of
Mission: 100 Days Problem Solving

āφāϜāϕ⧇āϰ Problem: Highest altitude of an array

🧠 Topic: āĻāĻ•āϟāĻŋ array, āϝ⧇āĻ–āĻžāύ⧇ āĻ•āĻŋāϛ⧁ numbers āĻĻ⧇āĻ“ā§ŸāĻž āφāϛ⧇, āϧāϰ⧇ āύ⧇āĻ“ā§ŸāĻž āĻšā§Ÿā§‡ āĻāχ āϗ⧁āϞāĻž āϰāĻžāĻ¸ā§āϤāĻžā§Ÿ altitude, āĻāĻ–āύ āĻāĻ•āϜāύ rider āϰāĻžāĻ¸ā§āϤāĻžāϰ āĻļ⧇āώ āĻĒāĻ°ā§āϝāĻ¨ā§āϤ āϗ⧇āϞ⧇ āϏ⧇ āĻ•āĻŋ āύāĻŋāωāĻŸā§āϰāϞ⧇ ā§Ļ āĻŦāĻž ā§Ļ āĻĨ⧇āϕ⧇ āωāĻĒāϰ⧇ āĻŦāĻž āĻļ⧁āϰ⧁ āĻĨ⧇āϕ⧇ āωāĻĒāϰ⧇ āĻĨāĻžāĻ•āϞ⧋, āĻŽāĻžāύ⧇ āϏāĻ°ā§āĻŦāĻļ⧇āώ āĻ…āĻŦāĻ¸ā§āĻĨāĻž āĻ•āĻŋ āϏ⧇āϟāĻžāχ āĻŦ⧇āϰ āĻ•āϰāϤ⧇ āĻšāĻŦ⧇āĨ¤




18/06/2026

🚀 Day 26 of
Mission 100 days problem solve
āφāϜāϕ⧇āϰ Problem: Angle between hands of a clock
🧠 Topic: āĻāĻ•āϟāĻž āϘ⧜āĻŋāϤ⧇ āĻŽāĻŋāύāĻŋāĻŸā§‡āϰ āĻ•āĻžāϟāĻž āĻāĻŦāĻ‚ āϘāĻ¨ā§āϟāĻžāϰ āĻ•āĻžāϟāĻžāϰ āĻŽāĻ§ā§āϝ⧇ āĻ‰ā§ŽāĻĒāĻ¨ā§āύ āϕ⧋āύ āύāĻŋāĻ°ā§āύ⧟āĨ¤



17/06/2026

🚀 Day 25 of
Mission 100 days problem solve
āφāϜāϕ⧇āϰ Problem: Process String with Special Operations I
🧠 Topic:āĻāĻāĻ•āϟāĻŋ string āĻĻ⧇āĻ“āϝāĻŧāĻž āĻĨāĻžāϕ⧇ āϝ⧇āĻ–āĻžāύ⧇ āĻ•āĻŋāϛ⧁ special character āύāĻŋāĻ°ā§āĻĻāĻŋāĻˇā§āϟ operation āύāĻŋāĻ°ā§āĻĻ⧇āĻļ āĻ•āϰ⧇āĨ¤ āύāĻŋāĻĻāĻŋāĻˇā§āϟ āĻĒā§āϝāĻžāϰāĻžāĻŽāĻŋāϟāĻžāϰ āĻāϰ āύāĻŋāĻĻāĻŋāĻˇā§āϟ āĻŽāĻžāύ āχ String-āĻāϰ āĻĒā§āϰāϤāĻŋāϟāĻŋ character process āĻ•āϰ⧇ final output āϤ⧈āϰāĻŋ āĻ•āϰāϤ⧇ āĻšāϝāĻŧāĨ¤



16/06/2026

🚀 Day 24 of
Mission 100 days problem solve
āφāϜāϕ⧇āϰ Problem: Process String with Special Operations I
🧠 Topic:āĻāĻāĻ•āϟāĻŋ string āĻĻ⧇āĻ“ā§ŸāĻž āĻĨāĻžāϕ⧇ āϝ⧇āĻ–āĻžāύ⧇ āĻ•āĻŋāϛ⧁ special character āύāĻŋāĻ°ā§āĻĻāĻŋāĻˇā§āϟ operation āύāĻŋāĻ°ā§āĻĻ⧇āĻļ āĻ•āϰ⧇āĨ¤ String-āĻāϰ āĻĒā§āϰāϤāĻŋāϟāĻŋ character process āĻ•āϰ⧇ final output āϤ⧈āϰāĻŋ āĻ•āϰāϤ⧇ āĻšā§ŸāĨ¤


15/06/2026

🚀 Day 23 of

📝 Problem: Delete the Middle Node of a Linked List

🧠 Topic: Linked List, Slow & Fast Pointer

āφāϜāϕ⧇āϰ āϏāĻŽāĻ¸ā§āϝāĻžā§Ÿ āĻāĻ•āϟāĻŋ Linked List āĻĨ⧇āϕ⧇ middle node delete āĻ•āϰāϤ⧇ āĻšā§Ÿā§‡āϛ⧇āĨ¤

āĻĒā§āϰāĻĨāĻŽā§‡ array āĻŦā§āϝāĻŦāĻšāĻžāϰ āĻ•āϰ⧇ āϏāĻŽāĻžāϧāĻžāύ āĻ•āϰāĻžāϰ āĻ•āĻĨāĻž āĻŽāĻžāĻĨāĻžā§Ÿ āĻāϏ⧇āĻ›āĻŋāϞ, āĻ•āĻŋāĻ¨ā§āϤ⧁ Linked List-āĻ index access āĻ•āϰāĻž āϝāĻžā§Ÿ āύāĻžāĨ¤ āϤāĻžāχ Slow & Fast Pointer technique āĻŦā§āϝāĻŦāĻšāĻžāϰ āĻ•āϰ⧇āĻ›āĻŋāĨ¤

Fast pointer ⧍ āϧāĻžāĻĒ āĻ•āϰ⧇ āĻāĻ—āĻŋāϝāĻŧ⧇āϛ⧇

Slow pointer ā§§ āϧāĻžāĻĒ āĻ•āϰ⧇ āĻāĻ—āĻŋāϝāĻŧ⧇āϛ⧇

Fast pointer āĻļ⧇āώ⧇ āĻĒ⧌āρāĻ›āĻžāύ⧋āϰ āĻĒāϰ Slow pointer middle node-āĻ āĻ›āĻŋāϞ

āĻāϰāĻĒāϰ previous node-āĻāϰ next update āĻ•āϰ⧇ middle node delete āĻ•āϰ⧇āĻ›āĻŋ

14/06/2026

🚀 Day 22 of

Mission: 100 Days Problem Solving

āφāϜāϕ⧇āϰ Problem: Maximum Twin Pair Sum in an Array (Two Pointers)

🧠 Topic: Two Pointers Technique

āφāϜāϕ⧇āϰ āϏāĻŽāĻ¸ā§āϝāĻžāϝāĻŧ āĻāĻ•āϟāĻŋ array āĻĻ⧇āĻ“āϝāĻŧāĻž āĻ›āĻŋāϞ, āϝ⧇āĻ–āĻžāύ⧇ āĻĒā§āϰāĻĨāĻŽ element-āĻāϰ āϏāĻžāĻĨ⧇ āĻļ⧇āώ element, āĻĻā§āĻŦāĻŋāϤ⧀āϝāĻŧ element-āĻāϰ āϏāĻžāĻĨ⧇ āĻĻā§āĻŦāĻŋāϤ⧀āϝāĻŧ āĻļ⧇āώ element āĻāĻ­āĻžāĻŦ⧇ pair āϤ⧈āϰāĻŋ āĻ•āϰāϤ⧇ āĻšāĻŦ⧇āĨ¤ āĻāϰāĻĒāϰ āĻĒā§āϰāϤāĻŋāϟāĻŋ pair-āĻāϰ sum āĻŦ⧇āϰ āĻ•āϰ⧇ maximum pair sum āϖ⧁āρāĻœā§‡ āĻŦ⧇āϰ āĻ•āϰāϤ⧇ āĻšāĻŦ⧇āĨ¤
āϏāĻŽāĻ¸ā§āϝāĻžāϟāĻŋ solve āĻ•āϰāϤ⧇ Two Pointers technique āĻŦā§āϝāĻŦāĻšāĻžāϰ āĻ•āϰ⧇āĻ›āĻŋāĨ¤ āĻāĻ•āϟāĻŋ pointer array-āĻāϰ āĻļ⧁āϰ⧁āϤ⧇ āĻāĻŦāĻ‚ āφāϰ⧇āĻ•āϟāĻŋ āĻļ⧇āώ⧇ āϰ⧇āϖ⧇ pair āϤ⧈āϰāĻŋ āĻ•āϰ⧇āĻ›āĻŋāĨ¤ āĻĒā§āϰāϤāĻŋāϟāĻŋ pair-āĻāϰ sum calculate āĻ•āϰ⧇ maximum value track āĻ•āϰ⧇āĻ›āĻŋāĨ¤āϤāĻŦ⧇ array odd āĻšāĻŦ⧇ āύāĻžāĨ¤



13/06/2026

🚀 Day 21 of

Mission 100 days problem solve

āφāϜāϕ⧇āϰ Problem: String Mapping Challenge

🧠 āφāĻŽāĻžāĻĻ⧇āϰ āĻĻ⧇āĻ“āϝāĻŧāĻž āĻ›āĻŋāϞ:āĻ•āĻŋāϛ⧁ āĻļāĻŦā§āĻĻ⧇āϰ (words) āĻāĻ•āϟāĻž array

āφāϰ ⧍ā§ŦāϟāĻž letter āĻāϰ āϜāĻ¨ā§āϝ āĻāĻ•āϟāĻž weights array (a → z)

āĻĒā§āϰāϤāĻŋāϟāĻž word āĻāϰ āϜāĻ¨ā§āϝ āĻ•āϰāϤ⧇ āĻšāĻŦ⧇:

āĻĒā§āϰāϤāĻŋāϟāĻž character āĻāϰ weight āϝ⧋āĻ— āĻ•āϰāϤ⧇ āĻšāĻŦ⧇

total sum āĻāϰ āωāĻĒāϰ mod 26 āύāĻŋāϤ⧇ āĻšāĻŦ⧇

result āϟāĻž reverse alphabet mapping āĻĻāĻŋāϝāĻŧ⧇ letter āĻ convert āĻ•āϰāϤ⧇ āĻšāĻŦ⧇ 🚀





12/06/2026

🚀 Day 20 of
Mission 100 days problem solve

āφāϜāϕ⧇āϰ Problem: Minimum Cost of Buying Candies With Discount
:- Taken from leetcode

🧠 Topic: A shop is selling candies at a discount. For every two candies sold, the shop gives a third candy for free.🚀





Address

Sylhet

Alerts

Be the first to know and let us send you an email when Mohibullah Mohim posts news and promotions. Your email address will not be used for any other purpose, and you can unsubscribe at any time.

Contact The Business

Send a message to Mohibullah Mohim:

Shortcuts

Share

Category