Forem

MD ARIFUL HAQUE profile picture

MD ARIFUL HAQUE

I am a Technical Lead with holistic knowledge of software development and design. I am also experienced in coordinating with stakeholders

Location 2 NO MUSLIM NAGAR, MATUAIL, TUSHARDHARA, DEMRA - 1362, DHAKA, BANGLADESH Joined Joined on  Personal website https://mah-shamim.github.io github website

Education

AHSANULLAH UNIVERSITY OF SCIENCE AND TECHNOLOGY

Pronouns

he/him

Work

TECH LEAD at MT TECHNOLOGIES

Frontend Challenge Completion Badge
2
2025 Hacktoberfest Writing Challenge Completion
Three Year Club
GitHub Copilot 1-Day Build Challenge Completion Badge
2024 Hacktoberfest Writing Challenge Completion Badge
Two Year Club
1 Week Community Wellness Streak
Writing Debut
One Year Club
3600. Maximize Spanning Tree Stability with Upgrades
Cover image for 3600. Maximize Spanning Tree Stability with Upgrades

3600. Maximize Spanning Tree Stability with Upgrades

Comments
5 min read

Want to connect with MD ARIFUL HAQUE?

Create an account to connect with MD ARIFUL HAQUE. You can also sign in below to proceed if you already have an account.

Already have an account? Sign in
1009. Complement of Base 10 Integer
Cover image for 1009. Complement of Base 10 Integer

1009. Complement of Base 10 Integer

Comments
3 min read
3130. Find All Possible Stable Binary Arrays II
Cover image for 3130. Find All Possible Stable Binary Arrays II

3130. Find All Possible Stable Binary Arrays II

1
Comments
6 min read
3129. Find All Possible Stable Binary Arrays I
Cover image for 3129. Find All Possible Stable Binary Arrays I

3129. Find All Possible Stable Binary Arrays I

1
Comments
5 min read
1888. Minimum Number of Flips to Make the Binary String Alternating
Cover image for 1888. Minimum Number of Flips to Make the Binary String Alternating

1888. Minimum Number of Flips to Make the Binary String Alternating

1
Comments
3 min read
1784. Check if Binary String Has at Most One Segment of Ones
Cover image for 1784. Check if Binary String Has at Most One Segment of Ones

1784. Check if Binary String Has at Most One Segment of Ones

1
Comments
3 min read
1758. Minimum Changes To Make Alternating Binary String
Cover image for 1758. Minimum Changes To Make Alternating Binary String

1758. Minimum Changes To Make Alternating Binary String

1
Comments
3 min read
1582. Special Positions in a Binary Matrix
Cover image for 1582. Special Positions in a Binary Matrix

1582. Special Positions in a Binary Matrix

Comments
4 min read
1536. Minimum Swaps to Arrange a Binary Grid
Cover image for 1536. Minimum Swaps to Arrange a Binary Grid

1536. Minimum Swaps to Arrange a Binary Grid

2
Comments
4 min read
1689. Partitioning Into Minimum Number Of Deci-Binary Numbers
Cover image for 1689. Partitioning Into Minimum Number Of Deci-Binary Numbers

1689. Partitioning Into Minimum Number Of Deci-Binary Numbers

1
Comments
3 min read
1680. Concatenation of Consecutive Binary Numbers
Cover image for 1680. Concatenation of Consecutive Binary Numbers

1680. Concatenation of Consecutive Binary Numbers

2
Comments
3 min read
3666. Minimum Operations to Equalize Binary String
Cover image for 3666. Minimum Operations to Equalize Binary String

3666. Minimum Operations to Equalize Binary String

3
Comments
5 min read
1356. Sort Integers by The Number of 1 Bits
Cover image for 1356. Sort Integers by The Number of 1 Bits

1356. Sort Integers by The Number of 1 Bits

1
Comments
5 min read
1022. Sum of Root To Leaf Binary Numbers
Cover image for 1022. Sum of Root To Leaf Binary Numbers

