2563. Count the Number of Fair Pairs

<!DOCTYPE html> <html lang="en"> <head> <meta charset="utf-8"> <title>2563. Count the Number of Fair Pairs - DEV Community</title> <meta name="last-updated" content="2024-11-28 10:18:21 UTC"> <meta name="user-signed-in" content="false"> <meta name="head-cached-at" content="1732789101"> <meta name="environment" content="production"> <link rel="stylesheet" href="https://assets.dev.to/assets/minimal-6206ee9219dabd8e1168cebeb1f34c12ab133f7723e45d4b24dd76b43fee1fbc.css" media="all" id="main-minimal-stylesheet" /> <link rel="stylesheet" href="https://assets.dev.to/assets/views-4dd5770daa5d9d443ed73a724fb1913af9b093295bf1a72307f0fb322e5df1d9.css" media="all" id="main-views-stylesheet" /> <link rel="stylesheet" href="https://assets.dev.to/assets/crayons-f94476cf86ce9153627fd53a77e651ec54b82b6be20ddb1bf93e3dd40b81aeab.css" media="all" id="main-crayons-stylesheet" /> <script src="https://assets.dev.to/assets/base-8dcc8a97f0617dfbfe06690e34a9d71cb7dd6554611a24ec3f71fb6b96414828.js" defer="defer"></script> <script src="https://assets.dev.to/assets/application-147cebefc5c4cddde055e8f5eb0055e811469b08405170e2411fbd7944b5ac04.js" defer="defer"></script> <script src="https://assets.dev.to/assets/baseInitializers-bc498cfd7bb7d2a2da59d68d0b2055cc2dd26fee3669ab88edbb396d37bc3369.js" defer="defer"></script> <script src="https://assets.dev.to/assets/baseTracking-b6bf73e5ee66633e151e7d5b7c6bbccedfa4c59e3615be97b98c4c0f543ddae7.js" defer="defer"></script> <meta name="search-script" content="https://assets.dev.to/assets/Search-cc5e8a352578866203771def747f37c3ec6a0869de0458328e0fcba3d5d2fceb.js"> <link rel="canonical" href="https://dev.to/mdarifulhaque/2563-count-the-number-of-fair-pairs-fl2" /> <meta name="description" content="2563. Count the Number of Fair Pairs Difficulty: Medium Topics: Array, Two Pointers, Binary Search,... Tagged with php, leetcode, algorithms, programming."> <meta name="keywords" content="php, leetcode, algorithms, programming, software, coding, development, engineering, inclusive, community"> <meta property="og:type" content="article" /> <meta property="og:url" content="https://dev.to/mdarifulhaque/2563-count-the-number-of-fair-pairs-fl2" /> <meta property="og:title" content="2563. Count the Number of Fair Pairs" /> <meta property="og:description" content="2563. Count the Number of Fair Pairs Difficulty: Medium Topics: Array, Two Pointers, Binary Search,..." /> <meta property="og:site_name" content="DEV Community" /> <meta name="twitter:site" content="@thepracticaldev"> <meta name="twitter:creator" content="@"> <meta name="twitter:title" content="2563. Count the Number of Fair Pairs"> <meta name="twitter:description" content="2563. Count the Number of Fair Pairs Difficulty: Medium Topics: Array, Two Pointers, Binary Search,..."> <meta name="twitter:card" content="summary_large_image"> <meta name="twitter:widgets:new-embed-design" content="on"> <meta name="robots" content="max-snippet:-1, max-image-preview:large, max-video-preview:-1"> <meta property="og:image" content="https://media2.dev.to/dynamic/image/width=1000,height=500,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fng69ulal4fl694doquwo.png" /> <meta name="twitter:image:src" content="https://media2.dev.to/dynamic/image/width=1000,height=500,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fng69ulal4fl694doquwo.png"> <meta name="viewport" content="width=device-width, initial-scale=1.0, viewport-fit=cover"> <link rel="icon" type="image/x-icon" href="https://media2.dev.to/dynamic/image/width=32,height=,fit=scale-down,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F8j7kvp660rqzt99zui8e.png" /> <link rel="apple-touch-icon" href="https://media2.dev.to/dynamic/image/width=180,height=,fit=scale-down,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F8j7kvp660rqzt99zui8e.png"> <link rel="apple-touch-icon" sizes="152x152" href="https://media2.dev.to/dynamic/image/width=152,height=,fit=scale-down,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F8j7kvp660rqzt99zui8e.png"> <link rel="apple-touch-icon" sizes="180x180" href="https://media2.dev.to/dynamic/image/width=180,height=,fit=scale-down,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F8j7kvp660rqzt99zui8e.png"> <link rel="apple-touch-icon" sizes="167x167" href="https://media2.dev.to/dynamic/image/width=167,height=,fit=scale-down,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F8j7kvp660rqzt99zui8e.png"> <link href="https://media2.dev.to/dynamic/image/width=192,height=,fit=scale-down,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F8j7kvp660rqzt99zui8e.png" rel="icon" sizes="192x192" /> <link href="https://media2.dev.to/dynamic/image/width=128,height=,fit=scale-down,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F8j7kvp660rqzt99zui8e.png" rel="icon" sizes="128x128" /> <meta name="apple-mobile-web-app-title" content="dev.to"> <meta name="application-name" content="dev.to"> <meta name="theme-color" content="#ffffff" media="(prefers-color-scheme: light)"> <meta name="theme-color" content="#000000" media="(prefers-color-scheme: dark)"> <link rel="search" href="https://dev.to/open-search.xml" type="application/opensearchdescription+xml" title="DEV Community" /> <meta property="forem:name" content="DEV Community" /> <meta property="forem:logo" content="https://media2.dev.to/dynamic/image/width=512,height=,fit=scale-down,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F8j7kvp660rqzt99zui8e.png" /> <meta property="forem:domain" content="dev.to" /> </head> <body class="sans-serif-article-body default-header" data-user-status="logged-out" data-community-name="DEV Community" data-subscription-icon="https://assets.dev.to/assets/subscription-icon-805dfa7ac7dd660f07ed8d654877270825b07a92a03841aa99a1093bd00431b2.png" data-locale="en" data-honeybadger-key="hbp_nqu4Y66HuEKlD6YRGssZuRQnPOjDm50J8Zkr" data-deployed-at="2024-11-27T20:09:47Z" data-latest-commit-id="39401f1330aa77effb25163fd2a840dcd3adb045" data-ga-tracking="UA-71991109-1" data-cookie-banner-user-context="logged_out_only" data-cookie-banner-platform-context="off" data-algolia-id="PRSOBFP46H" data-algolia-search-key="9aa7d31610cba78851c9b1f63776a9dd" data-algolia-display="true" data-ga4-tracking-id="G-TYEM8Y3JN3"> <link rel="stylesheet" href="https://assets.dev.to/assets/minimal-6206ee9219dabd8e1168cebeb1f34c12ab133f7723e45d4b24dd76b43fee1fbc.css" media="all" id="secondary-minimal-stylesheet" /> <link rel="stylesheet" href="https://assets.dev.to/assets/views-4dd5770daa5d9d443ed73a724fb1913af9b093295bf1a72307f0fb322e5df1d9.css" media="all" id="secondary-views-stylesheet" /> <link rel="stylesheet" href="https://assets.dev.to/assets/crayons-f94476cf86ce9153627fd53a77e651ec54b82b6be20ddb1bf93e3dd40b81aeab.css" media="all" id="secondary-crayons-stylesheet" /> <div id="body-styles"> <style> :root { --accent-brand-lighter-rgb: 80, 99, 301; --accent-brand-rgb: 59, 73, 223; --accent-brand-darker-rgb: 47, 58, 178; } </style> </div> <div id="audiocontent" data-podcast=""> </div> <div class="navigation-progress" id="navigation-progress"></div> <header id="topbar" class="crayons-header topbar print-hidden"> <a href="#main-content" class="skip-content-link">Skip to content</a> <div class="crayons-header__container"> <button class="c-btn c-btn--icon-alone js-hamburger-trigger mx-2"> <svg xmlns="http://www.w3.org/2000/svg" width="24" height="24" viewBox="0 0 24 24" role="img" aria-labelledby="aozuulvnhxju436ve522uy8w57ns2kke" class="crayons-icon"><title id="aozuulvnhxju436ve522uy8w57ns2kke">Navigation menu</title> <path d="M3 4h18v2H3V4zm0 7h18v2H3v-2zm0 7h18v2H3v-2z"></path> </svg> </button> <a href="/" class="site-logo" aria-label="DEV Community Home"> <img class="site-logo__img" src="https://media2.dev.to/dynamic/image/quality=100/https://dev-to-uploads.s3.amazonaws.com/uploads/logos/resized_logo_UQww2soKuUsjaOGNB38o.png" style="aspect-ratio: 10 / 8" alt="DEV Community"> </a> <div class="crayons-header--search js-search-form" id="header-search"> <form accept-charset="UTF-8" method="get" action="/search" role="search"> <div class="crayons-fields crayons-fields--horizontal"> <div class="crayons-field flex-1 relative"> <input id="search-input" class="crayons-header--search-input crayons-textfield js-search-input" type="text" id="nav-search" name="q" placeholder="Find related posts..." autocomplete="off" /> <button type="submit" aria-label="Search" class="c-btn c-btn--icon-alone absolute inset-px right-auto mt-0 py-0"> <svg xmlns="http://www.w3.org/2000/svg" width="24" height="24" viewBox="0 0 24 24" role="img" aria-labelledby="amrryrj7fjt4u1vx832jac7wvt4o36c2" aria-hidden="true" class="crayons-icon"><title id="amrryrj7fjt4u1vx832jac7wvt4o36c2">Search</title> <path d="M18.031 16.617l4.283 4.282-1.415 1.415-4.282-4.283A8.96 8.96 0 0111 20c-4.968 0-9-4.032-9-9s4.032-9 9-9 9 4.032 9 9a8.96 8.96 0 01-1.969 5.617zm-2.006-.742A6.977 6.977 0 0018 11c0-3.868-3.133-7-7-7-3.868 0-7 3.132-7 7 0 3.867 3.132 7 7 7a6.977 6.977 0 004.875-1.975l.15-.15z"></path> </svg> </button> <a class="crayons-header--search-brand-indicator" href="https://www.algolia.com/developers/?utm_source=devto&utm_medium=referral" target="_blank" rel="noopener noreferrer"> Powered by <svg xmlns="http://www.w3.org/2000/svg" id="Layer_1" width="24" height="24" viewBox="0 0 500 500.34" role="img" aria-labelledby="aq0i5omnnnu07npsxcid6yqt9vg46pmm" aria-hidden="true" class="crayons-icon"><title id="aq0i5omnnnu07npsxcid6yqt9vg46pmm">Search</title> <defs></defs><path class="cls-1" d="M250,0C113.38,0,2,110.16,.03,246.32c-2,138.29,110.19,252.87,248.49,253.67,42.71,.25,83.85-10.2,120.38-30.05,3.56-1.93,4.11-6.83,1.08-9.52l-23.39-20.74c-4.75-4.22-11.52-5.41-17.37-2.92-25.5,10.85-53.21,16.39-81.76,16.04-111.75-1.37-202.04-94.35-200.26-206.1,1.76-110.33,92.06-199.55,202.8-199.55h202.83V407.68l-115.08-102.25c-3.72-3.31-9.43-2.66-12.43,1.31-18.47,24.46-48.56,39.67-81.98,37.36-46.36-3.2-83.92-40.52-87.4-86.86-4.15-55.28,39.65-101.58,94.07-101.58,49.21,0,89.74,37.88,93.97,86.01,.38,4.28,2.31,8.28,5.53,11.13l29.97,26.57c3.4,3.01,8.8,1.17,9.63-3.3,2.16-11.55,2.92-23.6,2.07-35.95-4.83-70.39-61.84-127.01-132.26-131.35-80.73-4.98-148.23,58.18-150.37,137.35-2.09,77.15,61.12,143.66,138.28,145.36,32.21,.71,62.07-9.42,86.2-26.97l150.36,133.29c6.45,5.71,16.62,1.14,16.62-7.48V9.49C500,4.25,495.75,0,490.51,0H250Z"></path> </svg> Algolia </a> </div> </div> </form> </div> <div class="flex items-center h-100 ml-auto"> <a class="c-link c-link--icon-alone c-link--block m:hidden mx-1" id="search-link" aria-label="Search" href="/search"> <svg xmlns="http://www.w3.org/2000/svg" width="24" height="24" viewBox="0 0 24 24" role="img" aria-labelledby="amezxw35f2qtpt9aup5pwimvc1rxv3ti" class="crayons-icon"><title id="amezxw35f2qtpt9aup5pwimvc1rxv3ti">Search</title> <path d="M18.031 16.617l4.283 4.282-1.415 1.415-4.282-4.283A8.96 8.96 0 0111 20c-4.968 0-9-4.032-9-9s4.032-9 9-9 9 4.032 9 9a8.96 8.96 0 01-1.969 5.617zm-2.006-.742A6.977 6.977 0 0018 11c0-3.868-3.133-7-7-7-3.868 0-7 3.132-7 7 0 3.867 3.132 7 7 7a6.977 6.977 0 004.875-1.975l.15-.15z"></path> </svg> </a> <div class="flex" id="authentication-top-nav-actions"> <a href="/enter" class="c-link c-link--block mr-2 whitespace-nowrap ml-auto" data-no-instant> Log in </a> <a href="/enter?state=new-user" data-tracking-id="ca_top_nav" data-tracking-source="top_navbar" class="c-cta c-cta--branded whitespace-nowrap mr-2" data-no-instant> Create account </a> </div> </div> </div> </header> <div class="hamburger"> <div class="hamburger__content"> <header class="hamburger__content__header"> <h2 class="fs-l fw-bold flex-1 break-word lh-tight">DEV Community</h2> <button class="c-btn c-btn--icon-alone js-hamburger-trigger shrink-0" aria-label="Close"> <svg xmlns="http://www.w3.org/2000/svg" width="24" height="24" viewBox="0 0 24 24" role="img" aria-labelledby="ao1w431l4jfktfbmdk9gjhwhiv9vj32p" aria-hidden="true" class="crayons-icon c-btn__icon"><title id="ao1w431l4jfktfbmdk9gjhwhiv9vj32p">Close</title><path d="M12 10.586l4.95-4.95 1.414 1.414-4.95 4.95 4.95 4.95-1.414 1.414-4.95-4.95-4.95 4.95-1.414-1.414 4.95-4.95-4.95-4.95L7.05 5.636l4.95 4.95z"></path></svg> </button> </header> <div class="p-2 js-navigation-links-container" id="authentication-hamburger-actions"> </div> </div> <div class="hamburger__overlay js-hamburger-trigger"></div> </div> <div id="active-broadcast" class="broadcast-wrapper"></div> <div id="page-content" class="wrapper stories stories-show articletag-php articletag-leetcode articletag-algorithms articletag-programming articleuser-944478" data-current-page="stories-show"> <div id="page-content-inner" data-internal-nav="false"> <div id="page-route-change" class="screen-reader-only" aria-live="polite" aria-atomic="true"></div> <style> .html-variant-wrapper { display: none} </style> <script src="https://unpkg.com/@webcomponents/webcomponentsjs@2.2.10/webcomponents-loader.js" integrity="sha384-3HK5hxQbkFqOIxMbpROlRmRtYl2LBZ52t+tqcjzsmr9NJuOWQxl8RgQSyFvq2lhy" crossorigin="anonymous" defer></script> <script src="https://assets.dev.to/assets/webShare-0686f0b9ac40589694ef6ae6a6202c44119bc781c254f6cf6d52d8a008461156.js" defer="defer"></script> <script src="https://assets.dev.to/assets/articlePage-e91bed0487621b06608474cfabffa186165e1f43f05b24581203ccc21e7aa45d.js" defer="defer"></script> <script src="https://assets.dev.to/assets/commentDropdowns-7a28d130e5b78d38b30a9495a964003a66bd64fa455fc70b766d69cf06b9ba24.js" defer="defer"></script> <script type="application/ld+json"> {"@context":"http://schema.org","@type":"Article","mainEntityOfPage":{"@type":"WebPage","@id":"https://dev.to/mdarifulhaque/2563-count-the-number-of-fair-pairs-fl2"},"url":"https://dev.to/mdarifulhaque/2563-count-the-number-of-fair-pairs-fl2","image":["https://media2.dev.to/dynamic/image/width=1080,height=1080,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fng69ulal4fl694doquwo.png","https://media2.dev.to/dynamic/image/width=1280,height=720,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fng69ulal4fl694doquwo.png","https://media2.dev.to/dynamic/image/width=1600,height=900,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fng69ulal4fl694doquwo.png"],"publisher":{"@context":"http://schema.org","@type":"Organization","name":"DEV Community","logo":{"@context":"http://schema.org","@type":"ImageObject","url":"https://media2.dev.to/dynamic/image/width=192,height=,fit=scale-down,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F8j7kvp660rqzt99zui8e.png","width":"192","height":"192"}},"headline":"2563. Count the Number of Fair Pairs","author":{"@context":"http://schema.org","@type":"Person","url":"https://dev.to/mdarifulhaque","name":"MD ARIFUL HAQUE"},"datePublished":"2024-11-13T14:54:01Z","dateModified":"2024-11-13T14:54:01Z"} </script> <div class="crayons-layout crayons-layout--3-cols crayons-layout--article"> <aside class="crayons-layout__sidebar-left" aria-label="Article actions"> <div class="crayons-article-actions print-hidden"> <div class="crayons-article-actions__inner"> <div class="reaction-drawer__outer hoverdown" style=""> <button id="reaction-drawer-trigger" aria-label="reaction-drawer-trigger" aria-pressed="false" class="hoverdown-trigger crayons-reaction pseudo-reaction crayons-tooltip__activator relative"> <svg xmlns="http://www.w3.org/2000/svg" width="24" height="24" viewBox="0 0 24 24" fill="none" role="img" aria-hidden="true" class="crayons-icon"> <g clip-path="url(#clip0_988_3276)"> <path d="M19 14V17H22V19H18.999L19 22H17L16.999 19H14V17H17V14H19ZM20.243 4.75698C22.505 7.02498 22.583 10.637 20.479 12.992L19.059 11.574C20.39 10.05 20.32 7.65998 18.827 6.16998C17.324 4.67098 14.907 4.60698 13.337 6.01698L12.002 7.21498L10.666 6.01798C9.09103 4.60598 6.67503 4.66798 5.17203 6.17198C3.68203 7.66198 3.60703 10.047 4.98003 11.623L13.412 20.069L12 21.485L3.52003 12.993C1.41603 10.637 1.49503 7.01898 3.75603 4.75698C6.02103 2.49298 9.64403 2.41698 12 4.52898C14.349 2.41998 17.979 2.48998 20.242 4.75698H20.243Z" fill="#525252"></path> </g> <defs> <clipPath id="clip0_988_3276"> <rect width="24" height="24" fill="white"></rect> </clipPath> </defs> </svg> <img aria_hidden="true" height="24" width="24" src="https://assets.dev.to/assets/heart-plus-active-9ea3b22f2bc311281db911d416166c5f430636e76b15cd5df6b3b841d830eefa.svg" /> Add reaction </button> <div class="reaction-drawer" aria-expanded="false"> <div class="reaction-drawer__container"> <button id="reaction-butt-like" name="Like" aria-label="Like" aria-pressed="false" class="crayons-reaction crayons-tooltip__activator relative pt-2 pr-2 pb-1 pl-2" data-category="like"> <img aria_hidden="true" height="32" width="32" src="https://assets.dev.to/assets/sparkle-heart-5f9bee3767e18deb1bb725290cb151c25234768a0e9a2bd39370c382d02920cf.svg" /> Like </button> <button id="reaction-butt-unicorn" name="Unicorn" aria-label="Unicorn" aria-pressed="false" class="crayons-reaction crayons-tooltip__activator relative pt-2 pr-2 pb-1 pl-2" data-category="unicorn"> <img aria_hidden="true" height="32" width="32" src="https://assets.dev.to/assets/multi-unicorn-b44d6f8c23cdd00964192bedc38af3e82463978aa611b4365bd33a0f1f4f3e97.svg" /> Unicorn </button> <button id="reaction-butt-exploding_head" name="Exploding Head" aria-label="Exploding Head" aria-pressed="false" class="crayons-reaction crayons-tooltip__activator relative pt-2 pr-2 pb-1 pl-2" data-category="exploding_head"> <img aria_hidden="true" height="32" width="32" src="https://assets.dev.to/assets/exploding-head-daceb38d627e6ae9b730f36a1e390fca556a4289d5a41abb2c35068ad3e2c4b5.svg" /> Exploding Head </button> <button id="reaction-butt-raised_hands" name="Raised Hands" aria-label="Raised Hands" aria-pressed="false" class="crayons-reaction crayons-tooltip__activator relative pt-2 pr-2 pb-1 pl-2" data-category="raised_hands"> <img aria_hidden="true" height="32" width="32" src="https://assets.dev.to/assets/raised-hands-74b2099fd66a39f2d7eed9305ee0f4553df0eb7b4f11b01b6b1b499973048fe5.svg" /> Raised Hands </button> <button id="reaction-butt-fire" name="Fire" aria-label="Fire" aria-pressed="false" class="crayons-reaction crayons-tooltip__activator relative pt-2 pr-2 pb-1 pl-2" data-category="fire"> <img aria_hidden="true" height="32" width="32" src="https://assets.dev.to/assets/fire-f60e7a582391810302117f987b22a8ef04a2fe0df7e3258a5f49332df1cec71e.svg" /> Fire </button> </div> </div> </div> <button id="reaction-butt-comment" aria-label="Jump to Comments" aria-pressed="false" class="crayons-reaction crayons-reaction--comment crayons-tooltip__activator relative" data-category="comment"> <svg xmlns="http://www.w3.org/2000/svg" width="24" height="24" viewBox="0 0 24 24" role="img" aria-hidden="true" class="crayons-icon"> <path d="M10 3h4a8 8 0 010 16v3.5c-5-2-12-5-12-11.5a8 8 0 018-8zm2 14h2a6 6 0 000-12h-4a6 6 0 00-6 6c0 3.61 2.462 5.966 8 8.48V17z"></path> </svg> Jump to Comments </button> <button id="reaction-butt-readinglist" aria-label="Add to reading list" aria-pressed="false" class="crayons-reaction crayons-reaction--readinglist crayons-tooltip__activator relative" data-category="readinglist"> <svg xmlns="http://www.w3.org/2000/svg" width="24" height="24" viewBox="0 0 24 24" role="img" aria-hidden="true" class="crayons-icon"> <path d="M5 2h14a1 1 0 011 1v19.143a.5.5 0 01-.766.424L12 18.03l-7.234 4.536A.5.5 0 014 22.143V3a1 1 0 011-1zm13 2H6v15.432l6-3.761 6 3.761V4z"></path> </svg> Save </button> <button id="reaction-butt-boost" aria-label="Boost" aria-pressed="false" class="crayons-reaction crayons-reaction--boost crayons-tooltip__activator relative"> <svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 24 24" fill="currentColor" role="img" aria-hidden="true" class="crayons-icon" width="24" height="24"> <path transform="translate(24,0) scale(-1,1)" d="M6 4H21C21.5523 4 22 4.44772 22 5V12H20V6H6V9L1 5L6 1V4ZM18 20H3C2.44772 20 2 19.5523 2 19V12H4V18H18V15L23 19L18 23V20Z"></path> </svg> Boost </button> <div id="mod-actions-menu-btn-area" class="print-hidden trusted-visible-block align-center"> </div> <div class="align-center m:relative"> <button id="article-show-more-button" aria-controls="article-show-more-dropdown" aria-expanded="false" aria-haspopup="true" class="dropbtn crayons-btn crayons-btn--ghost-dimmed crayons-btn--icon-rounded" aria-label="Share post options"> <svg xmlns="http://www.w3.org/2000/svg" width="24" height="24" role="img" aria-labelledby="akxaghhdk8hohskvd67jg2ytdvx4rptb" aria-hidden="true" class="crayons-icon dropdown-icon"><title id="akxaghhdk8hohskvd67jg2ytdvx4rptb">More...</title><path fill-rule="evenodd" clip-rule="evenodd" d="M7 12a2 2 0 11-4 0 2 2 0 014 0zm7 0a2 2 0 11-4 0 2 2 0 014 0zm5 2a2 2 0 100-4 2 2 0 000 4z"></path></svg> </button> <div id="article-show-more-dropdown" class="crayons-dropdown side-bar left-2 right-2 m:right-auto m:left-100 s:left-auto mb-1 m:mb-0 top-unset bottom-100 m:top-0 m:bottom-unset"> <div> <button id="copy-post-url-button" class="flex justify-between crayons-link crayons-link--block w-100 bg-transparent border-0" data-postUrl="https://dev.to/mdarifulhaque/2563-count-the-number-of-fair-pairs-fl2"> Copy link <svg xmlns="http://www.w3.org/2000/svg" width="24" height="24" viewBox="0 0 24 24" id="article-copy-icon" role="img" aria-labelledby="abyfz47sq5pxtiriz3p4c9teij04cu5n" aria-hidden="true" class="crayons-icon mx-2 shrink-0"><title id="abyfz47sq5pxtiriz3p4c9teij04cu5n">Copy link</title> <path d="M7 6V3a1 1 0 011-1h12a1 1 0 011 1v14a1 1 0 01-1 1h-3v3c0 .552-.45 1-1.007 1H4.007A1 1 0 013 21l.003-14c0-.552.45-1 1.007-1H7zm2 0h8v10h2V4H9v2zm-2 5v2h6v-2H7zm0 4v2h6v-2H7z"></path> </svg> </button> <div id="article-copy-link-announcer" aria-live="polite" class="crayons-notice crayons-notice--success my-2 p-1" aria-live="polite" hidden>Copied to Clipboard</div> </div> <div class="Desktop-only"> <a target="_blank" class="crayons-link crayons-link--block" rel="noopener" href='https://twitter.com/intent/tweet?text=%222563.%20Count%20the%20Number%20of%20Fair%20Pairs%22%20by%20MD%20ARIFUL%20HAQUE%20%23DEVCommunity%20https%3A%2F%2Fdev.to%2Fmdarifulhaque%2F2563-count-the-number-of-fair-pairs-fl2'> Share to X </a> <a target="_blank" class="crayons-link crayons-link--block" rel="noopener" href="https://www.linkedin.com/shareArticle?mini=true&url=https%3A%2F%2Fdev.to%2Fmdarifulhaque%2F2563-count-the-number-of-fair-pairs-fl2&title=2563.%20Count%20the%20Number%20of%20Fair%20Pairs&summary=2563.%20Count%20the%20Number%20of%20Fair%20Pairs%20%20Difficulty%3A%20Medium%20%20Topics%3A%20Array%2C%20Two%20Pointers%2C%20Binary%20Search%2C...&source=DEV%20Community"> Share to LinkedIn </a> <a target="_blank" class="crayons-link crayons-link--block" rel="noopener" href="https://www.facebook.com/sharer.php?u=https%3A%2F%2Fdev.to%2Fmdarifulhaque%2F2563-count-the-number-of-fair-pairs-fl2"> Share to Facebook </a> <a target="_blank" class="crayons-link crayons-link--block" rel="noopener" href="https://toot.kytta.dev/?text=https%3A%2F%2Fdev.to%2Fmdarifulhaque%2F2563-count-the-number-of-fair-pairs-fl2"> Share to Mastodon </a> </div> <web-share-wrapper shareurl="https://dev.to/mdarifulhaque/2563-count-the-number-of-fair-pairs-fl2" sharetitle="2563. Count the Number of Fair Pairs" sharetext="2563. Count the Number of Fair Pairs Difficulty: Medium Topics: Array, Two Pointers, Binary Search,..." template="web-share-button"> </web-share-wrapper> <template id="web-share-button"> <a href="#" class="dropdown-link-row crayons-link crayons-link--block">Share Post via...</a> </template> <a href="/report-abuse" class="crayons-link crayons-link--block">Report Abuse</a> </div> </div> </div> </div> </aside> <main id="main-content" class="crayons-layout__content grid gap-4"> <div class="article-wrapper"> <article class="crayons-card crayons-article mb-4" id="article-show-container" data-article-id="2102640" data-article-slug="2563-count-the-number-of-fair-pairs-fl2" data-author-id="944478" data-author-name="MD ARIFUL HAQUE" data-author-username="mdarifulhaque" data-co-author-ids="" data-path="/mdarifulhaque/2563-count-the-number-of-fair-pairs-fl2" data-pin-path="/stories/feed/pinned_article" data-pinned-article-id="" data-published="true" data-scheduled="false" lang=en > <header class="crayons-article__header" id="main-title"> <a class="crayons-article__cover" href="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fng69ulal4fl694doquwo.png"> <img src="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fng69ulal4fl694doquwo.png" style="aspect-ratio: auto 1000 / 420;" width="1000" height="420" class="crayons-article__cover__image" alt="Cover image for 2563. Count the Number of Fair Pairs"> </a> <div class="crayons-article__header__meta"> <div class="flex s:items-start flex-col s:flex-row"> <div id="action-space" class="crayons-article__actions mb-4 s:mb-0 s:order-last"></div> <div class="flex flex-1 mb-5 items-start"> <div class="relative"> <a href="/mdarifulhaque"><img class="radius-full align-middle" src="https://media2.dev.to/dynamic/image/width=50,height=50,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F944478%2F148ec474-230c-4c52-8b8e-5aba51bc6d2e.jpeg" width="40" height="40" alt="MD ARIFUL HAQUE" /></a> </div> <div class="pl-3 flex-1"> <a href="/mdarifulhaque" class="crayons-link fw-bold">MD ARIFUL HAQUE</a> Posted on <time datetime="2024-11-13T14:54:01Z" class="date-no-year">Nov 13</time> </div> </div> </div> <h1 class=" fs-3xl m:fs-4xl l:fs-5xl fw-bold s:fw-heavy lh-tight mb-2 medium"> 2563. Count the Number of Fair Pairs </h1> <div class="spec__tags flex flex-wrap"> <a class="crayons-tag " style=" --tag-bg: rgba(35, 161, 170, 0.10); --tag-prefix: #23A1AA; --tag-bg-hover: rgba(35, 161, 170, 0.10); --tag-prefix-hover: #23A1AA; " href="/t/php">#php</a> <a class="crayons-tag " style=" --tag-bg: rgba(0, 0, 0, 0.10); --tag-prefix: #000000; --tag-bg-hover: rgba(0, 0, 0, 0.10); --tag-prefix-hover: #000000; " href="/t/leetcode">#leetcode</a> <a class="crayons-tag " style=" --tag-bg: rgba(0, 128, 0, 0.10); --tag-prefix: #008000; --tag-bg-hover: rgba(0, 128, 0, 0.10); --tag-prefix-hover: #008000; " href="/t/algorithms">#algorithms</a> <a class="crayons-tag " style=" --tag-bg: rgba(137, 6, 6, 0.10); --tag-prefix: #890606; --tag-bg-hover: rgba(137, 6, 6, 0.10); --tag-prefix-hover: #890606; " href="/t/programming">#programming</a> </div> </div> </header> <div class="crayons-article__main "> <nav class="series-switcher crayons-card crayons-card--secondary"> <header class="crayons-card__header"> <h2 class="crayons-subtitle-2"> <a href="/mdarifulhaque/series/27523">#LEETCODE (249 Part Series)</a> </h2> </header> <div class="series-switcher__list"> <a href="/mdarifulhaque/623-add-one-row-to-tree-h2c" class="crayons-link crayons-link--contentful series-switcher__link " data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fshznz1hmv97mggsqdk41.png" title="Published Apr 16"> 1 623. Add One Row to Tree </a> <a href="/mdarifulhaque/988-smallest-string-starting-from-leaf-4l9c" class="crayons-link crayons-link--contentful series-switcher__link " data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Ftc4v0bzxm0crdja3qgm3.png" title="Published Apr 17"> 2 988. Smallest String Starting From Leaf </a> <a href="/mdarifulhaque/463-island-perimeter-2dmi" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--active series-switcher__link--inbetween" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Faghgw42kfis5gxy2yr9s.png" id="collection-link-inbetween" data-no-instant title="View more"> ... 245 more parts... </a> <a href="/mdarifulhaque/463-island-perimeter-2dmi" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Faghgw42kfis5gxy2yr9s.png" title="Published Apr 18"> 3 463. Island Perimeter </a> <a href="/mdarifulhaque/200-number-of-islands-5ak4" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F5iy4lud5cu1wpu04s5tp.png" title="Published Apr 19"> 4 200. Number of Islands </a> <a href="/mdarifulhaque/1992-find-all-groups-of-farmland-h17" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fvoi43s03pqkpxybwlf0f.png" title="Published Apr 20"> 5 1992. Find All Groups of Farmland </a> <a href="/mdarifulhaque/752-open-the-lock-562h" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fzwudv3lvliadh0ojq6t5.png" title="Published Apr 22"> 6 752. Open the Lock </a> <a href="/mdarifulhaque/1971-find-if-path-exists-in-graph-18oj" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Ft1j0689mvkbmcaj6nusn.png" title="Published Apr 22"> 7 1971. Find if Path Exists in Graph </a> <a href="/mdarifulhaque/310-minimum-height-trees-p87" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Ffn167c6rfcza4jrv9j5y.png" title="Published Apr 23"> 8 310. Minimum Height Trees </a> <a href="/mdarifulhaque/1137-n-th-tribonacci-number-5ap2" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F0exwvigfub0viht6wggp.png" title="Published Apr 24"> 9 1137. N-th Tribonacci Number </a> <a href="/mdarifulhaque/2370-longest-ideal-subsequence-43ie" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fe5o3g661pf0918gw0xc0.png" title="Published Apr 25"> 10 2370. Longest Ideal Subsequence </a> <a href="/mdarifulhaque/1289-minimum-falling-path-sum-ii-4a2n" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fppix4trms6ea66azakbz.png" title="Published Apr 26"> 11 1289. Minimum Falling Path Sum II </a> <a href="/mdarifulhaque/514-freedom-trail-4j8f" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fhtbpnfmwl1qerdgbecu9.png" title="Published Apr 27"> 12 514. Freedom Trail </a> <a href="/mdarifulhaque/834-sum-of-distances-in-tree-2a2d" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fir4b8fzj0bxz57kyxxjr.png" title="Published Apr 28"> 13 834. Sum of Distances in Tree </a> <a href="/mdarifulhaque/1700-number-of-students-unable-to-eat-lunch-344k" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F4s1n814uhu3vg3icxmsh.png" title="Published Apr 28"> 14 1700. Number of Students Unable to Eat Lunch </a> <a href="/mdarifulhaque/2073-time-needed-to-buy-tickets-429f" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fvi44vdmzx6ylmc2425z1.png" title="Published Apr 28"> 15 2073. Time Needed to Buy Tickets </a> <a href="/mdarifulhaque/2997-minimum-number-of-operations-to-make-array-xor-equal-to-k-g87" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Faml9v6xim6glzl2bth9w.png" title="Published Apr 29"> 16 2997. Minimum Number of Operations to Make Array XOR Equal to K </a> <a href="/mdarifulhaque/1614-maximum-nesting-depth-of-the-parentheses-1jol" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fhxxq4cax1uw3ww3kmr8q.png" title="Published Apr 29"> 17 1614. Maximum Nesting Depth of the Parentheses </a> <a href="/mdarifulhaque/1544-make-the-string-great-2o4h" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fham0cwqkb8b89x8mtsbp.png" title="Published Apr 29"> 18 1544. Make The String Great </a> <a href="/mdarifulhaque/1915-number-of-wonderful-substrings-3mok" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Ftm4sm4nsl0pe60bloomk.png" title="Published Apr 30"> 19 1915. Number of Wonderful Substrings </a> <a href="/mdarifulhaque/1249-minimum-remove-to-make-valid-parentheses-db4" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fktg3r7cxehgwpndmyx50.png" title="Published Apr 30"> 20 1249. Minimum Remove to Make Valid Parentheses </a> <a href="/mdarifulhaque/950-reveal-cards-in-increasing-order-4gie" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Frfn8pmzsxm8rlcty7462.png" title="Published Apr 30"> 21 950. Reveal Cards In Increasing Order </a> <a href="/mdarifulhaque/678-valid-parenthesis-string-3bcf" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F2pekas048tncz1thjgj3.png" title="Published Apr 30"> 22 678. Valid Parenthesis String </a> <a href="/mdarifulhaque/2000-reverse-prefix-of-word-4hbb" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fbfi5ggvv7qgcmkkhvlcy.png" title="Published May 1"> 23 2000. Reverse Prefix of Word </a> <a href="/mdarifulhaque/79-word-search-5d7b" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F65s2mqso8bq7eknc97of.png" title="Published May 1"> 24 79. Word Search </a> <a href="/mdarifulhaque/129-sum-root-to-leaf-numbers-1526" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fas56n3cagyloe4tfv83u.png" title="Published May 1"> 25 129. Sum Root to Leaf Numbers </a> <a href="/mdarifulhaque/2441-largest-positive-integer-that-exists-with-its-negative-67i" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Flbbdkko6ohup6krig6q3.png" title="Published May 2"> 26 2441. Largest Positive Integer That Exists With Its Negative </a> <a href="/mdarifulhaque/58-length-of-last-word-43f3" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F0kmgs2xhv95wujsfc9yn.png" title="Published May 2"> 27 58. Length of Last Word </a> <a href="/mdarifulhaque/205-isomorphic-strings-3fdb" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F5tbup2visfdma3wt1u29.png" title="Published May 2"> 28 205. Isomorphic Strings </a> <a href="/mdarifulhaque/165-compare-version-numbers-4dgg" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fzq0k32g6oac625siu4g1.png" title="Published May 3"> 29 165. Compare Version Numbers </a> <a href="/mdarifulhaque/402-remove-k-digits-2oea" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F2jzt9sngy82ve7lz09q1.png" title="Published May 3"> 30 402. Remove K Digits </a> <a href="/mdarifulhaque/42-trapping-rain-water-9jo" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fxq014u924eyvg72j4cev.png" title="Published May 3"> 31 42. Trapping Rain Water </a> <a href="/mdarifulhaque/881-boats-to-save-people-2647" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fe38wsc2d7h4yqw32k6ii.png" title="Published May 5"> 32 881. Boats to Save People </a> <a href="/mdarifulhaque/237-delete-node-in-a-linked-list-3743" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F02bdz44lqe156tacy9bl.png" title="Published May 5"> 33 237. Delete Node in a Linked List </a> <a href="/mdarifulhaque/85-maximal-rectangle-2afn" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fpct0lthp3mctn2rgbx3g.png" title="Published May 5"> 34 85. Maximal Rectangle </a> <a href="/mdarifulhaque/404-sum-of-left-leaves-pok" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fxewaeq1ihsf6suhf3wyp.png" title="Published May 6"> 35 404. Sum of Left Leaves </a> <a href="/mdarifulhaque/2487-remove-nodes-from-linked-list-37d" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fuv2ynkiiuf4ymu0d08yy.png" title="Published May 6"> 36 2487. Remove Nodes From Linked List </a> <a href="/mdarifulhaque/2816-double-a-number-represented-as-a-linked-list-1al9" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F4stx27kihs552i0xjsku.png" title="Published May 7"> 37 2816. Double a Number Represented as a Linked List </a> <a href="/mdarifulhaque/445-add-two-numbers-ii-7l0" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fgk519wagxqmybmscnvsz.png" title="Published May 7"> 38 445. Add Two Numbers II </a> <a href="/mdarifulhaque/506-relative-ranks-8id" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fkbczgtj445693jbnplf3.png" title="Published May 8"> 39 506. Relative Ranks </a> <a href="/mdarifulhaque/1-two-sum-1hf1" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fc80umvdx2xum4rmmphri.png" title="Published May 8"> 40 1. Two Sum </a> <a href="/mdarifulhaque/3075-maximize-happiness-of-selected-children-2od9" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fo05l1cpfkv6r0e3hdexc.png" title="Published May 9"> 41 3075. Maximize Happiness of Selected Children </a> <a href="/mdarifulhaque/2-add-two-numbers-42l9" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fmgnl9h9skb46vk9awhxg.png" title="Published May 9"> 42 2. Add Two Numbers </a> <a href="/mdarifulhaque/786-k-th-smallest-prime-fraction-5am7" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F8t3eho6bi63dp45mtwae.png" title="Published May 10"> 43 786. K-th Smallest Prime Fraction </a> <a href="/mdarifulhaque/3-longest-substring-without-repeating-characters-3m10" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fdjbokle96y8lsk44kp1q.png" title="Published May 10"> 44 3. Longest Substring Without Repeating Characters </a> <a href="/mdarifulhaque/3123-find-edges-in-shortest-paths-126i" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fswx5y37hkqwtr4gepi0s.png" title="Published May 10"> 45 3123. Find Edges in Shortest Paths </a> <a href="/mdarifulhaque/3122-minimum-number-of-operations-to-satisfy-conditions-2j67" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fs9pt1gxqqck04wc58g5i.png" title="Published May 10"> 46 3122. Minimum Number of Operations to Satisfy Conditions </a> <a href="/mdarifulhaque/3121-count-the-number-of-special-characters-ii-4cb2" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fkvwkryyybqcvt63rd94f.png" title="Published May 10"> 47 3121. Count the Number of Special Characters II </a> <a href="/mdarifulhaque/3113-find-the-number-of-subarrays-where-boundary-elements-are-maximum-1e90" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fse23ma9scz8i26fafkhf.png" title="Published May 10"> 48 3113. Find the Number of Subarrays Where Boundary Elements Are Maximum </a> <a href="/mdarifulhaque/2570-merge-two-2d-arrays-by-summing-values-solution-317l" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F0swws7iy0p9kbxoqdohj.png" title="Published May 10"> 49 2570. Merge Two 2D Arrays by Summing Values solution </a> <a href="/mdarifulhaque/2530-maximal-score-after-applying-k-operations-57eg" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fiqb6ch2fs6e29dsi1jjl.png" title="Published May 10"> 50 2530. Maximal Score After Applying K Operations </a> <a href="/mdarifulhaque/857-minimum-cost-to-hire-k-workers-20e6" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fcwdbgdjj5s18giyz3uyd.png" title="Published May 11"> 51 857. Minimum Cost to Hire K Workers </a> <a href="/mdarifulhaque/4-median-of-two-sorted-arrays-54pa" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fn15nvlm56zta0malkvs4.png" title="Published May 11"> 52 4. Median of Two Sorted Arrays </a> <a href="/mdarifulhaque/2373-largest-local-values-in-a-matrix-5ale" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fkj4pdhjeqbkawtkqidw2.png" title="Published May 12"> 53 2373. Largest Local Values in a Matrix </a> <a href="/mdarifulhaque/17-letter-combinations-of-a-phone-number-1fjc" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fvj1hco9sihmsqkzu7zkq.png" title="Published May 12"> 54 17. Letter Combinations of a Phone Number </a> <a href="/mdarifulhaque/861-score-after-flipping-matrix-1c3i" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fdq7uuk1l6fna71usz3hx.png" title="Published May 13"> 55 861. Score After Flipping Matrix </a> <a href="/mdarifulhaque/1219-path-with-maximum-gold-3pb0" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fn7l9fnvmzdg2d4uv2vps.png" title="Published May 14"> 56 1219. Path with Maximum Gold </a> <a href="/mdarifulhaque/2812-find-the-safest-path-in-a-grid-1p8" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fqm1yk74slue55kp1w7w8.png" title="Published May 15"> 57 2812. Find the Safest Path in a Grid </a> <a href="/mdarifulhaque/2331-evaluate-boolean-binary-tree-6ae" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fmokw46bp59q75k6paqxl.png" title="Published May 16"> 58 2331. Evaluate Boolean Binary Tree </a> <a href="/mdarifulhaque/1325-delete-leaves-with-a-given-value-2p5k" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fvvco4rooruiwpvk0vg9b.png" title="Published May 17"> 59 1325. Delete Leaves With a Given Value </a> <a href="/mdarifulhaque/979-distribute-coins-in-binary-tree-a7k" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fp3zzw1gxq71ay1hmrree.png" title="Published May 18"> 60 979. Distribute Coins in Binary Tree </a> <a href="/mdarifulhaque/3068-find-the-maximum-sum-of-node-values-2jo7" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fg10pz6rya214oeqwj6u9.png" title="Published May 19"> 61 3068. Find the Maximum Sum of Node Values </a> <a href="/mdarifulhaque/1863-sum-of-all-subset-xor-totals-4850" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fimfn7v7wrjdn9qdp15qe.png" title="Published May 20"> 62 1863. Sum of All Subset XOR Totals </a> <a href="/mdarifulhaque/78-subsets-b0e" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fk0vtwc25j7uqazy6f5ll.png" title="Published May 21"> 63 78. Subsets </a> <a href="/mdarifulhaque/131-palindrome-partitioning-193j" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Few25pah3zum75aehs2jf.png" title="Published May 22"> 64 131. Palindrome Partitioning </a> <a href="/mdarifulhaque/2597-the-number-of-beautiful-subsets-ih5" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fr75ezwih86oz7hgiqopw.png" title="Published May 23"> 65 2597. The Number of Beautiful Subsets </a> <a href="/mdarifulhaque/1255-maximum-score-words-formed-by-letters-25bj" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Ffn99ep1ta616dx5spxne.png" title="Published May 24"> 66 1255. Maximum Score Words Formed by Letters </a> <a href="/mdarifulhaque/140-word-break-ii-4a1m" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F3tk78c6o93up74m3x835.png" title="Published May 25"> 67 140. Word Break II </a> <a href="/mdarifulhaque/552-student-attendance-record-ii-1n4b" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fawwxadi2th6v0w5en4xx.png" title="Published May 26"> 68 552. Student Attendance Record II </a> <a href="/mdarifulhaque/1608-special-array-with-x-elements-greater-than-or-equal-x-gkn" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fyb2xxl1yobeety6b41d4.png" title="Published May 27"> 69 1608. Special Array With X Elements Greater Than or Equal X </a> <a href="/mdarifulhaque/1208-get-equal-substrings-within-budget-31e1" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fnyj3edutfpqs0f71hf3d.png" title="Published May 28"> 70 1208. Get Equal Substrings Within Budget </a> <a href="/mdarifulhaque/1404-number-of-steps-to-reduce-a-number-in-binary-representation-to-one-34nd" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F48wc9mv3aenaa5px0xtg.png" title="Published May 29"> 71 1404. Number of Steps to Reduce a Number in Binary Representation to One </a> <a href="/mdarifulhaque/1442-count-triplets-that-can-form-two-arrays-of-equal-xor-13eb" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fwo7vim99elfeqcsv8m67.png" title="Published May 30"> 72 1442. Count Triplets That Can Form Two Arrays of Equal XOR </a> <a href="/mdarifulhaque/260-single-number-iii-g3e" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fgbhrgl3fqnxxe63pfkrz.png" title="Published May 31"> 73 260. Single Number III </a> <a href="/mdarifulhaque/3110-score-of-a-string-fbl" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fix6qsoblxuplav8cqfy4.png" title="Published Jun 1"> 74 3110. Score of a String </a> <a href="/mdarifulhaque/344-reverse-string-43p9" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fdhjqdss66qkrtpseo2hm.png" title="Published Jun 2"> 75 344. Reverse String </a> <a href="/mdarifulhaque/2486-append-characters-to-string-to-make-subsequence-5633" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fw9ungb259qevfp47nttj.png" title="Published Jun 3"> 76 2486. Append Characters to String to Make Subsequence </a> <a href="/mdarifulhaque/409-longest-palindrome-127o" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F8177o2h9udxy2jo8cw24.png" title="Published Jun 4"> 77 409. Longest Palindrome </a> <a href="/mdarifulhaque/1002-find-common-characters-2hh9" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F7hji0tw3eva0xy4ucc00.png" title="Published Jun 5"> 78 1002. Find Common Characters </a> <a href="/mdarifulhaque/846-hand-of-straights-pg1" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fcidbu6vo2td8u22clzim.png" title="Published Jun 6"> 79 846. Hand of Straights </a> <a href="/mdarifulhaque/648-replace-words-4f20" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fcqx9sg0xz6lcoumkgnrn.png" title="Published Jun 7"> 80 648. Replace Words </a> <a href="/mdarifulhaque/523-continuous-subarray-sum-2b4" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F48xfm1wafuugx8u6t5un.png" title="Published Jun 8"> 81 523. Continuous Subarray Sum </a> <a href="/mdarifulhaque/974-subarray-sums-divisible-by-k-dd" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F33s4wevtm9conpfk7g1e.png" title="Published Jun 9"> 82 974. Subarray Sums Divisible by K </a> <a href="/mdarifulhaque/1051-height-checker-ai" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Frapbcql4k9i4xlxrjk9k.png" title="Published Jun 10"> 83 1051. Height Checker </a> <a href="/mdarifulhaque/1122-relative-sort-array-2lbd" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fucrc6ls953wxgjlkjz0n.png" title="Published Jun 11"> 84 1122. Relative Sort Array </a> <a href="/mdarifulhaque/75-sort-colors-2hjp" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F5b1g2hm0jzcmv5c98mvs.png" title="Published Jun 12"> 85 75. Sort Colors </a> <a href="/mdarifulhaque/2037-minimum-number-of-moves-to-seat-everyone-164a" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fcitjktwqnoud0enxirxt.png" title="Published Jun 13"> 86 2037. Minimum Number of Moves to Seat Everyone </a> <a href="/mdarifulhaque/945-minimum-increment-to-make-array-unique-4am8" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fj8sei9otu5kmtde29l1d.png" title="Published Jun 14"> 87 945. Minimum Increment to Make Array Unique </a> <a href="/mdarifulhaque/502-ipo-295e" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F4mc92tm1o2f4rjft2ngu.png" title="Published Jun 15"> 88 502. IPO </a> <a href="/mdarifulhaque/330-patching-array-4oo9" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fos590dh13vyv2sy09dsr.png" title="Published Jun 16"> 89 330. Patching Array </a> <a href="/mdarifulhaque/633-sum-of-square-numbers-1248" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fvtoghrvdhd7tpu7i2m8d.png" title="Published Jun 17"> 90 633. Sum of Square Numbers </a> <a href="/mdarifulhaque/826-most-profit-assigning-work-2b8o" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Flpfrzxqutherjpy7f33r.png" title="Published Jun 18"> 91 826. Most Profit Assigning Work </a> <a href="/mdarifulhaque/1482-minimum-number-of-days-to-make-m-bouquets-gn7" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F9xwu3777zkss96xqljct.png" title="Published Jun 19"> 92 1482. Minimum Number of Days to Make m Bouquets </a> <a href="/mdarifulhaque/1552-magnetic-force-between-two-balls-485i" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fzhlfugveqy3u3y57bje7.png" title="Published Jun 20"> 93 1552. Magnetic Force Between Two Balls </a> <a href="/mdarifulhaque/1052-grumpy-bookstore-owner-2ffd" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Ft43oyawrhghkol7qc762.png" title="Published Jun 21"> 94 1052. Grumpy Bookstore Owner </a> <a href="/mdarifulhaque/1248-count-number-of-nice-subarrays-405o" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fkwbdoko1tga5kbyygmrt.png" title="Published Jun 22"> 95 1248. Count Number of Nice Subarrays </a> <a href="/mdarifulhaque/1438-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit-4j9j" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Frgb8r354jixw1bkzorsd.png" title="Published Jun 23"> 96 1438. Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit </a> <a href="/mdarifulhaque/995-minimum-number-of-k-consecutive-bit-flips-5gpp" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fptkuf90v1518m1s3j7t8.png" title="Published Jun 24"> 97 995. Minimum Number of K Consecutive Bit Flips </a> <a href="/mdarifulhaque/1038-binary-search-tree-to-greater-sum-tree-20hb" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F12jkdjtaqgkuct7ten8t.png" title="Published Jun 25"> 98 1038. Binary Search Tree to Greater Sum Tree </a> <a href="/mdarifulhaque/1382-balance-a-binary-search-tree-1bj8" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="" title="Published Jun 26"> 99 1382. Balance a Binary Search Tree </a> <a href="/mdarifulhaque/1791-find-center-of-star-graph-3ahk" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Feelcue6jnpic9ianngzz.png" title="Published Jun 27"> 100 1791. Find Center of Star Graph </a> <a href="/mdarifulhaque/2285-maximum-total-importance-of-roads-5281" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fzjy8hf3wykrepkcua7c6.png" title="Published Jun 28"> 101 2285. Maximum Total Importance of Roads </a> <a href="/mdarifulhaque/2192-all-ancestors-of-a-node-in-a-directed-acyclic-graph-3h26" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fdx0ix519rrw11i5qhmzu.png" title="Published Jun 29"> 102 2192. All Ancestors of a Node in a Directed Acyclic Graph </a> <a href="/mdarifulhaque/1579-remove-max-number-of-edges-to-keep-graph-fully-traversable-4h7" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fds731odu8ubg0dlkq42n.png" title="Published Jun 30"> 103 1579. Remove Max Number of Edges to Keep Graph Fully Traversable </a> <a href="/mdarifulhaque/1550-three-consecutive-odds-53hn" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fzi8vz9tmfl7u2rxmqluk.png" title="Published Jul 1"> 104 1550. Three Consecutive Odds </a> <a href="/mdarifulhaque/350-intersection-of-two-arrays-ii-3fgm" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fvfep6swxpdcfxzh8z86u.png" title="Published Jul 2"> 105 350. Intersection of Two Arrays II </a> <a href="/mdarifulhaque/1509-minimum-difference-between-largest-and-smallest-value-in-three-moves-19pk" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F3j409uyq1bdedsbpqs90.png" title="Published Jul 3"> 106 1509. Minimum Difference Between Largest and Smallest Value in Three Moves </a> <a href="/mdarifulhaque/2181-merge-nodes-in-between-zeros-ghp" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F5e4awtkcnicvasco31u0.png" title="Published Jul 4"> 107 2181. Merge Nodes in Between Zeros </a> <a href="/mdarifulhaque/2058-find-the-minimum-and-maximum-number-of-nodes-between-critical-points-13c3" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F30qnpd1qocbtqcx99r9y.png" title="Published Jul 5"> 108 2058. Find the Minimum and Maximum Number of Nodes Between Critical Points </a> <a href="/mdarifulhaque/2582-pass-the-pillow-4gf8" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fsexxhwpmi8b7gwosr22f.png" title="Published Jul 6"> 109 2582. Pass the Pillow </a> <a href="/mdarifulhaque/1518-water-bottles-2hf0" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F80olscznxmsw4kjcwcd2.png" title="Published Jul 7"> 110 1518. Water Bottles </a> <a href="/mdarifulhaque/1823-find-the-winner-of-the-circular-game-5aa2" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fuwissbrlq1wp1n0y8yvc.png" title="Published Jul 8"> 111 1823. Find the Winner of the Circular Game </a> <a href="/mdarifulhaque/1701-average-waiting-time-51ef" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fw6ewhlm3hx71xlkgkttr.png" title="Published Jul 9"> 112 1701. Average Waiting Time </a> <a href="/mdarifulhaque/1598-crawler-log-folder-2l07" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fefq8a9mfnkauq2zl7l5z.png" title="Published Jul 10"> 113 1598. Crawler Log Folder </a> <a href="/mdarifulhaque/1190-reverse-substrings-between-each-pair-of-parentheses-39bk" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fey16zq0mozoylef9cztu.png" title="Published Jul 11"> 114 1190. Reverse Substrings Between Each Pair of Parentheses </a> <a href="/mdarifulhaque/1717-maximum-score-from-removing-substrings-2109" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F32v5crah36omdtm4bl2x.png" title="Published Jul 12"> 115 1717. Maximum Score From Removing Substrings </a> <a href="/mdarifulhaque/2751-robot-collisions-49ge" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F1s68yi0uz9cr28znqe62.png" title="Published Jul 13"> 116 2751. Robot Collisions </a> <a href="/mdarifulhaque/726-number-of-atoms-4ah3" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F9uzfxrg4h4jyyoa2gwb6.png" title="Published Jul 14"> 117 726. Number of Atoms </a> <a href="/mdarifulhaque/2196-create-binary-tree-from-descriptions-4mo2" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fsi2oaouc2mgl7cf5dhlh.png" title="Published Jul 15"> 118 2196. Create Binary Tree From Descriptions </a> <a href="/mdarifulhaque/2096-step-by-step-directions-from-a-binary-tree-node-to-another-3ijc" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fe3b3sa40xa8k7zen2jql.png" title="Published Jul 16"> 119 2096. Step-By-Step Directions From a Binary Tree Node to Another </a> <a href="/mdarifulhaque/1110-delete-nodes-and-return-forest-3h" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F364dunjfxz78v3zkby5s.png" title="Published Jul 17"> 120 1110. Delete Nodes And Return Forest </a> <a href="/mdarifulhaque/1636-sort-array-by-increasing-frequency-1gkj" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Frj215rcl320dujt7tzqq.png" title="Published Jul 23"> 121 1636. Sort Array by Increasing Frequency </a> <a href="/mdarifulhaque/1530-number-of-good-leaf-nodes-pairs-3b3n" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fgl2h8jxd7cxrk4mtyifx.png" title="Published Jul 24"> 122 1530. Number of Good Leaf Nodes Pairs </a> <a href="/mdarifulhaque/2191-sort-the-jumbled-numbers-1hgk" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fpaq416g33je4hlbfmds6.png" title="Published Jul 24"> 123 2191. Sort the Jumbled Numbers </a> <a href="/mdarifulhaque/1380-lucky-numbers-in-a-matrix-2l11" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F3kdp2fv77abuat6k92kx.png" title="Published Jul 24"> 124 1380. Lucky Numbers in a Matrix </a> <a href="/mdarifulhaque/1605-find-valid-matrix-given-row-and-column-sums-3o58" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fzq3yilck67ugsjsd1a1c.png" title="Published Jul 24"> 125 1605. Find Valid Matrix Given Row and Column Sums </a> <a href="/mdarifulhaque/2418-sort-the-people-18jl" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Ffeqv90alrap58bwe92v0.png" title="Published Jul 25"> 126 2418. Sort the People </a> <a href="/mdarifulhaque/2392-build-a-matrix-with-conditions-384j" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fnm9se9kcys7gh4wc49uq.png" title="Published Jul 25"> 127 2392. Build a Matrix With Conditions </a> <a href="/mdarifulhaque/912-sort-an-array-4ob3" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fl0bkzhpg0yodx4phhyrd.png" title="Published Jul 25"> 128 912. Sort an Array </a> <a href="/mdarifulhaque/1334-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance-2afa" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F8u9s0j1uqe2d2l0gblx4.png" title="Published Jul 26"> 129 1334. Find the City With the Smallest Number of Neighbors at a Threshold Distance </a> <a href="/mdarifulhaque/2976-minimum-cost-to-convert-string-i-4gai" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F0wsb89rbx0zct15d2hbt.png" title="Published Jul 27"> 130 2976. Minimum Cost to Convert String I </a> <a href="/mdarifulhaque/2045-second-minimum-time-to-reach-destination-419d" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F8utscsgqpikh336dtcii.png" title="Published Jul 28"> 131 2045. Second Minimum Time to Reach Destination </a> <a href="/mdarifulhaque/1395-count-number-of-teams-8lg" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fvlmpnzkpl6juw7vmceh5.png" title="Published Jul 29"> 132 1395. Count Number of Teams </a> <a href="/mdarifulhaque/1653-minimum-deletions-to-make-string-balanced-8c1" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F2cno4bdex4zrp51uepum.png" title="Published Jul 30"> 133 1653. Minimum Deletions to Make String Balanced </a> <a href="/mdarifulhaque/1105-filling-bookcase-shelves-293k" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fnt6pacorbem6oc0nhuk2.png" title="Published Jul 31"> 134 1105. Filling Bookcase Shelves </a> <a href="/mdarifulhaque/2678-number-of-senior-citizens-4jk9" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F33cbzzh1na39qrkq0ury.png" title="Published Aug 1"> 135 2678. Number of Senior Citizens </a> <a href="/mdarifulhaque/2134-minimum-swaps-to-group-all-1s-together-ii-4837" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fkmf7kpmxin67193h14xi.png" title="Published Aug 2"> 136 2134 Minimum Swaps to Group All 1's Together II </a> <a href="/mdarifulhaque/1460-make-two-arrays-equal-by-reversing-subarrays-4e5l" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F1khkfhqhjyhwva0jvb45.png" title="Published Aug 3"> 137 1460. Make Two Arrays Equal by Reversing Subarrays </a> <a href="/mdarifulhaque/1508-range-sum-of-sorted-subarray-sums-5hbm" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fbp06ieu1g5p95grjfyn0.png" title="Published Aug 4"> 138 1508. Range Sum of Sorted Subarray Sums </a> <a href="/mdarifulhaque/2053-kth-distinct-string-in-an-array-2c5k" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F1xsb31bww6z32di9r8iy.png" title="Published Aug 5"> 139 2053. Kth Distinct String in an Array </a> <a href="/mdarifulhaque/3016-minimum-number-of-pushes-to-type-word-ii-4epo" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fod4r8c5t980baydgknax.png" title="Published Aug 6"> 140 3016. Minimum Number of Pushes to Type Word II </a> <a href="/mdarifulhaque/273-integer-to-english-words-4c25" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F47dmphsj60rmnqd0dooy.png" title="Published Aug 7"> 141 273. Integer to English Words </a> <a href="/mdarifulhaque/885-spiral-matrix-iii-3m4l" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Flr4y514nxj47n4snesqs.png" title="Published Aug 8"> 142 885. Spiral Matrix III </a> <a href="/mdarifulhaque/840-magic-squares-in-grid-2pek" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fgy2i3rq1gp4ccdyxswvk.png" title="Published Aug 9"> 143 840. Magic Squares In Grid </a> <a href="/mdarifulhaque/959-regions-cut-by-slashes-2cog" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fiu8ucljbrxry6w3rdyn3.png" title="Published Aug 10"> 144 959. Regions Cut By Slashes </a> <a href="/mdarifulhaque/1568-minimum-number-of-days-to-disconnect-island-ddf" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fr9t6d50i2pm26cix26oh.png" title="Published Aug 12"> 145 1568. Minimum Number of Days to Disconnect Island </a> <a href="/mdarifulhaque/703-kth-largest-element-in-a-stream-3ck0" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F5h9m32l8eymwypfrn7tu.png" title="Published Aug 12"> 146 703. Kth Largest Element in a Stream </a> <a href="/mdarifulhaque/40-combination-sum-ii-14ni" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fs8pyqjci1g5klqo1h3bk.png" title="Published Aug 13"> 147 40. Combination Sum II </a> <a href="/mdarifulhaque/719-find-k-th-smallest-pair-distance-2pep" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fhwiahbp6fpt18edcwjog.png" title="Published Aug 14"> 148 719. Find K-th Smallest Pair Distance </a> <a href="/mdarifulhaque/860-lemonade-change-49jm" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F0dm26ujv3e38qeou2vfe.png" title="Published Aug 15"> 149 860. Lemonade Change </a> <a href="/mdarifulhaque/624-maximum-distance-in-arrays-3659" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fwwh7atz5480mgtunuk20.png" title="Published Aug 16"> 150 624. Maximum Distance in Arrays </a> <a href="/mdarifulhaque/1937-maximum-number-of-points-with-cost-nh" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fkqk8le6rrgn0p1cuj61x.png" title="Published Aug 17"> 151 1937. Maximum Number of Points with Cost </a> <a href="/mdarifulhaque/650-2-keys-keyboard-57n0" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Faskc2wq4nvp05qhsu0uh.png" title="Published Aug 19"> 152 650. 2 Keys Keyboard </a> <a href="/mdarifulhaque/1140-stone-game-ii-1cco" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fc7fzcjgiz8xn5pr003if.png" title="Published Aug 20"> 153 1140. Stone Game II </a> <a href="/mdarifulhaque/664-strange-printer-2mpj" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fif3io6tg7j7gmtutuaiu.png" title="Published Aug 21"> 154 664. Strange Printer </a> <a href="/mdarifulhaque/476-number-complement-d7i" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fxo1mrozj4v7ioa59muic.png" title="Published Aug 22"> 155 476. Number Complement </a> <a href="/mdarifulhaque/592-fraction-addition-and-subtraction-3fo0" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Ffik2j26jhf3ya0ihzore.png" title="Published Aug 23"> 156 592. Fraction Addition and Subtraction </a> <a href="/mdarifulhaque/564-find-the-closest-palindrome-4mlj" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Ft2lbwepip3d2p3i35iu9.png" title="Published Aug 24"> 157 564. Find the Closest Palindrome </a> <a href="/mdarifulhaque/145-binary-tree-postorder-traversal-5628" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fuhk3fcvqw7j6sz5ychid.png" title="Published Aug 25"> 158 145. Binary Tree Postorder Traversal </a> <a href="/mdarifulhaque/590-n-ary-tree-postorder-traversa-1493" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Ful47a1ryd3qouzw71lq7.png" title="Published Aug 26"> 159 590. N-ary Tree Postorder Traversa </a> <a href="/mdarifulhaque/1514-path-with-maximum-probability-2oag" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fvsmq2uxvre7bkhcy8kpe.png" title="Published Aug 27"> 160 1514. Path with Maximum Probability </a> <a href="/mdarifulhaque/1905-count-sub-islands-32am" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F5e8ad97zdex20cviz3yz.png" title="Published Aug 28"> 161 1905. Count Sub Islands </a> <a href="/mdarifulhaque/947-most-stones-removed-with-same-row-or-column-2io8" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F7apz08adw2nuihhvtrud.png" title="Published Aug 29"> 162 947. Most Stones Removed with Same Row or Column </a> <a href="/mdarifulhaque/2699-modify-graph-edge-weights-p7j" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F8eyeitx2vb33w6ki8hw5.png" title="Published Aug 30"> 163 2699. Modify Graph Edge Weights </a> <a href="/mdarifulhaque/2022-convert-1d-array-into-2d-array-4h1o" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fdfr2zldva9hzfq5eg2xz.png" title="Published Sep 1"> 164 2022. Convert 1D Array Into 2D Array </a> <a href="/mdarifulhaque/1894-find-the-student-that-will-replace-the-chalk-5092" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F01tgp4ha6simkp135hku.png" title="Published Sep 2"> 165 1894. Find the Student that Will Replace the Chalk </a> <a href="/mdarifulhaque/1894-find-the-student-that-will-replace-the-chalk-l40" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F01tgp4ha6simkp135hku.png" title="Published Sep 2"> 166 1894. Find the Student that Will Replace the Chalk </a> <a href="/mdarifulhaque/1945-sum-of-digits-of-string-after-convert-3fi9" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Flk46fxh2x93na3rckq3g.png" title="Published Sep 3"> 167 1945. Sum of Digits of String After Convert </a> <a href="/mdarifulhaque/1367-linked-list-in-binary-tree-31n8" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F5c6zpph7q49y3rs6t7vw.png" title="Published Sep 7"> 168 1367. Linked List in Binary Tree </a> <a href="/mdarifulhaque/3217-delete-nodes-from-linked-list-present-in-array-2fc" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F2c2x2rl22c656vmpv9zv.png" title="Published Sep 7"> 169 3217. Delete Nodes From Linked List Present in Array </a> <a href="/mdarifulhaque/725-split-linked-list-in-parts-3gin" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fvnzlieeltdcii34g7vt3.png" title="Published Sep 8"> 170 725. Split Linked List in Parts </a> <a href="/mdarifulhaque/2326-spiral-matrix-iv-4m4k" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fn55urhs8omwklutvs62z.png" title="Published Sep 9"> 171 2326. Spiral Matrix IV </a> <a href="/mdarifulhaque/2807-insert-greatest-common-divisors-in-linked-list-3c7p" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F9mijnzrd86hryhamt16x.png" title="Published Sep 10"> 172 2807. Insert Greatest Common Divisors in Linked List </a> <a href="/mdarifulhaque/2220-minimum-bit-flips-to-convert-number-4gg5" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fs9k31u4kxbvjpxbnp3x8.png" title="Published Sep 11"> 173 2220. Minimum Bit Flips to Convert Number </a> <a href="/mdarifulhaque/1684-count-the-number-of-consistent-strings-5e38" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fhbyvm6o4ub5lzw5mpwrp.png" title="Published Sep 12"> 174 1684. Count the Number of Consistent Strings </a> <a href="/mdarifulhaque/1310-xor-queries-of-a-subarray-4nki" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fyaw8s6fnwqcjj4doxzgp.png" title="Published Sep 13"> 175 1310. XOR Queries of a Subarray </a> <a href="/mdarifulhaque/2419-longest-subarray-with-maximum-bitwise-and-5cb3" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fpoddjy0o1fn0j7yidojv.png" title="Published Sep 14"> 176 2419. Longest Subarray With Maximum Bitwise AND </a> <a href="/mdarifulhaque/1371-find-the-longest-substring-containing-vowels-in-even-counts-1kdj" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fz6l8dnigbfpm5atu6mfp.png" title="Published Sep 15"> 177 1371. Find the Longest Substring Containing Vowels in Even Counts </a> <a href="/mdarifulhaque/539-minimum-time-difference-3665" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fere0cl1mjt7aaceeui4m.png" title="Published Sep 16"> 178 539. Minimum Time Difference </a> <a href="/mdarifulhaque/884-uncommon-words-from-two-sentences-2p3d" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fgifhn35h4d0ku5nlrg9y.png" title="Published Sep 17"> 179 884. Uncommon Words from Two Sentences </a> <a href="/mdarifulhaque/179-largest-number-26cd" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fr3iucivuk1i02jbbyaez.png" title="Published Sep 18"> 180 179. Largest Number </a> <a href="/mdarifulhaque/241-different-ways-to-add-parentheses-45k2" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fx0kaz09mevxva1ifeb47.png" title="Published Sep 19"> 181 241. Different Ways to Add Parentheses </a> <a href="/mdarifulhaque/214-shortest-palindrome-b1l" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fed9e48dxyxnbio2q2a7j.png" title="Published Sep 20"> 182 214. Shortest Palindrome </a> <a href="/mdarifulhaque/386-lexicographical-numbers-2c60" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fqj75s35buzybg9n6wjye.png" title="Published Sep 21"> 183 386. Lexicographical Numbers </a> <a href="/mdarifulhaque/440-k-th-smallest-in-lexicographical-order-3i8h" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fn3dpceiab1wa8j8hssbv.png" title="Published Sep 22"> 184 440. K-th Smallest in Lexicographical Order </a> <a href="/mdarifulhaque/2707-extra-characters-in-a-string-2d8c" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fp4v2c22ql4um6trfx9gz.png" title="Published Sep 23"> 185 2707. Extra Characters in a String </a> <a href="/mdarifulhaque/3043-find-the-length-of-the-longest-common-prefix-41fi" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F6tyyohtavtg09g3bjpz4.png" title="Published Sep 24"> 186 3043. Find the Length of the Longest Common Prefix </a> <a href="/mdarifulhaque/2416-sum-of-prefix-scores-of-strings-af6" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fz6c9buh47wt9v286zhqh.png" title="Published Sep 25"> 187 2416. Sum of Prefix Scores of Strings </a> <a href="/mdarifulhaque/729-my-calendar-i-1h94" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F1cjtpgc36fhgwct8ej52.png" title="Published Sep 26"> 188 729. My Calendar I </a> <a href="/mdarifulhaque/731-my-calendar-ii-3hf4" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fjq0jw757mg0ofd4kdc9d.png" title="Published Sep 27"> 189 731. My Calendar II </a> <a href="/mdarifulhaque/641-design-circular-deque-1b63" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F49esoxq42ytsh09rtlcm.png" title="Published Sep 28"> 190 641. Design Circular Deque </a> <a href="/mdarifulhaque/432-all-oone-data-structure-5374" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F7nzs0wnoth7hrw0onpfm.png" title="Published Sep 29"> 191 432. All O`one Data Structure </a> <a href="/mdarifulhaque/1381-design-a-stack-with-increment-operation-3cco" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fsvwq1ntn936u19ew83cd.png" title="Published Sep 30"> 192 1381. Design a Stack With Increment Operation </a> <a href="/mdarifulhaque/1497-check-if-array-pairs-are-divisible-by-k-5afc" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F0xbbu8w8benvsqtebn7k.png" title="Published Oct 1"> 193 1497. Check If Array Pairs Are Divisible by k </a> <a href="/mdarifulhaque/1331-rank-transform-of-an-array-21ip" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fngg12fttdvwzp87gbt6m.png" title="Published Oct 2"> 194 1331. Rank Transform of an Array </a> <a href="/mdarifulhaque/1590-make-sum-divisible-by-p-41jp" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fyqo1y97q6zxsahh9q1un.png" title="Published Oct 3"> 195 1590. Make Sum Divisible by P </a> <a href="/mdarifulhaque/2491-divide-players-into-teams-of-equal-skill-113o" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F4yy827fe31d9xaktmptb.png" title="Published Oct 4"> 196 2491. Divide Players Into Teams of Equal Skill </a> <a href="/mdarifulhaque/567-permutation-in-string-h5k" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fre6te1klnv6fgakya7ip.png" title="Published Oct 5"> 197 567. Permutation in String </a> <a href="/mdarifulhaque/1813-sentence-similarity-iii-33lm" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fc1unpqi044u522rk7tn7.png" title="Published Oct 6"> 198 1813. Sentence Similarity III </a> <a href="/mdarifulhaque/2696-minimum-string-length-after-removing-substrings-2a36" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fqokd6r8thjx48m2wc8k3.png" title="Published Oct 7"> 199 2696. Minimum String Length After Removing Substrings </a> <a href="/mdarifulhaque/1963-minimum-number-of-swaps-to-make-the-string-balanced-4ckc" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fd85pihfca3ig0884kkbn.png" title="Published Oct 8"> 200 1963. Minimum Number of Swaps to Make the String Balanced </a> <a href="/mdarifulhaque/1963-minimum-number-of-swaps-to-make-the-string-balanced-1nc4" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fd85pihfca3ig0884kkbn.png" title="Published Oct 8"> 201 1963. Minimum Number of Swaps to Make the String Balanced </a> <a href="/mdarifulhaque/921-minimum-add-to-make-parentheses-valid-14jk" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fabr0c8h6gge2efftn9b1.png" title="Published Oct 9"> 202 921. Minimum Add to Make Parentheses Valid </a> <a href="/mdarifulhaque/962-maximum-width-ramp-2e56" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fxdgh7mdzgc3gtrd6p2lr.png" title="Published Oct 10"> 203 962. Maximum Width Ramp </a> <a href="/mdarifulhaque/1942-the-number-of-the-smallest-unoccupied-chair-1db0" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F3y4l8p8f1lvizygy1kn2.png" title="Published Oct 11"> 204 1942. The Number of the Smallest Unoccupied Chair </a> <a href="/mdarifulhaque/2406-divide-intervals-into-minimum-number-of-groups-3bb9" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fu2edfogiwyjeqxbdf3fk.png" title="Published Oct 12"> 205 2406. Divide Intervals Into Minimum Number of Groups </a> <a href="/mdarifulhaque/632-smallest-range-covering-elements-from-k-lists-30d4" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F7sxkvrbgn45235c1vk2b.png" title="Published Oct 13"> 206 632. Smallest Range Covering Elements from K Lists </a> <a href="/mdarifulhaque/2938-separate-black-and-white-balls-4052" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fwn7988g0ylqd4cpegit4.png" title="Published Oct 16"> 207 2938. Separate Black and White Balls </a> <a href="/mdarifulhaque/1405-longest-happy-string-9mg" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F28akm6a66kr7v1uj5ikl.png" title="Published Oct 16"> 208 1405. Longest Happy String </a> <a href="/mdarifulhaque/670-maximum-swap-3ago" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F4drwxm4pz6muv1m2m51k.png" title="Published Oct 17"> 209 670. Maximum Swap </a> <a href="/mdarifulhaque/2044-count-number-of-maximum-bitwise-or-subsets-dim" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Frm37lg8qlearcneqcvrl.png" title="Published Oct 18"> 210 2044. Count Number of Maximum Bitwise-OR Subsets </a> <a href="/mdarifulhaque/1545-find-kth-bit-in-nth-binary-string-1lek" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Ft90g306fa80qn37op1af.png" title="Published Oct 19"> 211 1545. Find Kth Bit in Nth Binary String </a> <a href="/mdarifulhaque/1106-parsing-a-boolean-expression-281a" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fgg2d2t21avwbglmxbe6y.png" title="Published Oct 20"> 212 1106. Parsing A Boolean Expression </a> <a href="/mdarifulhaque/1593-split-a-string-into-the-max-number-of-unique-substrings-2l3k" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F8y7xsrkhzd4octf1m610.png" title="Published Oct 21"> 213 1593. Split a String Into the Max Number of Unique Substrings </a> <a href="/mdarifulhaque/2583-kth-largest-sum-in-a-binary-tree-4n79" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fu2m42e551rym6te86z55.png" title="Published Oct 22"> 214 2583. Kth Largest Sum in a Binary Tree </a> <a href="/mdarifulhaque/2641-cousins-in-binary-tree-ii-3idh" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F0abz296gjaq8uu1jckxl.png" title="Published Oct 23"> 215 2641. Cousins in Binary Tree II </a> <a href="/mdarifulhaque/951-flip-equivalent-binary-trees-1g45" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fule3cymftoklixnxk4uz.png" title="Published Oct 24"> 216 951. Flip Equivalent Binary Trees </a> <a href="/mdarifulhaque/1233-remove-sub-folders-from-the-filesystem-3ikg" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Ft5xglzju0fs18icq16pb.png" title="Published Oct 25"> 217 1233. Remove Sub-Folders from the Filesystem </a> <a href="/mdarifulhaque/2458-height-of-binary-tree-after-subtree-removal-queries-286k" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F3380uglxg49uz5bpu7gx.png" title="Published Oct 26"> 218 2458. Height of Binary Tree After Subtree Removal Queries </a> <a href="/mdarifulhaque/1277-count-square-submatrices-with-all-ones-4e1m" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fz7k9awzo6aus2qpwzpyq.png" title="Published Oct 27"> 219 1277. Count Square Submatrices with All Ones </a> <a href="/mdarifulhaque/learning-from-200-leetcode-problems-a-guide-to-building-strong-problem-solving-skills-17nd" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fkc8mgm3d0g9ihngv7e2d.png" title="Published Oct 27"> 220 Learning from 200+ LeetCode Problems: A Guide to Building Strong Problem-Solving Skills </a> <a href="/mdarifulhaque/2684-maximum-number-of-moves-in-a-grid-371a" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F31fz8pi1q4wcexb919pm.png" title="Published Oct 29"> 221 2684. Maximum Number of Moves in a Grid </a> <a href="/mdarifulhaque/1671-minimum-number-of-removals-to-make-mountain-array-4lac" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F0anquugj5wb7y1spem9l.png" title="Published Oct 30"> 222 1671. Minimum Number of Removals to Make Mountain Array </a> <a href="/mdarifulhaque/2463-minimum-total-distance-traveled-4850" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F8o4xqg1d7v21kurs0jgz.png" title="Published Oct 31"> 223 2463. Minimum Total Distance Traveled </a> <a href="/mdarifulhaque/1957-delete-characters-to-make-fancy-string-3k99" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F8sf38v9ufvy77h0eofae.png" title="Published Nov 1"> 224 1957. Delete Characters to Make Fancy String </a> <a href="/mdarifulhaque/2490-circular-sentence-2jp0" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fgrevkfexlorm04yiyjzs.png" title="Published Nov 2"> 225 2490. Circular Sentence </a> <a href="/mdarifulhaque/796-rotate-string-48ki" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fzixtg9u751gcv8x4t3fx.png" title="Published Nov 3"> 226 796. Rotate String </a> <a href="/mdarifulhaque/3163-string-compression-iii-1on4" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F7yqedqktgpy6qzkjjh7y.png" title="Published Nov 4"> 227 3163. String Compression III </a> <a href="/mdarifulhaque/2914-minimum-number-of-changes-to-make-binary-string-beautiful-270a" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fzad7rzivtik78xeta0mi.png" title="Published Nov 5"> 228 2914. Minimum Number of Changes to Make Binary String Beautiful </a> <a href="/mdarifulhaque/3011-find-if-array-can-be-sorted-38jb" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F3c5jy0npc9vl8jhrsrr1.png" title="Published Nov 6"> 229 3011. Find if Array Can Be Sorted </a> <a href="/mdarifulhaque/2275-largest-combination-with-bitwise-and-greater-than-zero-2hdf" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F11x4xtvu9jukuzmfpktu.png" title="Published Nov 7"> 230 2275. Largest Combination With Bitwise AND Greater Than Zero </a> <a href="/mdarifulhaque/1829-maximum-xor-for-each-query-3p3d" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F1prw6l3pxt4wacdymlxi.png" title="Published Nov 8"> 231 1829. Maximum XOR for Each Query </a> <a href="/mdarifulhaque/3133-minimum-array-end-15fa" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fwf5bhc46shpuaxnets49.png" title="Published Nov 9"> 232 3133. Minimum Array End </a> <a href="/mdarifulhaque/3097-shortest-subarray-with-or-at-least-k-ii-22fp" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fwkm9xpdo47r7xz40edln.png" title="Published Nov 10"> 233 3097. Shortest Subarray With OR at Least K II </a> <a href="/mdarifulhaque/2601-prime-subtraction-operation-h6j" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F7toawkooky2d4uaa9gun.png" title="Published Nov 11"> 234 2601. Prime Subtraction Operation </a> <a href="/mdarifulhaque/2070-most-beautiful-item-for-each-query-2ik5" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F1m5mewbxoh3bjizzvafn.png" title="Published Nov 12"> 235 2070. Most Beautiful Item for Each Query </a> <a href="/mdarifulhaque/2563-count-the-number-of-fair-pairs-fl2" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--active series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fng69ulal4fl694doquwo.png" title="Published Nov 13"> 236 2563. Count the Number of Fair Pairs </a> <a href="/mdarifulhaque/2064-minimized-maximum-of-products-distributed-to-any-store-2kl3" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F5dl4gywysknkykrvj7jp.png" title="Published Nov 14"> 237 2064. Minimized Maximum of Products Distributed to Any Store </a> <a href="/mdarifulhaque/1574-shortest-subarray-to-be-removed-to-make-array-sorted-3ang" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fvirjl98tb71h1sxena5y.png" title="Published Nov 15"> 238 1574. Shortest Subarray to be Removed to Make Array Sorted </a> <a href="/mdarifulhaque/3254-find-the-power-of-k-size-subarrays-i-41kc" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fcu976nkg90f4ij289oag.png" title="Published Nov 16"> 239 3254. Find the Power of K-Size Subarrays I </a> <a href="/mdarifulhaque/862-shortest-subarray-with-sum-at-least-k-5bli" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F28njyib2py98foh47gkq.png" title="Published Nov 17"> 240 862. Shortest Subarray with Sum at Least K </a> <a href="/mdarifulhaque/2461-maximum-sum-of-distinct-subarrays-with-length-k-4pic" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fy5jkyh9949379gjxoeqs.png" title="Published Nov 19"> 241 2461. Maximum Sum of Distinct Subarrays With Length K </a> <a href="/mdarifulhaque/2516-take-k-of-each-character-from-left-and-right-5ea2" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fe0lu0bmkai9op1zxgu7m.png" title="Published Nov 20"> 242 2516. Take K of Each Character From Left and Right </a> <a href="/mdarifulhaque/2257-count-unguarded-cells-in-the-grid-4ibc" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F7204v2qs9ezngc3v2rxa.png" title="Published Nov 21"> 243 2257. Count Unguarded Cells in the Grid </a> <a href="/mdarifulhaque/1072-flip-columns-for-maximum-number-of-equal-rows-48o5" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F08jxh0njg3cxv2tij5bp.png" title="Published Nov 22"> 244 1072. Flip Columns For Maximum Number of Equal Rows </a> <a href="/mdarifulhaque/1975-maximum-matrix-sum-okn" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fagkrkixqv29h1n90gcmj.png" title="Published Nov 24"> 245 1975. Maximum Matrix Sum </a> <a href="/mdarifulhaque/773-sliding-puzzle-42ki" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fzaiq58k4g0550iz1zdtn.png" title="Published Nov 25"> 246 773. Sliding Puzzle </a> <a href="/mdarifulhaque/2924-find-champion-ii-lbb" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fx0ct232oqk2a2rt4tgzi.png" title="Published Nov 26"> 247 2924. Find Champion II </a> <a href="/mdarifulhaque/3243-shortest-distance-after-road-addition-queries-i-30i5" class="crayons-link crayons-link--contentful series-switcher__link " data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Foobzuc008327qfvzf7qu.png" title="Published Nov 27"> 248 3243. Shortest Distance After Road Addition Queries I </a> <a href="/mdarifulhaque/2290-minimum-obstacle-removal-to-reach-corner-4fg6" class="crayons-link crayons-link--contentful series-switcher__link " data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F4kzm76nk1te6wgumnjan.png" title="Published Nov 28"> 249 2290. Minimum Obstacle Removal to Reach Corner </a> </div> </nav> <div class="crayons-article__body text-styles spec__body" data-article-id="2102640" id="article-body"> 2563. Count the Number of Fair Pairs Difficulty: Medium Topics: <code>Array</code>, <code>Two Pointers</code>, <code>Binary Search</code>, <code>Sorting</code> Given a 0-indexed integer array <code>nums</code> of size <code>n</code> and two integers <code>lower</code> and <code>upper</code>, return the number of fair pairs. A pair <code>(i, j)</code> is fair if: <ul> <li> <code>0 <= i < j < n</code>, and</li> <li><code>lower <= nums[i] + nums[j] <= upper</code></li> </ul> Example 1: <ul> <li> Input: nums = [0,1,7,4,4,5], lower = 3, upper = 6</li> <li> Output: 6</li> <li> Explanation: There are 6 fair pairs: (0,3), (0,4), (0,5), (1,3), (1,4), and (1,5).</li> </ul> Example 2: <ul> <li> Input: nums = [1,7,9,2,5], lower = 11, upper = 11</li> <li> Output: 1</li> <li> Explanation: There is a single fair pair: (2,3).</li> </ul> Constraints: <ul> <li><code>1 <= nums.length <= 105</code></li> <li>nums.length == n</li> <li><code>-109 <= nums[i] <= 109</code></li> <li><code>-109 <= lower <= upper <= 109</code></li> </ul> Hint: <ol> <li>Sort the array in ascending order.</li> <li>For each number in the array, keep track of the smallest and largest numbers in the array that can form a fair pair with this number.</li> <li>As you move to larger number, both boundaries move down.</li> </ol> Solution: We can use the following approach: <ol> <li> Sort the Array: Sorting helps us leverage the two-pointer technique and perform binary searches more effectively.</li> <li> Two-Pointer Technique: For each element in the sorted array, we can calculate the range of elements that can form a fair pair with it. We use binary search to find this range.</li> <li> Binary Search for Bounds: For each element <code>nums[i]</code>, find the range <code>[lower, upper] - nums[i]</code> for <code>j > i</code>. We use binary search to find the smallest and largest indices that satisfy this range.</li> </ol> Let's implement this solution in PHP: <a href="https://github.com/mah-shamim/leet-code-in-php/tree/main/algorithms/002563-count-the-number-of-fair-pairs" target="_blank" rel="noopener noreferrer">2563. Count the Number of Fair Pairs</a> <div class="highlight js-code-highlight"> <pre class="highlight php"><code><?php /** * @param Integer[] $nums * @param Integer $lower * @param Integer $upper * @return Integer */ function countFairPairs($nums, $lower, $upper) { ... ... ... /** * go to ./solution.php */ } /** * Helper function for binary search to find left boundary * * @param $arr * @param $target * @param $start * @return int|mixed */ function lowerBound($arr, $target, $start) { ... ... ... /** * go to ./solution.php */ } /** * Helper function for binary search to find right boundary * * @param $arr * @param $target * @param $start * @return int|mixed */ function upperBound($arr, $target, $start) { ... ... ... /** * go to ./solution.php */ } // Example usage: $nums = [0, 1, 7, 4, 4, 5]; $lower = 3; $upper = 6; echo countFairPairs($nums, $lower, $upper); // Output: 6 ?> </code></pre> <div class="highlight__panel js-actions-panel"> <div class="highlight__panel-action js-fullscreen-code-action"> <svg xmlns="http://www.w3.org/2000/svg" width="20px" height="20px" viewbox="0 0 24 24" class="highlight-action crayons-icon highlight-action--fullscreen-on"><title>Enter fullscreen mode</title> <path d="M16 3h6v6h-2V5h-4V3zM2 3h6v2H4v4H2V3zm18 16v-4h2v6h-6v-2h4zM4 19h4v2H2v-6h2v4z"></path> </svg> <svg xmlns="http://www.w3.org/2000/svg" width="20px" height="20px" viewbox="0 0 24 24" class="highlight-action crayons-icon highlight-action--fullscreen-off"><title>Exit fullscreen mode</title> <path d="M18 7h4v2h-6V3h2v4zM8 9H2V7h4V3h2v6zm10 8v4h-2v-6h6v2h-4zM8 15v6H6v-4H2v-2h6z"></path> </svg> </div> </div> </div> <h3> <a name="explanation" href="#explanation"> </a> Explanation: </h3> <ol> <li> Sorting: We sort the array <code>nums</code> to make it easier to find valid pairs with binary search.</li> <li> Binary Search Bounds: <ul> <li>For each element <code>nums[i]</code>, we find the <code>low</code> and <code>high</code> values, which are the bounds we want the sum to fall within.</li> <li>We use two binary searches to find the range of indices <code>[left, right)</code> where <code>nums[i] + nums[j]</code> falls within <code>[lower, upper]</code>.</li> </ul> </li> <li> Counting Pairs: We add the count of valid indices between <code>left</code> and <code>right</code> for each <code>i</code>.</li> </ol> This approach has a time complexity of O(n log n) due to sorting and binary search for each element, which is efficient enough for large inputs. Contact Links If you found this series helpful, please consider giving the <a href="https://github.com/mah-shamim/leet-code-in-php" target="_blank" rel="noopener noreferrer">repository</a> a star on GitHub or sharing the post on your favorite social networks 😍. <a href="https://isolatedcompliments.com/v09uayg6h?key=a647d02f1aafcddaf10536d7cd00bd7c" target="_blank" rel="noopener noreferrer">Your support would mean a lot to me!</a> If you want more helpful content like this, feel free to follow me: <ul> <li><a href="https://www.linkedin.com/in/arifulhaque/" target="_blank" rel="noopener noreferrer">LinkedIn</a></li> <li><a href="https://github.com/mah-shamim" target="_blank" rel="noopener noreferrer">GitHub</a></li> </ul> </div> <nav class="series-switcher crayons-card crayons-card--secondary"> <header class="crayons-card__header"> <h2 class="crayons-subtitle-2"> <a href="/mdarifulhaque/series/27523">#LEETCODE (249 Part Series)</a> </h2> </header> <div class="series-switcher__list"> <a href="/mdarifulhaque/623-add-one-row-to-tree-h2c" class="crayons-link crayons-link--contentful series-switcher__link " data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fshznz1hmv97mggsqdk41.png" title="Published Apr 16"> 1 623. Add One Row to Tree </a> <a href="/mdarifulhaque/988-smallest-string-starting-from-leaf-4l9c" class="crayons-link crayons-link--contentful series-switcher__link " data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Ftc4v0bzxm0crdja3qgm3.png" title="Published Apr 17"> 2 988. Smallest String Starting From Leaf </a> <a href="/mdarifulhaque/463-island-perimeter-2dmi" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--active series-switcher__link--inbetween" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Faghgw42kfis5gxy2yr9s.png" id="collection-link-inbetween" data-no-instant title="View more"> ... 245 more parts... </a> <a href="/mdarifulhaque/463-island-perimeter-2dmi" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Faghgw42kfis5gxy2yr9s.png" title="Published Apr 18"> 3 463. Island Perimeter </a> <a href="/mdarifulhaque/200-number-of-islands-5ak4" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F5iy4lud5cu1wpu04s5tp.png" title="Published Apr 19"> 4 200. Number of Islands </a> <a href="/mdarifulhaque/1992-find-all-groups-of-farmland-h17" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fvoi43s03pqkpxybwlf0f.png" title="Published Apr 20"> 5 1992. Find All Groups of Farmland </a> <a href="/mdarifulhaque/752-open-the-lock-562h" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fzwudv3lvliadh0ojq6t5.png" title="Published Apr 22"> 6 752. Open the Lock </a> <a href="/mdarifulhaque/1971-find-if-path-exists-in-graph-18oj" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Ft1j0689mvkbmcaj6nusn.png" title="Published Apr 22"> 7 1971. Find if Path Exists in Graph </a> <a href="/mdarifulhaque/310-minimum-height-trees-p87" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Ffn167c6rfcza4jrv9j5y.png" title="Published Apr 23"> 8 310. Minimum Height Trees </a> <a href="/mdarifulhaque/1137-n-th-tribonacci-number-5ap2" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F0exwvigfub0viht6wggp.png" title="Published Apr 24"> 9 1137. N-th Tribonacci Number </a> <a href="/mdarifulhaque/2370-longest-ideal-subsequence-43ie" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fe5o3g661pf0918gw0xc0.png" title="Published Apr 25"> 10 2370. Longest Ideal Subsequence </a> <a href="/mdarifulhaque/1289-minimum-falling-path-sum-ii-4a2n" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fppix4trms6ea66azakbz.png" title="Published Apr 26"> 11 1289. Minimum Falling Path Sum II </a> <a href="/mdarifulhaque/514-freedom-trail-4j8f" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fhtbpnfmwl1qerdgbecu9.png" title="Published Apr 27"> 12 514. Freedom Trail </a> <a href="/mdarifulhaque/834-sum-of-distances-in-tree-2a2d" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fir4b8fzj0bxz57kyxxjr.png" title="Published Apr 28"> 13 834. Sum of Distances in Tree </a> <a href="/mdarifulhaque/1700-number-of-students-unable-to-eat-lunch-344k" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F4s1n814uhu3vg3icxmsh.png" title="Published Apr 28"> 14 1700. Number of Students Unable to Eat Lunch </a> <a href="/mdarifulhaque/2073-time-needed-to-buy-tickets-429f" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fvi44vdmzx6ylmc2425z1.png" title="Published Apr 28"> 15 2073. Time Needed to Buy Tickets </a> <a href="/mdarifulhaque/2997-minimum-number-of-operations-to-make-array-xor-equal-to-k-g87" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Faml9v6xim6glzl2bth9w.png" title="Published Apr 29"> 16 2997. Minimum Number of Operations to Make Array XOR Equal to K </a> <a href="/mdarifulhaque/1614-maximum-nesting-depth-of-the-parentheses-1jol" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fhxxq4cax1uw3ww3kmr8q.png" title="Published Apr 29"> 17 1614. Maximum Nesting Depth of the Parentheses </a> <a href="/mdarifulhaque/1544-make-the-string-great-2o4h" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fham0cwqkb8b89x8mtsbp.png" title="Published Apr 29"> 18 1544. Make The String Great </a> <a href="/mdarifulhaque/1915-number-of-wonderful-substrings-3mok" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Ftm4sm4nsl0pe60bloomk.png" title="Published Apr 30"> 19 1915. Number of Wonderful Substrings </a> <a href="/mdarifulhaque/1249-minimum-remove-to-make-valid-parentheses-db4" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fktg3r7cxehgwpndmyx50.png" title="Published Apr 30"> 20 1249. Minimum Remove to Make Valid Parentheses </a> <a href="/mdarifulhaque/950-reveal-cards-in-increasing-order-4gie" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Frfn8pmzsxm8rlcty7462.png" title="Published Apr 30"> 21 950. Reveal Cards In Increasing Order </a> <a href="/mdarifulhaque/678-valid-parenthesis-string-3bcf" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F2pekas048tncz1thjgj3.png" title="Published Apr 30"> 22 678. Valid Parenthesis String </a> <a href="/mdarifulhaque/2000-reverse-prefix-of-word-4hbb" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fbfi5ggvv7qgcmkkhvlcy.png" title="Published May 1"> 23 2000. Reverse Prefix of Word </a> <a href="/mdarifulhaque/79-word-search-5d7b" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F65s2mqso8bq7eknc97of.png" title="Published May 1"> 24 79. Word Search </a> <a href="/mdarifulhaque/129-sum-root-to-leaf-numbers-1526" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fas56n3cagyloe4tfv83u.png" title="Published May 1"> 25 129. Sum Root to Leaf Numbers </a> <a href="/mdarifulhaque/2441-largest-positive-integer-that-exists-with-its-negative-67i" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Flbbdkko6ohup6krig6q3.png" title="Published May 2"> 26 2441. Largest Positive Integer That Exists With Its Negative </a> <a href="/mdarifulhaque/58-length-of-last-word-43f3" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F0kmgs2xhv95wujsfc9yn.png" title="Published May 2"> 27 58. Length of Last Word </a> <a href="/mdarifulhaque/205-isomorphic-strings-3fdb" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F5tbup2visfdma3wt1u29.png" title="Published May 2"> 28 205. Isomorphic Strings </a> <a href="/mdarifulhaque/165-compare-version-numbers-4dgg" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fzq0k32g6oac625siu4g1.png" title="Published May 3"> 29 165. Compare Version Numbers </a> <a href="/mdarifulhaque/402-remove-k-digits-2oea" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F2jzt9sngy82ve7lz09q1.png" title="Published May 3"> 30 402. Remove K Digits </a> <a href="/mdarifulhaque/42-trapping-rain-water-9jo" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fxq014u924eyvg72j4cev.png" title="Published May 3"> 31 42. Trapping Rain Water </a> <a href="/mdarifulhaque/881-boats-to-save-people-2647" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fe38wsc2d7h4yqw32k6ii.png" title="Published May 5"> 32 881. Boats to Save People </a> <a href="/mdarifulhaque/237-delete-node-in-a-linked-list-3743" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F02bdz44lqe156tacy9bl.png" title="Published May 5"> 33 237. Delete Node in a Linked List </a> <a href="/mdarifulhaque/85-maximal-rectangle-2afn" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fpct0lthp3mctn2rgbx3g.png" title="Published May 5"> 34 85. Maximal Rectangle </a> <a href="/mdarifulhaque/404-sum-of-left-leaves-pok" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fxewaeq1ihsf6suhf3wyp.png" title="Published May 6"> 35 404. Sum of Left Leaves </a> <a href="/mdarifulhaque/2487-remove-nodes-from-linked-list-37d" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fuv2ynkiiuf4ymu0d08yy.png" title="Published May 6"> 36 2487. Remove Nodes From Linked List </a> <a href="/mdarifulhaque/2816-double-a-number-represented-as-a-linked-list-1al9" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F4stx27kihs552i0xjsku.png" title="Published May 7"> 37 2816. Double a Number Represented as a Linked List </a> <a href="/mdarifulhaque/445-add-two-numbers-ii-7l0" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fgk519wagxqmybmscnvsz.png" title="Published May 7"> 38 445. Add Two Numbers II </a> <a href="/mdarifulhaque/506-relative-ranks-8id" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fkbczgtj445693jbnplf3.png" title="Published May 8"> 39 506. Relative Ranks </a> <a href="/mdarifulhaque/1-two-sum-1hf1" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fc80umvdx2xum4rmmphri.png" title="Published May 8"> 40 1. Two Sum </a> <a href="/mdarifulhaque/3075-maximize-happiness-of-selected-children-2od9" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fo05l1cpfkv6r0e3hdexc.png" title="Published May 9"> 41 3075. Maximize Happiness of Selected Children </a> <a href="/mdarifulhaque/2-add-two-numbers-42l9" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fmgnl9h9skb46vk9awhxg.png" title="Published May 9"> 42 2. Add Two Numbers </a> <a href="/mdarifulhaque/786-k-th-smallest-prime-fraction-5am7" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F8t3eho6bi63dp45mtwae.png" title="Published May 10"> 43 786. K-th Smallest Prime Fraction </a> <a href="/mdarifulhaque/3-longest-substring-without-repeating-characters-3m10" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fdjbokle96y8lsk44kp1q.png" title="Published May 10"> 44 3. Longest Substring Without Repeating Characters </a> <a href="/mdarifulhaque/3123-find-edges-in-shortest-paths-126i" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fswx5y37hkqwtr4gepi0s.png" title="Published May 10"> 45 3123. Find Edges in Shortest Paths </a> <a href="/mdarifulhaque/3122-minimum-number-of-operations-to-satisfy-conditions-2j67" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fs9pt1gxqqck04wc58g5i.png" title="Published May 10"> 46 3122. Minimum Number of Operations to Satisfy Conditions </a> <a href="/mdarifulhaque/3121-count-the-number-of-special-characters-ii-4cb2" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fkvwkryyybqcvt63rd94f.png" title="Published May 10"> 47 3121. Count the Number of Special Characters II </a> <a href="/mdarifulhaque/3113-find-the-number-of-subarrays-where-boundary-elements-are-maximum-1e90" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fse23ma9scz8i26fafkhf.png" title="Published May 10"> 48 3113. Find the Number of Subarrays Where Boundary Elements Are Maximum </a> <a href="/mdarifulhaque/2570-merge-two-2d-arrays-by-summing-values-solution-317l" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F0swws7iy0p9kbxoqdohj.png" title="Published May 10"> 49 2570. Merge Two 2D Arrays by Summing Values solution </a> <a href="/mdarifulhaque/2530-maximal-score-after-applying-k-operations-57eg" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fiqb6ch2fs6e29dsi1jjl.png" title="Published May 10"> 50 2530. Maximal Score After Applying K Operations </a> <a href="/mdarifulhaque/857-minimum-cost-to-hire-k-workers-20e6" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fcwdbgdjj5s18giyz3uyd.png" title="Published May 11"> 51 857. Minimum Cost to Hire K Workers </a> <a href="/mdarifulhaque/4-median-of-two-sorted-arrays-54pa" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fn15nvlm56zta0malkvs4.png" title="Published May 11"> 52 4. Median of Two Sorted Arrays </a> <a href="/mdarifulhaque/2373-largest-local-values-in-a-matrix-5ale" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fkj4pdhjeqbkawtkqidw2.png" title="Published May 12"> 53 2373. Largest Local Values in a Matrix </a> <a href="/mdarifulhaque/17-letter-combinations-of-a-phone-number-1fjc" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fvj1hco9sihmsqkzu7zkq.png" title="Published May 12"> 54 17. Letter Combinations of a Phone Number </a> <a href="/mdarifulhaque/861-score-after-flipping-matrix-1c3i" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fdq7uuk1l6fna71usz3hx.png" title="Published May 13"> 55 861. Score After Flipping Matrix </a> <a href="/mdarifulhaque/1219-path-with-maximum-gold-3pb0" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fn7l9fnvmzdg2d4uv2vps.png" title="Published May 14"> 56 1219. Path with Maximum Gold </a> <a href="/mdarifulhaque/2812-find-the-safest-path-in-a-grid-1p8" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fqm1yk74slue55kp1w7w8.png" title="Published May 15"> 57 2812. Find the Safest Path in a Grid </a> <a href="/mdarifulhaque/2331-evaluate-boolean-binary-tree-6ae" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fmokw46bp59q75k6paqxl.png" title="Published May 16"> 58 2331. Evaluate Boolean Binary Tree </a> <a href="/mdarifulhaque/1325-delete-leaves-with-a-given-value-2p5k" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fvvco4rooruiwpvk0vg9b.png" title="Published May 17"> 59 1325. Delete Leaves With a Given Value </a> <a href="/mdarifulhaque/979-distribute-coins-in-binary-tree-a7k" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fp3zzw1gxq71ay1hmrree.png" title="Published May 18"> 60 979. Distribute Coins in Binary Tree </a> <a href="/mdarifulhaque/3068-find-the-maximum-sum-of-node-values-2jo7" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fg10pz6rya214oeqwj6u9.png" title="Published May 19"> 61 3068. Find the Maximum Sum of Node Values </a> <a href="/mdarifulhaque/1863-sum-of-all-subset-xor-totals-4850" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fimfn7v7wrjdn9qdp15qe.png" title="Published May 20"> 62 1863. Sum of All Subset XOR Totals </a> <a href="/mdarifulhaque/78-subsets-b0e" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fk0vtwc25j7uqazy6f5ll.png" title="Published May 21"> 63 78. Subsets </a> <a href="/mdarifulhaque/131-palindrome-partitioning-193j" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Few25pah3zum75aehs2jf.png" title="Published May 22"> 64 131. Palindrome Partitioning </a> <a href="/mdarifulhaque/2597-the-number-of-beautiful-subsets-ih5" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fr75ezwih86oz7hgiqopw.png" title="Published May 23"> 65 2597. The Number of Beautiful Subsets </a> <a href="/mdarifulhaque/1255-maximum-score-words-formed-by-letters-25bj" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Ffn99ep1ta616dx5spxne.png" title="Published May 24"> 66 1255. Maximum Score Words Formed by Letters </a> <a href="/mdarifulhaque/140-word-break-ii-4a1m" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F3tk78c6o93up74m3x835.png" title="Published May 25"> 67 140. Word Break II </a> <a href="/mdarifulhaque/552-student-attendance-record-ii-1n4b" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fawwxadi2th6v0w5en4xx.png" title="Published May 26"> 68 552. Student Attendance Record II </a> <a href="/mdarifulhaque/1608-special-array-with-x-elements-greater-than-or-equal-x-gkn" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fyb2xxl1yobeety6b41d4.png" title="Published May 27"> 69 1608. Special Array With X Elements Greater Than or Equal X </a> <a href="/mdarifulhaque/1208-get-equal-substrings-within-budget-31e1" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fnyj3edutfpqs0f71hf3d.png" title="Published May 28"> 70 1208. Get Equal Substrings Within Budget </a> <a href="/mdarifulhaque/1404-number-of-steps-to-reduce-a-number-in-binary-representation-to-one-34nd" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F48wc9mv3aenaa5px0xtg.png" title="Published May 29"> 71 1404. Number of Steps to Reduce a Number in Binary Representation to One </a> <a href="/mdarifulhaque/1442-count-triplets-that-can-form-two-arrays-of-equal-xor-13eb" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fwo7vim99elfeqcsv8m67.png" title="Published May 30"> 72 1442. Count Triplets That Can Form Two Arrays of Equal XOR </a> <a href="/mdarifulhaque/260-single-number-iii-g3e" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fgbhrgl3fqnxxe63pfkrz.png" title="Published May 31"> 73 260. Single Number III </a> <a href="/mdarifulhaque/3110-score-of-a-string-fbl" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fix6qsoblxuplav8cqfy4.png" title="Published Jun 1"> 74 3110. Score of a String </a> <a href="/mdarifulhaque/344-reverse-string-43p9" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fdhjqdss66qkrtpseo2hm.png" title="Published Jun 2"> 75 344. Reverse String </a> <a href="/mdarifulhaque/2486-append-characters-to-string-to-make-subsequence-5633" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fw9ungb259qevfp47nttj.png" title="Published Jun 3"> 76 2486. Append Characters to String to Make Subsequence </a> <a href="/mdarifulhaque/409-longest-palindrome-127o" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F8177o2h9udxy2jo8cw24.png" title="Published Jun 4"> 77 409. Longest Palindrome </a> <a href="/mdarifulhaque/1002-find-common-characters-2hh9" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F7hji0tw3eva0xy4ucc00.png" title="Published Jun 5"> 78 1002. Find Common Characters </a> <a href="/mdarifulhaque/846-hand-of-straights-pg1" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fcidbu6vo2td8u22clzim.png" title="Published Jun 6"> 79 846. Hand of Straights </a> <a href="/mdarifulhaque/648-replace-words-4f20" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fcqx9sg0xz6lcoumkgnrn.png" title="Published Jun 7"> 80 648. Replace Words </a> <a href="/mdarifulhaque/523-continuous-subarray-sum-2b4" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F48xfm1wafuugx8u6t5un.png" title="Published Jun 8"> 81 523. Continuous Subarray Sum </a> <a href="/mdarifulhaque/974-subarray-sums-divisible-by-k-dd" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F33s4wevtm9conpfk7g1e.png" title="Published Jun 9"> 82 974. Subarray Sums Divisible by K </a> <a href="/mdarifulhaque/1051-height-checker-ai" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Frapbcql4k9i4xlxrjk9k.png" title="Published Jun 10"> 83 1051. Height Checker </a> <a href="/mdarifulhaque/1122-relative-sort-array-2lbd" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fucrc6ls953wxgjlkjz0n.png" title="Published Jun 11"> 84 1122. Relative Sort Array </a> <a href="/mdarifulhaque/75-sort-colors-2hjp" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F5b1g2hm0jzcmv5c98mvs.png" title="Published Jun 12"> 85 75. Sort Colors </a> <a href="/mdarifulhaque/2037-minimum-number-of-moves-to-seat-everyone-164a" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fcitjktwqnoud0enxirxt.png" title="Published Jun 13"> 86 2037. Minimum Number of Moves to Seat Everyone </a> <a href="/mdarifulhaque/945-minimum-increment-to-make-array-unique-4am8" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fj8sei9otu5kmtde29l1d.png" title="Published Jun 14"> 87 945. Minimum Increment to Make Array Unique </a> <a href="/mdarifulhaque/502-ipo-295e" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F4mc92tm1o2f4rjft2ngu.png" title="Published Jun 15"> 88 502. IPO </a> <a href="/mdarifulhaque/330-patching-array-4oo9" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fos590dh13vyv2sy09dsr.png" title="Published Jun 16"> 89 330. Patching Array </a> <a href="/mdarifulhaque/633-sum-of-square-numbers-1248" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fvtoghrvdhd7tpu7i2m8d.png" title="Published Jun 17"> 90 633. Sum of Square Numbers </a> <a href="/mdarifulhaque/826-most-profit-assigning-work-2b8o" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Flpfrzxqutherjpy7f33r.png" title="Published Jun 18"> 91 826. Most Profit Assigning Work </a> <a href="/mdarifulhaque/1482-minimum-number-of-days-to-make-m-bouquets-gn7" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F9xwu3777zkss96xqljct.png" title="Published Jun 19"> 92 1482. Minimum Number of Days to Make m Bouquets </a> <a href="/mdarifulhaque/1552-magnetic-force-between-two-balls-485i" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fzhlfugveqy3u3y57bje7.png" title="Published Jun 20"> 93 1552. Magnetic Force Between Two Balls </a> <a href="/mdarifulhaque/1052-grumpy-bookstore-owner-2ffd" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Ft43oyawrhghkol7qc762.png" title="Published Jun 21"> 94 1052. Grumpy Bookstore Owner </a> <a href="/mdarifulhaque/1248-count-number-of-nice-subarrays-405o" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fkwbdoko1tga5kbyygmrt.png" title="Published Jun 22"> 95 1248. Count Number of Nice Subarrays </a> <a href="/mdarifulhaque/1438-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit-4j9j" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Frgb8r354jixw1bkzorsd.png" title="Published Jun 23"> 96 1438. Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit </a> <a href="/mdarifulhaque/995-minimum-number-of-k-consecutive-bit-flips-5gpp" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fptkuf90v1518m1s3j7t8.png" title="Published Jun 24"> 97 995. Minimum Number of K Consecutive Bit Flips </a> <a href="/mdarifulhaque/1038-binary-search-tree-to-greater-sum-tree-20hb" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F12jkdjtaqgkuct7ten8t.png" title="Published Jun 25"> 98 1038. Binary Search Tree to Greater Sum Tree </a> <a href="/mdarifulhaque/1382-balance-a-binary-search-tree-1bj8" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="" title="Published Jun 26"> 99 1382. Balance a Binary Search Tree </a> <a href="/mdarifulhaque/1791-find-center-of-star-graph-3ahk" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Feelcue6jnpic9ianngzz.png" title="Published Jun 27"> 100 1791. Find Center of Star Graph </a> <a href="/mdarifulhaque/2285-maximum-total-importance-of-roads-5281" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fzjy8hf3wykrepkcua7c6.png" title="Published Jun 28"> 101 2285. Maximum Total Importance of Roads </a> <a href="/mdarifulhaque/2192-all-ancestors-of-a-node-in-a-directed-acyclic-graph-3h26" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fdx0ix519rrw11i5qhmzu.png" title="Published Jun 29"> 102 2192. All Ancestors of a Node in a Directed Acyclic Graph </a> <a href="/mdarifulhaque/1579-remove-max-number-of-edges-to-keep-graph-fully-traversable-4h7" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fds731odu8ubg0dlkq42n.png" title="Published Jun 30"> 103 1579. Remove Max Number of Edges to Keep Graph Fully Traversable </a> <a href="/mdarifulhaque/1550-three-consecutive-odds-53hn" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fzi8vz9tmfl7u2rxmqluk.png" title="Published Jul 1"> 104 1550. Three Consecutive Odds </a> <a href="/mdarifulhaque/350-intersection-of-two-arrays-ii-3fgm" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fvfep6swxpdcfxzh8z86u.png" title="Published Jul 2"> 105 350. Intersection of Two Arrays II </a> <a href="/mdarifulhaque/1509-minimum-difference-between-largest-and-smallest-value-in-three-moves-19pk" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F3j409uyq1bdedsbpqs90.png" title="Published Jul 3"> 106 1509. Minimum Difference Between Largest and Smallest Value in Three Moves </a> <a href="/mdarifulhaque/2181-merge-nodes-in-between-zeros-ghp" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F5e4awtkcnicvasco31u0.png" title="Published Jul 4"> 107 2181. Merge Nodes in Between Zeros </a> <a href="/mdarifulhaque/2058-find-the-minimum-and-maximum-number-of-nodes-between-critical-points-13c3" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F30qnpd1qocbtqcx99r9y.png" title="Published Jul 5"> 108 2058. Find the Minimum and Maximum Number of Nodes Between Critical Points </a> <a href="/mdarifulhaque/2582-pass-the-pillow-4gf8" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fsexxhwpmi8b7gwosr22f.png" title="Published Jul 6"> 109 2582. Pass the Pillow </a> <a href="/mdarifulhaque/1518-water-bottles-2hf0" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F80olscznxmsw4kjcwcd2.png" title="Published Jul 7"> 110 1518. Water Bottles </a> <a href="/mdarifulhaque/1823-find-the-winner-of-the-circular-game-5aa2" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fuwissbrlq1wp1n0y8yvc.png" title="Published Jul 8"> 111 1823. Find the Winner of the Circular Game </a> <a href="/mdarifulhaque/1701-average-waiting-time-51ef" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fw6ewhlm3hx71xlkgkttr.png" title="Published Jul 9"> 112 1701. Average Waiting Time </a> <a href="/mdarifulhaque/1598-crawler-log-folder-2l07" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fefq8a9mfnkauq2zl7l5z.png" title="Published Jul 10"> 113 1598. Crawler Log Folder </a> <a href="/mdarifulhaque/1190-reverse-substrings-between-each-pair-of-parentheses-39bk" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fey16zq0mozoylef9cztu.png" title="Published Jul 11"> 114 1190. Reverse Substrings Between Each Pair of Parentheses </a> <a href="/mdarifulhaque/1717-maximum-score-from-removing-substrings-2109" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F32v5crah36omdtm4bl2x.png" title="Published Jul 12"> 115 1717. Maximum Score From Removing Substrings </a> <a href="/mdarifulhaque/2751-robot-collisions-49ge" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F1s68yi0uz9cr28znqe62.png" title="Published Jul 13"> 116 2751. Robot Collisions </a> <a href="/mdarifulhaque/726-number-of-atoms-4ah3" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F9uzfxrg4h4jyyoa2gwb6.png" title="Published Jul 14"> 117 726. Number of Atoms </a> <a href="/mdarifulhaque/2196-create-binary-tree-from-descriptions-4mo2" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fsi2oaouc2mgl7cf5dhlh.png" title="Published Jul 15"> 118 2196. Create Binary Tree From Descriptions </a> <a href="/mdarifulhaque/2096-step-by-step-directions-from-a-binary-tree-node-to-another-3ijc" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fe3b3sa40xa8k7zen2jql.png" title="Published Jul 16"> 119 2096. Step-By-Step Directions From a Binary Tree Node to Another </a> <a href="/mdarifulhaque/1110-delete-nodes-and-return-forest-3h" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F364dunjfxz78v3zkby5s.png" title="Published Jul 17"> 120 1110. Delete Nodes And Return Forest </a> <a href="/mdarifulhaque/1636-sort-array-by-increasing-frequency-1gkj" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Frj215rcl320dujt7tzqq.png" title="Published Jul 23"> 121 1636. Sort Array by Increasing Frequency </a> <a href="/mdarifulhaque/1530-number-of-good-leaf-nodes-pairs-3b3n" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fgl2h8jxd7cxrk4mtyifx.png" title="Published Jul 24"> 122 1530. Number of Good Leaf Nodes Pairs </a> <a href="/mdarifulhaque/2191-sort-the-jumbled-numbers-1hgk" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fpaq416g33je4hlbfmds6.png" title="Published Jul 24"> 123 2191. Sort the Jumbled Numbers </a> <a href="/mdarifulhaque/1380-lucky-numbers-in-a-matrix-2l11" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F3kdp2fv77abuat6k92kx.png" title="Published Jul 24"> 124 1380. Lucky Numbers in a Matrix </a> <a href="/mdarifulhaque/1605-find-valid-matrix-given-row-and-column-sums-3o58" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fzq3yilck67ugsjsd1a1c.png" title="Published Jul 24"> 125 1605. Find Valid Matrix Given Row and Column Sums </a> <a href="/mdarifulhaque/2418-sort-the-people-18jl" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Ffeqv90alrap58bwe92v0.png" title="Published Jul 25"> 126 2418. Sort the People </a> <a href="/mdarifulhaque/2392-build-a-matrix-with-conditions-384j" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fnm9se9kcys7gh4wc49uq.png" title="Published Jul 25"> 127 2392. Build a Matrix With Conditions </a> <a href="/mdarifulhaque/912-sort-an-array-4ob3" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fl0bkzhpg0yodx4phhyrd.png" title="Published Jul 25"> 128 912. Sort an Array </a> <a href="/mdarifulhaque/1334-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance-2afa" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F8u9s0j1uqe2d2l0gblx4.png" title="Published Jul 26"> 129 1334. Find the City With the Smallest Number of Neighbors at a Threshold Distance </a> <a href="/mdarifulhaque/2976-minimum-cost-to-convert-string-i-4gai" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F0wsb89rbx0zct15d2hbt.png" title="Published Jul 27"> 130 2976. Minimum Cost to Convert String I </a> <a href="/mdarifulhaque/2045-second-minimum-time-to-reach-destination-419d" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F8utscsgqpikh336dtcii.png" title="Published Jul 28"> 131 2045. Second Minimum Time to Reach Destination </a> <a href="/mdarifulhaque/1395-count-number-of-teams-8lg" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fvlmpnzkpl6juw7vmceh5.png" title="Published Jul 29"> 132 1395. Count Number of Teams </a> <a href="/mdarifulhaque/1653-minimum-deletions-to-make-string-balanced-8c1" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F2cno4bdex4zrp51uepum.png" title="Published Jul 30"> 133 1653. Minimum Deletions to Make String Balanced </a> <a href="/mdarifulhaque/1105-filling-bookcase-shelves-293k" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fnt6pacorbem6oc0nhuk2.png" title="Published Jul 31"> 134 1105. Filling Bookcase Shelves </a> <a href="/mdarifulhaque/2678-number-of-senior-citizens-4jk9" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F33cbzzh1na39qrkq0ury.png" title="Published Aug 1"> 135 2678. Number of Senior Citizens </a> <a href="/mdarifulhaque/2134-minimum-swaps-to-group-all-1s-together-ii-4837" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fkmf7kpmxin67193h14xi.png" title="Published Aug 2"> 136 2134 Minimum Swaps to Group All 1's Together II </a> <a href="/mdarifulhaque/1460-make-two-arrays-equal-by-reversing-subarrays-4e5l" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F1khkfhqhjyhwva0jvb45.png" title="Published Aug 3"> 137 1460. Make Two Arrays Equal by Reversing Subarrays </a> <a href="/mdarifulhaque/1508-range-sum-of-sorted-subarray-sums-5hbm" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fbp06ieu1g5p95grjfyn0.png" title="Published Aug 4"> 138 1508. Range Sum of Sorted Subarray Sums </a> <a href="/mdarifulhaque/2053-kth-distinct-string-in-an-array-2c5k" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F1xsb31bww6z32di9r8iy.png" title="Published Aug 5"> 139 2053. Kth Distinct String in an Array </a> <a href="/mdarifulhaque/3016-minimum-number-of-pushes-to-type-word-ii-4epo" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fod4r8c5t980baydgknax.png" title="Published Aug 6"> 140 3016. Minimum Number of Pushes to Type Word II </a> <a href="/mdarifulhaque/273-integer-to-english-words-4c25" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F47dmphsj60rmnqd0dooy.png" title="Published Aug 7"> 141 273. Integer to English Words </a> <a href="/mdarifulhaque/885-spiral-matrix-iii-3m4l" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Flr4y514nxj47n4snesqs.png" title="Published Aug 8"> 142 885. Spiral Matrix III </a> <a href="/mdarifulhaque/840-magic-squares-in-grid-2pek" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fgy2i3rq1gp4ccdyxswvk.png" title="Published Aug 9"> 143 840. Magic Squares In Grid </a> <a href="/mdarifulhaque/959-regions-cut-by-slashes-2cog" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fiu8ucljbrxry6w3rdyn3.png" title="Published Aug 10"> 144 959. Regions Cut By Slashes </a> <a href="/mdarifulhaque/1568-minimum-number-of-days-to-disconnect-island-ddf" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fr9t6d50i2pm26cix26oh.png" title="Published Aug 12"> 145 1568. Minimum Number of Days to Disconnect Island </a> <a href="/mdarifulhaque/703-kth-largest-element-in-a-stream-3ck0" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F5h9m32l8eymwypfrn7tu.png" title="Published Aug 12"> 146 703. Kth Largest Element in a Stream </a> <a href="/mdarifulhaque/40-combination-sum-ii-14ni" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fs8pyqjci1g5klqo1h3bk.png" title="Published Aug 13"> 147 40. Combination Sum II </a> <a href="/mdarifulhaque/719-find-k-th-smallest-pair-distance-2pep" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fhwiahbp6fpt18edcwjog.png" title="Published Aug 14"> 148 719. Find K-th Smallest Pair Distance </a> <a href="/mdarifulhaque/860-lemonade-change-49jm" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F0dm26ujv3e38qeou2vfe.png" title="Published Aug 15"> 149 860. Lemonade Change </a> <a href="/mdarifulhaque/624-maximum-distance-in-arrays-3659" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fwwh7atz5480mgtunuk20.png" title="Published Aug 16"> 150 624. Maximum Distance in Arrays </a> <a href="/mdarifulhaque/1937-maximum-number-of-points-with-cost-nh" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fkqk8le6rrgn0p1cuj61x.png" title="Published Aug 17"> 151 1937. Maximum Number of Points with Cost </a> <a href="/mdarifulhaque/650-2-keys-keyboard-57n0" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Faskc2wq4nvp05qhsu0uh.png" title="Published Aug 19"> 152 650. 2 Keys Keyboard </a> <a href="/mdarifulhaque/1140-stone-game-ii-1cco" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fc7fzcjgiz8xn5pr003if.png" title="Published Aug 20"> 153 1140. Stone Game II </a> <a href="/mdarifulhaque/664-strange-printer-2mpj" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fif3io6tg7j7gmtutuaiu.png" title="Published Aug 21"> 154 664. Strange Printer </a> <a href="/mdarifulhaque/476-number-complement-d7i" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fxo1mrozj4v7ioa59muic.png" title="Published Aug 22"> 155 476. Number Complement </a> <a href="/mdarifulhaque/592-fraction-addition-and-subtraction-3fo0" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Ffik2j26jhf3ya0ihzore.png" title="Published Aug 23"> 156 592. Fraction Addition and Subtraction </a> <a href="/mdarifulhaque/564-find-the-closest-palindrome-4mlj" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Ft2lbwepip3d2p3i35iu9.png" title="Published Aug 24"> 157 564. Find the Closest Palindrome </a> <a href="/mdarifulhaque/145-binary-tree-postorder-traversal-5628" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fuhk3fcvqw7j6sz5ychid.png" title="Published Aug 25"> 158 145. Binary Tree Postorder Traversal </a> <a href="/mdarifulhaque/590-n-ary-tree-postorder-traversa-1493" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Ful47a1ryd3qouzw71lq7.png" title="Published Aug 26"> 159 590. N-ary Tree Postorder Traversa </a> <a href="/mdarifulhaque/1514-path-with-maximum-probability-2oag" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fvsmq2uxvre7bkhcy8kpe.png" title="Published Aug 27"> 160 1514. Path with Maximum Probability </a> <a href="/mdarifulhaque/1905-count-sub-islands-32am" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F5e8ad97zdex20cviz3yz.png" title="Published Aug 28"> 161 1905. Count Sub Islands </a> <a href="/mdarifulhaque/947-most-stones-removed-with-same-row-or-column-2io8" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F7apz08adw2nuihhvtrud.png" title="Published Aug 29"> 162 947. Most Stones Removed with Same Row or Column </a> <a href="/mdarifulhaque/2699-modify-graph-edge-weights-p7j" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F8eyeitx2vb33w6ki8hw5.png" title="Published Aug 30"> 163 2699. Modify Graph Edge Weights </a> <a href="/mdarifulhaque/2022-convert-1d-array-into-2d-array-4h1o" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fdfr2zldva9hzfq5eg2xz.png" title="Published Sep 1"> 164 2022. Convert 1D Array Into 2D Array </a> <a href="/mdarifulhaque/1894-find-the-student-that-will-replace-the-chalk-5092" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F01tgp4ha6simkp135hku.png" title="Published Sep 2"> 165 1894. Find the Student that Will Replace the Chalk </a> <a href="/mdarifulhaque/1894-find-the-student-that-will-replace-the-chalk-l40" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F01tgp4ha6simkp135hku.png" title="Published Sep 2"> 166 1894. Find the Student that Will Replace the Chalk </a> <a href="/mdarifulhaque/1945-sum-of-digits-of-string-after-convert-3fi9" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Flk46fxh2x93na3rckq3g.png" title="Published Sep 3"> 167 1945. Sum of Digits of String After Convert </a> <a href="/mdarifulhaque/1367-linked-list-in-binary-tree-31n8" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F5c6zpph7q49y3rs6t7vw.png" title="Published Sep 7"> 168 1367. Linked List in Binary Tree </a> <a href="/mdarifulhaque/3217-delete-nodes-from-linked-list-present-in-array-2fc" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F2c2x2rl22c656vmpv9zv.png" title="Published Sep 7"> 169 3217. Delete Nodes From Linked List Present in Array </a> <a href="/mdarifulhaque/725-split-linked-list-in-parts-3gin" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fvnzlieeltdcii34g7vt3.png" title="Published Sep 8"> 170 725. Split Linked List in Parts </a> <a href="/mdarifulhaque/2326-spiral-matrix-iv-4m4k" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fn55urhs8omwklutvs62z.png" title="Published Sep 9"> 171 2326. Spiral Matrix IV </a> <a href="/mdarifulhaque/2807-insert-greatest-common-divisors-in-linked-list-3c7p" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F9mijnzrd86hryhamt16x.png" title="Published Sep 10"> 172 2807. Insert Greatest Common Divisors in Linked List </a> <a href="/mdarifulhaque/2220-minimum-bit-flips-to-convert-number-4gg5" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fs9k31u4kxbvjpxbnp3x8.png" title="Published Sep 11"> 173 2220. Minimum Bit Flips to Convert Number </a> <a href="/mdarifulhaque/1684-count-the-number-of-consistent-strings-5e38" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fhbyvm6o4ub5lzw5mpwrp.png" title="Published Sep 12"> 174 1684. Count the Number of Consistent Strings </a> <a href="/mdarifulhaque/1310-xor-queries-of-a-subarray-4nki" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fyaw8s6fnwqcjj4doxzgp.png" title="Published Sep 13"> 175 1310. XOR Queries of a Subarray </a> <a href="/mdarifulhaque/2419-longest-subarray-with-maximum-bitwise-and-5cb3" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fpoddjy0o1fn0j7yidojv.png" title="Published Sep 14"> 176 2419. Longest Subarray With Maximum Bitwise AND </a> <a href="/mdarifulhaque/1371-find-the-longest-substring-containing-vowels-in-even-counts-1kdj" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fz6l8dnigbfpm5atu6mfp.png" title="Published Sep 15"> 177 1371. Find the Longest Substring Containing Vowels in Even Counts </a> <a href="/mdarifulhaque/539-minimum-time-difference-3665" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fere0cl1mjt7aaceeui4m.png" title="Published Sep 16"> 178 539. Minimum Time Difference </a> <a href="/mdarifulhaque/884-uncommon-words-from-two-sentences-2p3d" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fgifhn35h4d0ku5nlrg9y.png" title="Published Sep 17"> 179 884. Uncommon Words from Two Sentences </a> <a href="/mdarifulhaque/179-largest-number-26cd" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fr3iucivuk1i02jbbyaez.png" title="Published Sep 18"> 180 179. Largest Number </a> <a href="/mdarifulhaque/241-different-ways-to-add-parentheses-45k2" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fx0kaz09mevxva1ifeb47.png" title="Published Sep 19"> 181 241. Different Ways to Add Parentheses </a> <a href="/mdarifulhaque/214-shortest-palindrome-b1l" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fed9e48dxyxnbio2q2a7j.png" title="Published Sep 20"> 182 214. Shortest Palindrome </a> <a href="/mdarifulhaque/386-lexicographical-numbers-2c60" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fqj75s35buzybg9n6wjye.png" title="Published Sep 21"> 183 386. Lexicographical Numbers </a> <a href="/mdarifulhaque/440-k-th-smallest-in-lexicographical-order-3i8h" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fn3dpceiab1wa8j8hssbv.png" title="Published Sep 22"> 184 440. K-th Smallest in Lexicographical Order </a> <a href="/mdarifulhaque/2707-extra-characters-in-a-string-2d8c" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fp4v2c22ql4um6trfx9gz.png" title="Published Sep 23"> 185 2707. Extra Characters in a String </a> <a href="/mdarifulhaque/3043-find-the-length-of-the-longest-common-prefix-41fi" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F6tyyohtavtg09g3bjpz4.png" title="Published Sep 24"> 186 3043. Find the Length of the Longest Common Prefix </a> <a href="/mdarifulhaque/2416-sum-of-prefix-scores-of-strings-af6" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fz6c9buh47wt9v286zhqh.png" title="Published Sep 25"> 187 2416. Sum of Prefix Scores of Strings </a> <a href="/mdarifulhaque/729-my-calendar-i-1h94" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F1cjtpgc36fhgwct8ej52.png" title="Published Sep 26"> 188 729. My Calendar I </a> <a href="/mdarifulhaque/731-my-calendar-ii-3hf4" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fjq0jw757mg0ofd4kdc9d.png" title="Published Sep 27"> 189 731. My Calendar II </a> <a href="/mdarifulhaque/641-design-circular-deque-1b63" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F49esoxq42ytsh09rtlcm.png" title="Published Sep 28"> 190 641. Design Circular Deque </a> <a href="/mdarifulhaque/432-all-oone-data-structure-5374" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F7nzs0wnoth7hrw0onpfm.png" title="Published Sep 29"> 191 432. All O`one Data Structure </a> <a href="/mdarifulhaque/1381-design-a-stack-with-increment-operation-3cco" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fsvwq1ntn936u19ew83cd.png" title="Published Sep 30"> 192 1381. Design a Stack With Increment Operation </a> <a href="/mdarifulhaque/1497-check-if-array-pairs-are-divisible-by-k-5afc" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F0xbbu8w8benvsqtebn7k.png" title="Published Oct 1"> 193 1497. Check If Array Pairs Are Divisible by k </a> <a href="/mdarifulhaque/1331-rank-transform-of-an-array-21ip" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fngg12fttdvwzp87gbt6m.png" title="Published Oct 2"> 194 1331. Rank Transform of an Array </a> <a href="/mdarifulhaque/1590-make-sum-divisible-by-p-41jp" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fyqo1y97q6zxsahh9q1un.png" title="Published Oct 3"> 195 1590. Make Sum Divisible by P </a> <a href="/mdarifulhaque/2491-divide-players-into-teams-of-equal-skill-113o" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F4yy827fe31d9xaktmptb.png" title="Published Oct 4"> 196 2491. Divide Players Into Teams of Equal Skill </a> <a href="/mdarifulhaque/567-permutation-in-string-h5k" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fre6te1klnv6fgakya7ip.png" title="Published Oct 5"> 197 567. Permutation in String </a> <a href="/mdarifulhaque/1813-sentence-similarity-iii-33lm" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fc1unpqi044u522rk7tn7.png" title="Published Oct 6"> 198 1813. Sentence Similarity III </a> <a href="/mdarifulhaque/2696-minimum-string-length-after-removing-substrings-2a36" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fqokd6r8thjx48m2wc8k3.png" title="Published Oct 7"> 199 2696. Minimum String Length After Removing Substrings </a> <a href="/mdarifulhaque/1963-minimum-number-of-swaps-to-make-the-string-balanced-4ckc" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fd85pihfca3ig0884kkbn.png" title="Published Oct 8"> 200 1963. Minimum Number of Swaps to Make the String Balanced </a> <a href="/mdarifulhaque/1963-minimum-number-of-swaps-to-make-the-string-balanced-1nc4" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fd85pihfca3ig0884kkbn.png" title="Published Oct 8"> 201 1963. Minimum Number of Swaps to Make the String Balanced </a> <a href="/mdarifulhaque/921-minimum-add-to-make-parentheses-valid-14jk" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fabr0c8h6gge2efftn9b1.png" title="Published Oct 9"> 202 921. Minimum Add to Make Parentheses Valid </a> <a href="/mdarifulhaque/962-maximum-width-ramp-2e56" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fxdgh7mdzgc3gtrd6p2lr.png" title="Published Oct 10"> 203 962. Maximum Width Ramp </a> <a href="/mdarifulhaque/1942-the-number-of-the-smallest-unoccupied-chair-1db0" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F3y4l8p8f1lvizygy1kn2.png" title="Published Oct 11"> 204 1942. The Number of the Smallest Unoccupied Chair </a> <a href="/mdarifulhaque/2406-divide-intervals-into-minimum-number-of-groups-3bb9" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fu2edfogiwyjeqxbdf3fk.png" title="Published Oct 12"> 205 2406. Divide Intervals Into Minimum Number of Groups </a> <a href="/mdarifulhaque/632-smallest-range-covering-elements-from-k-lists-30d4" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F7sxkvrbgn45235c1vk2b.png" title="Published Oct 13"> 206 632. Smallest Range Covering Elements from K Lists </a> <a href="/mdarifulhaque/2938-separate-black-and-white-balls-4052" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fwn7988g0ylqd4cpegit4.png" title="Published Oct 16"> 207 2938. Separate Black and White Balls </a> <a href="/mdarifulhaque/1405-longest-happy-string-9mg" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F28akm6a66kr7v1uj5ikl.png" title="Published Oct 16"> 208 1405. Longest Happy String </a> <a href="/mdarifulhaque/670-maximum-swap-3ago" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F4drwxm4pz6muv1m2m51k.png" title="Published Oct 17"> 209 670. Maximum Swap </a> <a href="/mdarifulhaque/2044-count-number-of-maximum-bitwise-or-subsets-dim" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Frm37lg8qlearcneqcvrl.png" title="Published Oct 18"> 210 2044. Count Number of Maximum Bitwise-OR Subsets </a> <a href="/mdarifulhaque/1545-find-kth-bit-in-nth-binary-string-1lek" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Ft90g306fa80qn37op1af.png" title="Published Oct 19"> 211 1545. Find Kth Bit in Nth Binary String </a> <a href="/mdarifulhaque/1106-parsing-a-boolean-expression-281a" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fgg2d2t21avwbglmxbe6y.png" title="Published Oct 20"> 212 1106. Parsing A Boolean Expression </a> <a href="/mdarifulhaque/1593-split-a-string-into-the-max-number-of-unique-substrings-2l3k" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F8y7xsrkhzd4octf1m610.png" title="Published Oct 21"> 213 1593. Split a String Into the Max Number of Unique Substrings </a> <a href="/mdarifulhaque/2583-kth-largest-sum-in-a-binary-tree-4n79" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fu2m42e551rym6te86z55.png" title="Published Oct 22"> 214 2583. Kth Largest Sum in a Binary Tree </a> <a href="/mdarifulhaque/2641-cousins-in-binary-tree-ii-3idh" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F0abz296gjaq8uu1jckxl.png" title="Published Oct 23"> 215 2641. Cousins in Binary Tree II </a> <a href="/mdarifulhaque/951-flip-equivalent-binary-trees-1g45" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fule3cymftoklixnxk4uz.png" title="Published Oct 24"> 216 951. Flip Equivalent Binary Trees </a> <a href="/mdarifulhaque/1233-remove-sub-folders-from-the-filesystem-3ikg" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Ft5xglzju0fs18icq16pb.png" title="Published Oct 25"> 217 1233. Remove Sub-Folders from the Filesystem </a> <a href="/mdarifulhaque/2458-height-of-binary-tree-after-subtree-removal-queries-286k" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F3380uglxg49uz5bpu7gx.png" title="Published Oct 26"> 218 2458. Height of Binary Tree After Subtree Removal Queries </a> <a href="/mdarifulhaque/1277-count-square-submatrices-with-all-ones-4e1m" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fz7k9awzo6aus2qpwzpyq.png" title="Published Oct 27"> 219 1277. Count Square Submatrices with All Ones </a> <a href="/mdarifulhaque/learning-from-200-leetcode-problems-a-guide-to-building-strong-problem-solving-skills-17nd" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fkc8mgm3d0g9ihngv7e2d.png" title="Published Oct 27"> 220 Learning from 200+ LeetCode Problems: A Guide to Building Strong Problem-Solving Skills </a> <a href="/mdarifulhaque/2684-maximum-number-of-moves-in-a-grid-371a" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F31fz8pi1q4wcexb919pm.png" title="Published Oct 29"> 221 2684. Maximum Number of Moves in a Grid </a> <a href="/mdarifulhaque/1671-minimum-number-of-removals-to-make-mountain-array-4lac" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F0anquugj5wb7y1spem9l.png" title="Published Oct 30"> 222 1671. Minimum Number of Removals to Make Mountain Array </a> <a href="/mdarifulhaque/2463-minimum-total-distance-traveled-4850" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F8o4xqg1d7v21kurs0jgz.png" title="Published Oct 31"> 223 2463. Minimum Total Distance Traveled </a> <a href="/mdarifulhaque/1957-delete-characters-to-make-fancy-string-3k99" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F8sf38v9ufvy77h0eofae.png" title="Published Nov 1"> 224 1957. Delete Characters to Make Fancy String </a> <a href="/mdarifulhaque/2490-circular-sentence-2jp0" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fgrevkfexlorm04yiyjzs.png" title="Published Nov 2"> 225 2490. Circular Sentence </a> <a href="/mdarifulhaque/796-rotate-string-48ki" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fzixtg9u751gcv8x4t3fx.png" title="Published Nov 3"> 226 796. Rotate String </a> <a href="/mdarifulhaque/3163-string-compression-iii-1on4" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F7yqedqktgpy6qzkjjh7y.png" title="Published Nov 4"> 227 3163. String Compression III </a> <a href="/mdarifulhaque/2914-minimum-number-of-changes-to-make-binary-string-beautiful-270a" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fzad7rzivtik78xeta0mi.png" title="Published Nov 5"> 228 2914. Minimum Number of Changes to Make Binary String Beautiful </a> <a href="/mdarifulhaque/3011-find-if-array-can-be-sorted-38jb" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F3c5jy0npc9vl8jhrsrr1.png" title="Published Nov 6"> 229 3011. Find if Array Can Be Sorted </a> <a href="/mdarifulhaque/2275-largest-combination-with-bitwise-and-greater-than-zero-2hdf" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F11x4xtvu9jukuzmfpktu.png" title="Published Nov 7"> 230 2275. Largest Combination With Bitwise AND Greater Than Zero </a> <a href="/mdarifulhaque/1829-maximum-xor-for-each-query-3p3d" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F1prw6l3pxt4wacdymlxi.png" title="Published Nov 8"> 231 1829. Maximum XOR for Each Query </a> <a href="/mdarifulhaque/3133-minimum-array-end-15fa" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fwf5bhc46shpuaxnets49.png" title="Published Nov 9"> 232 3133. Minimum Array End </a> <a href="/mdarifulhaque/3097-shortest-subarray-with-or-at-least-k-ii-22fp" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fwkm9xpdo47r7xz40edln.png" title="Published Nov 10"> 233 3097. Shortest Subarray With OR at Least K II </a> <a href="/mdarifulhaque/2601-prime-subtraction-operation-h6j" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F7toawkooky2d4uaa9gun.png" title="Published Nov 11"> 234 2601. Prime Subtraction Operation </a> <a href="/mdarifulhaque/2070-most-beautiful-item-for-each-query-2ik5" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F1m5mewbxoh3bjizzvafn.png" title="Published Nov 12"> 235 2070. Most Beautiful Item for Each Query </a> <a href="/mdarifulhaque/2563-count-the-number-of-fair-pairs-fl2" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--active series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fng69ulal4fl694doquwo.png" title="Published Nov 13"> 236 2563. Count the Number of Fair Pairs </a> <a href="/mdarifulhaque/2064-minimized-maximum-of-products-distributed-to-any-store-2kl3" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F5dl4gywysknkykrvj7jp.png" title="Published Nov 14"> 237 2064. Minimized Maximum of Products Distributed to Any Store </a> <a href="/mdarifulhaque/1574-shortest-subarray-to-be-removed-to-make-array-sorted-3ang" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fvirjl98tb71h1sxena5y.png" title="Published Nov 15"> 238 1574. Shortest Subarray to be Removed to Make Array Sorted </a> <a href="/mdarifulhaque/3254-find-the-power-of-k-size-subarrays-i-41kc" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fcu976nkg90f4ij289oag.png" title="Published Nov 16"> 239 3254. Find the Power of K-Size Subarrays I </a> <a href="/mdarifulhaque/862-shortest-subarray-with-sum-at-least-k-5bli" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F28njyib2py98foh47gkq.png" title="Published Nov 17"> 240 862. Shortest Subarray with Sum at Least K </a> <a href="/mdarifulhaque/2461-maximum-sum-of-distinct-subarrays-with-length-k-4pic" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fy5jkyh9949379gjxoeqs.png" title="Published Nov 19"> 241 2461. Maximum Sum of Distinct Subarrays With Length K </a> <a href="/mdarifulhaque/2516-take-k-of-each-character-from-left-and-right-5ea2" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fe0lu0bmkai9op1zxgu7m.png" title="Published Nov 20"> 242 2516. Take K of Each Character From Left and Right </a> <a href="/mdarifulhaque/2257-count-unguarded-cells-in-the-grid-4ibc" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F7204v2qs9ezngc3v2rxa.png" title="Published Nov 21"> 243 2257. Count Unguarded Cells in the Grid </a> <a href="/mdarifulhaque/1072-flip-columns-for-maximum-number-of-equal-rows-48o5" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F08jxh0njg3cxv2tij5bp.png" title="Published Nov 22"> 244 1072. Flip Columns For Maximum Number of Equal Rows </a> <a href="/mdarifulhaque/1975-maximum-matrix-sum-okn" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fagkrkixqv29h1n90gcmj.png" title="Published Nov 24"> 245 1975. Maximum Matrix Sum </a> <a href="/mdarifulhaque/773-sliding-puzzle-42ki" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fzaiq58k4g0550iz1zdtn.png" title="Published Nov 25"> 246 773. Sliding Puzzle </a> <a href="/mdarifulhaque/2924-find-champion-ii-lbb" class="crayons-link crayons-link--contentful series-switcher__link series-switcher__link--hidden" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fx0ct232oqk2a2rt4tgzi.png" title="Published Nov 26"> 247 2924. Find Champion II </a> <a href="/mdarifulhaque/3243-shortest-distance-after-road-addition-queries-i-30i5" class="crayons-link crayons-link--contentful series-switcher__link " data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Foobzuc008327qfvzf7qu.png" title="Published Nov 27"> 248 3243. Shortest Distance After Road Addition Queries I </a> <a href="/mdarifulhaque/2290-minimum-obstacle-removal-to-reach-corner-4fg6" class="crayons-link crayons-link--contentful series-switcher__link " data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F4kzm76nk1te6wgumnjan.png" title="Published Nov 28"> 249 2290. Minimum Obstacle Removal to Reach Corner </a> </div> </nav> <div class="js-billboard-container body-billboard-container" data-async-url="/mdarifulhaque/2563-count-the-number-of-fair-pairs-fl2/billboards/post_body_bottom"></div> </div> <section id="comments" data-follow-button-container="true" data-updated-at="2024-11-28 10:01:18 UTC" class="text-padding mb-4 border-t-1 border-0 border-solid border-base-10"> <header class="relative flex justify-between items-center mb-6"> <div class="flex items-center"> <h2 class="crayons-subtitle-1"> Top comments (0) </h2> </div> <div id="comment-subscription" class="print-hidden"> <div class="crayons-btn-group"> Subscribe </div> </div> </header> <div id="billboard_delay_trigger"></div> <div id="comments-container" data-testid="comments-container" data-commentable-id="2102640" data-commentable-type="Article" data-has-recent-comment-activity="false"> <div id="response-templates-data" class="hidden"></div> <form class="comment-form print-hidden" id="new_comment" action="/comments" accept-charset="UTF-8" method="post"><input name="utf8" type="hidden" value="✓" autocomplete="off" /> <input type="hidden" name="authenticity_token" value="NOTHING" id="new_comment_authenticity_token"> <input value="2102640" autocomplete="off" type="hidden" name="comment[commentable_id]" id="comment_commentable_id" /> <input value="Article" autocomplete="off" type="hidden" name="comment[commentable_type]" id="comment_commentable_type" /> <img src="https://media2.dev.to/dynamic/image/width=256,height=,fit=scale-down,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F8j7kvp660rqzt99zui8e.png" width="32" height="32" alt="pic" class="crayons-avatar__image overflow-hidden" id="comment-primary-user-profile--avatar" loading="lazy" /> <div class="comment-form__inner"> <div class="comment-form__field" data-tracking-name="comment_form_textfield"> <textarea placeholder="Add to the discussion" onfocus="handleFocus(event)" onkeyup="handleKeyUp(event)" onkeydown="handleKeyDown(event)" oninput="handleChange(event)" id="text-area" required="required" class="crayons-textfield comment-textarea crayons-textfield--ghost" aria-label="Add a comment to the discussion" name="comment[body_markdown]"> </textarea> </div> <div class="response-templates-container crayons-card crayons-card--secondary p-4 mb-4 comment-form__templates fs-base hidden"> <header class="mb-3"> <button type="button" class="crayons-btn personal-template-button active" data-target-type="personal" data-form-id="new_comment">Personal</button> <button type="button" class="crayons-btn moderator-template-button hidden" data-target-type="moderator" data-form-id="new_comment">Trusted User</button> </header> <div class="personal-responses-container"> </div> <div class="moderator-responses-container hidden"> </div> <a target="_blank" rel="noopener nofollow" href="/settings/response-templates"> Create template </a> Templates let you quickly answer FAQs or store snippets for re-use. </div> <div class="comment-form__preview text-styles text-styles--secondary" id="preview-div"></div> <div class="comment-form__buttons mb-4"> <button type="submit" class="crayons-btn mr-2 js-btn-enable" onclick="validateField(event)" data-tracking-name="comment_submit_button" disabled>Submit</button> <button type="button" class="preview-toggle crayons-btn crayons-btn--secondary comment-action-preview js-btn-enable mr-2" data-tracking-name="comment_preview_button" disabled>Preview</button> <a href="/404.html" class="dismiss-edit-comment crayons-btn crayons-btn--ghost js-btn-dismiss hidden">Dismiss</a> </div> </div> <div class="code-of-conduct" id="toggle-code-of-conduct-checkbox"></div> </form> <div class="comments" id="comment-trees-container"> </div> </div> <div class="align-center"> <nav class="fs-s align-center block" aria-label="Conduct controls"> <a href="/code-of-conduct" class="crayons-link crayons-link--secondary">Code of Conduct</a> • <a href="/report-abuse" class="crayons-link crayons-link--secondary">Report abuse</a> </nav> </div> </section> <div id="hide-comments-modal" class="hidden"> <form id="hide-comments-modal__form" class="hide-comments-modal__form" data-type="json" action="/comments/hide" accept-charset="UTF-8" data-remote="true" method="post"><input name="utf8" type="hidden" value="✓" autocomplete="off" /><input type="hidden" name="_method" value="patch" autocomplete="off" /><input type="hidden" name="authenticity_token" value="tjnW2pO1bhBzUgl4JPndVx6YlVfibhCE0kv1yUWtiDkHoWOHjnOc4JN70ASrsBBGCOjvrr9Dy1bBkm0NO0YDcg" autocomplete="off" /> <div class="hide-comments-modal__content"> Are you sure you want to hide this comment? It will become hidden in your post, but will still be visible via the comment's <a id="hide-comments-modal__comment-permalink" href="#">permalink</a>. <label class="crayons-field crayons-field--checkbox my-2"> <input name="hide_children" type="hidden" value="0" autocomplete="off" /><input class="hide_children crayons-checkbox" type="checkbox" value="1" name="hide_children" id="hide_children" /> Hide child comments as well </label> <button type="submit" class="crayons-btn"> Confirm </button> </div> </form> For further actions, you may consider blocking this person and/or <a id="hide-comments-modal__report-link" href="/report-abuse">reporting abuse</a> </div> </article> <div class="pb-4 crayons-layout__comments-billboard"> <div class="js-billboard-container pb-4 crayons-layout__comments-billboard" data-async-url="/mdarifulhaque/2563-count-the-number-of-fair-pairs-fl2/billboards/post_comments"></div> </div> <section class="crayons-card crayons-card--secondary text-padding mb-4 print-hidden" id="bottom-content-read-next"> <h2 class="crayons-subtitle-1">Read next</h2> <a href="/composiodev/9-must-know-dev-tools-to-build-cool-ai-apps-1ff1" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F4hteijq1ldakmqqme7n3.gif" class="crayons-link mt-6 block"> <div class="flex items-center"> <img loading="lazy" alt="ayush2390 profile image" class="crayons-avatar__image" width="100" height="100" src="https://media2.dev.to/dynamic/image/width=100,height=100,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F528884%2Fe6c37315-7389-4c82-bf3f-4fab89ddc8b5.png" /> <div> <h3 class="fs-xl mb-0 lh-tight">9 must-know dev tools to build cool AI apps 🧙‍♂️🪄</h3> Ayush Thakur - <time datetime="2024-11-25T14:25:58Z">Nov 25</time> </div> </div> </a> <a href="/sosalejandro/comparative-benchmarking-ilp-a-and-branch-and-bound-algorithms-in-high-throughput-scenarios-8ae" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fwzr068n6txj3krqyahqg.jpg" class="crayons-link mt-6 block"> <div class="flex items-center"> <img loading="lazy" alt="sosalejandro profile image" class="crayons-avatar__image" width="100" height="100" src="https://media2.dev.to/dynamic/image/width=100,height=100,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F582577%2F5a43b267-e94b-437f-b437-b5394843ce89.jpeg" /> <div> <h3 class="fs-xl mb-0 lh-tight">Comparative Benchmarking: ILP, A*, and Branch and Bound Algorithms in High-Throughput Scenarios</h3> Alejandro Sosa - <time datetime="2024-11-05T13:19:06Z">Nov 5</time> </div> </div> </a> <a href="/izushi/api-token-authentication-2o9j" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Ft5zsl1hysxbgbbohx4z9.png" class="crayons-link mt-6 block"> <div class="flex items-center"> <img loading="lazy" alt="izushi profile image" class="crayons-avatar__image" width="100" height="100" src="https://media2.dev.to/dynamic/image/width=100,height=100,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F2191640%2F09f13623-8305-4211-948d-ab1100874456.jpg" /> <div> <h3 class="fs-xl mb-0 lh-tight">Clear illustration of how API Token Authentication works</h3> Daichi Izushi - <time datetime="2024-11-05T20:32:07Z">Nov 5</time> </div> </div> </a> <a href="/priya2422/navigating-the-directed-maze-finding-the-minimum-spanning-tree-2je4" data-preload-image="https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fjsrso5b898hs2jlei18m.jpg" class="crayons-link mt-6 block"> <div class="flex items-center"> <img loading="lazy" alt="priya2422 profile image" class="crayons-avatar__image" width="100" height="100" src="https://media2.dev.to/dynamic/image/width=100,height=100,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F1344494%2F2641f299-da9b-466f-9925-2ef82eeb7e38.png" /> <div> <h3 class="fs-xl mb-0 lh-tight">Navigating the Directed Maze: Finding the Minimum Spanning Tree</h3> Priya Pandey - <time datetime="2024-11-05T08:45:46Z">Nov 5</time> </div> </div> </a> </section> </div> </main> <aside class="crayons-layout__sidebar-right" aria-label="Author details"> <div class="crayons-article-sticky grid gap-4 pb-4 break-word" id="article-show-primary-sticky-nav"> <div class="crayons-card crayons-card--secondary branded-7 p-4 pt-0 gap-4 grid" style="border-top-color: #000000;"> <div class="-mt-4"> <a href="/mdarifulhaque" class="flex"> <img src="https://media2.dev.to/dynamic/image/width=90,height=90,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F944478%2F148ec474-230c-4c52-8b8e-5aba51bc6d2e.jpeg" class="crayons-avatar__image" alt="" loading="lazy" /> MD ARIFUL HAQUE </a> </div> <div class="print-hidden"> <button name="button" type="button" data-info="{"className":"User","style":"","id":944478,"name":"MD ARIFUL HAQUE"}" class="crayons-btn follow-action-button whitespace-nowrap w-100 follow-user" aria-label="Follow user: MD ARIFUL HAQUE" aria-pressed="false">Follow</button> </div> <div class="color-base-70"> I am a Technical Lead with holistic knowledge of software development and design. I am also experienced in coordinating with stakeholders </div> <div class="user-metadata-details"> <ul class="user-metadata-details-inner"> <li> <div class="key"> Location </div> <div class="value"> 2 NO MUSLIM NAGAR, MATUAIL, TUSHARDHARA, DEMRA - 1362, DHAKA, BANGLADESH </div> </li> <li> <div class="key"> Education </div> <div class="value"> AHSANULLAH UNIVERSITY OF SCIENCE AND TECHNOLOGY </div> </li> <li> <div class="key"> Pronouns </div> <div class="value"> he/him </div> </li> <li> <div class="key"> Work </div> <div class="value"> TECH LEAD at MT TECHNOLOGIES </div> </li> <li> <div class="key"> Joined </div> <div class="value"> <time datetime="2022-10-15T05:04:08Z" class="date">Oct 15, 2022</time> </div> </li> </ul> </div> </div> <div class="crayons-card crayons-card--secondary"> <header class="crayons-card__header"> <h3 class="crayons-subtitle-2"> More from <a href="/mdarifulhaque">MD ARIFUL HAQUE</a> </h3> </header> <div> <a class="crayons-link crayons-link--contentful" href="/mdarifulhaque/2290-minimum-obstacle-removal-to-reach-corner-4fg6"> 2290. Minimum Obstacle Removal to Reach Corner <div class="crayons-link__secondary -ml-1"> #php #leetcode #algorithms #programming </div> </a> <a class="crayons-link crayons-link--contentful" href="/mdarifulhaque/3243-shortest-distance-after-road-addition-queries-i-30i5"> 3243. Shortest Distance After Road Addition Queries I <div class="crayons-link__secondary -ml-1"> #php #leetcode #algorithms #programming </div> </a> <a class="crayons-link crayons-link--contentful" href="/mdarifulhaque/mastering-laravel-naming-conventions-clean-and-maintainable-code-4a6d"> Mastering Laravel Naming Conventions: Clean and Maintainable Code <div class="crayons-link__secondary -ml-1"> #laravel #php #webdev #programming </div> </a> </div> </div> </div> <div class="crayons-article-sticky grid gap-4 break-word js-billboard-container" data-async-url="/mdarifulhaque/2563-count-the-number-of-fair-pairs-fl2/billboards/post_sidebar"></div> </aside> </div> <div class="mod-actions-menu print-hidden"></div> <div data-testid="unpublish-post-modal-container" class="unpublish-post-modal-container hidden"></div> <div class="fullscreen-code js-fullscreen-code"></div> <script src="https://assets.dev.to/assets/followButtons-f2455d1f50a862b83fa006b1953e3a1644598781243cae25d3e75b13c04184fd.js" defer="defer"></script> <script src="https://assets.dev.to/assets/billboard-a7ffd2b38d410444a4ef2d42c6ce905699d84b1520aed314b817a767ddc3b362.js" defer="defer"></script> <script src="https://assets.dev.to/assets/localizeArticleDates-70147c5c6bfe350b42e020ebb2a3dd37419d83978982b5a67b6389119bf162ac.js" defer="defer"></script> <script src="https://assets.dev.to/assets/articleReactions-79a44d82fb34a91c3987c24cfd3bcf2b0d38a02730b69ae6da297387d185f015.js" defer="defer"></script> <script> function activateRunkitTags() { if (!areAnyRunkitTagsPresent()) return var checkRunkit = setInterval(function() { try { dynamicallyLoadRunkitLibrary() if (typeof(RunKit) === 'undefined') { return } replaceTagContentsWithRunkitWidget() clearInterval(checkRunkit); } catch(e) { console.error(e); clearInterval(checkRunkit); } }, 200); } function isRunkitTagAlreadyActive(runkitTag) { return runkitTag.querySelector("iframe") !== null; }; function areAnyRunkitTagsPresent() { var presentRunkitTags = document.getElementsByClassName("runkit-element"); return presentRunkitTags.length > 0 } function replaceTagContentsWithRunkitWidget() { var targets = document.getElementsByClassName("runkit-element"); for (var i = 0; i < targets.length; i++) { if (isRunkitTagAlreadyActive(targets[i])) { continue; } var wrapperContent = targets[i].textContent; if (/^(<iframe src)/.test(wrapperContent) === false) { if (targets[i].children.length > 0) { var preamble = targets[i].children[0].textContent; var content = targets[i].children[1].textContent; targets[i].innerHTML = ""; var notebook = RunKit.createNotebook({ element: targets[i], source: content, preamble: preamble }); } } } }; function dynamicallyLoadRunkitLibrary() { if (typeof(dynamicallyLoadScript) === "undefined") return dynamicallyLoadScript("//embed.runkit.com") } activateRunkitTags(); </script> <div class="js-billboard-container pb-4 crayons-layout__comments-billboard" data-async-url="/mdarifulhaque/2563-count-the-number-of-fair-pairs-fl2/billboards/post_fixed_bottom"></div> <div id="runtime-banner-container"></div> </div> </div> <footer id="footer" class="crayons-footer print-hidden"> <div id="footer-container" class="crayons-footer__container"> <div style="" data-display-unit data-id="146443" data-category-click="click" data-category-impression="impression" data-context-type="home" data-special="nothing" data-article-id="152338" data-type-of="in_house"> Thank you to our Diamond Sponsor <a href="https://neon.tech/">Neon</a> for supporting our community. </div> <a class="c-link c-link--branded fw-medium" aria-label="DEV Community Home" href="/">DEV Community</a> — A constructive and inclusive social network for software developers. With you every step of your journey. <ul class="footer__nav-links flex gap-2 justify-center flex-wrap fs-s p-0" style="" /> <li class="footer__nav-link flex items-center"> <a href="/"> Home </a> </li> <li class="footer__nav-link flex items-center"> <a href="/++"> DEV++ </a> </li> <li class="footer__nav-link flex items-center"> <a href="/pod"> Podcasts </a> </li> <li class="footer__nav-link flex items-center"> <a href="/videos"> Videos </a> </li> <li class="footer__nav-link flex items-center"> <a href="/tags"> Tags </a> </li> <li class="footer__nav-link flex items-center"> <a href="/help"> DEV Help </a> </li> <li class="footer__nav-link flex items-center"> <a href="https://shop.forem.com/"> Forem Shop </a> </li> <li class="footer__nav-link flex items-center"> <a href="/advertise"> Advertise on DEV </a> </li> <li class="footer__nav-link flex items-center"> <a href="/challenges"> DEV Challenges </a> </li> <li class="footer__nav-link flex items-center"> <a href="/showcase"> DEV Showcase </a> </li> <li class="footer__nav-link flex items-center"> <a href="/about"> About </a> </li> <li class="footer__nav-link flex items-center"> <a href="/contact"> Contact </a> </li> <li class="footer__nav-link flex items-center"> <a href="/free-postgres-database-tier"> Free Postgres Database </a> </li> <li class="footer__nav-link flex items-center"> <a href="/guides"> Guides </a> </li> <li class="footer__nav-link flex items-center"> <a href="/software-comparisons"> Software comparisons </a> </li> </ul> <ul class="footer__nav-links flex gap-2 justify-center flex-wrap fs-s p-0" style="" /> <li class="footer__nav-link flex items-center"> <a href="/code-of-conduct"> Code of Conduct </a> </li> <li class="footer__nav-link flex items-center"> <a href="/privacy"> Privacy Policy </a> </li> <li class="footer__nav-link flex items-center"> <a href="/terms"> Terms of use </a> </li> </ul> <div class="fs-s"> Built on <a class="c-link c-link--branded" target="_blank" rel="noopener" href="https://www.forem.com">Forem</a> — the <a target="_blank" rel="noopener" class="c-link c-link--branded" href="https://dev.to/t/opensource">open source</a> software that powers <a target="_blank" rel="noopener" class="c-link c-link--branded" href="https://dev.to">DEV</a> and other inclusive communities. Made with love and <a target="_blank" rel="noopener" class="c-link c-link--branded" href="https://dev.to/t/rails">Ruby on Rails</a>. DEV Community © 2016 - 2024. </div> </div> </footer> <div id="snack-zone"></div> <div id="global-signup-modal" class="authentication-modal hidden"> <div class="authentication-modal__container"> <figure class="authentication-modal__image-container"> <img class="authentication-modal__image" src="https://media2.dev.to/dynamic/image/width=190,height=,fit=scale-down,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F8j7kvp660rqzt99zui8e.png" alt="DEV Community" loading="lazy" /> </figure> <div class="authentication-modal__content"> We're a place where coders share, stay up-to-date and grow their careers. </div> <div class="authentication-modal__actions"> <a href="/enter" class="crayons-btn" aria-label="Log in" data-no-instant> Log in </a> <a href="/enter?state=new-user" class="crayons-btn crayons-btn--ghost-brand js-global-signup-modal__create-account" aria-label="Create new account" data-no-instant> Create account </a> </div> </div> </div> <script src="https://assets.dev.to/assets/signupModalShortcuts-0b25469b985100a01e94cbd7fccaf7f0a4d776e129aac65c766aa32cb28ab29a.js" defer="defer"></script> <div id="cookie-consent"></div> <div id="i18n-translations" data-translations="{"en":{"core":{"add_comment":"Add comment","beta":"beta","comment":"Comment","copy_link":"Copy link","edit_profile":"Edit profile","follow":"Follow","follow_back":"Follow back","following":"Following","like":"Like","loading":"loading...","reaction":"Reaction","report_abuse":"Report abuse","search":"Search","success_settings":"Successfully updated settings.","counted_organization":{"one":"%{count} organization","other":"%{count} organizations"},"counted_user":{"one":"%{count} person","other":"%{count} people"},"not_following":"You're not following anyone","following_everyone":"You're following %{details} (everyone)","you_are_following":"You're following","and":"and"}}}"></div> <div id="reaction-category-resources" class="hidden" aria-hidden="true"> <img data-name="Like" data-slug="like" data-position="1" src="https://assets.dev.to/assets/sparkle-heart-5f9bee3767e18deb1bb725290cb151c25234768a0e9a2bd39370c382d02920cf.svg" width="18" height="18" /> <img data-name="Unicorn" data-slug="unicorn" data-position="2" src="https://assets.dev.to/assets/multi-unicorn-b44d6f8c23cdd00964192bedc38af3e82463978aa611b4365bd33a0f1f4f3e97.svg" width="18" height="18" /> <img data-name="Exploding Head" data-slug="exploding_head" data-position="3" src="https://assets.dev.to/assets/exploding-head-daceb38d627e6ae9b730f36a1e390fca556a4289d5a41abb2c35068ad3e2c4b5.svg" width="18" height="18" /> <img data-name="Raised Hands" data-slug="raised_hands" data-position="4" src="https://assets.dev.to/assets/raised-hands-74b2099fd66a39f2d7eed9305ee0f4553df0eb7b4f11b01b6b1b499973048fe5.svg" width="18" height="18" /> <img data-name="Fire" data-slug="fire" data-position="5" src="https://assets.dev.to/assets/fire-f60e7a582391810302117f987b22a8ef04a2fe0df7e3258a5f49332df1cec71e.svg" width="18" height="18" /> </div> </body> </html>

CINXE.COM

2563. Count the Number of Fair Pairs - DEV Community