1022. Sum of Root To Leaf Binary Numbers

1
Comments
3 min read
1461. Check If a String Contains All Binary Codes of Size K
Cover image for 1461. Check If a String Contains All Binary Codes of Size K

1461. Check If a String Contains All Binary Codes of Size K

1
Comments
3 min read
868. Binary Gap
Cover image for 868. Binary Gap

868. Binary Gap

Comments
3 min read
762. Prime Number of Set Bits in Binary Representation
Cover image for 762. Prime Number of Set Bits in Binary Representation

762. Prime Number of Set Bits in Binary Representation

Comments
4 min read
761. Special Binary String
Cover image for 761. Special Binary String

761. Special Binary String

Comments
4 min read
696. Count Binary Substrings
Cover image for 696. Count Binary Substrings

696. Count Binary Substrings

Comments
3 min read
693. Binary Number with Alternating Bits
Cover image for 693. Binary Number with Alternating Bits

693. Binary Number with Alternating Bits

Comments
3 min read
401. Binary Watch
Cover image for 401. Binary Watch

401. Binary Watch

Comments
3 min read
190. Reverse Bits
Cover image for 190. Reverse Bits

190. Reverse Bits

Comments
3 min read
67. Add Binary
Cover image for 67. Add Binary

67. Add Binary

Comments
2 min read
799. Champagne Tower
Cover image for 799. Champagne Tower

799. Champagne Tower

Comments
4 min read
3714. Longest Balanced Substring II
Cover image for 3714. Longest Balanced Substring II

3714. Longest Balanced Substring II

Comments
5 min read
3721. Longest Balanced Subarray II
Cover image for 3721. Longest Balanced Subarray II

3721. Longest Balanced Subarray II

Comments
5 min read
3713. Longest Balanced Substring I
Cover image for 3713. Longest Balanced Substring I

3713. Longest Balanced Substring I

Comments
3 min read
3719. Longest Balanced Subarray I
Cover image for 3719. Longest Balanced Subarray I

3719. Longest Balanced Subarray I

Comments
3 min read
110. Balanced Binary Tree
Cover image for 110. Balanced Binary Tree

110. Balanced Binary Tree

Comments
3 min read
3634. Minimum Removals to Balance Array
Cover image for 3634. Minimum Removals to Balance Array

3634. Minimum Removals to Balance Array

Comments
3 min read
3379. Transformed Array
Cover image for 3379. Transformed Array

3379. Transformed Array

Comments
3 min read
3640. Trionic Array II
Cover image for 3640. Trionic Array II

3640. Trionic Array II

Comments
4 min read
3637. Trionic Array I
Cover image for 3637. Trionic Array I

3637. Trionic Array I

Comments
3 min read
3013. Divide an Array Into Subarrays With Minimum Cost II
Cover image for 3013. Divide an Array Into Subarrays With Minimum Cost II

3013. Divide an Array Into Subarrays With Minimum Cost II

Comments
43 min read
3010. Divide an Array Into Subarrays With Minimum Cost I
Cover image for 3010. Divide an Array Into Subarrays With Minimum Cost I

3010. Divide an Array Into Subarrays With Minimum Cost I

Comments
3 min read
744. Find Smallest Letter Greater Than Target
Cover image for 744. Find Smallest Letter Greater Than Target

744. Find Smallest Letter Greater Than Target

Comments
3 min read
2977. Minimum Cost to Convert String II
Cover image for 2977. Minimum Cost to Convert String II

2977. Minimum Cost to Convert String II

Comments
9 min read
3651. Minimum Cost Path with Teleportations
Cover image for 3651. Minimum Cost Path with Teleportations

3651. Minimum Cost Path with Teleportations

Comments
4 min read
3650. Minimum Cost Path with Edge Reversals
Cover image for 3650. Minimum Cost Path with Edge Reversals

3650. Minimum Cost Path with Edge Reversals

Comments
4 min read
1200. Minimum Absolute Difference
Cover image for 1200. Minimum Absolute Difference

1200. Minimum Absolute Difference

Comments
3 min read
1984. Minimum Difference Between Highest and Lowest of K Scores
Cover image for 1984. Minimum Difference Between Highest and Lowest of K Scores

1984. Minimum Difference Between Highest and Lowest of K Scores

Comments
3 min read
1877. Minimize Maximum Pair Sum in Array
Cover image for 1877. Minimize Maximum Pair Sum in Array

1877. Minimize Maximum Pair Sum in Array

Comments
3 min read
3510. Minimum Pair Removal to Sort Array II
Cover image for 3510. Minimum Pair Removal to Sort Array II

3510. Minimum Pair Removal to Sort Array II

Comments
4 min read
3507. Minimum Pair Removal to Sort Array I
Cover image for 3507. Minimum Pair Removal to Sort Array I

3507. Minimum Pair Removal to Sort Array I

Comments
3 min read
3315. Construct the Minimum Bitwise Array II
Cover image for 3315. Construct the Minimum Bitwise Array II

3315. Construct the Minimum Bitwise Array II

Comments
4 min read
3314. Construct the Minimum Bitwise Array I
Cover image for 3314. Construct the Minimum Bitwise Array I

3314. Construct the Minimum Bitwise Array I

Comments
4 min read
1292. Maximum Side Length of a Square with Sum Less than or Equal to Threshold
Cover image for 1292. Maximum Side Length of a Square with Sum Less than or Equal to Threshold

1292. Maximum Side Length of a Square with Sum Less than or Equal to Threshold

Comments
4 min read
1895. Largest Magic Square
Cover image for 1895. Largest Magic Square

1895. Largest Magic Square

Comments
4 min read
3047. Find the Largest Area of Square Inside Two Rectangles
Cover image for 3047. Find the Largest Area of Square Inside Two Rectangles

3047. Find the Largest Area of Square Inside Two Rectangles

Comments
4 min read
2975. Maximum Square Area by Removing Fences From a Field
Cover image for 2975. Maximum Square Area by Removing Fences From a Field

2975. Maximum Square Area by Removing Fences From a Field

Comments
4 min read
2943. Maximize Area of Square Hole in Grid
Cover image for 2943. Maximize Area of Square Hole in Grid

2943. Maximize Area of Square Hole in Grid

Comments
4 min read
3454. Separate Squares II
Cover image for 3454. Separate Squares II

3454. Separate Squares II

Comments
5 min read
3453. Separate Squares I
Cover image for 3453. Separate Squares I

3453. Separate Squares I

Comments
4 min read
1266. Minimum Time Visiting All Points
Cover image for 1266. Minimum Time Visiting All Points

1266. Minimum Time Visiting All Points

Comments
3 min read
712. Minimum ASCII Delete Sum for Two Strings
Cover image for 712. Minimum ASCII Delete Sum for Two Strings

712. Minimum ASCII Delete Sum for Two Strings

Comments
4 min read
865. Smallest Subtree with all the Deepest Nodes
Cover image for 865. Smallest Subtree with all the Deepest Nodes

865. Smallest Subtree with all the Deepest Nodes

Comments
4 min read
1458. Remove Max Number of Edges to Keep Graph Fully Traversable
Cover image for 1458. Remove Max Number of Edges to Keep Graph Fully Traversable

1458. Remove Max Number of Edges to Keep Graph Fully Traversable

Comments
4 min read
1339. Maximum Product of Splitted Binary Tree
Cover image for 1339. Maximum Product of Splitted Binary Tree

1339. Maximum Product of Splitted Binary Tree

Comments
4 min read
1390. Four Divisors
Cover image for 1390. Four Divisors

1390. Four Divisors

Comments
3 min read
1579. Number of Ways to Paint N 3 Grid
Cover image for 1579. Number of Ways to Paint N 3 Grid

1579. Number of Ways to Paint N 3 Grid

Comments
3 min read
loading...