website/public/en/ChapterTwo/Stack/index.html - master - githubmirror/LeetCode-Go

website/public/en/ChapterTwo/Stack/index.html
13 059 строк283 KB
halfrost
update proxy
03 июл 2026, 02:27
03 июл 2026, 02:273bcc916
<!DOCTYPE html>
<html lang="en" dir="ltr">

<head>
  <meta name="generator" content="Hugo 0.74.3" />
  <meta charset="UTF-8">
<meta name="viewport" content="width=device-width, initial-scale=1.0">

<script>
  
  
  document.documentElement.classList.add('no-anim');
  window.addEventListener('load', function () {
    requestAnimationFrame(function () { document.documentElement.classList.remove('no-anim'); });
  });
</script>

<script>
  
  
  (function () {
    try {
      var cur = "en", otherLang = "zh", otherURL = "https:\/\/books.halfrost.com\/leetcode\/zh\/ChapterTwo\/Stack\/";
      var pref = localStorage.getItem('preferredLang');
      if (pref && pref === otherLang && otherURL) { location.replace(otherURL); }
    } catch (e) {}
  })();
</script>

<meta name="description" content="Stack #    Parentheses matching problems and similar problems. Problem 20, Problem 921, Problem 1021. Basic stack pop and push operations. Problem 71, Problem 150, Problem 155, Problem 224, Problem 225, Problem 232, Problem 946, Problem 1047. Encoding problems using a stack. Problem 394, Problem 682, Problem 856, Problem 880. Monotonic stack. Use a stack to maintain a monotonically increasing or decreasing index array. Problem 84, Problem 456, Problem 496, Problem 503, Problem 739, Problem 901, Problem 907, Problem 1019.">
<meta name="theme-color" content="#FFFFFF"><meta property="og:title" content="2.05 ✅ Stack" />
<meta property="og:description" content="Stack #    Parentheses matching problems and similar problems. Problem 20, Problem 921, Problem 1021. Basic stack pop and push operations. Problem 71, Problem 150, Problem 155, Problem 224, Problem 225, Problem 232, Problem 946, Problem 1047. Encoding problems using a stack. Problem 394, Problem 682, Problem 856, Problem 880. Monotonic stack. Use a stack to maintain a monotonically increasing or decreasing index array. Problem 84, Problem 456, Problem 496, Problem 503, Problem 739, Problem 901, Problem 907, Problem 1019." />
<meta property="og:type" content="article" />
<meta property="og:url" content="https://books.halfrost.com/leetcode/en/ChapterTwo/Stack/" />
<meta property="article:modified_time" content="2026-06-28T12:43:20-07:00" />
<title>2.05 ✅ Stack | LeetCode Cookbook</title>
<link rel="manifest" href="/leetcode/manifest.json">
<link rel="icon" href="/leetcode/favicon.png" type="image/x-icon">
<link rel="alternate" hreflang="zh" href="https://books.halfrost.com/leetcode/zh/ChapterTwo/Stack/" title="2.05 ✅ Stack">

<link rel="stylesheet" href="/leetcode/book.min.f8a130404c630c0548ad12d48a6b211d58536bddb42de301908d62338ec5bc78.css" integrity="sha256-&#43;KEwQExjDAVIrRLUimshHVhTa920LeMBkI1iM47FvHg=">
<script defer src="/leetcode/en.search.min.cb4441a35f7edc8ad6327488282266c11589d9483728ec07a9653194baa463ff.js" integrity="sha256-y0RBo19&#43;3IrWMnSIKCJmwRWJ2Ug3KOwHqWUxlLqkY/8="></script>

<script async>
    if ('serviceWorker' in navigator) {
      navigator.serviceWorker.register("\/leetcode\/serviceworker-v1.min.js", { updateViaCache: 'none' }).then(function() {
          if (navigator.serviceWorker.controller) {
            console.log('Assets cached by the controlling service worker.');
          } else {
            console.log('Please reload this page to allow the service worker to handle network operations.');
          }
      }).catch(function(error) {
          console.log('ERROR: ' + error);
        });
  } else {
      console.log('Service workers are not supported in the current browser.');
  }
</script>
<script async src="//busuanzi.ibruce.info/busuanzi/2.3/busuanzi.pure.mini.js"></script>
<script type="application/javascript">
var doNotTrack = false;
if (!doNotTrack) {
	window.ga=window.ga||function(){(ga.q=ga.q||[]).push(arguments)};ga.l=+new Date;
	ga('create', 'UA-82753806-3', 'auto');
	
	ga('send', 'pageview');
}
</script>
<script async src='https://www.google-analytics.com/analytics.js'></script>
<!--
Made with Book Theme
https://github.com/alex-shpak/hugo-book
-->

  <link rel="stylesheet" href="/leetcode/prism.css"/>
<link href="/leetcode/apple-touch-icon-60x60.png" rel="apple-touch-icon" sizes="60x60" />
<link href="/leetcode/apple-touch-icon-76x76.png" rel="apple-touch-icon" sizes="76x76" />
<link href="/leetcode/apple-touch-icon-120x120.png" rel="apple-touch-icon" sizes="120x120" />
<link href="/leetcode/apple-touch-icon-152x152.png" rel="apple-touch-icon" sizes="152x152" />
<link href="/leetcode/apple-touch-icon-180x180.png" rel="apple-touch-icon" sizes="180x180"/>
<link href="/leetcode/apple-touch-icon-512x512.png" rel="apple-touch-icon" sizes="512x512" />
<link href="/leetcode/apple-touch-icon-1024x1024.png" rel="apple-touch-icon" sizes="1024x1024" />

<script>
    var html = document.documentElement;
    var stored = localStorage.getItem('themeMode');
    
    function applyAutoTheme() {
      if (window.matchMedia && window.matchMedia('(prefers-color-scheme: dark)').matches) {
        html.setAttribute("data-theme", "dark");
      } else {
        html.setAttribute("data-theme", "light");
      }
    }
    if (stored === 'dark') {
      html.setAttribute("data-theme", "dark");        
    } else if (stored === 'light') {
      html.setAttribute("data-theme", "light");       
    } else {
      applyAutoTheme();                                
    }
    
    if (window.matchMedia) {
      var mq = window.matchMedia('(prefers-color-scheme: dark)');
      var onSchemeChange = function () {
        if (!localStorage.getItem('themeMode')) {
          applyAutoTheme();
        }
      };
      if (mq.addEventListener) { mq.addEventListener('change', onSchemeChange); }
      else if (mq.addListener) { mq.addListener(onSchemeChange); }
    }
  </script>

<style>
   
  .book-toc .book-toc-content,
  aside.book-menu .book-menu-content {
    max-height: 100vh;
    overflow-y: auto;
    padding-bottom: 4.5rem;
  }
   
  .book-toc .book-toc-content {
    box-sizing: border-box;
    overflow-x: hidden;
  }
  .book-toc .book-toc-content nav,
  .book-toc .book-toc-content nav ul,
  .book-toc .book-toc-content nav li,
  .book-toc .book-toc-content nav a {
    max-width: 100%;
    white-space: normal;
    overflow-wrap: anywhere;
    word-break: break-word;
  }
   
  .markdown .table-scroll {
    overflow-x: auto;
    margin: 1rem 0;
  }
  .markdown .table-scroll > table {
    margin-top: 0;
    margin-bottom: 0;
  }
   
  html.no-anim .book-menu-content,
  html.no-anim .book-toc-content,
  html.no-anim .book-page,
  html.no-anim .markdown {
    transition: none !important;
  }
</style>
</head>

<body dir="ltr">
  <input type="checkbox" class="hidden toggle" id="menu-control" />
  <input type="checkbox" class="hidden toggle" id="toc-control" />

  <a href="https://github.com/halfrost/LeetCode-Go" class="github-corner" aria-label="View source on GitHub"><svg width="80" height="80" viewBox="0 0 250 250" style="fill:#64CEAA; color:#fff; position: absolute; top: 0; border: 0; right: 0;z-index: 100;" aria-hidden="true"><path d="M0,0 L115,115 L130,115 L142,142 L250,250 L250,0 Z"></path><path d="M128.3,109.0 C113.8,99.7 119.0,89.6 119.0,89.6 C122.0,82.7 120.5,78.6 120.5,78.6 C119.2,72.0 123.4,76.3 123.4,76.3 C127.3,80.9 125.5,87.3 125.5,87.3 C122.9,97.6 130.6,101.9 134.4,103.2" fill="currentColor" style="transform-origin: 130px 106px;" class="octo-arm"></path><path d="M115.0,115.0 C114.9,115.1 118.7,116.5 119.8,115.4 L133.7,101.6 C136.9,99.2 139.9,98.4 142.2,98.6 C133.8,88.0 127.5,74.4 143.8,58.0 C148.5,53.4 154.0,51.2 159.7,51.0 C160.3,49.4 163.2,43.6 171.4,40.1 C171.4,40.1 176.1,42.5 178.8,56.2 C183.1,58.6 187.2,61.8 190.9,65.4 C194.5,69.0 197.7,73.2 200.1,77.6 C213.8,80.2 216.3,84.9 216.3,84.9 C212.7,93.1 206.9,96.0 205.4,96.6 C205.1,102.4 203.0,107.8 198.3,112.5 C181.9,128.9 168.3,122.5 157.7,114.1 C157.9,116.9 156.7,120.9 152.7,124.9 L141.0,136.5 C139.8,137.7 141.6,141.9 141.8,141.8 Z" fill="currentColor" class="octo-body"></path></svg></a><style>.github-corner:hover .octo-arm{animation:octocat-wave 560ms ease-in-out}@keyframes octocat-wave{0%,100%{transform:rotate(0)}20%,60%{transform:rotate(-25deg)}40%,80%{transform:rotate(10deg)}}@media (max-width:500px){.github-corner:hover .octo-arm{animation:none}.github-corner .octo-arm{animation:octocat-wave 560ms ease-in-out}}</style>

  <main class="container flex">
    <aside class="book-menu">
      <div class="book-menu-content">
        
  <nav>

<a href="/leetcode/en"><svg version="1.1" id="Layer_1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" x="0px" y="0px" width="1075px" height="342px" viewBox="0 0 1075 342" enable-background="new 0 0 1075 342" xml:space="preserve" style="width: 224px;height:70px;">  <image id="image0" width="1075" height="342" x="0" y="0"
      href="data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAABDMAAAFWCAMAAABD6CbHAAAABGdBTUEAALGPC/xhBQAAACBjSFJN
  AAB6JgAAgIQAAPoAAACA6AAAdTAAAOpgAAA6mAAAF3CculE8AAAC9FBMVEUAAAAJCQgAAAAAAAAA
  AAAAAAAHBwYDAwMAAAAAAAAHBwYAAAAAAAAAAAAAAAAHBwcHBwYEBAQFBQQAAAAlJSUICAcBAQEA
  AAAAAAAAAAAAAAAFBQUHBwYFBQUaGRcdHRocHBocHBodHRsdHRocHBodHBodHRsbGxhJQzozLilZ
  WVhZWVlZWVhZWVlYWFhYWFdYWFdYWFdLRDtZWVhZWFhZWVlZWVhYWFi84+Ks17Or1bGo1K+m0618
  l38AAAAHAwMSEA4VFBMfHx0dHRsaGRYKCAchIiBFTEdOXVEVEhAcGxhebGovMi5qgG2r1rM3Ojc/
  REC94eB+lJMPDAtVZVyZv6DL/tVNUk8YFhTf//+jv76Ip4y56cO/8MmPqKfl//+ctrVyinW04r2v
  3LijyaorKidnd3bD5+bJ8O/A5OOp07GQspYnJiLE985dcGB3i4rT+/qHnp2529rZ//+01NOqycjZ
  7+6VuZtkeWd+mYKvz83O9vWmxMNvgYDw//6exKWWr67G6+pZWVlgXF2BgYGkpKS3uLfBwsHMzMzW
  1tba2trj4+KrratnZl9ubWp5dnOampmOj475+fj////09PPd3d3o6Oju7u4kIR0iHxsOAwRcVEk2
  LiU+NCxCOTFHPzdORTtSS0FXUEWOgniWi4AKDw7j/ene8vFuW0pSMCKmmo2xpJdMHha7rqI6DQaM
  dFu43b9qTD98ZVTX89zHuKpSNVCukh2egCBAHzfWx7X65dTh0L3gxgz//gDs2sbTuRDNvqxjPiT/
  5wD/8gAvDj9/YCHv1gf33gTQ/v+/phjm0gzr57T/97z//8rTw5bDoXufDx3XFykMOEUIIinR6+qh
  XmX/nsDGc4PsiJ+1l3Pxx5j/7LOni2rUr4b/2KXlvZD/4Kv/0qC/4MXLp3/dtoucgWLrw5QEhLAG
  YYMMS2HT6tfS6dXP6NPN5tHE4sn4zp0Apd4Avf4AtvYAsvAAq+gAntQBj8EGdpvJ487M393i+fgA
  0P+kapj4AAAAPnRSTlMAFF2q374HIXHwPYjU+eg3G1Ipkg9DfrKeyvVKMGljxtOQ9uC2oux7xuXu
  zJndVKqIM3O7IndmRIaLi4uLtWIh9YkAAAABYktHRJPhA9+2AAAAB3RJTUUH5AgXEB0DxvxJBQAA
  fLNJREFUeNrtvXl8E9e9/81qdjBgtrCvub8kZLmJk9/z/J7njDSjkSwhLAnZlrxhvAjZRgbjJcYL
  GBtjDMYYYxYbG7DZAoSQQpI2bUraJM0tvTe53KZpewOBkGZpmjYlTdOkN88/zzmjbUYzI81oZMkO
  5/PqK8W25szMV/N9z/f7PduwYVhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhY
  WFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhY
  WFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhY
  WFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhY
  WFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhY
  WFhYWFhYQ17DR4wcBUbHxfoyvhcaM3b0OGJkmAfHjZ8wcdLkKbG+h9gaAWuwK37qhNGA0dB/VGOt
  aSOmT3TbMl7+wQnjx44cxxw8Pdb3ETsjYA1exSXET5sxYub00e6nlNGMWF/UEFXC8Gnjp46dPmvU
  JL8tx8g8esKsUf6DZ8f6jqJuBKwhoBGALxxnhKU4QsCW8UqOHoLMUGYErKGgmQJf8bRYX9TQ1BgB
  UwLJtSGhoyfE+paibQSsAA2fAUO2OaPu8xhy3ORRE0ePnD5zxIz4GF6UUJyREGtLDVZjBVfCOL4p
  xyk6emysbynaRuBr9LhRc2bNnjB2xNzx08YkMIofM2/KjKnzx06YPXLOqEkjYn3HA6a4qd56kJDu
  mzN7/pQYwXjE7NEBX/N92FjhadqEkXMmcS92oqyjA+96aqzvKOpG4GkUCKGZsb7hAdLckZNC3Tr0
  hdET5sboDT9lNvtCRmFjha+4ubPY1zla3tHD53N8ZHys7yYmRuDo3mRG3PyQ9x0Z8yrRVNY1zMHG
  UqSxrEuUPTQhYQ7r6CFcWFJkBJYmhHoIhipXgyhu7GTpTgAVq+scGZmv+N4wVgix3F5+FXM86/4G
  ZSQVDSOwNGXE9DkigeeoWRPmz4v1fUZecwNfm6NGThgxftqY4QkJw8dMmTpzZODfh8fqQv2XELMe
  viFjrBCa77/CMCJnFjZjfSOxMwJXCVNHB/LivtlTB+m3r1DxIzn3OW72iHjeZ8aMZUejMQtH4/2X
  EKPRh0PIWCE0xX+FYfR8+EsBMS9Gx84IPAX0700YyiFYME2dzL7NOSPEiv0zWBSN2RhMf/wXG2YM
  KWMFF4u/YbjLdD82Y30jsTMCX5wy/RAcuCJJcdM5TjA32Gfn+zx2fqwu19/hGgtmDDFjBVeCInfx
  V/2GNDOUGYEvVvIMxg3KrnblSmCnYJND9bRP8b5lY0ZQf60gBswYasYKIUXu4h+ZO6SZocwIfE1j
  PSGDtMNMqeLZ43Nmh86+5nne8zHrtIglM4acsUIIM0OpEfhiD0qfFet7GxDFs0r80oa3zvCE5bG6
  4hgyY+gZK4QwM5Qaga/vPTOGs7xgnMRRJ+48Nma18tgxYwgaK4QwM5Qaga/vOzPYg/kmSx11Eud2
  nVitNRAzZgxFY4UQZoZSI/D1fWcGa7T9fdIXo3B3QcdqXlLMmDEUjRVCmBlKjcDX95wZ7DUp5so4
  jnHbWM25iRUzhqSxQggzQ6kR+Pp+M2M8a6kiWQ/12FjaI0bMGJrGCiHMDKVG4GsoM2PCpBDfZQKr
  pCevsD8cDVaaHKP7ig0zhqixQggzQ6kR+BrCzJga8rtkjWicJHNCBJPax6iuFxtmDFFjhRBmhlIj
  8DWEmTEx1Hc5j3VvcscpMnMBY7RYWUyYMVSNFUKYGUqNwNfQZcbUkN8laxT0fXJn68YT0S4n+BUT
  ZgxVY4UQZoZSI/A1dJkxOtR3yZ5KI386xPw5oybGaOHYWDBjyBorhDAzlBqBryHLjCkhv0vWAKVJ
  Q2pRkFgwY8gaK4QwM5Qaga8hy4xZob5L9ptzsM6gElYMmDF0jRVCmBlKjcDXUGXGvJDfJXu9ZTkj
  lGKvGDBj6BorhDAzlBqBr6HKjFmhvkv2jQ3SsQNiij4zhrCxQggzQ6kR+BqizJgR8rtkD4QeYptt
  Rp8ZQ9hYIYSZodQIfA1NZvjGLIp/l+y1Ywbn0AFRRZ8ZQ9hYIYSZodQIfA1NZowM+V2y1x8brAvp
  iynqzBjKxgohzAylRuAr0syYNnbkRLTc27hRo2fL2yVFxpES1oNmbx6lZJPK4Jo3dvboUd6LHit/
  69KEqdNHT54EwKTJc0bO9O0SIZMZ4Zt8aBkrrAYGghlx48fOnjP5PgDuGzVrwnhZ9xETGwxqZsTP
  DNgqZ/J0icswyDkygbv7Blv+6ZjslXAHqPNw/OzJAaefNGuEjM0e4qbOCtiVas5YZtKGHGaEb3KW
  hoCxwm1AzF1mAyEF2FuQGfNmczfinjxB6kybWNlAmRH4iiAzxswmBK5gtIQl4qQfGRc/Y8I4ICqf
  SeLY3jgQSzuI7WZ633SJT5BIA2g3EenMCN/knEsZqsaS0ICYu4wWbC9gFW0BZoyZxT+KmB0/qG2g
  zAh8RYwZCdMJIKzpCRE7cjYILt9iUeMFfxs5jRDf/5iYLaUiMFe0gXHTJ/sNMEAm52rQG0tBA2Lu
  MlOwtYAgi8+MscL7lY4LWTiOpQ2UGYGvSDFj7mTRWwITx0ToyAQQXP5Rz+wMHUR889lpo4NexriQ
  WePwkUCSgjIjfJMHaJAbS1ED/s8FfGyKwH7F4wLSukBmJMwSvYrZQSsLsbWBMiPwFRlmxHl3nJo8
  feq04Qnx42dyNvOcPCYyR44BQTXOv5kXxycj3RMw4j5vy/eNnD8+PmH4tPFjud/prOCnHD+K1cAU
  2MCY8SOmC71HgjAjfJPzNLiNpawBUXdBJpxxn99eqO3ADwQwg7P3S6BGB4FGjG2gzAh8RYQZ3r23
  Js/3G44TfI8aHpEjx9w3cdb0+XOn+R/ycQkssT7J/nYnhXtbIvIlSJPHsk45hpM3TQ62as0IL9sn
  TWDf3bzZPOaLMyN8k/M1qI2lsIFg7uK/8zlTBT2eywzP3i8Tx04ZnjBmxsxAgMwShUasbaDMCHxF
  ghle/o6OZ/+W070xMqJH+o0l1td6H9uaYd6WsOJ88WngLmOcXCHI7iC+VGBi4NccH1ivEWVG+CYf
  WsZS3EBQd/HOzBOb/M9hhhsZo/yzccZzAjvRLyv2NlBmBL4iwAzvRjo80LI9YEQkjwzJjOHs73JU
  eLclrLjR4uafxn7P3yf2Fc73fmKOQKFyPDdDEWNG+CYfWsZSbu1g7jLfU0IW3Z+azYwEhtLT44T/
  Lm7wQWADZUbgSzkzvBvpTOS7ACvlmpwQwSNDMmMK+6uM6Cgl36mFbBw/mXVakYrCCJ93CiYP3DKb
  CDPCN/kQM5biBoK5i6cgNEm8p4jNDPS98HajnMrJJsfFD04bKDMCX8qZ4XnIJwkU3ONZQylmRvDI
  kMxgLwcRUTfwPUXCM7nmscP8OULp4TzfUyb2VpjAakKEGeGbfGgZS3EDQdwlzvMQBdtiksUMNPT4
  vhnBbSeUDg4GGygzAl+KmeHNzqcH+yOCYFzkjgzJjKkD5Aa+LUDE3uEj2CcWyBD9GwKIlzdZEa/w
  h8I33NAyluIGhom7i7eGPCpY7TEg9xB6F3P6qQGvm3JQ2ECZEfhSygzve1N4Qbi4yf7W50fsyNDM
  4Bgycm4QN0r0krxiVyEJfhzgu/Jg6/SGGAeqwHBDyljKrT1M1F3ivdldfLBb4DJDOGzj5JKBQygH
  hw2UGYEvpczw1o5FVl2YIG7P8I+UyYzIlfV81yT+Bh/DznB5Fz7D96dgo7VCMEOB4YaUsRQ3gCTs
  Lt7a4ejgJR8OM0SMGc9ODgJHxA0OGygzgsAZlTHD1wkwQ/jv7Pra8AgdKZcZEZvH7P92gng8uxwR
  eG9x/j79YEOugjNDieGGkrEUN8BI0F3Ge4o+I0Mkb2xmiO4TxQELl+ODxAbKjMCXMmb4AuH7xE7M
  KsmNiMyRw+TWMyI2TMl/2iBLZsYHwb7fO4NubhiUGYoMN5SMpbgBRkLu4u3tCDmBk40D0Q8nsAMN
  7pcySGygzAh8KWPG2KCXisTq+5sdmSOHyWUGiJdvFiGxvptg0RxnXBbn5eRPToOvYxCUGYoMN4SM
  pbgBtwTcxWvB0N1KbGaIB4bT2ZfA9u3BYgNlRuBLETP89TbRQWQsg86JyJFcI4kwYwZgS/6CEoLy
  x4BBC4WcWaKcu2MlAUFnggVjhjLDDSFjKW7ALb67eEckSIjBWMwI4hvsXSs5lB4sNlBmBL4UMcP/
  hpIwlI4T9oZ/JFJIZnC+xkhN7/a78kiJnwsoKc4Jddm8BvjMUGa4IWQsxQ24FegucZ5uhvuk7MjA
  smSwLqiJIpcwWGygzAh8KWKGv59J9OTs/usxkTgSSd7Y8QgtI8OiefCh+ZyaFCtUZK26GbxDIxgz
  lBlu6BhLcQMeBbiLb2qfpHBqZrCWRS7BX3YeNDZQZgS+lDAjwZ9uiZw9bhp7Hs+UCBzJSN4ctQgt
  V8f6YoKvVsAJFVnvp5BjtbwKwgyFhhs6xlLcgEfcZrxT+0ZJWymA9Y0F61zgJHf+jotBYwNlRuBL
  CTNYA2fnDYtLGDNtyoypI+aPnTlh+uxZo+dMHDUuYG733AgcySg0MzgTlSMz5oBVWgyeBcaxfXC2
  YAPBH4EgzFBouCFprPAa8Ihj83mT3f+cI3GdAInrjiewl0vzu+ygsYEyI/ClhBmsYtt9wmuecTUi
  AkcyCs0M7oJK8eFah/29sK4zRM7PXg3FX7xif7HBH4EgzFBouKFjLKUNeMV2lxmeXmjJg5ik7lXA
  hq4vixg8NlBmBL6UMCP4emPBHuDwj2QUmhncUb+RqOtNk94eO728T7CBGUGPD8IMhYYbksYKqwGv
  WO7iW+pojtRRTFKZIbhsyeCxgTIj8KWEGZNlPsBTI3Ako9DM4I45iMTWQlPFLydQnIGVw4UaCL7o
  ZhBmKDTckDRWWA145f8Tq8wj9UGXygw2dH1tDx4bKDMCXwqYEWRF30njRk2cM3rWyNnTJ8wcO3/E
  1BlT5o0ZnhCBI90KzQzuyqGRyNHns9oL8Q1yOi99eBgr9EtBiTNDqeGGjLEUN+CVsLEkrkkllRls
  l/V1iQ0eGygzAl8KmMGOneZMn848qXPHz5sWH/JJDf9It0IzI+CFHIGBSmyXDxHxxwmemh0/hssM
  pYYbMsZS3IBXwu4iccavVGawV9HwMWPw2ECZEfhSwAz2ZCh5e7qFf6RbEpjBXVkzAvH2TBnXzPZB
  X+mCPcQ4XGYoNdyQMZbiBrzy/2kC+3PSOpSkMoP9tYzmHxxrGygzAl8KmMHulpY3Eij8I92SwAxu
  jj4u/IKPV+xvMFRUxx4h4fsG2Y4Z/FUuzgylhhsyxlLcgFcst5vCmUwmZR8Xqcxgpwaz+AfH2gbK
  jMBXhJghLzcK/0i3JDCDO7hR8nq64mJ/g6HGPbE7L314YDMjOOClMSPsdHQoGEtxA16x3IWLRikb
  wITDjJH8g2NtA2VG4EsBM8bLuKdIHemWBGYE9EpKmqwVVGNltMbGwzShX4Y7PkOp4YaMsRQ34BXb
  XbidyhND14DCYYbvKxs8NlBmBL4UMGOejHuK1JGBFhL/LtlVZxB26uYXuzZ+X4jPsksXCUK/DJ5X
  iDNDqeGGjLEUN+AVx124O8aNDpmDhcMMX+Vh8NhAmRH4UsAM9qGTZJ06/CPdksIMzlIoEfAwzor+
  IUI61jfo32OI3W8idZpiIDOUGm7IGEtxA15x3SWOs41RyNVFpDKDnTL6eDt4bKDMCHwpYEaIDp4B
  OdItKcwI3EM+jHfn1NnT5/ugzcn5Q3SXs75B/wxW9rs8+Eq9k0WZodRwQ8ZYihvwiusu3v0TPQpV
  Rg5nfIbPuQePDZQZgS/5zJgweoLHLpPDPnP4RzKSxAz2WAYQzruTCQz8RWj2NYfojmR9g/5KJbsT
  nwiaRt4nfh6FhhsyxlLegEcB7sLdDyRUtVcqM9j7Q0TwFiJlA2VG4Es2M1Ac5lkln105k/eUhX8k
  I0nMCJh6JXsEy7SAR4CdBoZY0Z/11va/sTmjLYNNOGEN9gw63ySSBY3BZizlDXgU6C4Bq58G3wtI
  KjNYHssK9QeNDZQZgS/ZzBjpfzhCLfUhrvCPDLBQsO8y4N0puDNeEE0PcFrO7jfB00u/Z09iBRSs
  tX2DdpSysmMeMxQabugYS3EDHvHchdtvMC6oDaUyg0VyVg4xaGygzAh8yWXG8En+D3JoJWu4QPhH
  MpLGjMAkXdpuH74bZeI3FrQ5cYLUBTDYxc4QE5Z9YnGBxwyFhhs6xlLcgEcCjXDudFSwVSSkMsMf
  6rO3IRk0NlBmBL7kMoMxoyeTHs5ea+Q+OT294R8ZcMNBv8vh7Dd7SLMHiIE8Z0gku9wcNC9gJRfs
  QJHD9iAj8FgVKh4zFBpu6BhLeQNuCdxQHGc0SrA54RKZwepq5WB8sNhAmRH4ksmMhMnog95snHNe
  WW+98I9EksgM7hRhEGrZCoEb5UCbEyoGG3Xrr3Zy5ohyJh+K17RmBP2UMsMNHWMpb8AtAXcZNpzT
  bxCk31siM/yXOil+MNpAmRH4kskMtxW97zfOYzZJTlYU/pFIrMAq+AcDKnsyEjf3jXJKygnsN3Gw
  bm1/SYxbkmZ/S+IxApsKfGYoM9wQMpbiBtwScpdh0zgxlTh5JTJjjkhTg8UGyozAlzxmuANYXzLu
  fr94FTzAmTuTDcrwj0RiMSN4UMWFqYzx9e5vi+DmeewC5CTxlvxbkIziXh0nORHrKeVULPjMUGa4
  IWQs5Q0wEnQXTr93kE4i/yUEY4bfhcYliB0fUxsoM0KwG5bCDLez+onHXRUuWB8yvPv72IOQwj9y
  GIcZIZ5rbk+09LWW3eAOKAQOl4Z9v9cH5JbD2St43hcveHDCqBB2UWS4IWQs5Q0wEnYXbtQvOoTN
  //oOxgz/pwL9bpDYQJkR+JLFjBGBpgkonImPMpoQ+FSFfyTnWwo5GJI7zRu+PCW9emcIWDjQyKK9
  2r4VZXlJIqdYLWxtzmQAISQoMtxQMpbyBpBE3IX7VYjNCZfEjOE+0vKNPThsoMwIfMlhxgzPe5JV
  HeOiSiwripsdeJySIznv2pCD2AJLe/dJWCIzfrL7s4FW5IzUHyVSkfCNEZ/M68Eaw1kqXKhnAlll
  tj/UmC3ykXANN5SMpbwBJDFzc/sNJscLHsx6N4mz2fehcfywbHDYQJkR+GKP5QnBjLleoLKuLI6z
  NwYEndBVe3bpCbjesI/kTN0IvahUoB+A6aE6loZ7Lo0/22cM+yUvDPUxvteOwGuBsx2wwBwCdGMT
  WVtBC3WwKTHckDKW8gaGibtLQPVGeE44+z0sBg3/8gRCwf2gsIEyI/DF7tmbHOz5iPO93DlPx7yA
  XTYm8178CRPcHwl8Z4Z/JHsZCfbgqOGjiZECtzA3IE0HE4MPlh3jdUqBryhEhRJes8+jhYpK3GrF
  pEBoIBPDtxXrQ0J9FwoMF1qDyFgRaCCIuwT0GwjOCeckirMEPcrvdcJQGQw2UGYEvjgpzUhR0CTM
  9z/I3LQtYOkF+JDNZ7cSP3Oy2DMV/pHsjav8j/Rc9HmhXGXeqMAzjQzSjzjVZ0ah74CTGfC/wuG+
  WFL4EeLuwQ4msL+kBOYRncrpk50YL9BI+IaToEFkrAg0EO8/nPeRGQTnLgX8hbsU0SgBeib4rkCs
  szL2NlBoBJ4CHr/J06dOC1jgPiFh2oyxs4Js7jYBBOq+0WPnwmaGj5k702f1WQJXE/6RrC/T2904
  ZqTYh73eyBYxUqR4OoXVtGC3AecrnBWQF4wP8dYJ7PYAE/0B7YjJ3keP7bXjJkzh31L4hpOgQWQs
  5Q2wjp/IMwf34RfYWIyz0AR68uMDPjDN944Xz5FjbgOFRuBq+IhAo0hSYHwzXcIxswWf37CPZN/o
  nKnxCfFTZzPRuGhwNXUyr+GJM3nvz/j5bINMFmmKnRpMns864zRf0DZJvLc7YF4HGDVz7piE4VNm
  ur97pqQU8KafNHF2YH0xfJNL0eAxlsIG4sayjx7NwxrXjJNHBFqMF3JN4nwTCTN9zQcrHMXWBoqN
  wDrbiAlzOGGJdPFKd2NDHSF6Q+EemTBO8NNBQquE6QLbm44aOXbqlDHDE+D7ecrUsbMDi4siTU3h
  PEqTZ4+YF58wfNrcCX4XGhWsB3g2EJc7NOA9qvxaaPgml6LBYywFDcTNmB34lIyeGvAaDdjKErbO
  canA2g5ztunzx0MrxM8bMdL353HBxzbEzgaRMIKvqbACDI/4l8dUEsQ1RzwhDvdIQZ8JPv51zGyZ
  jBR9dySEeM3PDh7gTRA90BPg8pnBn0UQvskladAYK9wGxo4WcnhAzOFcaMJE3ifu8/ceeldFGz1i
  /PT7glzB6PgBuQXlDUTCCD6NBwok0Lc3PMjLc3LQN16YR8bxNzseF3IsQfyEcUCGgnQYzAuy1/Kc
  kGMvBWJ/5ga89VsuM+6bPGqi0NiusE0uTYPFWOE1MFX8CM5jMkbgJn1vWXftcDRzhuHewjLf2FLW
  uYqFDSJjBJ+UMEN4P895I4VfTKPGhkqrwztyeGCkNCteguXjps6aBCQq+Bq942cJHzVayhDc4QKx
  P+EvsHmYMZFJBsSvInyTS9MgMVZYDYwQv1Sui8/g36LvnYgmIt/nwy80h0Brk8dKHNQQfRtExgg+
  jSEmTxw9cvrM+VNnTJk2JiG0xkybO3/CyDmTJ4ljNX4mL+GZPFvSOMSwjoybwI67Rktenyxu7vQ5
  wV1h0qjRs2dOnRfqWYgfy7vqUROkpgRjuJvggcnTWWAfO2nSnOlTJayDEr7Jh5SxoBYsnC2rgRnw
  ukZOgI832uja/QCPnzp/wuzREycFvJTRH4ePmTdlxtQRYyfMnjVnsv+dCN+sozmnCLQ3MWuqDDwr
  tUFAAyp1qAYiYoSBVvzUCbMmMoHOuImjp8+XYY9wjhw+YjaC2KRRs8bK3A4qbsqICSNHT5zscYdx
  45g91UfOnjBzxNxpMtYsSpg7E3J0HLMp+6zpI2RdRdz4mbNGIexNnjhr5viwI4PwTT6UjLWApKgE
  JQ2Ed+cJfBR67T1p8ujpU2WveaT4FvwNaEhyURRsgIU1JBRI0MUQGUsiuSjZkNe8pRRFLo71VWBh
  DQ7NW7SUk1/NW0hBLY31ZcVQUxYt4iYTi5FFyAWxvi4srEGhBSRJLvT/OJzxD4pcFuvriqFFKJJz
  +3MXkYxJIrkpFhbWUFXccuQP/qh7/gqSotVaiopA9/HQVMIyrkVmLCS1KhpaZEUEN9/EwhqqmruU
  iSo8b9CE+5dSpArokvQUGc/+WMIMWasWDmUtWIEMovX2C05dRpEGoF5lVJPLOZ9LmIILolj3nuKZ
  IAO+QZmfxixegYihXp1sotkOMm/BshU+rHzPNW+hOw1xV3OGL1hEkRoAzJY1BEWyGMGYhLxnOIqF
  5dbw+5eQGqunuJewAL5QKRUwpKSm2QBJxbs/M23B8kUMVqj7Y325UdC05aTWjiyinYqmjixfQpJ2
  QOvWpGfQeh9F50GTkNp7xSRYWD4l3L+CJGnaZrRTi4bNWAx/oGhCm5SZlZ0CDEugzwyfsmAxwwsV
  jf77/Y/ExyyntBSgU4x2ctmw8cthmkbRwGpba8lZR9NaVCYePv7+ZfDXpMGKTEJ+/02CheVTPIKE
  Cmgzc/UaaikqaqgIwrQ6NS+/wEbYySXLFy5dAn2GUtMAOJJIA7VQ+TkHt8Yvh/dLAHPGehW8W9RT
  ogeEcdU6Z2HRGhWhpRYuRiaB0hOAMNkoA/m9NwkWlk9TFi9BlQsqpXiDSuX2A8Jlyy3OSi0ogVEG
  k9Jr1CroHBpTUmbeRqthRXysr3lAFTd1IUMMx6bSzcAOQwjKCgClW1NWXlZRmgEIlIrA8EKFJhwZ
  zCmVT6dYcTcK1j2juAULGZ8wpFTl5xmBRkUTVlKXu6E4PzPJuCF7IwAEAWlh1bhMW6pT89LSkgB8
  8Y75HnvIFBh0aTUAmDbV1NYRhB3B0mHbtK7MmbHVuKZ0nd473UVrtm1dW1O7rVwHKHKhnIH8WFiD
  S/FzFyxYMF7KIxw3Y/kKitQQhGPjhuT6qoLVKo3LnJJbn5dcUJC/0VSdXJC6OiklZeOW3MzU4uy0
  kqz8kmr04qWoFcvunzFUhpMPnzJ1wdQp0lx6zHyIUBh0Wc2bypyVlRVJBLLIprJaZ0VF4Vbj1oqy
  ms0pKSmrVq3ftL2iND09vdaZswqgwEO7ZAiZBAvLr4T73cMUqSUL7w/hJnMXL2VCDKs5tx4Soz61
  qj6zekNxSVbuxuL8/Kz85Oz84uKsbKiSkuyS7ILi5OTkrHotYMIOhhsLhsC7df7CJW57LFocavb1
  tPsXwqTDTgAyZW2Zpa6ypq6mYu3adWXl5ZvXWxqctYVl5bWWssJypPT08vRCi7OoqKh0LRN2WA2M
  SebHx/qGsbBkae5SkrJbCYK22klqhXj3X9x4phdETdCOlOri4tTUguT81A2pxXl5xdU2x5b8rJKC
  qjzIiHyoZMSKDTpTalZycnFWQXXuRp1RTwCVgaSWLBdff2LMguXLFi1atGy5/AmokbWHBtqDsNrR
  EPBgaxPNX0aSlIEGKvPWjIayupqyhqKMjEpLYa1lbYpjfUNtubOuATLC6VaRs2GzaVUhgkZt3eZN
  KToHDZBJyCXLgtzv8LmLly1ENlkQHzubYGGxtIDUqoDdqLOZHWpgJclFgrPz4+YyXYd6gtDoclOT
  CyArEBmKC+rrM7eYjSn1WXn1ucakPIYWeTDagMyoTspMRj8XZ5WUwBxlQ3WSlgY0xMbSxYLBxrzl
  EEkGu9puCMqugbaHVqsHVodJZ3LoAQHvebnw5+YhgpIaeEfG9dvLnDUZNZaGBqelrKysYt1WnTGl
  srTBst1sKiuEiLA4YbRRVNTQsGpVZQP6uQjmKPBX6zbbSAKaREutWC68KMKY5aj3SaPWQHwtWf49
  LglhDR1NI7W0fUtqflZ2XnLVFi2wa5fw1gBKmIpqGBAYNKlbvaE4OXVDVQETS+TnbTTpzBAiWVnw
  n46NBW5k1G9JhQFHcX5WVjJKTtzKh7lKceZGIw306PHnjQqNW8wMZ6DtFIz0VSQVoylu87Rawro+
  A8YKhZa6TSZg1QpQNG7G4qXulERvWrW5pqEsAxGDCSAqbDabWbepsrTcWbvVtaqOQUZD7ebN6B/O
  hlLEDo+cheU55WVr15toxGpqGT/+QjYhYTBitcMgjYawvTfG0mINbi0irVR9WjYMEPLzstPyU6CT
  aLkP7xQ0IhyNviDNCBgFVZAYTPyAQFCdm1mfn52F/l1fkJ2HEJGdqTXV5yULKa8kLS8zSQNo2OAy
  7sDp+EVakiaMKdVVqanVSQYQo9ELcSsgQuu2lRc2OBugS9eu0QNIOK6roiowRalgXqHbur2iwVLj
  I0ZRUWHFpjXwd+WlTkuRs6amtJT5ZZlNvaacwYSziCtnbXp64br1LgA0JLUoYFrfvKUkDEOM69es
  q8vYvNUI9Fo8MxYr5ppBGkB1mteni7PTqq2EVut354T5C0kmwnDYciEw6qsgMeqL830UyMrOyvP8
  lOfhRN6G3OK84mQR5ZeUFKw2AgLmH8tZ1Ji3grQDY3UeTGKyYCpTnERotKF39o28FmjtYPs2r0db
  CreVGQFFuvyRxvAFCyktqQdAC4FR1lBWWZeRUVnmbPAe4SwvL611eo72/KOhYuu62iJRNZTnWNbo
  CBjikYvYK2zMIOHFGNcU5qSXl5an5xRuJazaJUOghIz1/dYykjbnexFQnJ+XlbbBSmu9o43i73f3
  q2pRDQMBAxLDXcgIouK8bHFkMJxJy6o2MaWCxfGeyxjjIlVEUnGJNzzJTksCpDYGQ6sXUcBW6wsG
  LLWlOaVmGGn4DIJiLjsMCmxrMixOCAwuMUQEQVJaZAn2gdqc0owUJiVb5FtgfDyltYJVlhxPNmOp
  3baWUN/Lq5JgDQrFraDo3Hyfh2fZzMlpGwgVMzdi2PDFS9zjDjwRRtUGJsYITgwpKs5Py8pkqLHE
  XepMWKFVweuAGU9xPlM/Lc7KctAx8I/hFEWscVq80CjdbF6XU2qE+GIMMm85SZFWoNdtWmdxVtQh
  YNTVQGI4ixTL4kxPr1ulBmqYtLnzj3laLU1schYxfbOFiBvObevhlQzAArJYWNI1j1JrN/hyjewN
  QJOcl5YLNFqYWd+/QguJQSZVF+d7gVGQHAFieKiRXW1EBcaFyEMWutTE6jwYwRTnZ21gCqnFadUw
  fYl6j+tcSq/NQF2m7qSh0AU2l5c7KZqEBhnunk+iXeUHRmVFUUMkiMFQo6g8pwLGGhottTiOKaxY
  ic2FlYhfpTCUYSKNQodVi9cUxYqpZlBWY31VvQcEaavBxpLk/DQdIA33LyLhK1W7sSq/uIohRmpB
  JEIMTqyRq0E5/OJhM7UasCWPuYyS1SClBP09L9+hoqTuJBIxzScJc0VdhZsZzvJKYKottORkoNc/
  CroIYNxa2VBWxxCjssISkRCDpdL0uiQAU6Glc4ct1KrBmsKMmoYiS/p2oCtnoJGzHnz/5/phDW5B
  ZpjqU6s83SDZSWB1Vn5+XqrRSpGkmiAhMQoYYsCcJDmCwHBTIy+tOIUgoIfA17cuORUGGMUlVQBU
  Z7svRkdQUV9z934tYYNIsLihkb4Z2JwNDQ2162kNRWppYNxU1lDBECNSOUmgynPWOoBKSy0iKbCq
  sDKjrMFSWmYFW8u9F4RntmHFVuNhnJGauqEqv6QkK7WqwAxyiwuK67M3EjCvp5NSmaQEESNSOUkA
  NbLTNjiAXkvRZngmyIz8EhNYnVbsARgR/SVFmTijMqPOmZ5eWpHh3ApSymrKahoqSBWpAdpNFQ01
  bmJUWBoaFNJBJENx5tRutQKUBUFk1EFmFOU0glU5bjyVbyc0JO45wYqlplFqMhOGEhuqq1Pzkot1
  YHXxhoKCJDWlB6ZMb4wRsSoGHxrJJVkbaYKEwU5x1YbU5LRqoM3LSo4dM2ZQeu06FEms3V5T6GzY
  CpIsECDbjXoSgJSaQi8xigYixPBSo3BbjRlYSTrFaYEJkDOnDuid5e6+k/K1hAEzAyumilthsFYn
  V+VvBIA252avBhuLk1ONwE6o4D/cdYz6iCclHGpkpVW5gMGqrs6HyUmWEVSXZKOR5sX5eSY6+rnJ
  cIqiN1vqitYAQJg3NdQBXUVFw1aC0ADj5oaKDKaOMaDEYKhRnr7GCkjgWldYl1FRawbry9F02HKL
  JX0rIO/lbWOwBoMWkkRKclV9ZorNAYAtBaSUZJKEhjBmetOSiBY+BVWSlwRUVnpLfn3yFmBKrd6y
  esvGDXlZ9QY1Ff1+xaUkWN9QV7Nulc0FgGmN3tjgTAF6NE6ioY4JMiotA0wMBI2GbRVGoAHWzQ2V
  DZuAsXLdmk2btq5tKEpfBfAADawYaz6p0lbVw2AiuT7XCGirbYOatoOkYqazBKULA00MJtSopgk1
  SMrboFI5KGaWuKkkrZrwrGYeVS2maFNZZUaN01KzVgeAwVGXBAxAvdmdltTBPwxMHYMXapSvB1aI
  qtJKu9XocK/YYym3uKx4/0asGCuOoojV+YgPqckFG2mrS6NSEVuYEVwIGQMeZDDQyE9L1QINoTMS
  BO0y2zbmrq7KyzYT5HLl9ydX87QUWNOAkpAap3OTitC6aAo46txBBswUBj7I8ECjNmetFaZEKSYA
  MyOTLmX9+s3OnM2AxPsbYMVay0naWOBGRH1+tctqV9G5ealVqamp9fXF2Wg2STSwkZZnAgaaMG2s
  ri8oyEpLy8uustpj4h4LtYSjzB1UVDbUmGmVAZjLLBl1lTU1FTVF5aW1tbWFAxtquNfasDhzKrSA
  QlPUNmeUVTSkp5c703W4nIEVe42BgUZKvjusKC5w6K10dXZycXFBfeqGzA0QHMV5Wdlo9YtIUyIf
  NVuSne1Z0wstGmpXOZKzU6uq0LBU+KM2Ju4xjyTBqkJ3WFFTmkJQQOdsKCuyVFRmrNteWVNZWVNm
  KSxPL6+NfMDhLCxFa3khLJWidb3QqqEaq7GovKayrgyN7VpH2LV4SxSsmGsxqaerGWgU1DtoO5WZ
  l5m70WY2GV2UQWPQGk26pNWZ9Vkl2fnFyknh5QVsLTWzenVKElLKxtzqzOS01XYNra0qRmXX4pIq
  q1obm13Ul5F6Yi2TnVQ2pMAX/apyy/bNm1LMRocWGgRaxGE0r1qzrqwUvvgtykHhFeRQqSVj++at
  q5JsOltSyvo1a7c7c9ZbKYKqc2agsV0N5SagXYJHdGHFXiu0tKYqGaYmyWZAqs0bjcxCf16hJcQB
  TZk3VmWlZUWEGLCd+lybCS2fx6xQjv5LqzTmLUY1CcjU4g2p+XklphiFGcOGJSzREnbopnV1heuB
  RmVcs8pEWQngtojnv9AiLtvWjNL0wojwAuIg3bJ9q82op5nVyZFJAFpBVbfKZdcCTV1RRqWzYdsm
  gKa9YGHFXFO0JOGqSk7NTwEGNPPdqkJPLqHSkFotqbGix5dWEUBvzi1Oy1IYaxQnZ5cU5JoNBGzS
  SgC/aEgQA0nBK6nPr0rNzgUGMtTyvQOluVotIOsK65ybgYo0OFQAUoJZ8ddOabVaZpMneL3wv7Ru
  cxEMDhQToza9dt16B4NOtkkA2vCBIiktoCpra+pqK9TWWHEUC4ur+RAaMCVZTahJiAwAVEbdjqad
  zbtadu9pbW3dvbepzUyqDXYCGLYkl2RnQeXl5XlXCg6VhqAlheHH0VFZqHKRmmIHhJ5Sq7WmxrZ9
  7U1N7e1tO2xmLfJEKwWhYcwszsq0qrSxG4cwn9QS6s3ldVaaZBb8BBqjbV/T/r3Nu3a1IDV3tNtc
  8Nd6AFzrK9ILFVHDUpjuXGNCDIUQ0ppsyCRI7W06hwEFNBpKS2g31TVYjECrjRVHsbC4up8iaYMZ
  urEd2G1NzXsOdDI6cBDqwIHOg4eaO2waA5rnSuamVlWl1hcUoOV5GAZkJ4uFHmjp4GyImLx8tNRw
  KjOodEOKCi0HSmmM+zr2tuw+dPhgp0dHdu/fZyIIu5a26qrNhHZJDFcevx/NR1tvIrQkDQhj4/5d
  e44cYNTp05Fd7SaARlCot9amh1/XsDjTS9doIUQBMOja97YcOnLQf5KDrbuabEbIUsoKtGtWAQqP
  zcAaNJqxglQTdkrjatwPX6M7O+BbbkcjUwftMmjsdoPLZOrq7oLSHzV0d3d3uYxGkxlV6jZuzBUd
  9ZWXuXHLxpQknQ6243B1dXcbNAb9UY0LtdNlhL+D/+cymm072vY1dexsbjnU2tLR6NBQdoLWk0ui
  Pg2erQVLSQ2wkgA42vcegoBobT3MdmaPdu2jgEoFjNvTa8OEBkxL1pkArQa0raPlYOeBw/BEAec5
  uKvJDEM/FUFTeH9XrMGjeStIErKg22gzd6kIb22Stqr0drtdo9EYDIYut6DjayBF9HqV9SgS6E7O
  E2FGSRJgPmJlmmEaMVBdvnYMqB27ykp4c3jaYOrpMcGrIA1UrIchLIZZCQCmDgiMVnY0FKDWdjWA
  2dz60vKwoGEpr10FCA2gdzSjaE70RM079GjZPzI2HUlYWGzFT5l6//Jli7yebNDbNTCM6O6SLL2x
  WIwZ2SlHpbeDiKWxq1ReNnUtWr54wYxpselZjFtOaWH8sPNI5+Hdu1uPdAZR6z4A7MBYlC4fGhZn
  To0DIadxV+eBQ7t3HwpyokPtNNCQS3BughU7JcybC2GxFGYH0v16IJkhohULl98vdd/UiGnaIi0J
  6KbDMMQI6sieIMAFKEDVpIdRylhnBQbg2gmJsSfkiXY3AkJLLsMT4bFioOFT5i9etkImLFAcIMgM
  R4FMZoi1JCqXa8nCxffPjY+WfcYvQVsEtHQe2bN79+FQxEAVh0ZgJ6x1MqFhacjZDGg9aDzSeUja
  iZoNgNKuwNNNsKKq4TC4WLQkKC6QS1Oo9OAuY3hEueX/Bfor+rjdVc+M9HJ3ozDyTlHJTmKYQXEa
  4rXk+SsVAiUuV9fSZYsXRGFy/AwtzEvajnTu2bO79WBoT0ZqAmqCrpSXnjjT1wAVDTo6D+4+tPuQ
  pBMdtgG1dgnubsWKosascLnEUcGMjIbOC/3T4XD09h47duw41IlAoV/Cvx3rRXUPTXdqdlZ2SXZe
  cn3VhkwktC8j+k2WmxndjmNiDXla6u3thedjOlaYKxCnB7z6AS8DziO1VtAEgwyIDGnEgNoP9ISq
  TBY0ctZCZBB7O1vlnKgdqNgbVmFhDbTudwmxgvFUhhS9yLH7+vr7TyL1sOX/he/3J12IGYbikoLM
  LUlmo8tg1yPZKYdJl5S7oTiNYYbmRE+AAltiTtbf39eHKHKsF9GDiU0oIXQsGmATTXNBZOxnPFlK
  XuKHBkxnaqWPCbWk1xFWK90M8xJZJ9oPVOQSvMMJVtS0jEsLFFhAVjh6jyFUQFJ4Pbjfoz63OLGB
  +1fwjyf7XRRspStJ59IfPWrV22Ha4c5r7KqjR4/aHUkmDUpNTpxktcVvqc97Mg9K0Kf7IDuYIR0M
  zTjkGOhleFbAxMSNjJDFT446gAHY0qVOkreUF2kIFXAjQ9aJYESjxSuPY0VNi9jIMHTBBOQ4ZAXj
  qx5S9CF37fUIpRRu32ZDhMkpjvXBYxxMRQPiQSiV8Azf6u46dhy233/cwwhuS57UxHO2E54/u+mB
  Qg8UdnRRhugxYxmpgYlJ655DMpHR2dkGobEmR2KgUVhqBhrIpkPwRHLCGQZO9hgOq8e617SQ5dK9
  0EFPelkBSXHc7bgnTu7Y1950qmP/Tvf0it17Dh1qbT3sUWtrKyryt7Q0uwzG472GrpDqtm8pSOp2
  qTpaYHO7dvNb2tXcvHdnx6mm9n1tPX3wIiDFTiCSMexA1wfJwQo1BpYZC0gS7GCQIb2W4ZURWPVl
  0rITS84mQIF94Z1oH6DIsbF+krDuFS32+57meI87sDgBX/THjvf1tLWf3r+zedceie/XneAM5WDF
  FygpsetVKhXMUdjZRLe1OEtlBbbOA0eOHD4QvM2DrXtad+1vb9t3qu2EG2BMDtTTz2pw0UDaZzip
  BY4jB6EnH5KNjM7dhBpmJ1JW4rGUVuhVwHTgCDzRHvknMgGtC5c0sKKjf9H4mXGMKUGeON6zDwYV
  LVJ7Ff2yAZeXGd16NEJcb3AZTSaT0WXQW+GPnoTF0F2QRNCuVmmOeKCjzWY2mva1HNy1c39TG4w7
  +uFl9vmZoflfA2mfZVo10dy5GwZAByRYIFBNQEOskzKI3JmeAtT0LniiQ7tl272zs5W2ahfF+lHC
  ukf0L37nsx9/4F+OH7ebW/YcPig3dWe0G2gYZrj0hN6oS8mtzkT7MyYnF9dXZVavTjK7jh5Ff7ab
  VqtQ5i7JP5psJgLoVTTQtri9o2Wvq/fESVacoTkxgOaZpyVBeydMxuTWGDzAc9HAXB66DGopzyA0
  MDMJ+0Q7YXYyNdbPEta9oQd77b6cYXnCXPUZsLfz8KE9YcTHnSiv7mXgY67eUIzW9sxmltVAK2Wg
  H/LqMzdS0NUNJocKmA+0HpKQuZtNRzoPO2iK0gLQ4sUIMKy4f4X3qqmukwNonoVaWnsIJgx7wshM
  kPYCDVgbepCGs9wGrCRzovAsD7MTMgbbOGDdi3qov9tbtnTdP2wRCRo7D4X7sus8RKDRHt1Hq89m
  5/Gnw+dnpeV3QUJ1u7rtkEx7JMT7NvBM57bODkAhaDi8n9bSGjQtxlNQPb5y4KyDtinoYN7+YQVe
  yJcJzwbuQVW+jkCdM7vDP1EL0GhHxPphwron9HDPCbsHGq7507Qa0NwZ/suus42BxtHVJcLTTbKq
  EKC6HS5gPtgqgUwdgEBX0g6YseWQM27th4G4Fxnq3p5HBs46y7S0q/VweAVQ77XaVZWloZiRvgpY
  Ha2HDyk4kQ7gigZWVBR3sudEt13DlCHuX64FOknOLPq2szLDM7Zki0xR24BmpHT3upiXd8gw44id
  ps27j+xV6d3MaPf8/oCLdjODshuOnex5eMCME0+S8O2/J7y6pFsHSStYnx4CGbVlWqunbBJuPNO5
  CwYaM2L9NGHdE3q0p6f/mINZH2PhUgrsVxJmdHaaacSMjWLMyLSjcaK9Kteew5LCDLQKp4tQad3M
  aPP+oQkwzOh2HevrOfnAwNnmflJlbzkYfjUDqR3QpoYQa5GnrwFq1S6FJzLhfVuxoqQH0DgpZvxm
  N0U7GGeWP3rJ7+YQPkdTRJmh70a5CfR+KS/vfSgn0Vs1JBXAjN20nblcSIz+ngGc1LkUDec6pOTt
  j97/amtGeYgKaBIAtgPh15EYwYyNwktpYEVDj53s7z/pYYbHRcKOxDt3EYgZSWLMqFYxSRDY2Snl
  nboPUGzBNMErE2DGjJ042X/y0YGzzBiScl9pWGMzPDqgpcGm4MlJbZnLyuRAexRYvvOIWkXhlf6w
  oqLH/sUbZ2gIac4srha0Ep8oM0qqrYgZBkPLESnvVJiCsJChAbtYf2GYAeOMfx1Aw8wnrdrdRxTF
  XVA7YAxRGrTnpHwdraabDyipgCLZQCx2wMa6NzX10f/FMEPldhEFAfJujR0xIysoM2jbQUnRzCFa
  5UcGCUys09Aox+l6/F8HNBhfTgLdQYWpCRpuZXVYghY00rcC2iipwhNUTXi3Z6woaiFa/bsb6I60
  slzk8N6O/bvkPbetXWrIDJvI/s8luWggqMsdh0t4p+7zBxqkihVmdB5wqFAJ9ImBNcpSNAaUTbeW
  /R0dO+UGHbuAyh60t9VZagOgTWFSiE5EaCi8+A5WtLSQiTPAPvjkepPqvTYKbRdg2innuT2CnDk4
  M7pd9P5OaQH/QQcwkF5kNLH/sgOgOOOxAbXJNEpD74UZg4duB5uMzBaL+jZ5nn3YYCU2ByuCNjSY
  jrox6t15qvPI/vZGk7ltv7w6ioPGWxdgRU3LmHFdngAAPamtZugeJKoi+IZFSNGB41bIDJ0YM1Yf
  Zaa7Nh+UGIcfNKONYdVot1gOMpiCRrdrYJkxntRTqPDiZsYuOzQI6vS1Ape8FALeQ9ARGrU1JFrU
  B57Ii9EOnRbeN/oCWuScSAfImbF+kLDuGS1D01u7iZ3e12qLGpjbKBr6CKmGz7N09dMhmaExMiVQ
  aUWCnTaXRm9w7QjIkdzMGNjcZAFldez2dj3vBGBfu4nJlUhgk8WMNgBSgg0fL99O61UMRj3M0On2
  dDZTKnQmIAca+/AIDazoaRmqTWrU3if3sB6mKZ17XFbkIoRBRjDeQ4Rkht7E1PukFhYPHhJY7Jth
  hmNghyMsJgnzYc+o2F0AkfOgiQ7swZGgdgCSgnWclK8hrFpWT5IJuO+QO8lGgjoAtSjWDxLWPaPl
  zCR10vvk2gC1rXMbM0wIDYxolv7cokJDCGaozIdaldb72uFpqBUDu+fzcgo0erpNDlLA2AkN0gzc
  XThy0jXo/YStNhgztgLadMjXbdIOHB4AMLaXUU7aCSjccYIVLS1H9Qy9y8OMFmDVP+N913EGU4VU
  W2hmWHWtipmxDzFj6cAunLuMAjsOuHsz9gOV/TDLILKSkw5A6GrF19Bwlq8HnoAGhV4tQE9DJO0i
  3f3MoFH6ifYCA54PjxUtLUZ9rSp3+n4E9fQTuj0H99o9k8P2yXPmEMygddBB9uxRxAwUzlADukAX
  6n8GbR5m7AAkbWo53EHbGYMQJjnXKoEZwM+MfUBrACadlfZMspFxqmbMDKzoaTHamMTDDOQiMP7W
  OHyTw2Qwoz0kM7oiwQwbAeEzwMxYBG+cYcYBlKtpgUoL9B6DmGUzwyk1zjCjUIYAau8kG1nM0CyJ
  9YOEdc/ofkc3K85AC1aQKto3OawjssxADqJoakVnp8kKmbFwYG3iY8bBzkZkELXVu0sk2CHnWpsA
  sIVihqnVywxTwCQbGbkJZgZWFPWvaH1NvZsZh2FizH1uZdRAJTDDalJczzji0Hd12f9lYG3iy02O
  oFn5LHuQcgo8IftNnOVbCdq421sDtQXYXkYNdKjmJgmJiQ80DuBqa1gDoidRbuKpgbZ2HlFZWY8t
  Tclw7+D1jFzEDJV7boUSZrR227u6qAFmxjJ/v8khgjXzhVLTu+Vc7A40PqMoCDPW0CrNLm9fKwdP
  JK2WYaahVgN9spGtWF8Nlkw95aBQX+suzyzOdtaDK69ncUcIZvjRpGTi1269pqu7ewAX9UNaTHrm
  3wQYRCsnX+hklgTdGmQcqLN2u1pPo9F0zJiugxTQ+k5lkDWebqj1tXKYMYBLJ2ENiB5Dk+ENejSm
  C40DPeDyPbgkoZLj3ag4GWKOmkEleey4mJqJbsiMRwfWJvMp92xTZmCs0QcNLQ1khRmHVCp6e7A4
  o7DSYQUdnb5B6sBre1Ijt1M3zDFdjzU+MLBDXUT0MEpKPBq43OTJlY2Nj0RgyHCk2gltlJV+lD6S
  mJg4cItXKtJwZtNEAs16OIR6NPbYAUV6PGSvnOf2hJWZCy/CDPdceMZBFC1KsZ+ZojaQa2dAzaBU
  zCA3ZurYYaOnK4Mk5BkEzWulampZjGho4BQ3nM4KGIm0++eoNWsAodZQGhWQGdDsA1R4Y8cfbGx8
  MgYPHaNEj3M8PlAneMgdxiiemxSpdoJb4/FGQa1MTBzYE4ehuP+l8c5Rc2cNh00A0HY7DWRFx52H
  u/SsNXfysksYZXsQku1hhtS58EG8o6uLcg0wf+dRdiYicpdeDjQCAKxWaBVZE33R2582Oj3rZzSU
  p5eXFjbUlqen+yjiLLLYALAd9NeFj7Qb9QBywyTL9Ez5dHE4N/oUfCgfjMVTx8jjJQ8NUPNPRiiO
  iVQ7QZTwaGNQPTVwpw5Lbma0sRal3Glz0VbXDlkzKzt36w3e9UDzSkoKMqtXb9mSW70hLy07v9i7
  HmgX4S4TKCiCogzI0DvA5E1Y4t3cxG2QliYzSZqb5MZHOt8UtdL0wnVbV9nMJtuq9ZvLytMbmL2S
  nJairYRKw126bE/z3l2yAzEjEd7ifg/F9IH0BBqPDlDzD3o9TuEbJlLtiMtPjIcSEz2/e4yVvQ3c
  mcPUvzALaDG9oL4I4GBLi1y/bmbWA92YXZxXkpybpKUJggAErTdtzMzOLkbrjqMUyK7apbCgYaK7
  ujS9A51bLiNBI4KoPyQ6LOWaD3CmlR3RWMHm9KIiS2F6zXoTmuCObAKANmlzKbOTq9NStt2ulrhE
  ajDtVqnJcHYrSBjQ93xIeV7gicpbEpTP4xSeIFLtiOkpbxHjkUA0PPbQwJ45bD2CdivQGFqkrbon
  Kma+6dHV2VnZq7UAqOx2tV6vV6tpQJgLSoqzqrqZOffu7U3Cd5BDaAVBzfGBrtvdTxImND5TpkHO
  nWL/tBfo0TJdltLS9dAKdo0aSq9S22GWY7YgaDgtNTWQJfuU7aPSiYo85JJwZuC4X/SxqYIOw8xw
  yxtkPCIUPD/24KBkxqMuptKwn3lywy9PnqDRJLTctCwzoDV2Dal1GI1GF2VX24E+NTuv3sHsDuvZ
  4DFsB2lGOyIYBnh4xrBhc0kYEcneQuDAeTczPMe0QTbUOosKa3VAZbBTLofJbDabTA673gAczlrE
  jDpnCqCNrcp2iUBnCm/5jJWxfYsNMDOGRG6S4CnqPCDSeMKDMQ0FRfSvzMrj7l02/GvMyVULSk0M
  9sw0HYD+YTSZbTugGm06kwZ6SF5W8TE9YgbM3g/uUeAgHUy3yYAzI85b0JC1SdSR8xfQ/z17kemi
  bqX1zFYF6augRbQms65xR1tb2w6TrtGoJsGqclQDrSzbbNV4dqNSsCuCiybvD+MuHx744l5QDTAz
  vP0ySuOoSLUjpCc8QHpQNNtOWBnTOrWwHj6OsgY9s/B4+OOt0Ez4Lk13cRXQaBxmG3QQZIo2k0an
  ozREZlr+CVWXfxHBsLcNaWRW3BngIV3DUEGDMB1plWmQ1ovPwf8evvQ8c3dNQEWW1RbVVtitGofO
  BiHKPB0G2rbPpCZMaL6rs6auzEQo3hRpFzCQ08K4SV/vXoyqoAPMDO/9Kb67SLXDV4IHGY8HwdFj
  jYNv2NsTJ9wrgu6X/V5luwuBwKN2/GA10DhsOvhSZbRD56DNJjXIPJvXw2yK1E0YDytYmp9ZdVxz
  bICHZ0DN1WqIZjGDiAGv5SJaxevyRfeHSCtIgWFG+VpCo9XpzGaPf+5wqdpsesJYnuO0NFRkNKwH
  dnrXAUXbXu4Ib6uCJ/zV+ug/dUgDzYxhqOfhkQj0sUWqHZ68UUbQCAYVQmNVchJTP1PQIJgN28MN
  NNoB2hZef6IkE9hdOg8zeqCH7DM6XBqVuSotV0UxmzO7I/EwA429qJyhOTHw78W4FVr3znJCeLty
  hf1T6ylvdea5i4fgfy65+6ibgN1aV26xlFsolcZkM3vjjDab1WZSa+y67em1RWV1FXWkylPkCTfQ
  OKxWaceGcY8P+ZgRo0dywJkx2OUpfz4QvBvwicHY2drr3q7A/V4Ny5v3AKZXRLXvhdU0ZTfCQMPj
  ITCHd6gNFAG2VHehj3SRwHjkcNgVDZQBdXf3xw+8UWaSKvXug8IGee7oBc5Ppzz/On3xAMxM3D8d
  tupRmGGpTd9kt2sMZpsv0GhsNKlJtRqAVbXllsqMwvVAw5g+7DUCmoCWDMMiCfDl6R0BEBu3vdeZ
  4a0nhRqJ+8jgs9G/MgUNl/e9Gk5HqI0JMwxduSm0wWCwG2GkYfMgw2Sn1DRtB8dPMMzo9o6WCiee
  Odith2dxDHgJFCqemaG3R9ggz1560f/DqfMXPQsLPwdxcfm8l256VU2ppbTUBuxqjcZgsuncNZ4d
  bTqN4QylIjTAWJRek1FRqbUC84HW8LMTFx3WzouotBeFIY5BdI8zI8HTbRVy7Dxky8BX8OTpqf5u
  Zh1ha8uBPeHFyM2AKYnYT5wAGtUZFaV2mXQ6G3SPHTaHigI9z5oA7ejrZoqgJK1B7++w3qr7mULr
  8aik38splZ0JNDgx0XPnmB+ev+QHyUs//NHLvns5fdSdmeyCwcOqHEttqQ5ozmghNewOsxmaBFrE
  pDcQ6ueeNQIDcBSWZtQ1rAdejoYVfKHlnsPZRG0lQoW3DBqTKug9zoxHpdoeRoSDrQia4N7n2eVO
  q8OAxkE17WJ2Xu53qOgTp4xAo9G4jCaT2WzUqDXA9OOfvNIOzpzsdQcaaJOQ1vBKGl1W5ixRmVU1
  hSTdo604vrzr4qXT6P/PXfIGBa0v//TqRd8SiKfdWcsBDUG4Gmqd6SmAIkwX9tEwY9O4HA6jyaHR
  U4B+9ievvrIDYsVcXpZRU2YkrNbdnbvDhIaG1oazbNlTjLd6A42YvMfubWZ4S9ASpug9lpg42Iqg
  DzLJSZfBXdGA3iwzb3BnJl2a3pMUMF949nQfTWs0do1GrVdrCND/yisv/vgnp8HxPo070NB4xo/J
  HpGABmfA1KQnPhpGmUrCnGoX8mQuRU9dOo8Sk/PekkbzxZ9e/ZkhYPYaTEjA9nRL+magIY5fuHCh
  3UHQdg0aG6vW0MD43KsvvvjKT9ogNLaWZ9Q51xJ2YDp4JLxIowmQ2nA6Wh9hSp8J3orGwM/05uve
  Zoa3BD3YypvS9K/u5MRFMOVJBA1ZkUYTcGcdmr5+YHr2wqkLz7abVDR95swZGgDH6VdfefHnP//5
  T/bpe7o82YmVYHxRLjT20HomAYpO8r2YpLTAyHgy15dbz126An/0piP7X3v9jas/+gXH2ffBbGN9
  urO2TEOfMV64cPr0hQttJjXBTDchHO2vvAotAjnaA/R0RUNGJZOdNHYeDgcau4FeG84Y0Cc8Xayx
  nNFwTzPDS+vBlnVI1PCeY+4QwL0Zukxo7AV2JswwuHpc6tPQQZCL7Os3GY3GEz2nfvzqzxEyfv7j
  V/uPH2OGj6O+E/LQAQYacmoaBxwonIFnGfjRGUjLKMpOeQ1yaPchFt9ePH/JP+d3x5tXX3/jjdde
  Yl1pB5N1FFpytgK7+hRjkdPPXth3sr+vr6ft9I9f/TFjkRdf+TF1BqKlLqOmyAwM8FStewJOJEFG
  oCXDiVsTPYn0UzGsgt7TzIhpVhgB/cvJbmbwhJ3wBON7pL/vmoHV5Q4zTvTQO55lHOTUqQvPvfji
  ixAUHv+AHvLqhV7PWVBJw3GQgYacLMjEZED2Ez3RSe0WUVq93g7Ttd1uaLD5duCCb72uwy//8Orr
  r1/9t0v+Fdo7wBnCVFhqqbW4rPRJn0Ve/DHUK36L/PzFn7QDK1nWkFFXVqOF6UmTO9KQBdImQGnD
  mgX/gBcTK2MXIt/TzHg8hgFeJPRkz3EmBHARZGvnnj28F2sQ7fUhw3Gu1+V+p546/dzPf8zo5yy9
  sqPvuCfQgJGG6TByRukBzW4TcJ+lZ8CWdeJqBaXeZLISmkNeaAjzreX8T9944+rrV3/4C2/o0QRU
  BsO6dEtR+mZgN7jDjFOnnmXMwTHIz195kVQRa9NrMuqKMlS0GkLjiEyQNgN1WJkJ467up1XaalkP
  Jz7EerwTEh9xP+/BqtFPJHrynkcTRXoGIsCMhz2r4T2emCj854cE2w9xmNR2wrCK78PewTrKhpcm
  JrqHkj4Q/SppT4+DyU5cwLi7E40VQO87KY9uhxcZFNXfo+p/1o2MF7m+4Qk02h2eszDQcO1BdIIB
  jSQ2daiYKKPb0NcTnW7B4UsMhCUDJhmOIwd2HxKPvfaf/+XVn/4QYuPNl5qbd3Y0te9Qv/xS37nX
  tl8rKl8F6BMeij73ys8F9Eo/AJvSnZUZdc7tVtoO9nUe2C0nyNtN0CQ5P5zbe9w3+NP38ApWQTmL
  /Xr6uB97xP+rlWLfRuKD7CNXPhykca/TcY7ghD4JnF/7nePJlezfP54Y2DLnsoeFPkzS7Suxil/e
  8VxKyhmPPcS+jsYHoxuyLOjppwzuSEPTvutg58HDhyS58z6gdyOj23783Al6n/ul+tyPhRzk1dNd
  Pf3dBg80uoBmlzuBD82mI/tPABVzHniWaAzogppGqe2V29YDAzAfPLjbW9TgX+qON1EF9FdXr/7y
  tfPnX4N684c//NUPz5+zFDY0mIgzbW6KPitokZ+/2gbAqvKGojoEDT2hAbrWzkNMUUNSfnLYDrRU
  WOO5HmMl0t5nXfhFzfeORM6DKjyI8ckHGgMklLaHYoav6Sc4zXmZkcBfQTOR27InzuGeNchhYlcY
  2E6YVmHLOzgj/BmrTzzCu48Horq2a0/PCQ1TbHDpgV3XsQs9tAcPHw4OjRYT6PYio7enh3QH4qdO
  /1iEGUTfOc9ZGDoRHegcrSHYdLi5zQUI9zHoLFFaUHUGZXWUlabbAAnMBw54oRF4qYebf/Gjq2+8
  +fKJf7v6xi///Ze/fP11GHFcvfrmy5ZrltoyB61u91D0FXdqEmCYV3sAWJ9e1GBB0MgwAAoYmjsP
  7hY4kSBKXUBjJcNaPBi9oLzvwuBvPPYSc8i1+B7HDyGeYD7zAOOJD3ufbAFoBDAjgb2aXSM3a/CF
  LY/6U4EH3WdBCHnKe6TYZfsV9LCQt6/AKlx57yfsEqjbeA8movDwCd965Y9Hsc/84ZMQGp4YQEMQ
  GtOO9v3NLS2iqfWB1l0dNhXhJgaDjJPHzrhOu/Xsi0wB9JVXXnn11Vdf8frJT/YBR38PCxoqYNu5
  a/fhgweEX6oHDu9u7mjXdRFA5T9LT5TCjGELSMJc2FBbaoaObDrsKfKgqMjH0SO79u946eXLP4UR
  xoW21xAqoF6Huvqjl+uuWYpqy1xeZpw+/dxzzyGT/Jhtkhdf+bHrDLP6HwONokoT0BCg7ZCnFBqq
  0nMYIkNvMpBhDOhKeIDdUeJ9+kVfUo/4/eCxlYHOwe9xeYppcKX36X1S1IsE6hk+33tM8MPsCaCP
  cF3uIU4MEnDZw2QcFuz2FVglQF6jPyr/2/OfnbVQj2+RjyguUv44jDQM3mpDt8ZKAELf5TCZG9s7
  9u/fudernVD7O9obTV00ABoWMvr7tHqvh5w6deHZZy+c2tfW1n7q9IUXX0Fe8spPnlWrrcf7/WhC
  E+OJbqN5R3tTR1PHzp3+U+zvaNrXaDa67Gg4g77b82nKfqznZJQ6TdAWJ2h7Zkt5rQlCw7GbSaPc
  VQ2Go3t2tr/08vk3f/gzGFf89OX/+I9f/OiXP/3Zz371M4SMX/1iP9rUpLDBSNBt3m6T0xcunG5v
  6znZ2LbvlNskr7z6kx1Apa8pRauSF1Vm1FksKYCG6cb+I4gae4QyIXaQZ4B505p1RDgbmyRyPNUb
  JotWQb3lhKfcOHDX+PwFiwDWPBXoYYliXiTADF8Wwn/00W+fCDiY/ZZODPgA67KHyTksyO0rsIpI
  m+EWgB/nYJll9mhCI+HkyZ5+h90bBDD1RrveSqNFb/kirHqf53dpDMd7+o6n6gj6xLPu4RnPnmo7
  4VCfodEqwipHXxuMPJ47TdK0o2DHsZ6+Lnu37xwaPVpsmBA4C23Va7pZV2PvPtHTfzJqPYL3k8BW
  6ixiJpkZgGpn54FDHmq0tlw4vYPhxS+Z4OKNN1966+CFS+dP9Fz+xZtXX4cIab/WgJYVT18F1NrT
  z7oHrJxq63PZafeNqrR9+049+9yFk4QGpSburU5qMjIqnJsdwE4DU0dr50FEp0PiyeF+GtjBqs7t
  YW2gtpLjJo95n19Rz/E4wlNPcVJmb0zAZY3H61l5unf0knDoEOA2iWK+hLyMXc18kNfkysBfeC97
  mLzDRG9fgVUC5bN5eMxgoqOAKfS+HDN66cmKk5Aax7vtfhb43DVQnL8a7K6+nr7e6rO5wHCmH3rH
  hdP7+rU0fUalIVGcYD1DwLeni4KvVFB9tv7E8Z6Tvb6ARuQE3bxLsBt6+3v6z0VnOBfSYtK9z4Cl
  tDwF6K3A1tLJ5AyHDh187tKlN3/6OuTFG6+/8e+/evP8pefffvvt55798X/sOPHvb1x9/fxLtbUW
  S0NDUXkdoT/jaEcWae+HxFTRVq2VwaEKwtRO0cwstVrvfkkVdRmVzooUyAICOJpaDkBs7N69p/Wg
  EDZa24BVBXmTs5YwrJC9evBTAa9aX61A7ACPHzzMTQ58486FPsv2hYdE3EOIGd5GebXBh7le+xj/
  zImBfv04H4VSDhO7/SeEfy3JKkJfQfjMSBQ8VHlZVabi1a7+PuiWx10aDcXzWTF1a+yu4yd7TvRW
  Z2flGYGB1vad7HOoaLUKEBqDpnFfo0ljpUiNlbZaAZ2bnZ9df+LYSYgYg0byOeBJNN29fT2QaVFc
  T2oZ6QkBLLXpawigAdYdOw8xNdvW1ucuv/Yrd+nizZdfaj/9n2+9/RakxoHTL//06htvvPZy2TVL
  kdPivHYNjQNV6U0nTjjOIIsAh0llbm+zmV1qilQRNMz/TDWlFu8OSQ2WShRqbLfRKNaw2zp2Hezs
  PNK6Z0/r4YM+cDD/37LPDjQEvaa8sHydVUMOl3tvjwQk5yEXvPRVGbiPo/c49lva+wJlN+VhA7/P
  U8htvI0GeuhD3LMn8v0yQQIzpBwmdvsizJBiFZ4UMeMJ4W/LO7c+asPEplEqY8/xPpignOh1QS81
  dIdy6m7kyw5IjJPHj1Vn5xdnF7iASk3D96mGVGltTc1msPdwy6FD+2kNSdrtDl11Xn5xcnZ9/7H+
  HkiZLkNoNnV3UwaNoav3ODwCXpoxrBGP4WkhBda40wZLQ06dEdBqAIz7Opp3t6Iqw/6X3vwZpMYb
  P3r5pf88cIBBxtvXf/ErmJn86BcZCBm1V86f2mmpXX/GCvM7WmUg1ZStqaUDtB9sOXTgsI3QOIwu
  h3lrRS13K8a6jDqLc61Oj6IIoLI17Ww5dLDzwIEDB73UOLhnVweECozZHNvLCy2llXY1OUbmraFH
  jlNc8CXXYjm41zsCwl4vH9ge5/GYRwQ+x4vWBZnhvZhHuZ9Fr2/25T0q4JcrQzNDymFity/GDAlW
  4UkRMx4RRrCv2hytzSemUFZjce6xY/0ne3r6+473urq6DRqIDiiKorw5g3fTcgOCSpcDMeZkX29f
  FbNXWlbBRiNFWQkNRezYtXvPoUbQ3nIYzaKijRsyqzcUFKNNGIuzk9t6T0AGMGwyMGdwN8o+h8HA
  nLy7y+U4jj58sv/E8T6XOqz9BcPTUopY69vSvbx2jQMAPQ392GWyte1r6jj58ks/+rerb1z99zd/
  se8/IDDeevs/XkYTT3748v5rTrR789721y6ev3xqh1FFEECvpU3N0CJNoG0XGnXeBoitloyMGouF
  u39rQxFDjaLtqxwEgw2CMjbCs+3f29zsHjHWaITsUluBfVUZypxqK7QqaorMW0vkPareLgCxHNzr
  HYFMeYD/a4YZDwpigFcEFR4H+pDgg/9kQGfwQ4J+w93aVMDXpRwmdvtizJBgFZ58zAgjdOYVmX12
  jvKya1NJqzGrZMOOY8f6+hlu9PedOH7sWK/D4XDx5Og9dgz6MgRGf9+x46uT0YaLMIRIK0g6c0aX
  a9SDptbmva3QQ9DLcS+gTcUFUO6dW4uzsqr7j51wswmeolfwBMwZ4CnQx0729x8/drJqI6DCGb4U
  noYv0VgzfFu6WwpzGtboNADAKMpdrqUNvS9d/hWqgf7qfB+Cxttvt7159Y3XX9uB6p+WhmvXrjkr
  97dfvnx585r1a1KsoPFQc/Pu/WjQVieaKk9sKqypqCjjIIOhhgVRo6yhbk2j0QoIq5VmTmdVazRq
  2l0ahr82rlpXW4iOLbQ4rJTcHdQe4D3/vjFKIr7j3YMj8PcP8r3jiQcEhmPLYsYTgg/+4wG/eFSC
  Y4rGGTL3tQ7ODClW4cnHjDDGZzwkfDnDol7RWEDR5ry87KzMtr5j0KOhs0Jv7UFFhH6+mL+hv5w4
  dqKtKjurOLk4v6QkNeWM9b8upmzUaMC+3c3Nnc2gianwA9pcX1+c790wvjg/uzi3/9hxN5t6RE7g
  OTv8d9/xY8d7qpPP5gIqnLVlwtMYyo72QCvyUyO9vGZzilFr9XfxdL/82s+uoq7W/0RxRud//AKm
  Kz98qQymG7UZVyzXGmqvXSus3F5hsZRvAsDW0ry3sxWYmAzDBKxrysqcDYHI8MQalTAEKSqqXLve
  7FCjMjIiFRT6LyDUxpQ1lYWFTubYQqeRJqfKu7UnBQIK7wtK5K33uGC64Pt9SA+UxQxvq5yPPxHo
  JN6qwSNB4nDRekbww6S0o9QqvjXf5bu3N3kT+JOvNyY6/a0LKEKXlQ/9OSu1et/J4yiO6OvjODF0
  YLZ7oxjheE9uVVZWcnFxXlpWtQmAi7/+9SVgd6hB++69e2CAwcz17ACEzk8Mhhp52cXVbScgm/oC
  QHGSw6g+JtTpa8vdkJ+dV1JNGKLHjHmUnqqp5XpzbXq5s2Ldmk1bN61Zv3791q1r1u14+UevX/3Z
  if848J8v7Xju7X0w0Pjl+aZrkBk1F18ru1aE6hqllopKy1aCMLc07+o8qCJR5HVES9s3OwsFiOGh
  RlkNwobFWVG3dtP6FJ3JaIThnsNoMiet37oWRiGwYU/dtMEkmxn8odN+iWTCYl7wkDRmPCGPGd53
  cED5gvtG9g/fflTUQQR8XcphUtpRahVfCUlsvknAWHTWZx8WsSZSdJOT+RRIymY8Ois7C+3qvqOn
  H3ksShF4Qr/tO9mWm5mcnYUQkJac+w5wZK6+dAn8ZktBEgHjjL2HITOYOKMJEElZbGQgwYimqnoL
  PAXrDCd88v58snFfbmYq/Gw+2lnealgUFVMgTaFU2opanjsX1pbnbMspbH43vbwc/u9a08v/dvVn
  L7313C/efPPll3a89NM3rv7opaLCIsu1svMXM8qZ3d+dDQ0NW2natKt5N1rtAq0j2kJbqXW1Ishg
  DnEibMAkpabMUmRh/glVVwl/tJShAMXX19Jgkrsj/GONwST8oIttCiSRGQ/JY4Zv1w//b1CmHnB2
  1jDzlYnCQxKEfF3CYZLaUWoV33WIoEuIGe7Q4tEgzPAWpqLTwXg/BVKyfR4NuZFfXF+VWV2dm7t6
  XxtX+1bn5lZnpsJoIZtBQV79xt8Ql0xVuV3EO7nJJSUpBIrED3pzExsAW0qS+YLnSK7fAM+weou7
  Xe/uBjva2jZuWQ1PUVWQD8+R5+ZN9gaVJpydf8LTDNLqKuMxA3Wglu0/d/7iuvJCyANL+brXIDN6
  rrz8o6tXf/qjN3+B/u/l/TDQgJnJuUtMNRQhoHwzYXU1I2aYAZox3wxoB79xLjZQtFFWA2kBVVlZ
  WeNRRVkRO6NpKDQTpDxmPNQYTMKhsojTSPKORG+SLZ0Z3vr/U+zfBF4Z16lWCr1ZhS5bwmFSb1+J
  VfzRnsgVPMH/nh5xt+jdek3Q2EG/xkiLwwyk/Ly8rKzs7OysrLxAod/DX3tjh5KN4NKvf20HwJyZ
  l52XXJJLWB27dnmZcVhltWZmJwsqPy/Lf4L8ZKZSyqgY/Yl1CoSYKrtd/vClcDWXshothXxP3nvl
  /MXL+8uuVVQiz722GTHjFy//6iqamvb6z376+utX33ypEFVBS6+1XzrlgUZpjV1FdLTsRvxsYSIv
  YCt3FoUQxIbTCaOMsgq3ymDM4XQ6OcchZmhlTYbnTjXxyRd9CPYQhukdTyVypl5KZsYw3iL+KwVO
  EjgN9iHe5QledujDpN6+Imb4SBqkCPoky3z+bdxWBsFCdHfgXUwRG0uSRVybq8A/l2wBv/71GVdK
  VRYTd2QVQA/Zt+eAhxkdgDbm5ScHV37gOfinyUql1Euitq7IApIwNTQEunFtzfnXTlcWXisvOn8F
  8QAy45dXf3r5Z1dfv/pvv0TDyCEzfvby9mtM0fRaR0ehN9CwQSPsOuJlhsMKtqaHQoYXHBzx/lyr
  I+Rt78zvaHXL60qCUW043pHoe1E+JDbhRJQZgcOinhKqtCTw5s6LFFOfkHmY1NtXxAxfYeUBSZ9i
  kSUYFnyl1VC3FBFBZmwpSQ5LkBn/9V9Ebpq3aFGSBOx0W0tnC1qtbqddDzamhdcwlxn1Wj0ld/hS
  2JqvJcwCFQdLjfNaqbPh2rmLlbXuOOOXb7z+xhuoEHr+hz99A0Hjjdd2MAfCPKbWM8bTkr4daIBp
  L8pNDnW22IBKVVNaFAk5S3VAHjPQW0qIvEHHA8n2jqc8b8gHE5lRBHKZ4R1o4AXY48Lj2nnhe8BW
  ySKXHeowqbeviBn+ZYSCTqF6kP+hoKyJKjOWK2JGr4te7UVGcVa+AdgBZbOpjSYtUBGa4qwIMCOv
  wCV/+FLYgqlaklD6gPKOomsdl3aiWAL+AzHj9Teu/vDlK799qe/NH/47GrDxcuW1QNdG+5zQVrNN
  azebrMDgnZkWAWbY5DHjYbFQIuh4IJne8ZT78w/4mpLLDF/k7j7jE40i8+ceC+wD4ib5Ypcd4jCp
  t6+IGf4cKegIDYF9k7zHCYJO0mSXSGkZRawOnxm5W8BqXwJSXFKlASorAFoVoK3AuqGkOBLMKDbK
  H74UthZTYFW5sJ9artVcandXKtzMuHr1Ry//9ne/+/3xHS9dfPNXr199bWsgMyy1hTpA6AGwkwBC
  FNhqC4siImd5EqDkjI59vFFsULP37btS5Cjp3vEoDwWymeGNsR/1nkbMsQKWt+O2JXbZIQ6TevvK
  mOEvxj4h4VOs70x8tYBhvmJHdOoZkBm54TMjNZPFDAiN4iTKygxDUlO6+jCbDVB+nomm5kbFFlDL
  taKxQKHltddq3WnHtU2QGVdff/PlE//9u9/99/nthft3vHz+R2/28XppLaWla4zugVlWq3FTaa2l
  KCJylqfIYsYT4s+Tb2SiAFJkeYdAF6RsZnAGkIeYRPYk2/85qdXjwXxS/DCpt6+MGf7kJFjHqAAz
  BNIVv6RuARsRLVTEjCQdwWIGTE+y66tXb9myOjezPis7ElEGZEaWTu5QBAVaRoqWKa+1X6q45vb5
  a02vvX7138+/tLcHxhm/u9xUfq2wruml85dOBwYaaBypc/uareu3rtm83ZleGCFkFBVBZmhlMOPR
  IO/UIFVQOd4hMBc+DGZ4CYb+lhjyvfmkv67JvpagzBA/TOrtK2MGq6wSJNAQYIa3M+VRoc+vDPK3
  iGsRRVQrqIFePLOa2zmCumlRT23ILhPJyrbJHYqgQAspsEmEGQ0ZGd4wAjLj6s8uvlSW3nYZMaOt
  0Om8dq0h48p+ocEXheXlpYwilJe4mbEKaKXPwkFFC9FXqi9Y5n9AhnckCr3o5DODPYD8AQldGw97
  54E/wm/jCZmHSb19hczw9XEEO7kAM4KOwVgZJAaJuBYZaAXM+PWv6dWRo4MIM5IIKqx1+cMyh28q
  PE+W2mveMOFa05s/vLij4RpkB0xOftvPjOiAPzYIxxHC/aVRZMaTwSLhIMvNSfeOBMFJnWEww9vL
  +CQzo1VCH/vjfE8KzQzBw6TevkJmsAINcRcXYIZvKI2QUR4Q/1PktVQjOvJKAjMuXowCM1IISla3
  ohJBZmxOD+mx105dvNh0rdZybf95yIzfn/DUMSLMhWBKl8UMFIuLT7MQr4JK9w7BBWdkzjdxy1fN
  E+xoTeStsO2hFfsk/MuWdJjU21fKDP8ODOJMFGDGsCBL63gsHaW1qZZqVAqYkZJERIEZgJwZHWNA
  ZpCSmNF+cf+1QktRacb536Mi6Lprob08wsxYD6RvcPJU8BeqeBVUund4k23Ox8RmVQVlhnfASKJg
  pJAotrRdKGZIOIynAWIGa/cU0W9FiBlBkpOHRb7AgdFSjX5D+Myo5/SbDIxKNsrrVlRmDpKQwIyG
  mjomD2ko6v8tYkZT9JmxSgYzHgrxJIsm99K9w1tVFPqYPGYk+GeTCfQCJPKDjycl5CaSDuNpoJjB
  yk7EIgMhZvgsw0fDI8Lf38AobqldXTW44wx4mugtuiONGZZC93BOZ2HbFaYIWhu9rMTDDBlxRkJj
  iMqArwoavnesFGjB+4zLYwZrAMPDgn8MbO5hnvMJMiP0YTwNGDNYk19ELkCIGeKBxhMiVzQwilth
  t1eFOVwzSvWMktUgrD3DwhJa2q9cuutea38NMuO3PfwpKlFghlSjoEft0WAfEK2Cyo8z2G7um44V
  eHhwZviuRihveJL/mk3knZh/2ZIO42ngmMGa/CI8gF2QGT4rB1ruoWD2jLgSVtg1Cpjx6/+KAjNy
  iagt1BW3wiCPGe4i6PGaWunHRJ0ZK0M+yCtFvFR+PYOVTsAXuafdwPJriH3hH2oU//uT/Kt07ywW
  fEyXpMN4GjhmsDdtFNwYWpgZIjtHSQiZIqmEFWpDqjxm5LunxWdlvZAL/uu/6NySLGZWe/5AoQMt
  1LUoauaQx4zaytd+//vf/vb8uvKIjdbyK1i+I4MZjHM8GMw5fEXQwIxYrNefP37Ll1A8zGp0pQgc
  EoOG5d5IW9CfHw4Ak/fiOafgX7akw3gSuX3pVgkmXxQGDcG/U2Fm+PpbOZumPfYA7+4GVAlL1JQ0
  ZuRlZZeUlGRnZ+clFxfUp1Zt2FCQQhwz0htTq6pS0cIXWdnMB7LyZFMhPwsemC82bDS7mjZEa9Ed
  yAx6uwxmFDacu9jXc/miZwe1CPKisDy9PL1BlERSmfGYb0/iR0We5acSOZPEE/1PqW8D8oBtxxN8
  JTx/kwkBOyIzn3nYM2xgJdcnfN7yqAjIHhdHitvVWR2n7k1i2Rm+77JXPiznMJ6E2pFplaB6irXZ
  60OBoZgIMzx84BDryehGGWidbb0EZqCVgpNTM3OTdDozs0il0QRldtCZMG+gDBq1lVYbTWazLmlL
  ZlVBdlqe9GHj+VlpaXn1uUlb0IrEwszItGpWRGkBDbnMuJZx8dThzoMXLu2PYM+JszQ9p7xo3Vbz
  +vJSMWigfpOQzOBtQcwfo/FUI18r0ceeTOQc7CPOU4mcyaEPeZf79y+4+UBiovszif7RoT5nfZh7
  +OOJQgWFp0Qudpj/RfuQ+3o8i/v4o6iAy070LOMX6jCeRNqRa5XgYq8d9oD3FMOeSPQvQcLvInnC
  eyL3vhCPeS5I3oLqygSZQYZmRn5+po6maavWbNPpTGabzdbYtmpfu46uXg32H9rVvHPnzg6TUafT
  GVU0DYy5kibBw8CkJK0kq746xYVW87aliUAje4PavkT2nmHhKWGJRg4znIWXzzELip+6WBaBkeFo
  2dF0yIuatetNdmQTnSg0JDHj0cYAia9yw9FDQizxHPtA4O9XirXEPMasGAY9/gm8ZgWL/ego4Vg7
  QWiJQv87ln/Zj0g5jCeRduRbJYQSH2gMLgH2PMk/5pHobdU6zM2M+lAenp+VBBz7Ww4d6dxrhDLb
  IC+amjp22oCKBs2dB7d1bnumxQb/0rats3X3XjNw1eeFaBDRoiCzOlfn8O0BoBMJT7KqNGoyPlrm
  0NDrpDOjsOLii+59VC9uVxhoOGshLJwVGWvXrDL7t0Uwp4vMhIXMCN2ZxHNj/kv9SaEH9VGhFYc9
  3hEYuvjj+6c4OY5nTTpWrQ8xRIAZYgsBifVoJCQGXMLjQuOrA5gR4jCeRNoJwyqh9LAgtT3gSRQ2
  Ajeb5Cc2A6zhpF4bmhl5RuBY1bS3ZfdOCIuOjqaO/Uh7m2DAYWvqaG/u3LWjHf56X1NLS3PHepOV
  qA7SZF5aGgwuNuqMtM81rMd74H9ThJf1yqon9VR8lMyxRGOVxYzzzzHMOHJ+pwJmQF6kl5atWaXT
  +k0CDFeeR9FXjnChRFKcEW095g2qH030k+Bh5ncPSl3rm9GjIV7UMPvxvGwTE2VkrWEeNuDyX5f3
  6hJDXGCC94gHE6PVw+pXPKmSwgyHemeTSa2yamFi0tgIUxMkW1s7VKPO1rijEdFDZzKqVSrjqr06
  IMqMvLSS/Nwkf3ABdfz5927cfPt9+K/qNKFAg1moK0qL+8lkhrP23GWGGc9eDLu31VKbXl62dpXp
  DMskvT3v37r9FmOTTTnCzJDR1zrklCBlRitWrBRPSWFGlhnAEKJlF9o7tH0VJITObDabTChRMZng
  P826xh1t65v2Nzfvgh/bqSIy84uhAppBuzQmV+vs/ldp74kr731w86237tz+8G34Vj2TJ1TSyCt2
  qKhp0TGHTGYUXau89PyRzs7nLrYLjwS1BIj3d2d5jnOtTuW1CG1wHL9y/YM7b7118/aHHzLQKBPs
  xoXMiOLuclHWk43RmqGJFYYkMSM5L38jAKrevstXTl14rhliYfceqN1I8P8PwX9BoDz37Kkr5y4f
  0xPAVPCHH/wgPz+5mA2O4uSSktQktcc3XCff/+jjD++4eYF0++0+AJLSxJgxLzrmkMuMomt7z1++
  cvL8eT4zGEQ4nc6Gdz1qQPPhOdywFKWnZ6zSuE2i6j33yfVPb7NMAm1yDpU0hGj0vWbGyqh2HWLJ
  FGJGQei+1uzsrt/88bM//emd35w5c0atMXR3d3d19TLq6urq7qY0GvWZM7/5zTt/+uyPfyIyt33+
  5z//5Ysv/vqHHzDgcDeRtkHnibyvvPcpepPevHPb4xxIN+9YAagXmPqSl2y0DlpmOMs7Ll6+8t+e
  JTRYwED7qL37NNQzfsGf3m1o8HHDUp5TaXObxNHz3l1kkjsck0Cm6gFYly4QaKRv/f4yA/VORLms
  hyVD0piRnJ/fa/3yb1999fevv/zHP7755ps/fov0GRL6xx//+M03//jHl1///auvvvrbO0erXoDA
  +OIvf/nz55Acf/gBg420/CQPMD6+43+TesQ4ytufCAcag5oZRde2M6PHz9f56xkQCQgXbkgECP3y
  3XeZeMOZU5bCmOTY87f4JnHb5K33ANDlCAQa6ZsAuSjWD88A6ZFoDmrEkq0gzCjOYg3qzLYR334F
  efGPL6G+hvo7S+hn9Pt/oL//Q9NdzDDDrb98/ucv/pCfn1aNcnb63Ed3mEzd4xZ3bt9868O7nl/d
  vtkFCIGRHXn5kBlR2qwgKDMshTk55aW13I6MwCU03MAQ5AWHG0UNOWuZsmfPrZtsk9yEyclNGHW9
  fecG+vGtXgAqBfZESV8DyOjtSBlVPdEY3SFKWDIFmeEqEBxMUVxSkLmhPr+kJA2iI+uFXOLbr79h
  qBBcX39DH/vr51+w9Zc/v7BtC3KPczfeeisgwPjo+Rt3PnrvWP9bnkAjl9/fmp9voqnx0TFHMGZY
  Sp3rt66rLKtNz0kvh6otLGxwFhWW9aElNF7ruOYmhhMB4+mQeuaZbZsYk3zAMcntux9/8PHzV+7c
  +eSK6txbnkBjfY5FiBnU95QZj4bYYwwrxhJlRnFJsgYGBpQ5aWN1VX19Xu7Rb799529/+zoUNr7+
  I2H+gsuML77YVg3d48R/ohcoyz/uoPGfqrtvnwPE++gvN28QwDxomWGpTTcztUpjytY12+sy6ios
  DbXl6Tk5+7zrCDPEkAIMpM4OlKj959sck3x48xY6Rd/Nm8eA69YdVNG4rQeOWv4YjfTNgIreLrbR
  FO5oHewSY0ZxVjblHy9AEDQNfvMb1WfffvPl3//2VTBufPUt0fgClxn/PNsM27jy1lvchP3D2+9f
  PvceSts/uO32HOgp9nzexTAbnERpU6QgzGjI0QGOaLXWaF61JqMdMeO3fZYGGcR4eluFsEnuvvfJ
  ex/cRP+4eYf5zVuXAajjX1H6WsIQrUk40VUi7mgd5BKNM9Kgh3Sf7KVBgH7zzmfffvm3v4ti46vP
  juae/TM3N9lmAuD5t+98GKibqKfgJuo/cf/81vMA8BcaRMwgo7QpkvjYcUvOGsjOKydc+kCLEIbL
  v//df1+uqJVOjKef6YQxyxUBk9y+iTpPkF28NoEJm8DKYeWQGdHb+Tqawh2tg10MM/h1x+K0TACs
  d9++8+n1T56/3GswGOxWFjf+9Mev/yZCja/+dLQjgBlniwHof/v2h0K6feOjjz5mR+b8jRPy88w0
  NTU65hCdo2YptcAbv/72zdt3P37vkyt9vcd6u1R+i6iO9TZ3bpNKDBhm/A8Ax9+6I2iSD+/c+uST
  615z3fwAFTT4zNhOaKI1cS+qQvPqorQULlZ4Euk3yS/RIg/5kBli5H62b3xw/f3nz7m82Pj2718J
  1zPeObrh7F+41YzVANx6S9g/UI0PfOxJ6u98CsCWNAFmENFjhthceJSZXHn7Q49FYHh05/aND25d
  /+Rcn8FtEarp3c7v3pXIjM51ALz/9ociNrkCgME3ruu2BiTxh3WVb6e/l8xAk1NwR+vglggzSqoB
  uOx7pm/fYcTg44PrV44zs0V+80ehUOPLf6i7i1/4IpAZ9Ed37wgGGrdvXH/vvbueP9350A50/Dgj
  yxy1zRdF188or4Sp2k1/YHAbCloEZVe3P36/j0lYznR0bpMIDYYZd2+LxF53P771wW2f7XuBmb9T
  ffk6qyZak32josf8s7TweK7BLZGx4yVGAO7eFHqekZd8+kkv8pHPBKDx9z8eNf0zoNtkWy4A7338
  8W1BF7l98+ZNrxvegf5hys7nMSN6G7aKre1nyVkF4y7hWAkNqLj7Xj8Cqe07idDYlgHA8zduiVAD
  2uSOzyY3j4kxI1oT96JieP9s8kdjfS1YwSXMjOxUGGYgD2HGMsM4/M5N9sMNneR6H3SRP/Gh8dW3
  hO7zAGacRa3dvX7rg7u3b4u9WuHv79744NNewThDF7XNF8XWEC4sUoFeZIPb0BaMAbj9xnfeeutT
  mFEA1zZpRQ1Uz3B9+tH1W59+KGYT5vc3Pvj4A2gTAWZkfL+Y4V9FAmcmg13CzEjLdRcZbn989+bt
  O7feu3v3oxucB/v2W2+9T6BIg99tQmwMKIF+8flZLQw07l6//tHHn964yzhDgBAvbn10/aNbosyI
  0uaLYsxIX4t6fiAbPn7vNiTf85989P77H3Jd/ebbt1ww0uiU1HfyTKcOgHMffnT9+i3GJh8KmuRj
  ZJOPhXOTDJX9+8SMxzEyhoziBdfcyTYBF6o/vHUZnHmemZENbgVkKrff/k+YxP/j68Dc5E9HqwOZ
  wQzp0nx84yPoIpALH3/8waeffnrDLfivTz/4+OOPb92Cv717t0uAGWjcetQ2bBXZ3wSmJsSnaEj3
  RwDo0TgSALp54cFbN2HKltEpraBRA5v45PYtZBJoE2QUZBVGH3yALPIxYyfIExFm6O3RWiAgGnoA
  JyZDRoLMyCs+A5iRy3c+ONd3/eadj55//jo/gH77ukCg8fU7R/e+8JcAZrxw1gh97KO7H3z0EcMN
  rz76CJECesit6++99/4nn3zyvFVosa7sJCJqG7YK76PmLDe7U5MP73x05ZPbt+98cP3WXX5G8dZd
  PWiUxoynO1dBaDz/6Y1bXJswJoE2cVvk+Svnzp1TARufGaV13ytmeLYneByXP4eABNcDzUqF78C3
  PHn6zdtM74BA7e/OMfBOQIere4ZaADK++OfZP9MAEOeuf3rjUxhR3GJeqzDSgJ7x/idXLvcd61L5
  Fu5aLciMqG3YKsyMhlqHu77DlDLQKLSbNwWKELdv9gHTNmkDu77rNKEpre/D1ORTJq5AQQX8562P
  3oek6HOpWEuZJfHHZ3zPmIFGcj0obbFurFhLkBmop9WXi9y+ceuGUJHuzt27l8E7fw+cbXL0eGC3
  CYLGtl3MHM4Tz3/yHgzEYUT+HvKM4928YaYgs2QQMqO27IwHosggt95/T7BqeefGjXPAmPOdJGa8
  u20bMxa9u+/K8++/954nqujjjBTzapMQM9TqaC0QgIXFluBeBagE+oG7t+82DCbAe/xOxtu3b3z0
  wTEeM/7+LZHywp+/EIDGPz2zNQi9plvDHlTq1hnKwawSmCKwHVt2SvSYsYgUHKldB8B1D0TRKDSX
  wGCT27c/vf7pccnMQNBoZ03o4YGCVmsdJp0tZVXKeid/jlpppR0zAysmEtwTKW01sN7wjhD45Pn3
  eKn77dt3P77+wXuot5XXbbLlrAAzYHpytsPEf4MSGpc5aUtu9YYCtA0blNB2atkpIHrMoASZsc4f
  eN354P1bdwU6Rm/cuv7BdVpyPQNC47vO3evVfJuoTSnrN23OqLA0FJaWl6dDCWynhpmBFSsNF9p7
  MW0LUHmZ8SF7RRiPe3z46ccfXb/1IYxA/hgYZ6Buk798IQSNz7edLWiyeVfjJ+xG28bc6tTkvOy0
  NGbHxnwYYQhv+VqyMarMWCPAjLX+Ae4f3uYb5PbdD25dhxY5DsB2ycyA2tb57vb1NpPjjFpzxu4y
  6ZJWrdleV1aanpOeXl5bW9jQ4BTbs7W0UqOP1kJEWFhsCe7xzMQZNwMHG3nGDaAyJuoe/PB5AH7z
  98AS6G/sBS8IMgNR4+y2s5//oLiguaBgF1oFDMIiS8rW0NFkxkIKbBKLMzwG4JjDY5CPGItcAcCx
  TWJq4lFOZ+e2bd/9z7vv/s+735WioIK3EJgIM2owM7BiI8gMTZVAPYO4/ikaL+Efa/Thh3fvMr0e
  zCCLjz64i3bs+Sag2wQt0vWHz78Q119eOOuRjL3oo8mMZYLMKK0gwPs3UF+P1yTIHNAeH3yMAMp0
  kd64gQaCVnZKnabm0zPPfJeTk7MtJ+fdoDvBBzLDoI/WQkRYWGwlrLDzmZG9AYD3P0aOgAYLuIcY
  3fIOI0AjCG7c8Iwd5802IXR/DsYM/9jQP0jfBrpkSxSZoQVb+cxoKNSCKzc+QgZxWwQNQvMYhLHS
  pzc+fR/NwdkqJzMJZMfTFsnIKKrFzMCKkeJWaOw8ZmTVQ2bc/NTtGrc8IxI/9Q7e/ODj658gYghM
  N/nqM2LVC5KY8ZcvkiVDAzFjeZTsAZmxXoAZpSbQfxsZ4yO33CNMGHtAM926/skVZtbe+k55mUkA
  NBqkQ6O2hlJhZmDFQnEr7OqqwKWx8opVoPdK37Fej44d77t87twVRucuH3O5e0o/46/x95XQyHGR
  QOMH0pmxOnrMWE6CVXxmFKXrgPVYb1e3QQNl6O7ucvX2Hu/rvwzVd7y329N13C59AQ1BZryLmYE1
  +BW31K7mLaeXn20EofTON0Iz4fkL7ojpz/8clMxYTIEUofkm60MaxHDl8mkZK3UJQsMpGRq1FZgZ
  WDHSUo2evwRn2uqg7kG/89k3X/2dRwzBBXfEoZEvFRpRZQYJGvmzO5hBXUFk1/b+/ne/+23/00pS
  E1mBRm0FiZmBFRst1agyeczIS05CI60yPaquzs1dvXGfCbxz9DefffbtH7/5+9++/oeAhBbciUAV
  NJrMuJ8EtlKB7ovazZu2r8uoq6ysqamprKvLWJeRsX3t5jWbNm3avL2u4ru9r/3ud7/7fd//5CgL
  NJ6WnptgZmDFSoLMKM5DgyegmKGZSGcPbOvcS3z72bf/H9qA8R/C+upbwiatBCorOYkmM8ZqCbPA
  Fu+WovL09PLyUp/Kt3X6tG1b5y60mdrvzzcrTE6elpycMMyI0gYOWFgcLdVYM7NDeW3xDyAJzlYd
  5XWu8rpNVkssgaKuE6nJSTSZsYAkTIWhB1VZ3uXMXs35nz5mA8b9SgsakpMTzAysmGmRhq4OzYy/
  QhKcLTj6zt+DbqOG1hx/QTIzJPecRJMZUyna1CBhICbX1797+uRv0WZqTZgZWN9/LTLQ/C1FApGR
  /5e/fPHFC3/Q/ObLYMz48ssgI8cFkhOpBY0oM8NYVBgyzGjgLpLxTE775f/+7ZXzl79TmpxIRAZm
  BlbstIiSwAyUmnzx+QvHzvwjGDO+/uao8Q9Su01QQUPisK5oMmMuaXVYQjPj3YCFdbY1X7zYd+7K
  +fMtCqEhtaCBmYEVMy2iiNyQzPgnSjg+P9tHfPN1EGb8/VsiSXIJVMZQ0GgyY4bW6iqrlZmaoDjj
  4rMHOzv3XL6kDBqSR2jgfhOsmGlhaGbA1ITx8bM94I/BmCG6eIbCImg0mTGeVGkrQjEjMDWBYcal
  F919KJcvf6do+LjUggZmBlbMJIUZP3AHD2f3gW+/ChZniC6eIZKcSCyCRpMZUygpzOClJlcue/pd
  d1/aqyTQeOZdacjA40CxYqdlEpjxV3fwsK2D+CxIZ6vMEqj0UV3RZMY8Sk/WhMxNAj39u8unvIM1
  Lp9SVtHAzMAa7ILMWB2cGcXJX7hBcHbD0d988/VXwv2tX371tz8Sx/8qvZzBFEGlMSOK81ohM6hQ
  zLA4A8KMZ3IuP+9jhrIxGlILGrU1FJ4LjxUbSWBGvqdGcXYvOL7vnT999s2XX/39a1av65dfQpB8
  89mfjITtcznMkFrQiOb6GdNItaGmVGZq8vS20+c9yGi5dFriZgViyYlUZuD1M7BipOWhmfEDLzN2
  AdeRn7zYZn7nnc8++/abf3z5NdKX//jmj5/96R3TlZ9cADJGgcooaERzna4xlFpTKZsZOe+ev3KA
  YcbhU5cUBRpSmcGs04XX9sOKhSAztoRghqec8cWfX6i2gn17Ojt/8vML7Tbbn7xKamx/9tXOzmYt
  yJQ+CpQpaPx1EDLDrq4LwYwi3iIZfmZ0dp6+tEtRdlIkCRqllRo1ZgZWTCSBGf/0gOCfn2/7YiMN
  6MadrW73OPgTqAPIWQ427wBAW/1PWciQOqormnsVxJN2VUZ5UHe1OHl+vu30xQO+KWuXL+coyE4k
  FjTwXgVYMdNiMgQzfCVQpBe2vVC/xUgDtdZka+rYuXfv3p0d+3RGAwTGxr0vnJVVzZCcnERzH7Xh
  SzTWdSGYETg6A/WbPO+f5vrixX8qmBIvMTlh9lH7Hu29iDWEtJgiNgZnRj6n+/SFs9vOflGQuUXn
  sKvOnDljPaMyGJNyq/5w9uxZ6cPGfcmJpN7WaO7xHLfCQIdiBr+c8T/nL/iZcei8oiEa0npbv2/7
  tWINIYVmxg8CEw7PhgMv/OWf//zrP7/4M/PTC5/LGJjhjzMkFTSydAR1f7TssZQitstlxnfvspnR
  enGnImZISk7KM1SYGVixURjMcIPjz5+/4Nbnfw4HF+5GpEw5yUfMmB8te0BmrE2XyYxncs5d8TOj
  5eIuJct1SVt9vDzDqqHGxPrhwbonFZoZf5BX2JQXaEgoaORnmQlqQbTsIbxhK0d8P9+2/9IRHzNO
  nVe0LKi0gkb5OlpDxsf64cG6JxWaGX8dQGZIWXcnP89MU3OjZQ/hDVtDMOO7Z1677AszLildflxK
  PaN8O2FYMjzWDw/WPan7KRBDZkgpaOTnm+joDXlcGA4znt72P5deO8Qg47lL53KUrT4uqaCRvhlQ
  K+Ji/fBg3ZOCzEgJvrafzEEXsiSloJGXb7RGb/iS8CbP7HKGU8jPt7Wcv3jl2ecuXL505TuFi49L
  KmikrwHk0lg/O1j3pkIxo3hAmSFlykleMmRG1IYvLQuPGU9vy9l/+fz58+eat+Uo2UvtaYkFjfSt
  gFoY62cH696UBGaE3S0SIWYUu1TR61aEzNgaDjOe/m7bd+/+z7s5imaoSWdG+SpALov1s4N1byo0
  M774/M8DpM+hQhdBs1IpNRUfLXssI0My4xkRfZeTk/NMBCShCOostwEyWmNjsbA4ClkDTf7rP/8q
  U3+QodBxRvYGq2ZJQrTsAZmxZpslKDOefndgJWGrBGe5DkRvnBsWFluLSeKB//1//d9B9H+4+n8i
  q//zf4fQ//nf/y9hWBE1eywkafP/HgIy0lrMDKyYaN7SFYN+SvWcFVEb0jVs6tKlE2J9v1I0Yumi
  eNE//v9fL8JT2ODWzQAAACV0RVh0ZGF0ZTpjcmVhdGUAMjAyMC0wOC0yM1QxNjoyOTowMSswMDow
  MMct+FYAAAAldEVYdGRhdGU6bW9kaWZ5ADIwMjAtMDgtMjNUMTY6Mjk6MDErMDA6MDC2cEDqAAAA
  AElFTkSuQmCC" />
  </svg>
</a>


<div class="magic">
    <div class="book-search">
      <input type="text" id="book-search-input" placeholder="Search" aria-label="Search" maxlength="64" data-hotkeys="s/" />
      <div class="book-search-spinner hidden"></div>
      <ul id="book-search-results"></ul>
    </div>
    <div class="js-toggle-wrapper">
      <div class="js-toggle">
          <div class="js-toggle-track">
              <div class="js-toggle-track-check">
                    <img src="data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAQAAAAEACAMAAABrrFhUAAAA2FBMVEUAAADExMTw01jg0p/w01fv1FfGxsbGxsbGxsbGxsbGxsbv1Ffv01fw01jv1Fjw1Ffw1Fbw01jv01fv1Fjv01jw01jw01jv1FjHx8fv01jw1FjHx8fFxcXExMTIyMjHx8fw01jv01jv01jv1Ffv01jv1Fnw01jw01jw1Fjv01jv01ju01bv01fv1Fjv01jv1Fjw01fq1GHv01jv01jw0ljw01jv1Ffw01fv1FjFxcXFxcXHx8fFxcXFxcXFxcXw01jFxcXGxsbw01nMzMzv1Fjv01jv01jGxsbNUVPOAAAARnRSTlMAJ0IITyrixqxrYkka2l2PD6jNmohnN+G6sqyEXTggG93GwJJ/d2y7t6BzFNSEfFY9BO+jIOov+eXd3LKoo5uVjTEmGfNjgBujdgAAB3dJREFUeNrs3Qlb2kAQBuARiFfCfRVaWxBFBJRDEHvaWv3y//9R26ctbbVKjt3szMb3H5AnJLO7803o2bNnz57pkt3/9HEvS6n15Z3/3c5rSqmv/i9blE7v/V92KJXe+GtvKI0O/LUDSqNX/torSqOX/tpLSqNdf22X0uitv7ZNKbTlf5fmSmDf/8s+pc8L/y8vKHX2/H/sUcpsbfv/2E7bimjHv+cDpcqu/8BnSpHP/loaq6HXH/z/2klJNbC37T9iOwXvgq39F/4TXuzbexe8OXj1cnfb3+jt7stXB/btkGzt+KG8/0pWee2H9oUskt3xQ3tn03nBnh/BPgWWyWQc4uyjH8EnCshtAUC+NiW2tF6ACX5bVicjYknrX6CJv6xadY7XQOdD8Aj3XBUbxI7G12AdD7UKM2JGXyGUw//kz9i9FnSVwpd4xDW7S6BpMbTCI25rHnGkejl8iEddnZeIIcUbIjU8Id9n9zhUviWWw5MqE2JI5aboCBtccHwaqtwW72CD+TGxo/JgpIyNDl3iRuHR2DECuF4QM+oOR10E0ckRL+qOxz0Ec06sKGyQWCKYMq/KUF2LzAkCGrN6FqprkqohME4vRHVtckMEd8FndaCuUbKAELps6kJ1rbIuwrji8iBQ1yzdQDh14kFZu/wNQjojFpQFJkYI65RYUBaZQWgnxIKq0NQtQhuQTZYIr00WaSKCC7LHGFFUyRoVRFIkW3Txk9B6QOUFEFoTxjVGVAxP0qPoIDJ2e6WRLBFZk8/+QAwrRNfmUMrGNEMcVQaLmZhKiOXM+HI2rgXiyZHw/L+DeCol4fn/BmIqCs//u4grJzv/30dclZLo/H8PsRVF5/8HiC8nOf/fQXyVrNz8/wwqnMnN/ztQYdUQm//PQYm22Pz/EGrcSc3/V6FG3hOa/z+EIkWZ+f8ZlMmIzP9noExLZP7/DOpkJOb/u1DnQmD+fwSVGvLy/xOodC0v/1+ESreOuPx/BUrVpOX/Hai19BIJP/NbCKwNk4i/c6yDf+vKugANKJcR9ReoQbmeqIdgHspdlQS9BnPQoCCoEDqFBi05pfBoDh0uxSyG6tDiSMxyeAAtulI2RFxocilkS6wNTY5lbIpmoMuhjG3xMrTxJByMTKFPXcLR2Cn0GQg4HG1Apxn/4/EqdHLZN0hModUR+xaZFrRqc2+SuoNeTeZtcl4emo14N0oWoVuGdatsBtods26WHkC7Mud2+T70yzMOTCyaSECWb2SmjCQ4bENTQySC2+ixtekKiRgST9kuknFNPPUQidgpI/cVkJQOcXTTRGKIozaSc0P8lJGgDLFTxgaWFwJlJKpAzJSRrD7xcgElZE7f/K6HpNWIkyMkrkeMKPj9UmcOKvr9ssfNhfv99q2GzmBEi5joISg7nwGniE3ysL2bNkw5IgYKTYRkVSmc7SEcyxZD0y7Csmo5PFzBqCkZtSjDMIdM6jdhmkfmZAYwL0umeEUwMCdT7vLgoEJmTFvgoUwmNKrgokbJm56CjzolLWP8zW/0YMhtg5cFJWhU5/DiN3Y4nDudg50OJaRR4/HaN7Ml6gwPwVSVAjuq5y4pPK9QHYOvPgWUa+KHbq/gUGAzt1gBbzcRxhjdHtYmi00/3ckNq2zv+z/ykWeYLFtHw7uJ23C8Eq3NSgun4fZ7gw6E6Clp3J83x93uuLNcQZwcn+SCGaWUX4ABBeTATscUFM8yLrYGBVWDjfJsEqyGnFJwS1howibEbUYzS8FNYJ8ehTASWOZtkuGUYzegwmKclUHnFMroCpa5ZBdlT9aA1ziX5NW5jfNI2NxjnOVLQpVCm1m1JJzK6WbWos1hvrdJLkVxDVucUCTOLSxR4DPhOhTjnVGeJfVwn6I6hw3yJYqqZEUtcM58uJFu4xFFN+N+3h1AgdH3fky4kBbvVmx+SfE4DHu9ko3LH0OyQ46fvNnI+CroXy7kKtI9KVsV5j1SYSGmCeq+AufP3jyNWTpC5qKoRXKn/ajQuSF1PM4NwE81BfL/9MsDHBbBNhSEZfpN7NCrWMYeqVbqQhCX1HMEbZHe0S8pfRCe0wOcPwP3E7slkNzz0jLdZ8H8IzbRuBNwN6b/kvQZiFiW9BiJU5B5hoM5l4QdepKI74Hxff7xb6Ks0pOsrwc21X+214RDCkbChxEljEdZmB8LZnhOYIlTQTB2KSA7X4dlj4Ky8mVwTqbkOHTQdHJkTsl8TdS6oXAsuwnMfy/A6E2QNz8l1+hNUPSIhezZCgYcusRGo42kzZl9LiXpmaEXl8RMolNjxyweft/au5sVBIEgDuDLqqfU/Ez05PemgpqVdBMi5v0fqatEwYpu7Nb+XmGGmf9p5hUO4TuMtkF8wmdgzyktxK/D9ACmCJfNP6d5V2Am4mjzfabXCbAwuD0SBc5usLGjz0nso2SZIWzHablb+xTGPIEtBBmHfzIpjUUK6wRVpyCh6SvOK6e5uLWfO+3yKFhcerfjOfAs1+DCNoBKTNxSQz9J0dR6IjG8Nzi25+ML+gN3rJpl4WVVRMJqn5em2mu64MNOkiRJGE+YnGcOWncZjQAAAABJRU5ErkJggg==" role="presentation" style="pointer-events: none;" width="16" height="16">
              </div>
              <div class="js-toggle-track-x">
                    <img src="data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAQAAAAEACAMAAABrrFhUAAAAsVBMVEUAAADxxA/xxA7xxA/xxA/yxA7xxA/wxBDtvQnyxQ/xxQ7zww7xxA/yxA/xxA7wxA/vwwzwxw/xxA/xxQ/2wxDwwQ7xxA/xxA/xxA7xxA/yxA/xxA/www/zxA/xxA7zyAzxxA/xxQ/zxA/yxQ3yxQ/yxA7yxA/yxA/xxQ/xxA/wxA7xxA/znBLxxA/zpxHywQ/yuw/znxHythDyrxDzohHxvg/yrBHyqhHzpBHytxDyshBq1XLAAAAALHRSTlMAMsTxt6+JQAiabTae0Y9XKRBvUh4ZppdJ3r16VUJaE+KBZSWqofz3yHhN21vQ0loAAAinSURBVHja5NuJWtpAEAfwSUJCuAQERQS8tdpv/zm4PN7/wWqRtmqTsDkmWdjfG2S+mWFndqGKtVqkN8chvY3HpLWfwE/S2T1wTxo7+QH8OCF93eDdDemrhnc10paBDYN0dY2Na9JVBxsd0tQZts5IT21stUlLJxa2LD2PAsf465h0ZOIvkzRUxyd10k8DnzRIO3VA7xSw8YVNmpnimynpxcSGtj8Ex9jS9CzQsvAfS6cFeQ3faLYYmSDShDRRf0CkB00OAycdxOjoMRXWsKFtGzhFglM6eE9I9EQHboYdZnTQBthpQAesCQlNOlhHkHJEh6lnQ5LdowN0cQVpVxeklus+5eQeIZUjl3LqX1Nx+nCGlMfMRErmjPIYOuhTgRxgZGSPn4MMnOxfYIwAh4o0xLvTGWXS7SCTTjdjup3i3ZAKNcJv9oBSM9rIrG1QagMbv42oWAY+mDcupWE0kEsjXQjcGxNMz05OsTV2jGyfzx8CwxnzjZUz/GNLFedts4ZC1Jq3JKFr885UNj4ZN6aUqCf39fIx6FGiaWPMfdE0wFfW3XQYU4iDUQeF64wGLkUaTu+sMkZKE/+xzFGz3uoNL13a6BvdSfscbM7bk67R34b5cthr1Zsj0wLKuWa6wd64IQ7uGHti7BILB3vCIR4G9oRBTGzsBZu4dLEXusRmL9rgmPg0sAcaxGeKQvjBfPHsvSxDsREuX7znxTzwUYgpMbKQkz9feKGIEXqLuY+cLOJ0hxz81/VS7LRcv/rI4Y6+UqUG/DdPSPPefGQ1JU5DZDP3REreHNkM6bvKm8BqEYoMwsUK6VnEy0RawbPI7DlAWibxGiGdwBO5eAHSGRGvJrayfT5/CJrEqw55/loUYu1DXp14tSDtLRQFCd8grUW8epAUvIgCvQSQ1CNeQ8hZiIItIGdIvC4hY+WJwnkryLgkXi4kzAWLOSS4xCxf+vOXAXHDLr4n2Hi++gFYLQWj5Ur1AAShYBUGagfgVbB7VTkAc1GCeaUB6Ff+/Tsi0CdeRr78568Cg3h1ESsQpQkQq0u8JoizCkVpwhXiTIhXGzH8pSjR0keMNvE6RwxPlMpDjHNi5Uqe//ktqpmGzvL+APL/GJ4RJweRVqICK0RyiNOjEg0gsQ08EqOeIg3gw6L8rWAzzQmIX1D6zUANUV5ERV4QpUZsbhHlTVTmDVFuiUsTEfxQVCb0JWqAuwLWokLrUmvAUKoDfgjKHIkbyhwBdhwGGvRBgwRITAEdEiAxBbRIgBJToI0Iz6JyzyWtRbrKTIHfrUpZDfY7Ck1BEjNRp0/FchAlFAoIy1gLzFTZA8nvhmZUINdUZw8iuxkxXSrOEaL4QhE+ohxRYS6g2hwsMxXjggrSu1JoEyhfA7jqUTFsqF0BcTUAmwpxH3sZrIxXRLsv7H24cpuQr9aMb8efEGcplLFEnKci7sKUbwGbJsBzU3ZR+XuY3K9mLvLmvzL3wUkWAEMV9Nt4p8iDgGQeErT7lEn9EVvqToJ/hEjyWKcMJg94tx89UAgfSR4mlFarht+UeBMmI0CyWotSObYAVP8otMD/Eli/2LsTpcSBIAzAnRsIBCQQDg+UlV0X/RMuRX3/B1stLQ8gmEwytQzT3wtQMzXMlenuNmV3ZuKNKotAplAC84yy8RxsOND74K/WyMDxsjS/ig/KrIIb62C6qkd7ddsmth3Wq4jdHpGR2e5Smn7dwiYVjkKvVsjMqvdpB+OqgQ3q7INSdkKpGlfG5tAfIqe7A4Ochl/+CmH0B9CtA4A/UUgv/OASgI4d8OIy8Ml3B/p2wMD16cV0oudfYDL9nATHtuIdMEdO9rjLyyBvhHgrzIchPg7zhQhfifGlKF+Lp/Aa6uyE5tin4ZGQrq3MOhhjD7tLoiJVloEl0kVUwF9FloEFZD2ROFdjFkyQ5pwKClU4Dq2QJqTCaio/kqpRCQJ1n8kF/FCSn8ryY2l+Ls8BExwyw0FTHDbHgZMcOsvB0xw+f6RDYN8A0GEI7B8AGgyBDAOA0+hwIiVOpcXJ1DidHidULEnjgG4HY+zUIJl6h59UtUcyhYfzoXCR71sQJ1bm1NqcXJ3T63OBBS6xwUVWuMwOF1riUltcbI3L7XHBRS65yUVXuewuF17m0ttcfJ3L74voIZ9ZLKX56Xokl4m8Zus7YesZ8jJJLgv53S/nQlPf8h75WSRVB2IWce6xv4CYDskUQlTyHOdo/XMCUSHJNEEBydPDKsOJ9+EpQQET+u7/TwHfJItlPE/918fLRYKCLJKoj1Iks8VyHT+u5u/tXj3G6+VilqAUfZIngAICkucWCrglaZpQQpNkcaAEhyQxoAiD5HChCJekqAygiEGFZBhDGWOSwcQWy+zVPL/VGb13+YnRPK0PIc2wfto0Tt4H5KjT8r1az7SwxSQJLjYbPwk7tFOl796gdDduP2Vkd8KJBYhEzYo/j7oN+rRXq2ajRHatRXv1g1vJT6Wm+OQ0KYNfNbus1v+iDJoOPk2pbM5nHk6DsjKqKKya4+fcgbTNkI835rhCeRhVCc1PVxmbkr4PRHg1FJhcjDqE1Q2ByXqYkj2oeKyIMyUhzQaENJokZOqUHzcSAJFPok5cCHBPSJQflXwtMEJQrEPPTeRknhcbsgFGVJ6rERVUCZBLUKGCRld0WC4ukdnlBR2hloOMnBYdp2tkck1H61rz9hNF+FFER83FD1w6cq7m7SeqYo8qaeBa0/nvw+gGKW5GpAXvN3b67ZEmTrHTKWnDxg426cO3sMXySSNtbGmTVkxsMEkvZ9hwRppx8I1DuvlXnr2jAAgDQRgetRDxURgiIVWsUs39r6ckAdHGTsX5zrCw/7ItT2QS4NDJ3QAXrfgAALXuCshm2QYobMOisZA0sBigybFwEDUyGaFqZfK1J95zKiYVZHnuPHTNuhGQ2UhG0QjIlt//Am8Y0kBaCNA2TdDW93jXBty7dRd1GL72AAAAAElFTkSuQmCC" role="presentation" style="pointer-events: none;" width="16" height="16">
              </div>
          </div>
          <div class="js-toggle-thumb">
              <img src="data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAekAAAHpCAMAAACREDSlAAABTVBMVEUAAADQ8Oam487Q8OZmxslkzqphyLmm486W3sZfw8ai4szH7ONlz6tr0LCa38l61biM28HO8OR/1rqD17xoz62J2r+f4MqO28J31LaG2L1t0bFp0K5007SY38h61bhnxsud4MrL7+NgxcJqx81tyNBxydR107Voz61cxb9ixsVkxsly0rN1ytaS3cRdxMJ21LaS3cWW3sah4sxnz6xv0rKB17xhza1z0rOa38jG7ORr0K+t49m86d7Y8u/c8Pxcxrp5y9i46N1bxbyG2b5307eS3cPG7eF007RfyrF+1rqS3MWW3cep4tZv0rGL2sCG2L+j4NVx0rOD17yz5trU7fRjy7WA1rtuz7iO28KL0OKh1/HA6998yuB+0M6F09OT1d+Y1+Gf4Myz3vbL7uNYxrF0zcmY3siq2fZkzqpmzqtcxrme4cpcx7du0bGG2b0hQFIMAAAAaHRSTlMAHGUh1dnceYHgbCrVy3qxkx+podKWcI+2ncfOvX7T0nMm4M7Hwbn749zZwLmI49yjm4PSxKTcvZIy8lg/DQTjskfnvLaIMOLgzYiBXuyynWvmwE4V2snIq5NtO62rnod8cE4q6r2WXh1mfBMAAA3eSURBVHja7MGBAAAAAICg/akXqQIAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAYPbgQAAAAAAAyP+1EVRVVVVVVVVVVVVVVVVVVWHX7nHbBqIgAO9MIIDYcEmGIm3qp5AbNSqVwE2aAHaTFL7G3P8EsRsDBkRLlLhcesnvBA8YzOPDgrPZbErAV/bvr6eD21Sv3Poxf8n4BmYWB5BJmapVnsxpf3UgmSWpzmt2BExYAHhS+NFGDbSFUxfp/g4wIYC09/lWrRb7l928eE4B7JOukQ+dNUgWR13EZXPaH4BZqau5jDDDAJns1U2ZzGG/x7zUjVYWxjdwVze6Sl7YOWzyUX3Y7Gg8AotUt6j+TbvZ+L5RX1xG4wewq3S7erIHOZhV6tOS8DLlQT1ZkWZ6wFKfGcUhDiZb9enwMLVeg428KNjnkEv1rrqbVK9RyJcGph/ASl7UPybTa2aV/KkS9rO35U0yjVrjWyW/nMXNff4pnxYTWOHgQaeMqTTgVr7tY4+aidqM5jAbZsY0iflrDVuq1Ug6w3unYazirTWWGk5FmO5Ap8FUsb6GI9egroiazzprPPfESOFhrYERI3nOafccX9SsNTyLbl9oDa+JLWqUCqHLfYtGIazjippOHQSJGk5huIiiBhcKhZdeEQeFsonmHwVahZPSXAC/FZI1UUChkDY0Z+GPgkqjWOCsFVbD86tbgR0jiBorhVZz3I1+c/zyC/w/e3ei1EQQhAH47xmXXWMIWQlBhIB4n8UhVxAPCgtBAS8Kr/IsLZv3fwGBEk0iEGans9tL+T0BxV/d2zM7OzG9nL0CjhKXWIG8T+B0lhUoEg5HL1iFvlxHraKid/SS6tad/z1w6mMlyoSDxUoqelctt8tqU2Y1YhyIvrIieZ3K6A7rMWsUbpi0mspnUZNhTUoq19Et8nngSFfQ3E2Kh7Fc929TYV36SHfr3hPkb/42t1gbg2baWvees3nr32aa1XlMaGSmWKOc9W9StL76q4oGdJ5V6slXUavYSf7HVcIf5hwrFSNHaIhVMthH/azVVI6GMtPDOpVJ6RKwSX9u+reCN9Ltitp0s2IEARdGusQtolnMQipD0+WoWijUyr1XK0JFLb8yuPZybHh1a3V4bH6bZSzD36eA5X3pwGmiStRy9SbtiIoy5UIFFjFeH7U7sM9aG86NqTiUsDbD8ro2sUN01umrEg5C8bRE0iJBz09aiwNYO+dd2waeaIXlBffQhNjXU0MdumMmeE4yb823x0OLQ4WT6+ylTPDTxfKCT7Ifa3SfIcJRyDyrcEIvsCtiT8OjFkezk35NnODlR8DyutCEauzK/ZpAEw2yu94SEXaYIvtYnwgt2gvDt5xcRPDwOWB5MwuSvbufOvQldrFsiEQW+xMhjikc5+QMPHTkIf1RsKTPF6gjB5d6Luyn7D2OLYUWx2bD+UySfrAysydIjFsFwUe5/e5iZOCA4iK3d26gRERSc8TSqIUTu8EJ9RKyc3/fJu0T3O8eMnBE3EZ/ZAitIk5qey6EA88Ornzz+wwn1UdwRXT0aGdI9CPpdYsEbNKoq9As+VRbMHBHccAHGXxtibBPaI54FQJpRl2GZjV21HqflH8Dv1Mlog6cYpywQKpRX4ViDp1R6KIPqr8JGuugZKgzX4mFFonZJW4nb0cHY/+g3b2Z+c67umvGkP9fKB80YMdO2EhGs8mCLsCPra0txEQ4hgFO4lpo4cU+YXcR1Kp1oqI1TIwhfFl21w+tHJ7SWd36EHESkxa+7Cq3kaerT2L1GwQ0yAm8tfAXKv/XdP4pXSWkp8oJjIcQYOsnJ2nDh9Gyu0u3PHbGfNlr7KqAI7y7dCodI+/Rop/ddRukqMAJTELInHsZ4HAXA07LRYk9CYIs+VvkNyyEhE+c64BwmMsBp+aKQPOupZs0u9sKIWZZrhC+pBh08M1/AVMhpClmd3XIsWJJn1nh9KygmbnLzpaRqrLHAktmJpNK+iGn6LJ/8+4mtEdSjKmwMwtJi0JJjwScnmDTf9oxaIfis0XO0LCFJCuT9LtUg77uX9I9RvmV28whsk06Pjjpiw1uNLrZ4NRIg0uNLje40uB2o0e/fYZ/0jHaoAucrS0LUXZM9yBzLE/Z1XmSXxXpLmlgkt0sQJ9ZdjWg/iPsVxbCQnazCHXoLrsqqL+3bgLIOOl7UMc9lSKhjYiztR0CGSe9BnXcky6jDSpytlYhzrILlTUdsSuj/mLwOsTZ+dzXdNk9ae1PabaQN5z3pN0P4g2R9l/vmLeQt5H37m3YVaS+pOvY9T/pZka8eWd/66hFByyxk9fQpiSdtBlkV7lI+iU70LhzErGju6R7Le3xGktylfUBwjavnHbyEy0es6MBpb9V/dccOiBkN6OQVZ9hN4H3XmgJRypw5kI4k0+aIOs0+ybNskmbImfuJCb9LUg/aaO9pE9k0r/Yu9PepoEgDMA7Y0UJIbGb5uqt9kuLqAIUWnEKJO5TXEJIwBeEhF7O//8RBwhtadPau2t77M7zC1K9ndnD9u45pPUw26Sp+FE6m6SDlUKTfldDWmfck5a9axKTMPX2nHQNqZ3NNGm6h+JtSEi67TXpD+mTrn1wT1p6SW+YDFxEOrN+m/epv87tOrPr9m+3xm7f+hr7/v3WKeOetPTrl74IeJIFNgW5+ZfxkLTwks5knA5QlqQnfCQte4mFP3NvTdpD0qJ3TTJKeuskJh2aaVYhg/+k68+Qzry8W7MIaS0fcViKDFeMKbakRZ5HRkhrgaR+tzFxwXhWf1X+5m0TD0tP2vvWSR2a9F70BkK4Je2+541NecO0TdJDM4WYpC96ThrpyDzfm5DW9JMS30KIB4GJFfZBrcwz+wn+2vf1NzXI4DdpVGGYNnTJY/s2dyHD1WJLelvgMG3Musf2bWjtdHLfkBHHt0PdDw1tGokaQDHDEP/AfjK3yT6hGs3bbgszIuOMImTG40GS9Q2k1hXZvA3DArkHPcJ/RM7JgjuVKWlDsNBg46iJbL0q7GRvRFKTfg7kP+fgNg4la/ckuIFYBZ5u/GH11/TILegZHE7U5nfwCahO87Y4Ztf9ASzfQ/YuBM5Jw8aSzPlYjJD3fy6vIg9bgVvOa9dgo2OkIlhpW0dNAxxFyKI6uA8rPbElbX2k1Byb6US8/e9yKlnwHjZkPtyY2IadLosdo/96YB11/QpsyF1i/TaEpVm2CLqLHJ23jHrtPKxIHqWdNjH6nDroPnJ1zSbq4CJsRXJH6RgDeVU1R7DyE7Y20kcdbMGS1KdYPk6K22RKkXPzEqz8+AZrG1v1lAX9EtY2JY/SbkWd4nJLogiWmPqwle5hdRA8ggPRvTvGPThYSlbW/Bi2+mRW4eDLlaRlXb8DF7PSkzbLcBJSkpt2YKtNzu+SXwiCREura3DRFt67Yww3i90mmemIG9uwNzTG0ALcrFw8pq6D+p1rcBMa8WgWrpZ4ShMn4gguemxiA7ja+FwPppdzijtKS7lpMjGABzONA2ETh0M4GkxuZHT3aKseHBrzFlIo5wrL82EGUch7hGEEZyOaPEL0YutKvV6fjNpBUI9d2IAPTfHTMRmHr0+zyVnc7fHlwfmVlZXzL+GL2NcEpZ5QchCbiRCSlWDe/Qd1IdI8STo3/KDS7JlIL+oFNrveQ65heZImkc2RRX6J/0+5FljSDh7aq0H7kn4Codrlqeixwq8zO2DIZh+eg0iLZapoiUW9zuY/HYhUii0TgScETrTY/I+Kv83lEP1y9e4Yy9o+aZah78S6JevdY7wOMVoNKkHfiY1KV9Eyrrr6ZyTh1dIEZktY0TGKIMQOyb2Oa5fMg8eEfOyazI78A4d/mytnRY+RiHOmGlSOJUKjrBU9tobiHT320Q6EKHFFx+g+ipXgJnMhW2VyP5ROhl6jWF0ux8K/jOvo/eg6XLmPffKrupzr6P3oKSzkuj6lwifg/dJX9Bh9RFF2yCTSKTjq1QpU9Bi9QDEaXIp3HDe5IkFbRu1/jBZ6K+5SJTp3gdOyVpNMCrSI5HSIFhR1xGYvqTPwVjne4Be8hTJikxaPkIiuoo9Ga8hPi8ikR30koTvdx6BODUcr/C1aGiBPC5Xr3BOdOeQiJGOJeAl5aQ0r2LknuIHszTAZezxEPuYrnHOMmjVkrMHGCXEP2et1qtq483qdPmIqw0utYbUL+g/iy8hKn8jP3LGPDLVGVPmCznYo3PZXKbyMzIxOQj3/RVn0x57XQiF6jUx0q/M0IxEebMOrhWU2fhFF8K01PGE5jxH14c0MkfGPqAGfGtWfbx+OfU3N7mVWKMTzHtv2CRqfs2iQ7ZDIZId4uQV37eZJmW5PQ9xYh731JzmMezyYbQNOv7Ky+9upEK8uwcbMILc6YR7BUjg46dW8F/NMD6m0+sxkckTMXaTVmucTONc+BvFgZxFJ1NrPm0wmf8T85G4LCS3urGrK0xB1mo1hhGmix6c7nYJ7IVGnM5qvYbpWd6bZbGrKxyOOheFy/+72QnuxvT03+zgMOSZovKPxL+wv7Av48nD8M7VdVxHtIejfUCmllFJKKaWUUkoppZRSSimllFJKKaWUUkoppZRSSimllFJKKaWUUkoppZRSSv1qDw4JAAAAAAT9f+0LEwAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAMAjNZdi2dVsiyAAAAAElFTkSuQmCC" role="presentation" style="pointer-events: none;" width="32" height="32">
          </div>
          <input class="js-toggle-screenreader-only" type="checkbox" aria-label="Switch between Dark and Light mode">
      </div>
    </div>
</div>






  
<ul>
  
  <li>
    <a href="https://halfrost.com" target="_blank" rel="noopener">
        Blog
      </a>
  </li>
  
  <li>
    <a href="https://github.com/halfrost" target="_blank" rel="noopener">
        Github
      </a>
  </li>
  
  <li>
    <a href="https://img.halfrost.com/wechat-qr-code.png" target="_blank" rel="noopener">
        WeChat Official Accounts
      </a>
  </li>
  
  <li>
    <a href="https://twitter.com/halffrost" target="_blank" rel="noopener">
        Twitter
      </a>
  </li>
  
  <li>
    <a href="https://weibo.com/halfrost" target="_blank" rel="noopener">
        Weibo
      </a>
  </li>
  
</ul>






<hr>


  

  



  
  <ul>
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterOne/" class="">Chapter 1 Prologue</a>
  

          
  <ul>
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterOne/Data_Structure/" class="">1.1 Data Structure Knowledge</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterOne/Algorithm/" class="">1.2 Algorithm Knowledge</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterOne/Time_Complexity/" class="">1.3 Time Complexity</a>
  

        </li>
      
    
  </ul>

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterTwo/" class="">Chapter 2 Algorithm Topics</a>
  

          
  <ul>
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterTwo/Array/" class="">2.01 Array</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterTwo/String/" class="">2.02 String</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterTwo/Two_Pointers/" class="">2.03 ✅ Two Pointers</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterTwo/Linked_List/" class="">2.04 ✅ Linked List</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterTwo/Stack/" class=" active">2.05 ✅ Stack</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterTwo/Tree/" class="">2.06 Tree</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterTwo/Dynamic_Programming/" class="">2.07 Dynamic Programming</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterTwo/Backtracking/" class="">2.08 ✅ Backtracking</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterTwo/Depth_First_Search/" class="">2.09 Depth First Search</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterTwo/Breadth_First_Search/" class="">2.10 Breadth First Search</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterTwo/Binary_Search/" class="">2.11 Binary Search</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterTwo/Math/" class="">2.12 Math</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterTwo/Hash_Table/" class="">2.13 Hash Table</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterTwo/Sorting/" class="">2.14 ✅ Sorting</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterTwo/Bit_Manipulation/" class="">2.15 ✅ Bit Manipulation</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterTwo/Union_Find/" class="">2.16 ✅ Union Find</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterTwo/Sliding_Window/" class="">2.17 ✅ Sliding Window</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterTwo/Segment_Tree/" class="">2.18 ✅ Segment Tree</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterTwo/Binary_Indexed_Tree/" class="">2.19 ✅ Binary Indexed Tree</a>
  

        </li>
      
    
  </ul>

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterThree/" class="">Chapter 3 Some Templates</a>
  

          
  <ul>
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterThree/Segment_Tree/" class="">3.1 Segment Tree</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterThree/UnionFind/" class="">3.2 UnionFind</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterThree/LRUCache/" class="">3.3 LRUCache</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterThree/LFUCache/" class="">3.4 LFUCache</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterThree/Binary_Indexed_Tree/" class="">3.5 Binary Indexed Tree</a>
  

        </li>
      
    
  </ul>

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/" class="">Chapter 4 LeetCode Solutions</a>
  

          
  <ul>
    
      
        <li>
          
  
  

  
    <input type="checkbox" id="section-d881de180b7e6c5379bcecdfbed5475b" class="toggle"  />
    <label for="section-d881de180b7e6c5379bcecdfbed5475b" class="flex justify-between">
      <a  class="">0001~0099</a>
    </label>
  

          
  <ul>
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0001~0099/0001.Two-Sum/" class="">0001. Two Sum</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0001~0099/0002.Add-Two-Numbers/" class="">0002. Add Two Numbers</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0001~0099/0003.Longest-Substring-Without-Repeating-Characters/" class="">0003. Longest Substring Without Repeating Characters</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0001~0099/0004.Median-of-Two-Sorted-Arrays/" class="">0004. Median of Two Sorted Arrays</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0001~0099/0005.Longest-Palindromic-Substring/" class="">0005. Longest Palindromic Substring</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0001~0099/0006.ZigZag-Conversion/" class="">0006. Zig Zag Conversion</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0001~0099/0007.Reverse-Integer/" class="">0007. Reverse Integer</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0001~0099/0008.String-to-Integer-atoi/" class="">0008. String to Integer Atoi</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0001~0099/0009.Palindrome-Number/" class="">0009. Palindrome Number</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0001~0099/0011.Container-With-Most-Water/" class="">0011. Container With Most Water</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0001~0099/0012.Integer-to-Roman/" class="">0012. Integer to Roman</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0001~0099/0013.Roman-to-Integer/" class="">0013. Roman to Integer</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0001~0099/0014.Longest-Common-Prefix/" class="">0014. Longest Common Prefix</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0001~0099/0015.3Sum/" class="">0015.3 Sum</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0001~0099/0016.3Sum-Closest/" class="">0016.3 Sum Closest</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0001~0099/0017.Letter-Combinations-of-a-Phone-Number/" class="">0017. Letter Combinations of a Phone Number</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0001~0099/0018.4Sum/" class="">0018.4 Sum</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0001~0099/0019.Remove-Nth-Node-From-End-of-List/" class="">0019. Remove Nth Node From End of List</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0001~0099/0020.Valid-Parentheses/" class="">0020. Valid Parentheses</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0001~0099/0021.Merge-Two-Sorted-Lists/" class="">0021. Merge Two Sorted Lists</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0001~0099/0022.Generate-Parentheses/" class="">0022. Generate Parentheses</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0001~0099/0023.Merge-k-Sorted-Lists/" class="">0023. Merge K Sorted Lists</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0001~0099/0024.Swap-Nodes-in-Pairs/" class="">0024. Swap Nodes in Pairs</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0001~0099/0025.Reverse-Nodes-in-k-Group/" class="">0025. Reverse Nodes in K Group</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0001~0099/0026.Remove-Duplicates-from-Sorted-Array/" class="">0026. Remove Duplicates From Sorted Array</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0001~0099/0027.Remove-Element/" class="">0027. Remove Element</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0001~0099/0028.Find-the-Index-of-the-First-Occurrence-in-a-String/" class="">0028. Find the Index of the First Occurrence in a String</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0001~0099/0029.Divide-Two-Integers/" class="">0029. Divide Two Integers</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0001~0099/0030.Substring-with-Concatenation-of-All-Words/" class="">0030. Substring With Concatenation of All Words</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0001~0099/0031.Next-Permutation/" class="">0031. Next Permutation</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0001~0099/0032.Longest-Valid-Parentheses/" class="">0032. Longest Valid Parentheses</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0001~0099/0033.Search-in-Rotated-Sorted-Array/" class="">0033. Search in Rotated Sorted Array</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0001~0099/0034.Find-First-and-Last-Position-of-Element-in-Sorted-Array/" class="">0034. Find First and Last Position of Element in Sorted Array</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0001~0099/0035.Search-Insert-Position/" class="">0035. Search Insert Position</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0001~0099/0036.Valid-Sudoku/" class="">0036. Valid Sudoku</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0001~0099/0037.Sudoku-Solver/" class="">0037. Sudoku Solver</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0001~0099/0039.Combination-Sum/" class="">0039. Combination Sum</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0001~0099/0040.Combination-Sum-II/" class="">0040. Combination Sum I I</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0001~0099/0041.First-Missing-Positive/" class="">0041. First Missing Positive</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0001~0099/0042.Trapping-Rain-Water/" class="">0042. Trapping Rain Water</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0001~0099/0043.Multiply-Strings/" class="">0043. Multiply Strings</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0001~0099/0045.Jump-Game-II/" class="">0045. Jump Game I I</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0001~0099/0046.Permutations/" class="">0046. Permutations</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0001~0099/0047.Permutations-II/" class="">0047. Permutations I I</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0001~0099/0048.Rotate-Image/" class="">0048. Rotate Image</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0001~0099/0049.Group-Anagrams/" class="">0049. Group Anagrams</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0001~0099/0050.Powx-n/" class="">0050. Powx N</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0001~0099/0051.N-Queens/" class="">0051. N Queens</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0001~0099/0052.N-Queens-II/" class="">0052. N Queens I I</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0001~0099/0053.Maximum-Subarray/" class="">0053. Maximum Subarray</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0001~0099/0054.Spiral-Matrix/" class="">0054. Spiral Matrix</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0001~0099/0055.Jump-Game/" class="">0055. Jump Game</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0001~0099/0056.Merge-Intervals/" class="">0056. Merge Intervals</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0001~0099/0057.Insert-Interval/" class="">0057. Insert Interval</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0001~0099/0058.Length-of-Last-Word/" class="">0058. Length of Last Word</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0001~0099/0059.Spiral-Matrix-II/" class="">0059. Spiral Matrix I I</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0001~0099/0060.Permutation-Sequence/" class="">0060. Permutation Sequence</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0001~0099/0061.Rotate-List/" class="">0061. Rotate List</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0001~0099/0062.Unique-Paths/" class="">0062. Unique Paths</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0001~0099/0063.Unique-Paths-II/" class="">0063. Unique Paths I I</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0001~0099/0064.Minimum-Path-Sum/" class="">0064. Minimum Path Sum</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0001~0099/0065.Valid-Number/" class="">0065. Valid Number</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0001~0099/0066.Plus-One/" class="">0066. Plus One</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0001~0099/0067.Add-Binary/" class="">0067. Add Binary</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0001~0099/0069.Sqrtx/" class="">0069. Sqrtx</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0001~0099/0070.Climbing-Stairs/" class="">0070. Climbing Stairs</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0001~0099/0071.Simplify-Path/" class="">0071. Simplify Path</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0001~0099/0073.Set-Matrix-Zeroes/" class="">0073. Set Matrix Zeroes</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0001~0099/0074.Search-a-2D-Matrix/" class="">0074. Search a 2 D Matrix</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0001~0099/0075.Sort-Colors/" class="">0075. Sort Colors</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0001~0099/0076.Minimum-Window-Substring/" class="">0076. Minimum Window Substring</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0001~0099/0077.Combinations/" class="">0077. Combinations</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0001~0099/0078.Subsets/" class="">0078. Subsets</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0001~0099/0079.Word-Search/" class="">0079. Word Search</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0001~0099/0080.Remove-Duplicates-from-Sorted-Array-II/" class="">0080. Remove Duplicates From Sorted Array I I</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0001~0099/0081.Search-in-Rotated-Sorted-Array-II/" class="">0081. Search in Rotated Sorted Array I I</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0001~0099/0082.Remove-Duplicates-from-Sorted-List-II/" class="">0082. Remove Duplicates From Sorted List I I</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0001~0099/0083.Remove-Duplicates-from-Sorted-List/" class="">0083. Remove Duplicates From Sorted List</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0001~0099/0084.Largest-Rectangle-in-Histogram/" class="">0084. Largest Rectangle in Histogram</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0001~0099/0085.Maximal-Rectangle/" class="">0085. Maximal Rectangle</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0001~0099/0086.Partition-List/" class="">0086. Partition List</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0001~0099/0088.Merge-Sorted-Array/" class="">0088. Merge Sorted Array</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0001~0099/0089.Gray-Code/" class="">0089. Gray Code</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0001~0099/0090.Subsets-II/" class="">0090. Subsets I I</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0001~0099/0091.Decode-Ways/" class="">0091. Decode Ways</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0001~0099/0092.Reverse-Linked-List-II/" class="">0092. Reverse Linked List I I</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0001~0099/0093.Restore-IP-Addresses/" class="">0093. Restore I P Addresses</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0001~0099/0094.Binary-Tree-Inorder-Traversal/" class="">0094. Binary Tree Inorder Traversal</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0001~0099/0095.Unique-Binary-Search-Trees-II/" class="">0095. Unique Binary Search Trees I I</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0001~0099/0096.Unique-Binary-Search-Trees/" class="">0096. Unique Binary Search Trees</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0001~0099/0097.Interleaving-String/" class="">0097. Interleaving String</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0001~0099/0098.Validate-Binary-Search-Tree/" class="">0098. Validate Binary Search Tree</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0001~0099/0099.Recover-Binary-Search-Tree/" class="">0099. Recover Binary Search Tree</a>
  

        </li>
      
    
  </ul>

        </li>
      
    
      
        <li>
          
  
  

  
    <input type="checkbox" id="section-493a834c00ee3cb3e08a5f00b31c323d" class="toggle"  />
    <label for="section-493a834c00ee3cb3e08a5f00b31c323d" class="flex justify-between">
      <a  class="">0100~0199</a>
    </label>
  

          
  <ul>
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0100~0199/0100.Same-Tree/" class="">0100. Same Tree</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0100~0199/0101.Symmetric-Tree/" class="">0101. Symmetric Tree</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0100~0199/0102.Binary-Tree-Level-Order-Traversal/" class="">0102. Binary Tree Level Order Traversal</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0100~0199/0103.Binary-Tree-Zigzag-Level-Order-Traversal/" class="">0103. Binary Tree Zigzag Level Order Traversal</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0100~0199/0104.Maximum-Depth-of-Binary-Tree/" class="">0104. Maximum Depth of Binary Tree</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0100~0199/0105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal/" class="">0105. Construct Binary Tree From Preorder and Inorder Traversal</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0100~0199/0106.Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal/" class="">0106. Construct Binary Tree From Inorder and Postorder Traversal</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0100~0199/0107.Binary-Tree-Level-Order-Traversal-II/" class="">0107. Binary Tree Level Order Traversal I I</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0100~0199/0108.Convert-Sorted-Array-to-Binary-Search-Tree/" class="">0108. Convert Sorted Array to Binary Search Tree</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0100~0199/0109.Convert-Sorted-List-to-Binary-Search-Tree/" class="">0109. Convert Sorted List to Binary Search Tree</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0100~0199/0110.Balanced-Binary-Tree/" class="">0110. Balanced Binary Tree</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0100~0199/0111.Minimum-Depth-of-Binary-Tree/" class="">0111. Minimum Depth of Binary Tree</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0100~0199/0112.Path-Sum/" class="">0112. Path Sum</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0100~0199/0113.Path-Sum-II/" class="">0113. Path Sum I I</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0100~0199/0114.Flatten-Binary-Tree-to-Linked-List/" class="">0114. Flatten Binary Tree to Linked List</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0100~0199/0115.Distinct-Subsequences/" class="">0115. Distinct Subsequences</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0100~0199/0116.Populating-Next-Right-Pointers-in-Each-Node/" class="">0116. Populating Next Right Pointers in Each Node</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0100~0199/0118.Pascals-Triangle/" class="">0118. Pascals Triangle</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0100~0199/0119.Pascals-Triangle-II/" class="">0119. Pascals Triangle I I</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0100~0199/0120.Triangle/" class="">0120. Triangle</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0100~0199/0121.Best-Time-to-Buy-and-Sell-Stock/" class="">0121. Best Time to Buy and Sell Stock</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0100~0199/0122.Best-Time-to-Buy-and-Sell-Stock-II/" class="">0122. Best Time to Buy and Sell Stock I I</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0100~0199/0124.Binary-Tree-Maximum-Path-Sum/" class="">0124. Binary Tree Maximum Path Sum</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0100~0199/0125.Valid-Palindrome/" class="">0125. Valid Palindrome</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0100~0199/0126.Word-Ladder-II/" class="">0126. Word Ladder I I</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0100~0199/0127.Word-Ladder/" class="">0127. Word Ladder</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0100~0199/0128.Longest-Consecutive-Sequence/" class="">0128. Longest Consecutive Sequence</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0100~0199/0129.Sum-Root-to-Leaf-Numbers/" class="">0129. Sum Root to Leaf Numbers</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0100~0199/0130.Surrounded-Regions/" class="">0130. Surrounded Regions</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0100~0199/0131.Palindrome-Partitioning/" class="">0131. Palindrome Partitioning</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0100~0199/0132.Palindrome-Partitioning-II/" class="">0132. Palindrome Partitioning I I</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0100~0199/0134.Gas-Station/" class="">0134. Gas Station</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0100~0199/0135.Candy/" class="">0135. Candy</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0100~0199/0136.Single-Number/" class="">0136. Single Number</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0100~0199/0137.Single-Number-II/" class="">0137. Single Number I I</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0100~0199/0138.Copy-List-With-Random-Pointer/" class="">0138. Copy List With Random Pointer</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0100~0199/0141.Linked-List-Cycle/" class="">0141. Linked List Cycle</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0100~0199/0142.Linked-List-Cycle-II/" class="">0142. Linked List Cycle I I</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0100~0199/0143.Reorder-List/" class="">0143. Reorder List</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0100~0199/0144.Binary-Tree-Preorder-Traversal/" class="">0144. Binary Tree Preorder Traversal</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0100~0199/0145.Binary-Tree-Postorder-Traversal/" class="">0145. Binary Tree Postorder Traversal</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0100~0199/0146.LRU-Cache/" class="">0146. L R U Cache</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0100~0199/0147.Insertion-Sort-List/" class="">0147. Insertion Sort List</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0100~0199/0148.Sort-List/" class="">0148. Sort List</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0100~0199/0150.Evaluate-Reverse-Polish-Notation/" class="">0150. Evaluate Reverse Polish Notation</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0100~0199/0151.Reverse-Words-in-a-String/" class="">0151. Reverse Words in a String</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0100~0199/0152.Maximum-Product-Subarray/" class="">0152. Maximum Product Subarray</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0100~0199/0153.Find-Minimum-in-Rotated-Sorted-Array/" class="">0153. Find Minimum in Rotated Sorted Array</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0100~0199/0154.Find-Minimum-in-Rotated-Sorted-Array-II/" class="">0154. Find Minimum in Rotated Sorted Array I I</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0100~0199/0155.Min-Stack/" class="">0155. Min Stack</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0100~0199/0160.Intersection-of-Two-Linked-Lists/" class="">0160. Intersection of Two Linked Lists</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0100~0199/0162.Find-Peak-Element/" class="">0162. Find Peak Element</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0100~0199/0164.Maximum-Gap/" class="">0164. Maximum Gap</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0100~0199/0167.Two-Sum-II-Input-array-is-sorted/" class="">0167. Two Sum I I Input Array Is Sorted</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0100~0199/0168.Excel-Sheet-Column-Title/" class="">0168. Excel Sheet Column Title</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0100~0199/0169.Majority-Element/" class="">0169. Majority Element</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0100~0199/0171.Excel-Sheet-Column-Number/" class="">0171. Excel Sheet Column Number</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0100~0199/0172.Factorial-Trailing-Zeroes/" class="">0172. Factorial Trailing Zeroes</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0100~0199/0173.Binary-Search-Tree-Iterator/" class="">0173. Binary Search Tree Iterator</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0100~0199/0174.Dungeon-Game/" class="">0174. Dungeon Game</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0100~0199/0179.Largest-Number/" class="">0179. Largest Number</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0100~0199/0187.Repeated-DNA-Sequences/" class="">0187. Repeated D N a Sequences</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0100~0199/0189.Rotate-Array/" class="">0189. Rotate Array</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0100~0199/0190.Reverse-Bits/" class="">0190. Reverse Bits</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0100~0199/0191.Number-of-1-Bits/" class="">0191. Number of 1 Bits</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0100~0199/0198.House-Robber/" class="">0198. House Robber</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0100~0199/0199.Binary-Tree-Right-Side-View/" class="">0199. Binary Tree Right Side View</a>
  

        </li>
      
    
  </ul>

        </li>
      
    
      
        <li>
          
  
  

  
    <input type="checkbox" id="section-914a625fd8dcb63474c27e8ff933fa50" class="toggle"  />
    <label for="section-914a625fd8dcb63474c27e8ff933fa50" class="flex justify-between">
      <a  class="">0200~0299</a>
    </label>
  

          
  <ul>
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0200~0299/0200.Number-of-Islands/" class="">0200. Number of Islands</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0200~0299/0201.Bitwise-AND-of-Numbers-Range/" class="">0201. Bitwise a N D of Numbers Range</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0200~0299/0202.Happy-Number/" class="">0202. Happy Number</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0200~0299/0203.Remove-Linked-List-Elements/" class="">0203. Remove Linked List Elements</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0200~0299/0204.Count-Primes/" class="">0204. Count Primes</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0200~0299/0205.Isomorphic-Strings/" class="">0205. Isomorphic Strings</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0200~0299/0206.Reverse-Linked-List/" class="">0206. Reverse Linked List</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0200~0299/0207.Course-Schedule/" class="">0207. Course Schedule</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0200~0299/0208.Implement-Trie-Prefix-Tree/" class="">0208. Implement Trie Prefix Tree</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0200~0299/0209.Minimum-Size-Subarray-Sum/" class="">0209. Minimum Size Subarray Sum</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0200~0299/0210.Course-Schedule-II/" class="">0210. Course Schedule I I</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0200~0299/0211.Design-Add-and-Search-Words-Data-Structure/" class="">0211. Design Add and Search Words Data Structure</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0200~0299/0212.Word-Search-II/" class="">0212. Word Search I I</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0200~0299/0213.House-Robber-II/" class="">0213. House Robber I I</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0200~0299/0215.Kth-Largest-Element-in-an-Array/" class="">0215. Kth Largest Element in an Array</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0200~0299/0216.Combination-Sum-III/" class="">0216. Combination Sum I I I</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0200~0299/0217.Contains-Duplicate/" class="">0217. Contains Duplicate</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0200~0299/0218.The-Skyline-Problem/" class="">0218. the Skyline Problem</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0200~0299/0219.Contains-Duplicate-II/" class="">0219. Contains Duplicate I I</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0200~0299/0220.Contains-Duplicate-III/" class="">0220. Contains Duplicate I I I</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0200~0299/0222.Count-Complete-Tree-Nodes/" class="">0222. Count Complete Tree Nodes</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0200~0299/0223.Rectangle-Area/" class="">0223. Rectangle Area</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0200~0299/0224.Basic-Calculator/" class="">0224. Basic Calculator</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0200~0299/0225.Implement-Stack-using-Queues/" class="">0225. Implement Stack Using Queues</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0200~0299/0226.Invert-Binary-Tree/" class="">0226. Invert Binary Tree</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0200~0299/0227.Basic-Calculator-II/" class="">0227. Basic Calculator I I</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0200~0299/0228.Summary-Ranges/" class="">0228. Summary Ranges</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0200~0299/0229.Majority-Element-II/" class="">0229. Majority Element I I</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0200~0299/0230.Kth-Smallest-Element-in-a-BST/" class="">0230. Kth Smallest Element in a B S T</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0200~0299/0231.Power-of-Two/" class="">0231. Power of Two</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0200~0299/0232.Implement-Queue-using-Stacks/" class="">0232. Implement Queue Using Stacks</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0200~0299/0234.Palindrome-Linked-List/" class="">0234. Palindrome Linked List</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0200~0299/0235.Lowest-Common-Ancestor-of-a-Binary-Search-Tree/" class="">0235. Lowest Common Ancestor of a Binary Search Tree</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0200~0299/0236.Lowest-Common-Ancestor-of-a-Binary-Tree/" class="">0236. Lowest Common Ancestor of a Binary Tree</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0200~0299/0237.Delete-Node-in-a-Linked-List/" class="">0237. Delete Node in a Linked List</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0200~0299/0238.Product-of-Array-Except-Self/" class="">0238. Product of Array Except Self</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0200~0299/0239.Sliding-Window-Maximum/" class="">0239. Sliding Window Maximum</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0200~0299/0240.Search-a-2D-Matrix-II/" class="">0240. Search a 2 D Matrix I I</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0200~0299/0242.Valid-Anagram/" class="">0242. Valid Anagram</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0200~0299/0257.Binary-Tree-Paths/" class="">0257. Binary Tree Paths</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0200~0299/0258.Add-Digits/" class="">0258. Add Digits</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0200~0299/0260.Single-Number-III/" class="">0260. Single Number I I I</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0200~0299/0263.Ugly-Number/" class="">0263. Ugly Number</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0200~0299/0264.Ugly-Number-II/" class="">0264. Ugly Number I I</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0200~0299/0268.Missing-Number/" class="">0268. Missing Number</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0200~0299/0274.H-Index/" class="">0274. H Index</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0200~0299/0275.H-Index-II/" class="">0275. H Index I I</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0200~0299/0278.First-Bad-Version/" class="">0278. First Bad Version</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0200~0299/0279.Perfect-Squares/" class="">0279. Perfect Squares</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0200~0299/0283.Move-Zeroes/" class="">0283. Move Zeroes</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0200~0299/0284.Peeking-Iterator/" class="">0284. Peeking Iterator</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0200~0299/0287.Find-the-Duplicate-Number/" class="">0287. Find the Duplicate Number</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0200~0299/0290.Word-Pattern/" class="">0290. Word Pattern</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0200~0299/0297.Serialize-and-Deserialize-Binary-Tree/" class="">0297. Serialize and Deserialize Binary Tree</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0200~0299/0299.Bulls-and-Cows/" class="">0299. Bulls and Cows</a>
  

        </li>
      
    
  </ul>

        </li>
      
    
      
        <li>
          
  
  

  
    <input type="checkbox" id="section-5467dcc2f086d2f7689ea104faf4a770" class="toggle"  />
    <label for="section-5467dcc2f086d2f7689ea104faf4a770" class="flex justify-between">
      <a  class="">0300~0399</a>
    </label>
  

          
  <ul>
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0300~0399/0300.Longest-Increasing-Subsequence/" class="">0300. Longest Increasing Subsequence</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0300~0399/0301.Remove-Invalid-Parentheses/" class="">0301. Remove Invalid Parentheses</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0300~0399/0303.Range-Sum-Query-Immutable/" class="">0303. Range Sum Query Immutable</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0300~0399/0304.Range-Sum-Query-2D-Immutable/" class="">0304. Range Sum Query 2 D Immutable</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0300~0399/0306.Additive-Number/" class="">0306. Additive Number</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0300~0399/0307.Range-Sum-Query-Mutable/" class="">0307. Range Sum Query Mutable</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0300~0399/0309.Best-Time-to-Buy-and-Sell-Stock-with-Cooldown/" class="">0309. Best Time to Buy and Sell Stock With Cooldown</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0300~0399/0315.Count-of-Smaller-Numbers-After-Self/" class="">0315. Count of Smaller Numbers After Self</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0300~0399/0316.Remove-Duplicate-Letters/" class="">0316. Remove Duplicate Letters</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0300~0399/0318.Maximum-Product-of-Word-Lengths/" class="">0318. Maximum Product of Word Lengths</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0300~0399/0319.Bulb-Switcher/" class="">0319. Bulb Switcher</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0300~0399/0322.Coin-Change/" class="">0322. Coin Change</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0300~0399/0324.Wiggle-Sort-II/" class="">0324. Wiggle Sort I I</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0300~0399/0326.Power-of-Three/" class="">0326. Power of Three</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0300~0399/0327.Count-of-Range-Sum/" class="">0327. Count of Range Sum</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0300~0399/0328.Odd-Even-Linked-List/" class="">0328. Odd Even Linked List</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0300~0399/0329.Longest-Increasing-Path-in-a-Matrix/" class="">0329. Longest Increasing Path in a Matrix</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0300~0399/0331.Verify-Preorder-Serialization-of-a-Binary-Tree/" class="">0331. Verify Preorder Serialization of a Binary Tree</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0300~0399/0337.House-Robber-III/" class="">0337. House Robber I I I</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0300~0399/0338.Counting-Bits/" class="">0338. Counting Bits</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0300~0399/0341.Flatten-Nested-List-Iterator/" class="">0341. Flatten Nested List Iterator</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0300~0399/0342.Power-of-Four/" class="">0342. Power of Four</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0300~0399/0343.Integer-Break/" class="">0343. Integer Break</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0300~0399/0344.Reverse-String/" class="">0344. Reverse String</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0300~0399/0345.Reverse-Vowels-of-a-String/" class="">0345. Reverse Vowels of a String</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0300~0399/0347.Top-K-Frequent-Elements/" class="">0347. Top K Frequent Elements</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0300~0399/0349.Intersection-of-Two-Arrays/" class="">0349. Intersection of Two Arrays</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0300~0399/0350.Intersection-of-Two-Arrays-II/" class="">0350. Intersection of Two Arrays I I</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0300~0399/0351.Android-Unlock-Patterns/" class="">0351. Android Unlock Patterns</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0300~0399/0352.Data-Stream-as-Disjoint-Intervals/" class="">0352. Data Stream as Disjoint Intervals</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0300~0399/0354.Russian-Doll-Envelopes/" class="">0354. Russian Doll Envelopes</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0300~0399/0357.Count-Numbers-with-Unique-Digits/" class="">0357. Count Numbers With Unique Digits</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0300~0399/0363.Max-Sum-of-Rectangle-No-Larger-Than-K/" class="">0363. Max Sum of Rectangle No Larger Than K</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0300~0399/0367.Valid-Perfect-Square/" class="">0367. Valid Perfect Square</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0300~0399/0368.Largest-Divisible-Subset/" class="">0368. Largest Divisible Subset</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0300~0399/0371.Sum-of-Two-Integers/" class="">0371. Sum of Two Integers</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0300~0399/0372.Super-Pow/" class="">0372. Super Pow</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0300~0399/0373.Find-K-Pairs-with-Smallest-Sums/" class="">0373. Find K Pairs With Smallest Sums</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0300~0399/0374.Guess-Number-Higher-or-Lower/" class="">0374. Guess Number Higher or Lower</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0300~0399/0376.Wiggle-Subsequence/" class="">0376. Wiggle Subsequence</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0300~0399/0377.Combination-Sum-IV/" class="">0377. Combination Sum I V</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0300~0399/0378.Kth-Smallest-Element-in-a-Sorted-Matrix/" class="">0378. Kth Smallest Element in a Sorted Matrix</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0300~0399/0382.Linked-List-Random-Node/" class="">0382. Linked List Random Node</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0300~0399/0383.Ransom-Note/" class="">0383. Ransom Note</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0300~0399/0384.Shuffle-an-Array/" class="">0384. Shuffle an Array</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0300~0399/0385.Mini-Parser/" class="">0385. Mini Parser</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0300~0399/0386.Lexicographical-Numbers/" class="">0386. Lexicographical Numbers</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0300~0399/0387.First-Unique-Character-in-a-String/" class="">0387. First Unique Character in a String</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0300~0399/0389.Find-the-Difference/" class="">0389. Find the Difference</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0300~0399/0390.Elimination-Game/" class="">0390. Elimination Game</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0300~0399/0391.Perfect-Rectangle/" class="">0391. Perfect Rectangle</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0300~0399/0392.Is-Subsequence/" class="">0392. Is Subsequence</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0300~0399/0393.UTF-8-Validation/" class="">0393. U T F 8 Validation</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0300~0399/0394.Decode-String/" class="">0394. Decode String</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0300~0399/0395.Longest-Substring-with-At-Least-K-Repeating-Characters/" class="">0395. Longest Substring With at Least K Repeating Characters</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0300~0399/0396.Rotate-Function/" class="">0396. Rotate Function</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0300~0399/0397.Integer-Replacement/" class="">0397. Integer Replacement</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0300~0399/0399.Evaluate-Division/" class="">0399. Evaluate Division</a>
  

        </li>
      
    
  </ul>

        </li>
      
    
      
        <li>
          
  
  

  
    <input type="checkbox" id="section-01fd10b2f8da1d4e93b4eff52ce1244d" class="toggle"  />
    <label for="section-01fd10b2f8da1d4e93b4eff52ce1244d" class="flex justify-between">
      <a  class="">0400~0499</a>
    </label>
  

          
  <ul>
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0400~0499/0400.Nth-Digit/" class="">0400. Nth Digit</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0400~0499/0401.Binary-Watch/" class="">0401. Binary Watch</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0400~0499/0402.Remove-K-Digits/" class="">0402. Remove K Digits</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0400~0499/0404.Sum-of-Left-Leaves/" class="">0404. Sum of Left Leaves</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0400~0499/0405.Convert-a-Number-to-Hexadecimal/" class="">0405. Convert a Number to Hexadecimal</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0400~0499/0409.Longest-Palindrome/" class="">0409. Longest Palindrome</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0400~0499/0410.Split-Array-Largest-Sum/" class="">0410. Split Array Largest Sum</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0400~0499/0412.Fizz-Buzz/" class="">0412. Fizz Buzz</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0400~0499/0413.Arithmetic-Slices/" class="">0413. Arithmetic Slices</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0400~0499/0414.Third-Maximum-Number/" class="">0414. Third Maximum Number</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0400~0499/0416.Partition-Equal-Subset-Sum/" class="">0416. Partition Equal Subset Sum</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0400~0499/0417.Pacific-Atlantic-Water-Flow/" class="">0417. Pacific Atlantic Water Flow</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0400~0499/0419.Battleships-in-a-Board/" class="">0419. Battleships in a Board</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0400~0499/0421.Maximum-XOR-of-Two-Numbers-in-an-Array/" class="">0421. Maximum X O R of Two Numbers in an Array</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0400~0499/0423.Reconstruct-Original-Digits-from-English/" class="">0423. Reconstruct Original Digits From English</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0400~0499/0424.Longest-Repeating-Character-Replacement/" class="">0424. Longest Repeating Character Replacement</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0400~0499/0429.N-ary-Tree-Level-Order-Traversal/" class="">0429. N Ary Tree Level Order Traversal</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0400~0499/0433.Minimum-Genetic-Mutation/" class="">0433. Minimum Genetic Mutation</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0400~0499/0434.Number-of-Segments-in-a-String/" class="">0434. Number of Segments in a String</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0400~0499/0435.Non-overlapping-Intervals/" class="">0435. Non Overlapping Intervals</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0400~0499/0436.Find-Right-Interval/" class="">0436. Find Right Interval</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0400~0499/0437.Path-Sum-III/" class="">0437. Path Sum I I I</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0400~0499/0438.Find-All-Anagrams-in-a-String/" class="">0438. Find All Anagrams in a String</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0400~0499/0441.Arranging-Coins/" class="">0441. Arranging Coins</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0400~0499/0445.Add-Two-Numbers-II/" class="">0445. Add Two Numbers I I</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0400~0499/0447.Number-of-Boomerangs/" class="">0447. Number of Boomerangs</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0400~0499/0448.Find-All-Numbers-Disappeared-in-an-Array/" class="">0448. Find All Numbers Disappeared in an Array</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0400~0499/0451.Sort-Characters-By-Frequency/" class="">0451. Sort Characters by Frequency</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0400~0499/0453.Minimum-Moves-to-Equal-Array-Elements/" class="">0453. Minimum Moves to Equal Array Elements</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0400~0499/0454.4Sum-II/" class="">0454.4 Sum I I</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0400~0499/0455.Assign-Cookies/" class="">0455. Assign Cookies</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0400~0499/0456.132-Pattern/" class="">0456.132 Pattern</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0400~0499/0457.Circular-Array-Loop/" class="">0457. Circular Array Loop</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0400~0499/0458.Poor-Pigs/" class="">0458. Poor Pigs</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0400~0499/0460.LFU-Cache/" class="">0460. L F U Cache</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0400~0499/0461.Hamming-Distance/" class="">0461. Hamming Distance</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0400~0499/0462.Minimum-Moves-to-Equal-Array-Elements-II/" class="">0462. Minimum Moves to Equal Array Elements I I</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0400~0499/0463.Island-Perimeter/" class="">0463. Island Perimeter</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0400~0499/0470.Implement-Rand10-Using-Rand7/" class="">0470. Implement Rand10 Using Rand7</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0400~0499/0473.Matchsticks-to-Square/" class="">0473. Matchsticks to Square</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0400~0499/0474.Ones-and-Zeroes/" class="">0474. Ones and Zeroes</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0400~0499/0475.Heaters/" class="">0475. Heaters</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0400~0499/0476.Number-Complement/" class="">0476. Number Complement</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0400~0499/0477.Total-Hamming-Distance/" class="">0477. Total Hamming Distance</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0400~0499/0478.Generate-Random-Point-in-a-Circle/" class="">0478. Generate Random Point in a Circle</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0400~0499/0480.Sliding-Window-Median/" class="">0480. Sliding Window Median</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0400~0499/0483.Smallest-Good-Base/" class="">0483. Smallest Good Base</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0400~0499/0485.Max-Consecutive-Ones/" class="">0485. Max Consecutive Ones</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0400~0499/0488.Zuma-Game/" class="">0488. Zuma Game</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0400~0499/0491.Non-decreasing-Subsequences/" class="">0491. Non Decreasing Subsequences</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0400~0499/0492.Construct-the-Rectangle/" class="">0492. Construct the Rectangle</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0400~0499/0493.Reverse-Pairs/" class="">0493. Reverse Pairs</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0400~0499/0494.Target-Sum/" class="">0494. Target Sum</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0400~0499/0495.Teemo-Attacking/" class="">0495. Teemo Attacking</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0400~0499/0496.Next-Greater-Element-I/" class="">0496. Next Greater Element I</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0400~0499/0497.Random-Point-in-Non-overlapping-Rectangles/" class="">0497. Random Point in Non Overlapping Rectangles</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0400~0499/0498.Diagonal-Traverse/" class="">0498. Diagonal Traverse</a>
  

        </li>
      
    
  </ul>

        </li>
      
    
      
        <li>
          
  
  

  
    <input type="checkbox" id="section-cca46776c03e61c0eb680bc067dead46" class="toggle"  />
    <label for="section-cca46776c03e61c0eb680bc067dead46" class="flex justify-between">
      <a  class="">0500~0599</a>
    </label>
  

          
  <ul>
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0500~0599/0500.Keyboard-Row/" class="">0500. Keyboard Row</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0500~0599/0503.Next-Greater-Element-II/" class="">0503. Next Greater Element I I</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0500~0599/0504.Base-7/" class="">0504. Base 7</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0500~0599/0506.Relative-Ranks/" class="">0506. Relative Ranks</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0500~0599/0507.Perfect-Number/" class="">0507. Perfect Number</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0500~0599/0508.Most-Frequent-Subtree-Sum/" class="">0508. Most Frequent Subtree Sum</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0500~0599/0509.Fibonacci-Number/" class="">0509. Fibonacci Number</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0500~0599/0513.Find-Bottom-Left-Tree-Value/" class="">0513. Find Bottom Left Tree Value</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0500~0599/0515.Find-Largest-Value-in-Each-Tree-Row/" class="">0515. Find Largest Value in Each Tree Row</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0500~0599/0518.Coin-Change-II/" class="">0518. Coin Change I I</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0500~0599/0519.Random-Flip-Matrix/" class="">0519. Random Flip Matrix</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0500~0599/0520.Detect-Capital/" class="">0520. Detect Capital</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0500~0599/0523.Continuous-Subarray-Sum/" class="">0523. Continuous Subarray Sum</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0500~0599/0524.Longest-Word-in-Dictionary-through-Deleting/" class="">0524. Longest Word in Dictionary Through Deleting</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0500~0599/0525.Contiguous-Array/" class="">0525. Contiguous Array</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0500~0599/0526.Beautiful-Arrangement/" class="">0526. Beautiful Arrangement</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0500~0599/0528.Random-Pick-with-Weight/" class="">0528. Random Pick With Weight</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0500~0599/0529.Minesweeper/" class="">0529. Minesweeper</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0500~0599/0530.Minimum-Absolute-Difference-in-BST/" class="">0530. Minimum Absolute Difference in B S T</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0500~0599/0532.K-diff-Pairs-in-an-Array/" class="">0532. K Diff Pairs in an Array</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0500~0599/0535.Encode-and-Decode-TinyURL/" class="">0535. Encode and Decode Tiny U R L</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0500~0599/0537.Complex-Number-Multiplication/" class="">0537. Complex Number Multiplication</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0500~0599/0538.Convert-BST-to-Greater-Tree/" class="">0538. Convert B S T to Greater Tree</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0500~0599/0540.Single-Element-in-a-Sorted-Array/" class="">0540. Single Element in a Sorted Array</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0500~0599/0541.Reverse-String-II/" class="">0541. Reverse String I I</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0500~0599/0542.01-Matrix/" class="">0542.01 Matrix</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0500~0599/0543.Diameter-of-Binary-Tree/" class="">0543. Diameter of Binary Tree</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0500~0599/0547.Number-of-Provinces/" class="">0547. Number of Provinces</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0500~0599/0551.Student-Attendance-Record-I/" class="">0551. Student Attendance Record I</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0500~0599/0554.Brick-Wall/" class="">0554. Brick Wall</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0500~0599/0557.Reverse-Words-in-a-String-III/" class="">0557. Reverse Words in a String I I I</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0500~0599/0559.Maximum-Depth-of-N-ary-Tree/" class="">0559. Maximum Depth of N Ary Tree</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0500~0599/0560.Subarray-Sum-Equals-K/" class="">0560. Subarray Sum Equals K</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0500~0599/0561.Array-Partition/" class="">0561. Array Partition</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0500~0599/0563.Binary-Tree-Tilt/" class="">0563. Binary Tree Tilt</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0500~0599/0566.Reshape-the-Matrix/" class="">0566. Reshape the Matrix</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0500~0599/0567.Permutation-in-String/" class="">0567. Permutation in String</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0500~0599/0572.Subtree-of-Another-Tree/" class="">0572. Subtree of Another Tree</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0500~0599/0575.Distribute-Candies/" class="">0575. Distribute Candies</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0500~0599/0576.Out-of-Boundary-Paths/" class="">0576. Out of Boundary Paths</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0500~0599/0581.Shortest-Unsorted-Continuous-Subarray/" class="">0581. Shortest Unsorted Continuous Subarray</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0500~0599/0583.Delete-Operation-for-Two-Strings/" class="">0583. Delete Operation for Two Strings</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0500~0599/0589.N-ary-Tree-Preorder-Traversal/" class="">0589. N Ary Tree Preorder Traversal</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0500~0599/0594.Longest-Harmonious-Subsequence/" class="">0594. Longest Harmonious Subsequence</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0500~0599/0598.Range-Addition-II/" class="">0598. Range Addition I I</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0500~0599/0599.Minimum-Index-Sum-of-Two-Lists/" class="">0599. Minimum Index Sum of Two Lists</a>
  

        </li>
      
    
  </ul>

        </li>
      
    
      
        <li>
          
  
  

  
    <input type="checkbox" id="section-96d65f8ef791738e2a005f7af89337b7" class="toggle"  />
    <label for="section-96d65f8ef791738e2a005f7af89337b7" class="flex justify-between">
      <a  class="">0600~0699</a>
    </label>
  

          
  <ul>
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0600~0699/0605.Can-Place-Flowers/" class="">0605. Can Place Flowers</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0600~0699/0609.Find-Duplicate-File-in-System/" class="">0609. Find Duplicate File in System</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0600~0699/0611.Valid-Triangle-Number/" class="">0611. Valid Triangle Number</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0600~0699/0617.Merge-Two-Binary-Trees/" class="">0617. Merge Two Binary Trees</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0600~0699/0622.Design-Circular-Queue/" class="">0622. Design Circular Queue</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0600~0699/0623.Add-One-Row-to-Tree/" class="">0623. Add One Row to Tree</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0600~0699/0628.Maximum-Product-of-Three-Numbers/" class="">0628. Maximum Product of Three Numbers</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0600~0699/0630.Course-Schedule-III/" class="">0630. Course Schedule I I I</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0600~0699/0632.Smallest-Range-Covering-Elements-from-K-Lists/" class="">0632. Smallest Range Covering Elements From K Lists</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0600~0699/0633.Sum-of-Square-Numbers/" class="">0633. Sum of Square Numbers</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0600~0699/0636.Exclusive-Time-of-Functions/" class="">0636. Exclusive Time of Functions</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0600~0699/0637.Average-of-Levels-in-Binary-Tree/" class="">0637. Average of Levels in Binary Tree</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0600~0699/0638.Shopping-Offers/" class="">0638. Shopping Offers</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0600~0699/0643.Maximum-Average-Subarray-I/" class="">0643. Maximum Average Subarray I</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0600~0699/0645.Set-Mismatch/" class="">0645. Set Mismatch</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0600~0699/0647.Palindromic-Substrings/" class="">0647. Palindromic Substrings</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0600~0699/0648.Replace-Words/" class="">0648. Replace Words</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0600~0699/0653.Two-Sum-IV-Input-is-a-BST/" class="">0653. Two Sum I v Input Is a B S T</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0600~0699/0658.Find-K-Closest-Elements/" class="">0658. Find K Closest Elements</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0600~0699/0661.Image-Smoother/" class="">0661. Image Smoother</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0600~0699/0662.Maximum-Width-of-Binary-Tree/" class="">0662. Maximum Width of Binary Tree</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0600~0699/0665.Non-decreasing-Array/" class="">0665. Non Decreasing Array</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0600~0699/0667.Beautiful-Arrangement-II/" class="">0667. Beautiful Arrangement I I</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0600~0699/0668.Kth-Smallest-Number-in-Multiplication-Table/" class="">0668. Kth Smallest Number in Multiplication Table</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0600~0699/0669.Trim-a-Binary-Search-Tree/" class="">0669. Trim a Binary Search Tree</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0600~0699/0674.Longest-Continuous-Increasing-Subsequence/" class="">0674. Longest Continuous Increasing Subsequence</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0600~0699/0676.Implement-Magic-Dictionary/" class="">0676. Implement Magic Dictionary</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0600~0699/0677.Map-Sum-Pairs/" class="">0677. Map Sum Pairs</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0600~0699/0682.Baseball-Game/" class="">0682. Baseball Game</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0600~0699/0684.Redundant-Connection/" class="">0684. Redundant Connection</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0600~0699/0685.Redundant-Connection-II/" class="">0685. Redundant Connection I I</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0600~0699/0690.Employee-Importance/" class="">0690. Employee Importance</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0600~0699/0692.Top-K-Frequent-Words/" class="">0692. Top K Frequent Words</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0600~0699/0693.Binary-Number-with-Alternating-Bits/" class="">0693. Binary Number With Alternating Bits</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0600~0699/0695.Max-Area-of-Island/" class="">0695. Max Area of Island</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0600~0699/0696.Count-Binary-Substrings/" class="">0696. Count Binary Substrings</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0600~0699/0697.Degree-of-an-Array/" class="">0697. Degree of an Array</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0600~0699/0699.Falling-Squares/" class="">0699. Falling Squares</a>
  

        </li>
      
    
  </ul>

        </li>
      
    
      
        <li>
          
  
  

  
    <input type="checkbox" id="section-839833488013efffc5fd6e71c842cceb" class="toggle"  />
    <label for="section-839833488013efffc5fd6e71c842cceb" class="flex justify-between">
      <a  class="">0700~0799</a>
    </label>
  

          
  <ul>
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0700~0799/0700.Search-in-a-Binary-Search-Tree/" class="">0700. Search in a Binary Search Tree</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0700~0799/0701.Insert-into-a-Binary-Search-Tree/" class="">0701. Insert Into a Binary Search Tree</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0700~0799/0703.Kth-Largest-Element-in-a-Stream/" class="">0703. Kth Largest Element in a Stream</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0700~0799/0704.Binary-Search/" class="">0704. Binary Search</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0700~0799/0705.Design-HashSet/" class="">0705. Design Hash Set</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0700~0799/0706.Design-HashMap/" class="">0706. Design Hash Map</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0700~0799/0707.Design-Linked-List/" class="">0707. Design Linked List</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0700~0799/0709.To-Lower-Case/" class="">0709. to Lower Case</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0700~0799/0710.Random-Pick-with-Blacklist/" class="">0710. Random Pick With Blacklist</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0700~0799/0713.Subarray-Product-Less-Than-K/" class="">0713. Subarray Product Less Than K</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0700~0799/0714.Best-Time-to-Buy-and-Sell-Stock-with-Transaction-Fee/" class="">0714. Best Time to Buy and Sell Stock With Transaction Fee</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0700~0799/0715.Range-Module/" class="">0715. Range Module</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0700~0799/0717.1-bit-and-2-bit-Characters/" class="">0717.1 Bit and 2 Bit Characters</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0700~0799/0718.Maximum-Length-of-Repeated-Subarray/" class="">0718. Maximum Length of Repeated Subarray</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0700~0799/0719.Find-K-th-Smallest-Pair-Distance/" class="">0719. Find K Th Smallest Pair Distance</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0700~0799/0720.Longest-Word-in-Dictionary/" class="">0720. Longest Word in Dictionary</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0700~0799/0721.Accounts-Merge/" class="">0721. Accounts Merge</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0700~0799/0724.Find-Pivot-Index/" class="">0724. Find Pivot Index</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0700~0799/0725.Split-Linked-List-in-Parts/" class="">0725. Split Linked List in Parts</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0700~0799/0726.Number-of-Atoms/" class="">0726. Number of Atoms</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0700~0799/0728.Self-Dividing-Numbers/" class="">0728. Self Dividing Numbers</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0700~0799/0729.My-Calendar-I/" class="">0729. My Calendar I</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0700~0799/0732.My-Calendar-III/" class="">0732. My Calendar I I I</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0700~0799/0733.Flood-Fill/" class="">0733. Flood Fill</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0700~0799/0735.Asteroid-Collision/" class="">0735. Asteroid Collision</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0700~0799/0739.Daily-Temperatures/" class="">0739. Daily Temperatures</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0700~0799/0744.Find-Smallest-Letter-Greater-Than-Target/" class="">0744. Find Smallest Letter Greater Than Target</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0700~0799/0745.Prefix-and-Suffix-Search/" class="">0745. Prefix and Suffix Search</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0700~0799/0746.Min-Cost-Climbing-Stairs/" class="">0746. Min Cost Climbing Stairs</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0700~0799/0747.Largest-Number-At-Least-Twice-of-Others/" class="">0747. Largest Number at Least Twice of Others</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0700~0799/0748.Shortest-Completing-Word/" class="">0748. Shortest Completing Word</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0700~0799/0752.Open-the-Lock/" class="">0752. Open the Lock</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0700~0799/0753.Cracking-the-Safe/" class="">0753. Cracking the Safe</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0700~0799/0756.Pyramid-Transition-Matrix/" class="">0756. Pyramid Transition Matrix</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0700~0799/0762.Prime-Number-of-Set-Bits-in-Binary-Representation/" class="">0762. Prime Number of Set Bits in Binary Representation</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0700~0799/0763.Partition-Labels/" class="">0763. Partition Labels</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0700~0799/0765.Couples-Holding-Hands/" class="">0765. Couples Holding Hands</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0700~0799/0766.Toeplitz-Matrix/" class="">0766. Toeplitz Matrix</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0700~0799/0767.Reorganize-String/" class="">0767. Reorganize String</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0700~0799/0771.Jewels-and-Stones/" class="">0771. Jewels and Stones</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0700~0799/0775.Global-and-Local-Inversions/" class="">0775. Global and Local Inversions</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0700~0799/0778.Swim-in-Rising-Water/" class="">0778. Swim in Rising Water</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0700~0799/0781.Rabbits-in-Forest/" class="">0781. Rabbits in Forest</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0700~0799/0783.Minimum-Distance-Between-BST-Nodes/" class="">0783. Minimum Distance Between B S T Nodes</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0700~0799/0784.Letter-Case-Permutation/" class="">0784. Letter Case Permutation</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0700~0799/0785.Is-Graph-Bipartite/" class="">0785. Is Graph Bipartite</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0700~0799/0786.K-th-Smallest-Prime-Fraction/" class="">0786. K Th Smallest Prime Fraction</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0700~0799/0791.Custom-Sort-String/" class="">0791. Custom Sort String</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0700~0799/0792.Number-of-Matching-Subsequences/" class="">0792. Number of Matching Subsequences</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0700~0799/0793.Preimage-Size-of-Factorial-Zeroes-Function/" class="">0793. Preimage Size of Factorial Zeroes Function</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0700~0799/0794.Valid-Tic-Tac-Toe-State/" class="">0794. Valid Tic Tac Toe State</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0700~0799/0795.Number-of-Subarrays-with-Bounded-Maximum/" class="">0795. Number of Subarrays With Bounded Maximum</a>
  

        </li>
      
    
  </ul>

        </li>
      
    
      
        <li>
          
  
  

  
    <input type="checkbox" id="section-944979e2fc1275a5f2cfdd0ea36a010f" class="toggle"  />
    <label for="section-944979e2fc1275a5f2cfdd0ea36a010f" class="flex justify-between">
      <a  class="">0800~0899</a>
    </label>
  

          
  <ul>
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0800~0899/0802.Find-Eventual-Safe-States/" class="">0802. Find Eventual Safe States</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0800~0899/0803.Bricks-Falling-When-Hit/" class="">0803. Bricks Falling When Hit</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0800~0899/0807.Max-Increase-to-Keep-City-Skyline/" class="">0807. Max Increase to Keep City Skyline</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0800~0899/0810.Chalkboard-XOR-Game/" class="">0810. Chalkboard X O R Game</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0800~0899/0811.Subdomain-Visit-Count/" class="">0811. Subdomain Visit Count</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0800~0899/0812.Largest-Triangle-Area/" class="">0812. Largest Triangle Area</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0800~0899/0815.Bus-Routes/" class="">0815. Bus Routes</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0800~0899/0816.Ambiguous-Coordinates/" class="">0816. Ambiguous Coordinates</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0800~0899/0817.Linked-List-Components/" class="">0817. Linked List Components</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0800~0899/0819.Most-Common-Word/" class="">0819. Most Common Word</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0800~0899/0820.Short-Encoding-of-Words/" class="">0820. Short Encoding of Words</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0800~0899/0821.Shortest-Distance-to-a-Character/" class="">0821. Shortest Distance to a Character</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0800~0899/0823.Binary-Trees-With-Factors/" class="">0823. Binary Trees With Factors</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0800~0899/0825.Friends-Of-Appropriate-Ages/" class="">0825. Friends of Appropriate Ages</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0800~0899/0826.Most-Profit-Assigning-Work/" class="">0826. Most Profit Assigning Work</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0800~0899/0828.Count-Unique-Characters-of-All-Substrings-of-a-Given-String/" class="">0828. Count Unique Characters of All Substrings of a Given String</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0800~0899/0830.Positions-of-Large-Groups/" class="">0830. Positions of Large Groups</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0800~0899/0832.Flipping-an-Image/" class="">0832. Flipping an Image</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0800~0899/0834.Sum-of-Distances-in-Tree/" class="">0834. Sum of Distances in Tree</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0800~0899/0836.Rectangle-Overlap/" class="">0836. Rectangle Overlap</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0800~0899/0838.Push-Dominoes/" class="">0838. Push Dominoes</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0800~0899/0839.Similar-String-Groups/" class="">0839. Similar String Groups</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0800~0899/0841.Keys-and-Rooms/" class="">0841. Keys and Rooms</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0800~0899/0842.Split-Array-into-Fibonacci-Sequence/" class="">0842. Split Array Into Fibonacci Sequence</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0800~0899/0844.Backspace-String-Compare/" class="">0844. Backspace String Compare</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0800~0899/0845.Longest-Mountain-in-Array/" class="">0845. Longest Mountain in Array</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0800~0899/0846.Hand-of-Straights/" class="">0846. Hand of Straights</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0800~0899/0850.Rectangle-Area-II/" class="">0850. Rectangle Area I I</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0800~0899/0851.Loud-and-Rich/" class="">0851. Loud and Rich</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0800~0899/0852.Peak-Index-in-a-Mountain-Array/" class="">0852. Peak Index in a Mountain Array</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0800~0899/0853.Car-Fleet/" class="">0853. Car Fleet</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0800~0899/0856.Score-of-Parentheses/" class="">0856. Score of Parentheses</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0800~0899/0859.Buddy-Strings/" class="">0859. Buddy Strings</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0800~0899/0862.Shortest-Subarray-with-Sum-at-Least-K/" class="">0862. Shortest Subarray With Sum at Least K</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0800~0899/0863.All-Nodes-Distance-K-in-Binary-Tree/" class="">0863. All Nodes Distance K in Binary Tree</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0800~0899/0864.Shortest-Path-to-Get-All-Keys/" class="">0864. Shortest Path to Get All Keys</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0800~0899/0867.Transpose-Matrix/" class="">0867. Transpose Matrix</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0800~0899/0869.Reordered-Power-of-2/" class="">0869. Reordered Power of 2</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0800~0899/0870.Advantage-Shuffle/" class="">0870. Advantage Shuffle</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0800~0899/0872.Leaf-Similar-Trees/" class="">0872. Leaf Similar Trees</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0800~0899/0874.Walking-Robot-Simulation/" class="">0874. Walking Robot Simulation</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0800~0899/0875.Koko-Eating-Bananas/" class="">0875. Koko Eating Bananas</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0800~0899/0876.Middle-of-the-Linked-List/" class="">0876. Middle of the Linked List</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0800~0899/0877.Stone-Game/" class="">0877. Stone Game</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0800~0899/0878.Nth-Magical-Number/" class="">0878. Nth Magical Number</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0800~0899/0880.Decoded-String-at-Index/" class="">0880. Decoded String at Index</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0800~0899/0881.Boats-to-Save-People/" class="">0881. Boats to Save People</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0800~0899/0884.Uncommon-Words-from-Two-Sentences/" class="">0884. Uncommon Words From Two Sentences</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0800~0899/0885.Spiral-Matrix-III/" class="">0885. Spiral Matrix I I I</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0800~0899/0887.Super-Egg-Drop/" class="">0887. Super Egg Drop</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0800~0899/0888.Fair-Candy-Swap/" class="">0888. Fair Candy Swap</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0800~0899/0890.Find-and-Replace-Pattern/" class="">0890. Find and Replace Pattern</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0800~0899/0891.Sum-of-Subsequence-Widths/" class="">0891. Sum of Subsequence Widths</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0800~0899/0892.Surface-Area-of-3D-Shapes/" class="">0892. Surface Area of 3 D Shapes</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0800~0899/0895.Maximum-Frequency-Stack/" class="">0895. Maximum Frequency Stack</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0800~0899/0896.Monotonic-Array/" class="">0896. Monotonic Array</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0800~0899/0897.Increasing-Order-Search-Tree/" class="">0897. Increasing Order Search Tree</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0800~0899/0898.Bitwise-ORs-of-Subarrays/" class="">0898. Bitwise O Rs of Subarrays</a>
  

        </li>
      
    
  </ul>

        </li>
      
    
      
        <li>
          
  
  

  
    <input type="checkbox" id="section-a07265dcd1eacdf6f28c6b25a1b707d5" class="toggle"  />
    <label for="section-a07265dcd1eacdf6f28c6b25a1b707d5" class="flex justify-between">
      <a  class="">0900~0999</a>
    </label>
  

          
  <ul>
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0900~0999/0901.Online-Stock-Span/" class="">0901. Online Stock Span</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0900~0999/0904.Fruit-Into-Baskets/" class="">0904. Fruit Into Baskets</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0900~0999/0907.Sum-of-Subarray-Minimums/" class="">0907. Sum of Subarray Minimums</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0900~0999/0909.Snakes-and-Ladders/" class="">0909. Snakes and Ladders</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0900~0999/0910.Smallest-Range-II/" class="">0910. Smallest Range I I</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0900~0999/0911.Online-Election/" class="">0911. Online Election</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0900~0999/0914.X-of-a-Kind-in-a-Deck-of-Cards/" class="">0914. X of a Kind in a Deck of Cards</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0900~0999/0916.Word-Subsets/" class="">0916. Word Subsets</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0900~0999/0918.Maximum-Sum-Circular-Subarray/" class="">0918. Maximum Sum Circular Subarray</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0900~0999/0920.Number-of-Music-Playlists/" class="">0920. Number of Music Playlists</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0900~0999/0921.Minimum-Add-to-Make-Parentheses-Valid/" class="">0921. Minimum Add to Make Parentheses Valid</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0900~0999/0922.Sort-Array-By-Parity-II/" class="">0922. Sort Array by Parity I I</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0900~0999/0923.3Sum-With-Multiplicity/" class="">0923.3 Sum With Multiplicity</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0900~0999/0924.Minimize-Malware-Spread/" class="">0924. Minimize Malware Spread</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0900~0999/0925.Long-Pressed-Name/" class="">0925. Long Pressed Name</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0900~0999/0927.Three-Equal-Parts/" class="">0927. Three Equal Parts</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0900~0999/0928.Minimize-Malware-Spread-II/" class="">0928. Minimize Malware Spread I I</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0900~0999/0930.Binary-Subarrays-With-Sum/" class="">0930. Binary Subarrays With Sum</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0900~0999/0933.Number-of-Recent-Calls/" class="">0933. Number of Recent Calls</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0900~0999/0938.Range-Sum-of-BST/" class="">0938. Range Sum of B S T</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0900~0999/0942.DI-String-Match/" class="">0942. D I String Match</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0900~0999/0946.Validate-Stack-Sequences/" class="">0946. Validate Stack Sequences</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0900~0999/0947.Most-Stones-Removed-with-Same-Row-or-Column/" class="">0947. Most Stones Removed With Same Row or Column</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0900~0999/0949.Largest-Time-for-Given-Digits/" class="">0949. Largest Time for Given Digits</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0900~0999/0952.Largest-Component-Size-by-Common-Factor/" class="">0952. Largest Component Size by Common Factor</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0900~0999/0953.Verifying-an-Alien-Dictionary/" class="">0953. Verifying an Alien Dictionary</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0900~0999/0958.Check-Completeness-of-a-Binary-Tree/" class="">0958. Check Completeness of a Binary Tree</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0900~0999/0959.Regions-Cut-By-Slashes/" class="">0959. Regions Cut by Slashes</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0900~0999/0961.N-Repeated-Element-in-Size-2N-Array/" class="">0961. N Repeated Element in Size 2 N Array</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0900~0999/0966.Vowel-Spellchecker/" class="">0966. Vowel Spellchecker</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0900~0999/0968.Binary-Tree-Cameras/" class="">0968. Binary Tree Cameras</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0900~0999/0969.Pancake-Sorting/" class="">0969. Pancake Sorting</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0900~0999/0970.Powerful-Integers/" class="">0970. Powerful Integers</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0900~0999/0971.Flip-Binary-Tree-To-Match-Preorder-Traversal/" class="">0971. Flip Binary Tree to Match Preorder Traversal</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0900~0999/0973.K-Closest-Points-to-Origin/" class="">0973. K Closest Points to Origin</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0900~0999/0975.Odd-Even-Jump/" class="">0975. Odd Even Jump</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0900~0999/0976.Largest-Perimeter-Triangle/" class="">0976. Largest Perimeter Triangle</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0900~0999/0977.Squares-of-a-Sorted-Array/" class="">0977. Squares of a Sorted Array</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0900~0999/0978.Longest-Turbulent-Subarray/" class="">0978. Longest Turbulent Subarray</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0900~0999/0979.Distribute-Coins-in-Binary-Tree/" class="">0979. Distribute Coins in Binary Tree</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0900~0999/0980.Unique-Paths-III/" class="">0980. Unique Paths I I I</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0900~0999/0981.Time-Based-Key-Value-Store/" class="">0981. Time Based Key Value Store</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0900~0999/0984.String-Without-AAA-or-BBB/" class="">0984. String Without a a a or B B B</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0900~0999/0985.Sum-of-Even-Numbers-After-Queries/" class="">0985. Sum of Even Numbers After Queries</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0900~0999/0986.Interval-List-Intersections/" class="">0986. Interval List Intersections</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0900~0999/0987.Vertical-Order-Traversal-of-a-Binary-Tree/" class="">0987. Vertical Order Traversal of a Binary Tree</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0900~0999/0989.Add-to-Array-Form-of-Integer/" class="">0989. Add to Array Form of Integer</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0900~0999/0990.Satisfiability-of-Equality-Equations/" class="">0990. Satisfiability of Equality Equations</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0900~0999/0991.Broken-Calculator/" class="">0991. Broken Calculator</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0900~0999/0992.Subarrays-with-K-Different-Integers/" class="">0992. Subarrays With K Different Integers</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0900~0999/0993.Cousins-in-Binary-Tree/" class="">0993. Cousins in Binary Tree</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0900~0999/0995.Minimum-Number-of-K-Consecutive-Bit-Flips/" class="">0995. Minimum Number of K Consecutive Bit Flips</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0900~0999/0996.Number-of-Squareful-Arrays/" class="">0996. Number of Squareful Arrays</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0900~0999/0997.Find-the-Town-Judge/" class="">0997. Find the Town Judge</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/0900~0999/0999.Available-Captures-for-Rook/" class="">0999. Available Captures for Rook</a>
  

        </li>
      
    
  </ul>

        </li>
      
    
      
        <li>
          
  
  

  
    <input type="checkbox" id="section-43ece15340608ec0bb04f18527617cc9" class="toggle"  />
    <label for="section-43ece15340608ec0bb04f18527617cc9" class="flex justify-between">
      <a  class="">1000~1099</a>
    </label>
  

          
  <ul>
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1000~1099/1002.Find-Common-Characters/" class="">1002. Find Common Characters</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1000~1099/1003.Check-If-Word-Is-Valid-After-Substitutions/" class="">1003. Check if Word Is Valid After Substitutions</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1000~1099/1004.Max-Consecutive-Ones-III/" class="">1004. Max Consecutive Ones I I I</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1000~1099/1005.Maximize-Sum-Of-Array-After-K-Negations/" class="">1005. Maximize Sum of Array After K Negations</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1000~1099/1006.Clumsy-Factorial/" class="">1006. Clumsy Factorial</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1000~1099/1009.Complement-of-Base-10-Integer/" class="">1009. Complement of Base 10 Integer</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1000~1099/1010.Pairs-of-Songs-With-Total-Durations-Divisible-by-60/" class="">1010. Pairs of Songs With Total Durations Divisible by 60</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1000~1099/1011.Capacity-To-Ship-Packages-Within-D-Days/" class="">1011. Capacity to Ship Packages Within D Days</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1000~1099/1017.Convert-to-Base-2/" class="">1017. Convert to Base 2</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1000~1099/1018.Binary-Prefix-Divisible-By-5/" class="">1018. Binary Prefix Divisible by 5</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1000~1099/1019.Next-Greater-Node-In-Linked-List/" class="">1019. Next Greater Node in Linked List</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1000~1099/1020.Number-of-Enclaves/" class="">1020. Number of Enclaves</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1000~1099/1021.Remove-Outermost-Parentheses/" class="">1021. Remove Outermost Parentheses</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1000~1099/1022.Sum-of-Root-To-Leaf-Binary-Numbers/" class="">1022. Sum of Root to Leaf Binary Numbers</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1000~1099/1025.Divisor-Game/" class="">1025. Divisor Game</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1000~1099/1026.Maximum-Difference-Between-Node-and-Ancestor/" class="">1026. Maximum Difference Between Node and Ancestor</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1000~1099/1028.Recover-a-Tree-From-Preorder-Traversal/" class="">1028. Recover a Tree From Preorder Traversal</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1000~1099/1030.Matrix-Cells-in-Distance-Order/" class="">1030. Matrix Cells in Distance Order</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1000~1099/1034.Coloring-A-Border/" class="">1034. Coloring a Border</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1000~1099/1037.Valid-Boomerang/" class="">1037. Valid Boomerang</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1000~1099/1038.Binary-Search-Tree-to-Greater-Sum-Tree/" class="">1038. Binary Search Tree to Greater Sum Tree</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1000~1099/1040.Moving-Stones-Until-Consecutive-II/" class="">1040. Moving Stones Until Consecutive I I</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1000~1099/1044.Longest-Duplicate-Substring/" class="">1044. Longest Duplicate Substring</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1000~1099/1047.Remove-All-Adjacent-Duplicates-In-String/" class="">1047. Remove All Adjacent Duplicates in String</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1000~1099/1048.Longest-String-Chain/" class="">1048. Longest String Chain</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1000~1099/1049.Last-Stone-Weight-II/" class="">1049. Last Stone Weight I I</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1000~1099/1051.Height-Checker/" class="">1051. Height Checker</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1000~1099/1052.Grumpy-Bookstore-Owner/" class="">1052. Grumpy Bookstore Owner</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1000~1099/1054.Distant-Barcodes/" class="">1054. Distant Barcodes</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1000~1099/1073.Adding-Two-Negabinary-Numbers/" class="">1073. Adding Two Negabinary Numbers</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1000~1099/1074.Number-of-Submatrices-That-Sum-to-Target/" class="">1074. Number of Submatrices That Sum to Target</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1000~1099/1078.Occurrences-After-Bigram/" class="">1078. Occurrences After Bigram</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1000~1099/1079.Letter-Tile-Possibilities/" class="">1079. Letter Tile Possibilities</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1000~1099/1089.Duplicate-Zeros/" class="">1089. Duplicate Zeros</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1000~1099/1091.Shortest-Path-in-Binary-Matrix/" class="">1091. Shortest Path in Binary Matrix</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1000~1099/1093.Statistics-from-a-Large-Sample/" class="">1093. Statistics From a Large Sample</a>
  

        </li>
      
    
  </ul>

        </li>
      
    
      
        <li>
          
  
  

  
    <input type="checkbox" id="section-6a4b50ae7ed2354ec0ea99d17658f21c" class="toggle"  />
    <label for="section-6a4b50ae7ed2354ec0ea99d17658f21c" class="flex justify-between">
      <a  class="">1100~1199</a>
    </label>
  

          
  <ul>
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1100~1199/1104.Path-In-Zigzag-Labelled-Binary-Tree/" class="">1104. Path in Zigzag Labelled Binary Tree</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1100~1199/1105.Filling-Bookcase-Shelves/" class="">1105. Filling Bookcase Shelves</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1100~1199/1108.Defanging-an-IP-Address/" class="">1108. Defanging an I P Address</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1100~1199/1110.Delete-Nodes-And-Return-Forest/" class="">1110. Delete Nodes and Return Forest</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1100~1199/1111.Maximum-Nesting-Depth-of-Two-Valid-Parentheses-Strings/" class="">1111. Maximum Nesting Depth of Two Valid Parentheses Strings</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1100~1199/1122.Relative-Sort-Array/" class="">1122. Relative Sort Array</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1100~1199/1123.Lowest-Common-Ancestor-of-Deepest-Leaves/" class="">1123. Lowest Common Ancestor of Deepest Leaves</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1100~1199/1128.Number-of-Equivalent-Domino-Pairs/" class="">1128. Number of Equivalent Domino Pairs</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1100~1199/1137.N-th-Tribonacci-Number/" class="">1137. N Th Tribonacci Number</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1100~1199/1143.Longest-Common-Subsequence/" class="">1143. Longest Common Subsequence</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1100~1199/1145.Binary-Tree-Coloring-Game/" class="">1145. Binary Tree Coloring Game</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1100~1199/1154.Day-of-the-Year/" class="">1154. Day of the Year</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1100~1199/1157.Online-Majority-Element-In-Subarray/" class="">1157. Online Majority Element in Subarray</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1100~1199/1160.Find-Words-That-Can-Be-Formed-by-Characters/" class="">1160. Find Words That Can Be Formed by Characters</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1100~1199/1170.Compare-Strings-by-Frequency-of-the-Smallest-Character/" class="">1170. Compare Strings by Frequency of the Smallest Character</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1100~1199/1171.Remove-Zero-Sum-Consecutive-Nodes-from-Linked-List/" class="">1171. Remove Zero Sum Consecutive Nodes From Linked List</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1100~1199/1175.Prime-Arrangements/" class="">1175. Prime Arrangements</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1100~1199/1178.Number-of-Valid-Words-for-Each-Puzzle/" class="">1178. Number of Valid Words for Each Puzzle</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1100~1199/1184.Distance-Between-Bus-Stops/" class="">1184. Distance Between Bus Stops</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1100~1199/1185.Day-of-the-Week/" class="">1185. Day of the Week</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1100~1199/1189.Maximum-Number-of-Balloons/" class="">1189. Maximum Number of Balloons</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1100~1199/1190.Reverse-Substrings-Between-Each-Pair-of-Parentheses/" class="">1190. Reverse Substrings Between Each Pair of Parentheses</a>
  

        </li>
      
    
  </ul>

        </li>
      
    
      
        <li>
          
  
  

  
    <input type="checkbox" id="section-9bf5c0cab2b475b1303bd2173774392e" class="toggle"  />
    <label for="section-9bf5c0cab2b475b1303bd2173774392e" class="flex justify-between">
      <a  class="">1200~1299</a>
    </label>
  

          
  <ul>
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1200~1299/1200.Minimum-Absolute-Difference/" class="">1200. Minimum Absolute Difference</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1200~1299/1201.Ugly-Number-III/" class="">1201. Ugly Number I I I</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1200~1299/1202.Smallest-String-With-Swaps/" class="">1202. Smallest String With Swaps</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1200~1299/1203.Sort-Items-by-Groups-Respecting-Dependencies/" class="">1203. Sort Items by Groups Respecting Dependencies</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1200~1299/1207.Unique-Number-of-Occurrences/" class="">1207. Unique Number of Occurrences</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1200~1299/1208.Get-Equal-Substrings-Within-Budget/" class="">1208. Get Equal Substrings Within Budget</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1200~1299/1209.Remove-All-Adjacent-Duplicates-in-String-II/" class="">1209. Remove All Adjacent Duplicates in String I I</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1200~1299/1217.Minimum-Cost-to-Move-Chips-to-The-Same-Position/" class="">1217. Minimum Cost to Move Chips to the Same Position</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1200~1299/1221.Split-a-String-in-Balanced-Strings/" class="">1221. Split a String in Balanced Strings</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1200~1299/1232.Check-If-It-Is-a-Straight-Line/" class="">1232. Check if It Is a Straight Line</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1200~1299/1234.Replace-the-Substring-for-Balanced-String/" class="">1234. Replace the Substring for Balanced String</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1200~1299/1235.Maximum-Profit-in-Job-Scheduling/" class="">1235. Maximum Profit in Job Scheduling</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1200~1299/1239.Maximum-Length-of-a-Concatenated-String-with-Unique-Characters/" class="">1239. Maximum Length of a Concatenated String With Unique Characters</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1200~1299/1249.Minimum-Remove-to-Make-Valid-Parentheses/" class="">1249. Minimum Remove to Make Valid Parentheses</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1200~1299/1252.Cells-with-Odd-Values-in-a-Matrix/" class="">1252. Cells With Odd Values in a Matrix</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1200~1299/1254.Number-of-Closed-Islands/" class="">1254. Number of Closed Islands</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1200~1299/1260.Shift-2D-Grid/" class="">1260. Shift 2 D Grid</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1200~1299/1266.Minimum-Time-Visiting-All-Points/" class="">1266. Minimum Time Visiting All Points</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1200~1299/1268.Search-Suggestions-System/" class="">1268. Search Suggestions System</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1200~1299/1275.Find-Winner-on-a-Tic-Tac-Toe-Game/" class="">1275. Find Winner on a Tic Tac Toe Game</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1200~1299/1281.Subtract-the-Product-and-Sum-of-Digits-of-an-Integer/" class="">1281. Subtract the Product and Sum of Digits of an Integer</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1200~1299/1283.Find-the-Smallest-Divisor-Given-a-Threshold/" class="">1283. Find the Smallest Divisor Given a Threshold</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1200~1299/1287.Element-Appearing-More-Than-25-In-Sorted-Array/" class="">1287. Element Appearing More Than 25 in Sorted Array</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1200~1299/1290.Convert-Binary-Number-in-a-Linked-List-to-Integer/" class="">1290. Convert Binary Number in a Linked List to Integer</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1200~1299/1292.Maximum-Side-Length-of-a-Square-with-Sum-Less-than-or-Equal-to-Threshold/" class="">1292. Maximum Side Length of a Square With Sum Less Than or Equal to Threshold</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1200~1299/1293.Shortest-Path-in-a-Grid-with-Obstacles-Elimination/" class="">1293. Shortest Path in a Grid With Obstacles Elimination</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1200~1299/1295.Find-Numbers-with-Even-Number-of-Digits/" class="">1295. Find Numbers With Even Number of Digits</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1200~1299/1296.Divide-Array-in-Sets-of-K-Consecutive-Numbers/" class="">1296. Divide Array in Sets of K Consecutive Numbers</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1200~1299/1299.Replace-Elements-with-Greatest-Element-on-Right-Side/" class="">1299. Replace Elements With Greatest Element on Right Side</a>
  

        </li>
      
    
  </ul>

        </li>
      
    
      
        <li>
          
  
  

  
    <input type="checkbox" id="section-e15e086de947e7a0ab70d1631216593c" class="toggle"  />
    <label for="section-e15e086de947e7a0ab70d1631216593c" class="flex justify-between">
      <a  class="">1300~1399</a>
    </label>
  

          
  <ul>
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1300~1399/1300.Sum-of-Mutated-Array-Closest-to-Target/" class="">1300. Sum of Mutated Array Closest to Target</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1300~1399/1302.Deepest-Leaves-Sum/" class="">1302. Deepest Leaves Sum</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1300~1399/1304.Find-N-Unique-Integers-Sum-up-to-Zero/" class="">1304. Find N Unique Integers Sum Up to Zero</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1300~1399/1305.All-Elements-in-Two-Binary-Search-Trees/" class="">1305. All Elements in Two Binary Search Trees</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1300~1399/1306.Jump-Game-III/" class="">1306. Jump Game I I I</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1300~1399/1310.XOR-Queries-of-a-Subarray/" class="">1310. X O R Queries of a Subarray</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1300~1399/1313.Decompress-Run-Length-Encoded-List/" class="">1313. Decompress Run Length Encoded List</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1300~1399/1317.Convert-Integer-to-the-Sum-of-Two-No-Zero-Integers/" class="">1317. Convert Integer to the Sum of Two No Zero Integers</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1300~1399/1319.Number-of-Operations-to-Make-Network-Connected/" class="">1319. Number of Operations to Make Network Connected</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1300~1399/1329.Sort-the-Matrix-Diagonally/" class="">1329. Sort the Matrix Diagonally</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1300~1399/1332.Remove-Palindromic-Subsequences/" class="">1332. Remove Palindromic Subsequences</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1300~1399/1337.The-K-Weakest-Rows-in-a-Matrix/" class="">1337. the K Weakest Rows in a Matrix</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1300~1399/1353.Maximum-Number-of-Events-That-Can-Be-Attended/" class="">1353. Maximum Number of Events That Can Be Attended</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1300~1399/1380.Lucky-Numbers-in-a-Matrix/" class="">1380. Lucky Numbers in a Matrix</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1300~1399/1383.Maximum-Performance-of-a-Team/" class="">1383. Maximum Performance of a Team</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1300~1399/1385.Find-the-Distance-Value-Between-Two-Arrays/" class="">1385. Find the Distance Value Between Two Arrays</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1300~1399/1389.Create-Target-Array-in-the-Given-Order/" class="">1389. Create Target Array in the Given Order</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1300~1399/1396.Design-Underground-System/" class="">1396. Design Underground System</a>
  

        </li>
      
    
  </ul>

        </li>
      
    
      
        <li>
          
  
  

  
    <input type="checkbox" id="section-143ad2bd34ee52439a375dae02d013b1" class="toggle"  />
    <label for="section-143ad2bd34ee52439a375dae02d013b1" class="flex justify-between">
      <a  class="">1400~1499</a>
    </label>
  

          
  <ul>
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1400~1499/1423.Maximum-Points-You-Can-Obtain-from-Cards/" class="">1423. Maximum Points You Can Obtain From Cards</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1400~1499/1437.Check-If-All-1s-Are-at-Least-Length-K-Places-Away/" class="">1437. Check if All 1s Are at Least Length K Places Away</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1400~1499/1438.Longest-Continuous-Subarray-With-Absolute-Diff-Less-Than-or-Equal-to-Limit/" class="">1438. Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1400~1499/1439.Find-the-Kth-Smallest-Sum-of-a-Matrix-With-Sorted-Rows/" class="">1439. Find the Kth Smallest Sum of a Matrix With Sorted Rows</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1400~1499/1442.Count-Triplets-That-Can-Form-Two-Arrays-of-Equal-XOR/" class="">1442. Count Triplets That Can Form Two Arrays of Equal X O R</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1400~1499/1446.Consecutive-Characters/" class="">1446. Consecutive Characters</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1400~1499/1455.Check-If-a-Word-Occurs-As-a-Prefix-of-Any-Word-in-a-Sentence/" class="">1455. Check if a Word Occurs as a Prefix of Any Word in a Sentence</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1400~1499/1461.Check-If-a-String-Contains-All-Binary-Codes-of-Size-K/" class="">1461. Check if a String Contains All Binary Codes of Size K</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1400~1499/1463.Cherry-Pickup-II/" class="">1463. Cherry Pickup I I</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1400~1499/1464.Maximum-Product-of-Two-Elements-in-an-Array/" class="">1464. Maximum Product of Two Elements in an Array</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1400~1499/1465.Maximum-Area-of-a-Piece-of-Cake-After-Horizontal-and-Vertical-Cuts/" class="">1465. Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1400~1499/1470.Shuffle-the-Array/" class="">1470. Shuffle the Array</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1400~1499/1480.Running-Sum-of-1d-Array/" class="">1480. Running Sum of 1d Array</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1400~1499/1482.Minimum-Number-of-Days-to-Make-m-Bouquets/" class="">1482. Minimum Number of Days to Make M Bouquets</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1400~1499/1486.XOR-Operation-in-an-Array/" class="">1486. X O R Operation in an Array</a>
  

        </li>
      
    
  </ul>

        </li>
      
    
      
        <li>
          
  
  

  
    <input type="checkbox" id="section-89b1e886fd48e4965d1d8818e365dfa0" class="toggle"  />
    <label for="section-89b1e886fd48e4965d1d8818e365dfa0" class="flex justify-between">
      <a  class="">1500~1599</a>
    </label>
  

          
  <ul>
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1500~1599/1512.Number-of-Good-Pairs/" class="">1512. Number of Good Pairs</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1500~1599/1518.Water-Bottles/" class="">1518. Water Bottles</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1500~1599/1539.Kth-Missing-Positive-Number/" class="">1539. Kth Missing Positive Number</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1500~1599/1551.Minimum-Operations-to-Make-Array-Equal/" class="">1551. Minimum Operations to Make Array Equal</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1500~1599/1572.Matrix-Diagonal-Sum/" class="">1572. Matrix Diagonal Sum</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1500~1599/1573.Number-of-Ways-to-Split-a-String/" class="">1573. Number of Ways to Split a String</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1500~1599/1576.Replace-All-s-to-Avoid-Consecutive-Repeating-Characters/" class="">1576. Replace All S to Avoid Consecutive Repeating Characters</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1500~1599/1579.Remove-Max-Number-of-Edges-to-Keep-Graph-Fully-Traversable/" class="">1579. Remove Max Number of Edges to Keep Graph Fully Traversable</a>
  

        </li>
      
    
  </ul>

        </li>
      
    
      
        <li>
          
  
  

  
    <input type="checkbox" id="section-3c3cf70fe82c57e07ad9cf7341846196" class="toggle"  />
    <label for="section-3c3cf70fe82c57e07ad9cf7341846196" class="flex justify-between">
      <a  class="">1600~1699</a>
    </label>
  

          
  <ul>
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1600~1699/1600.Throne-Inheritance/" class="">1600. Throne Inheritance</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1600~1699/1603.Design-Parking-System/" class="">1603. Design Parking System</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1600~1699/1608.Special-Array-With-X-Elements-Greater-Than-or-Equal-X/" class="">1608. Special Array With X Elements Greater Than or Equal X</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1600~1699/1609.Even-Odd-Tree/" class="">1609. Even Odd Tree</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1600~1699/1614.Maximum-Nesting-Depth-of-the-Parentheses/" class="">1614. Maximum Nesting Depth of the Parentheses</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1600~1699/1619.Mean-of-Array-After-Removing-Some-Elements/" class="">1619. Mean of Array After Removing Some Elements</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1600~1699/1624.Largest-Substring-Between-Two-Equal-Characters/" class="">1624. Largest Substring Between Two Equal Characters</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1600~1699/1629.Slowest-Key/" class="">1629. Slowest Key</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1600~1699/1631.Path-With-Minimum-Effort/" class="">1631. Path With Minimum Effort</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1600~1699/1636.Sort-Array-by-Increasing-Frequency/" class="">1636. Sort Array by Increasing Frequency</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1600~1699/1640.Check-Array-Formation-Through-Concatenation/" class="">1640. Check Array Formation Through Concatenation</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1600~1699/1641.Count-Sorted-Vowel-Strings/" class="">1641. Count Sorted Vowel Strings</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1600~1699/1642.Furthest-Building-You-Can-Reach/" class="">1642. Furthest Building You Can Reach</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1600~1699/1646.Get-Maximum-in-Generated-Array/" class="">1646. Get Maximum in Generated Array</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1600~1699/1647.Minimum-Deletions-to-Make-Character-Frequencies-Unique/" class="">1647. Minimum Deletions to Make Character Frequencies Unique</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1600~1699/1648.Sell-Diminishing-Valued-Colored-Balls/" class="">1648. Sell Diminishing Valued Colored Balls</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1600~1699/1649.Create-Sorted-Array-through-Instructions/" class="">1649. Create Sorted Array Through Instructions</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1600~1699/1652.Defuse-the-Bomb/" class="">1652. Defuse the Bomb</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1600~1699/1653.Minimum-Deletions-to-Make-String-Balanced/" class="">1653. Minimum Deletions to Make String Balanced</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1600~1699/1654.Minimum-Jumps-to-Reach-Home/" class="">1654. Minimum Jumps to Reach Home</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1600~1699/1655.Distribute-Repeating-Integers/" class="">1655. Distribute Repeating Integers</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1600~1699/1656.Design-an-Ordered-Stream/" class="">1656. Design an Ordered Stream</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1600~1699/1657.Determine-if-Two-Strings-Are-Close/" class="">1657. Determine if Two Strings Are Close</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1600~1699/1658.Minimum-Operations-to-Reduce-X-to-Zero/" class="">1658. Minimum Operations to Reduce X to Zero</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1600~1699/1659.Maximize-Grid-Happiness/" class="">1659. Maximize Grid Happiness</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1600~1699/1662.Check-If-Two-String-Arrays-are-Equivalent/" class="">1662. Check if Two String Arrays Are Equivalent</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1600~1699/1663.Smallest-String-With-A-Given-Numeric-Value/" class="">1663. Smallest String With a Given Numeric Value</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1600~1699/1664.Ways-to-Make-a-Fair-Array/" class="">1664. Ways to Make a Fair Array</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1600~1699/1665.Minimum-Initial-Energy-to-Finish-Tasks/" class="">1665. Minimum Initial Energy to Finish Tasks</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1600~1699/1668.Maximum-Repeating-Substring/" class="">1668. Maximum Repeating Substring</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1600~1699/1669.Merge-In-Between-Linked-Lists/" class="">1669. Merge in Between Linked Lists</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1600~1699/1670.Design-Front-Middle-Back-Queue/" class="">1670. Design Front Middle Back Queue</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1600~1699/1672.Richest-Customer-Wealth/" class="">1672. Richest Customer Wealth</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1600~1699/1673.Find-the-Most-Competitive-Subsequence/" class="">1673. Find the Most Competitive Subsequence</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1600~1699/1674.Minimum-Moves-to-Make-Array-Complementary/" class="">1674. Minimum Moves to Make Array Complementary</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1600~1699/1675.Minimize-Deviation-in-Array/" class="">1675. Minimize Deviation in Array</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1600~1699/1678.Goal-Parser-Interpretation/" class="">1678. Goal Parser Interpretation</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1600~1699/1679.Max-Number-of-K-Sum-Pairs/" class="">1679. Max Number of K Sum Pairs</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1600~1699/1680.Concatenation-of-Consecutive-Binary-Numbers/" class="">1680. Concatenation of Consecutive Binary Numbers</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1600~1699/1681.Minimum-Incompatibility/" class="">1681. Minimum Incompatibility</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1600~1699/1684.Count-the-Number-of-Consistent-Strings/" class="">1684. Count the Number of Consistent Strings</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1600~1699/1685.Sum-of-Absolute-Differences-in-a-Sorted-Array/" class="">1685. Sum of Absolute Differences in a Sorted Array</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1600~1699/1688.Count-of-Matches-in-Tournament/" class="">1688. Count of Matches in Tournament</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1600~1699/1689.Partitioning-Into-Minimum-Number-Of-Deci-Binary-Numbers/" class="">1689. Partitioning Into Minimum Number of Deci Binary Numbers</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1600~1699/1690.Stone-Game-VII/" class="">1690. Stone Game v I I</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1600~1699/1691.Maximum-Height-by-Stacking-Cuboids/" class="">1691. Maximum Height by Stacking Cuboids</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1600~1699/1694.Reformat-Phone-Number/" class="">1694. Reformat Phone Number</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1600~1699/1695.Maximum-Erasure-Value/" class="">1695. Maximum Erasure Value</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1600~1699/1696.Jump-Game-VI/" class="">1696. Jump Game v I</a>
  

        </li>
      
    
  </ul>

        </li>
      
    
      
        <li>
          
  
  

  
    <input type="checkbox" id="section-8a09b47c73a63bb9da34f25e6d8af69a" class="toggle"  />
    <label for="section-8a09b47c73a63bb9da34f25e6d8af69a" class="flex justify-between">
      <a  class="">1700~1799</a>
    </label>
  

          
  <ul>
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1700~1799/1700.Number-of-Students-Unable-to-Eat-Lunch/" class="">1700. Number of Students Unable to Eat Lunch</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1700~1799/1704.Determine-if-String-Halves-Are-Alike/" class="">1704. Determine if String Halves Are Alike</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1700~1799/1705.Maximum-Number-of-Eaten-Apples/" class="">1705. Maximum Number of Eaten Apples</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1700~1799/1710.Maximum-Units-on-a-Truck/" class="">1710. Maximum Units on a Truck</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1700~1799/1716.Calculate-Money-in-Leetcode-Bank/" class="">1716. Calculate Money in Leetcode Bank</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1700~1799/1720.Decode-XORed-Array/" class="">1720. Decode X O Red Array</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1700~1799/1721.Swapping-Nodes-in-a-Linked-List/" class="">1721. Swapping Nodes in a Linked List</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1700~1799/1725.Number-Of-Rectangles-That-Can-Form-The-Largest-Square/" class="">1725. Number of Rectangles That Can Form the Largest Square</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1700~1799/1732.Find-the-Highest-Altitude/" class="">1732. Find the Highest Altitude</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1700~1799/1734.Decode-XORed-Permutation/" class="">1734. Decode X O Red Permutation</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1700~1799/1736.Latest-Time-by-Replacing-Hidden-Digits/" class="">1736. Latest Time by Replacing Hidden Digits</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1700~1799/1738.Find-Kth-Largest-XOR-Coordinate-Value/" class="">1738. Find Kth Largest X O R Coordinate Value</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1700~1799/1742.Maximum-Number-of-Balls-in-a-Box/" class="">1742. Maximum Number of Balls in a Box</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1700~1799/1744.Can-You-Eat-Your-Favorite-Candy-on-Your-Favorite-Day/" class="">1744. Can You Eat Your Favorite Candy on Your Favorite Day</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1700~1799/1748.Sum-of-Unique-Elements/" class="">1748. Sum of Unique Elements</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1700~1799/1752.Check-if-Array-Is-Sorted-and-Rotated/" class="">1752. Check if Array Is Sorted and Rotated</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1700~1799/1758.Minimum-Changes-To-Make-Alternating-Binary-String/" class="">1758. Minimum Changes to Make Alternating Binary String</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1700~1799/1763.Longest-Nice-Substring/" class="">1763. Longest Nice Substring</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1700~1799/1791.Find-Center-of-Star-Graph/" class="">1791. Find Center of Star Graph</a>
  

        </li>
      
    
  </ul>

        </li>
      
    
      
        <li>
          
  
  

  
    <input type="checkbox" id="section-71addf2985f721c74acd31fd9d3f2244" class="toggle"  />
    <label for="section-71addf2985f721c74acd31fd9d3f2244" class="flex justify-between">
      <a  class="">1800~1899</a>
    </label>
  

          
  <ul>
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1800~1899/1816.Truncate-Sentence/" class="">1816. Truncate Sentence</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1800~1899/1818.Minimum-Absolute-Sum-Difference/" class="">1818. Minimum Absolute Sum Difference</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1800~1899/1846.Maximum-Element-After-Decreasing-and-Rearranging/" class="">1846. Maximum Element After Decreasing and Rearranging</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1800~1899/1877.Minimize-Maximum-Pair-Sum-in-Array/" class="">1877. Minimize Maximum Pair Sum in Array</a>
  

        </li>
      
    
  </ul>

        </li>
      
    
      
        <li>
          
  
  

  
    <input type="checkbox" id="section-acf559d79ed44339dc871c3434141adc" class="toggle"  />
    <label for="section-acf559d79ed44339dc871c3434141adc" class="flex justify-between">
      <a  class="">1900~1999</a>
    </label>
  

          
  <ul>
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/1900~1999/1984.Minimum-Difference-Between-Highest-and-Lowest-of-K-Scores/" class="">1984. Minimum Difference Between Highest and Lowest of K Scores</a>
  

        </li>
      
    
  </ul>

        </li>
      
    
      
        <li>
          
  
  

  
    <input type="checkbox" id="section-907d283ba262307805e7ef8acf32a7f6" class="toggle"  />
    <label for="section-907d283ba262307805e7ef8acf32a7f6" class="flex justify-between">
      <a  class="">2000~2099</a>
    </label>
  

          
  <ul>
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/2000~2099/2021.Brightest-Position-on-Street/" class="">2021. Brightest Position on Street</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/2000~2099/2022.Convert-1D-Array-Into-2D-Array/" class="">2022. Convert 1 D Array Into 2 D Array</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/2000~2099/2037.Minimum-Number-of-Moves-to-Seat-Everyone/" class="">2037. Minimum Number of Moves to Seat Everyone</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/2000~2099/2038.Remove-Colored-Pieces-if-Both-Neighbors-are-the-Same-Color/" class="">2038. Remove Colored Pieces if Both Neighbors Are the Same Color</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/2000~2099/2043.Simple-Bank-System/" class="">2043. Simple Bank System</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/2000~2099/2096.Step-By-Step-Directions-From-a-Binary-Tree-Node-to-Another/" class="">2096. Step by Step Directions From a Binary Tree Node to Another</a>
  

        </li>
      
    
  </ul>

        </li>
      
    
      
        <li>
          
  
  

  
    <input type="checkbox" id="section-5bd66ec192eaf5c1db789f860a836725" class="toggle"  />
    <label for="section-5bd66ec192eaf5c1db789f860a836725" class="flex justify-between">
      <a  class="">2100~2199</a>
    </label>
  

          
  <ul>
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/2100~2199/2164.Sort-Even-and-Odd-Indices-Independently/" class="">2164. Sort Even and Odd Indices Independently</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/2100~2199/2165.Smallest-Value-of-the-Rearranged-Number/" class="">2165. Smallest Value of the Rearranged Number</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/2100~2199/2166.Design-Bitset/" class="">2166. Design Bitset</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/2100~2199/2167.Minimum-Time-to-Remove-All-Cars-Containing-Illegal-Goods/" class="">2167. Minimum Time to Remove All Cars Containing Illegal Goods</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/2100~2199/2169.Count-Operations-to-Obtain-Zero/" class="">2169. Count Operations to Obtain Zero</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/2100~2199/2170.Minimum-Operations-to-Make-the-Array-Alternating/" class="">2170. Minimum Operations to Make the Array Alternating</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/2100~2199/2171.Removing-Minimum-Number-of-Magic-Beans/" class="">2171. Removing Minimum Number of Magic Beans</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/2100~2199/2180.Count-Integers-With-Even-Digit-Sum/" class="">2180. Count Integers With Even Digit Sum</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/2100~2199/2181.Merge-Nodes-in-Between-Zeros/" class="">2181. Merge Nodes in Between Zeros</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/2100~2199/2182.Construct-String-With-Repeat-Limit/" class="">2182. Construct String With Repeat Limit</a>
  

        </li>
      
    
      
        <li>
          
  
  

  
    <a href="https://books.halfrost.com/leetcode/en/ChapterFour/2100~2199/2183.Count-Array-Pairs-Divisible-by-K/" class="">2183. Count Array Pairs Divisible by K</a>
  

        </li>
      
    
  </ul>

        </li>
      
    
      
        <li>
          
  
  

  
    <input type="checkbox" id="section-8bb7a88dcc459ad0d794d77897637003" class="toggle"  />
    <label for="section-8bb7a88dcc459ad0d794d77897637003" class="flex justify-between">
      <a  class="">2200~2299</a>
    </label>
  

          
  <ul>
    
  </ul>

        </li>
      
    
  </ul>

        </li>
      
    
  </ul>















</nav>




  <script>(function(){var SCROLL_KEY="menu.scrollTop";var TOGGLE_KEY="menu.toggles";function getMenu(){return(document.querySelector("aside.book-menu .book-menu-content")||document.querySelector("aside.book-menu nav"));}
function loadToggles(){try{return JSON.parse(localStorage.getItem(TOGGLE_KEY)||"{}")||{};}catch(e){return{};}}
function restoreToggles(){var saved=loadToggles();var toggles=document.querySelectorAll("aside.book-menu .toggle");for(var i=0;i<toggles.length;i++){var cb=toggles[i];if(cb.id&&Object.prototype.hasOwnProperty.call(saved,cb.id)){cb.checked=saved[cb.id];}}
var active=document.querySelector("aside.book-menu a.active");if(active){var node=active.parentElement;while(node&&node.closest&&node.closest("aside.book-menu")){if(node.tagName==="LI"){var t=node.querySelector(":scope > .toggle");if(t){t.checked=true;}}
node=node.parentElement;}}}
function bindToggles(){var toggles=document.querySelectorAll("aside.book-menu .toggle");for(var i=0;i<toggles.length;i++){(function(cb){cb.addEventListener("change",function(){var saved=loadToggles();saved[cb.id]=cb.checked;localStorage.setItem(TOGGLE_KEY,JSON.stringify(saved));});})(toggles[i]);}}
function restoreScroll(){var menu=getMenu();if(!menu){return;}
var saved=localStorage.getItem(SCROLL_KEY);if(saved!==null){menu.scrollTop=parseInt(saved,10)||0;}}
var scrollBound=false;function bindScroll(){if(scrollBound){return;}
var menu=getMenu();if(!menu){return;}
scrollBound=true;menu.addEventListener("scroll",function(){localStorage.setItem(SCROLL_KEY,menu.scrollTop);},{passive:true});}
var savedScroll=parseInt(localStorage.getItem(SCROLL_KEY)||"0",10)||0;var stopPinAt=null;var frames=0;var userInteracted=false;function stopPinning(){if(userInteracted){return;}
userInteracted=true;bindScroll();}
function bindInteraction(){var menu=getMenu();var target=menu||document;["wheel","touchstart","pointerdown","keydown"].forEach(function(ev){target.addEventListener(ev,stopPinning,{passive:true});});}
function pin(){if(userInteracted){return;}
var menu=getMenu();if(menu&&savedScroll>0&&menu.scrollTop!==savedScroll){menu.scrollTop=savedScroll;}
frames++;if(stopPinAt!==null&&frames>stopPinAt){bindScroll();return;}
if(frames<600){requestAnimationFrame(pin);}else{bindScroll();}}
window.addEventListener("load",function(){if(stopPinAt===null){stopPinAt=frames+20;}
if(!userInteracted){restoreScroll();}});restoreToggles();restoreScroll();bindInteraction();requestAnimationFrame(pin);document.addEventListener("DOMContentLoaded",function(){restoreToggles();bindToggles();bindInteraction();});})();</script>


 
      </div>
    </aside>

    <div class="book-page">
      <header class="book-header">
        
  <div class="flex align-center justify-between">
  <label for="menu-control">
    <img src="/leetcode/svg/menu.svg" class="book-icon" alt="Menu" />
  </label>

  <strong>2.05 ✅ Stack</strong>

  <label for="toc-control">
    
    <img src="/leetcode/svg/toc.svg" class="book-icon" alt="Table of Contents" />
    
  </label>
</div>


  
  <aside class="hidden clearfix">
    
  
<nav id="TableOfContents"></nav>



  </aside>
  
 
      </header>

      
      
  <article class="markdown"><h1 id="stack">
  Stack
  <a class="anchor" href="#stack">#</a>
</h1>
<p>
  <img src="https://img.halfrost.com/Leetcode/Stack.png" alt="" /></p>
<ul>
<li>Parentheses matching problems and similar problems. Problem 20, Problem 921, Problem 1021.</li>
<li>Basic stack pop and push operations. Problem 71, Problem 150, Problem 155, Problem 224, Problem 225, Problem 232, Problem 946, Problem 1047.</li>
<li>Encoding problems using a stack. Problem 394, Problem 682, Problem 856, Problem 880.</li>
<li><strong>Monotonic stack</strong>. <strong>Use a stack to maintain a monotonically increasing or decreasing index array</strong>. Problem 84, Problem 456, Problem 496, Problem 503, Problem 739, Problem 901, Problem 907, Problem 1019.</li>
</ul>
<table>
<thead>
<tr>
<th align="center">No.</th>
<th align="left">Title</th>
<th align="center">Solution</th>
<th align="center">Difficulty</th>
<th align="center">TimeComplexity</th>
<th align="center">SpaceComplexity</th>
<th align="center">Favorite</th>
<th align="center">Acceptance</th>
</tr>
</thead>
<tbody>
<tr>
<td align="center">0020</td>
<td align="left">Valid Parentheses</td>
<td align="center">
  <a href="/leetcode/en/ChapterFour/0001~0099/0020.Valid-Parentheses/">Go</a></td>
<td align="center">Easy</td>
<td align="center">O(log n)</td>
<td align="center">O(1)</td>
<td align="center"></td>
<td align="center">40.2%</td>
</tr>
<tr>
<td align="center">0032</td>
<td align="left">Longest Valid Parentheses</td>
<td align="center">
  <a href="/leetcode/en/ChapterFour/0001~0099/0032.Longest-Valid-Parentheses/">Go</a></td>
<td align="center">Hard</td>
<td align="center"></td>
<td align="center"></td>
<td align="center"></td>
<td align="center">32.8%</td>
</tr>
<tr>
<td align="center">0042</td>
<td align="left">Trapping Rain Water</td>
<td align="center">
  <a href="/leetcode/en/ChapterFour/0001~0099/0042.Trapping-Rain-Water/">Go</a></td>
<td align="center">Hard</td>
<td align="center">O(n)</td>
<td align="center">O(1)</td>
<td align="center">❤️</td>
<td align="center">59.2%</td>
</tr>
<tr>
<td align="center">0071</td>
<td align="left">Simplify Path</td>
<td align="center">
  <a href="/leetcode/en/ChapterFour/0001~0099/0071.Simplify-Path/">Go</a></td>
<td align="center">Medium</td>
<td align="center">O(n)</td>
<td align="center">O(n)</td>
<td align="center">❤️</td>
<td align="center">39.3%</td>
</tr>
<tr>
<td align="center">0084</td>
<td align="left">Largest Rectangle in Histogram</td>
<td align="center">
  <a href="/leetcode/en/ChapterFour/0001~0099/0084.Largest-Rectangle-in-Histogram/">Go</a></td>
<td align="center">Hard</td>
<td align="center">O(n)</td>
<td align="center">O(n)</td>
<td align="center">❤️</td>
<td align="center">42.6%</td>
</tr>
<tr>
<td align="center">0094</td>
<td align="left">Binary Tree Inorder Traversal</td>
<td align="center">
  <a href="/leetcode/en/ChapterFour/0001~0099/0094.Binary-Tree-Inorder-Traversal/">Go</a></td>
<td align="center">Easy</td>
<td align="center">O(n)</td>
<td align="center">O(1)</td>
<td align="center"></td>
<td align="center">73.8%</td>
</tr>
<tr>
<td align="center">0114</td>
<td align="left">Flatten Binary Tree to Linked List</td>
<td align="center">
  <a href="/leetcode/en/ChapterFour/0100~0199/0114.Flatten-Binary-Tree-to-Linked-List/">Go</a></td>
<td align="center">Medium</td>
<td align="center"></td>
<td align="center"></td>
<td align="center"></td>
<td align="center">61.8%</td>
</tr>
<tr>
<td align="center">0143</td>
<td align="left">Reorder List</td>
<td align="center">
  <a href="/leetcode/en/ChapterFour/0100~0199/0143.Reorder-List/">Go</a></td>
<td align="center">Medium</td>
<td align="center"></td>
<td align="center"></td>
<td align="center"></td>
<td align="center">52.5%</td>
</tr>
<tr>
<td align="center">0144</td>
<td align="left">Binary Tree Preorder Traversal</td>
<td align="center">
  <a href="/leetcode/en/ChapterFour/0100~0199/0144.Binary-Tree-Preorder-Traversal/">Go</a></td>
<td align="center">Easy</td>
<td align="center">O(n)</td>
<td align="center">O(1)</td>
<td align="center"></td>
<td align="center">66.8%</td>
</tr>
<tr>
<td align="center">0145</td>
<td align="left">Binary Tree Postorder Traversal</td>
<td align="center">
  <a href="/leetcode/en/ChapterFour/0100~0199/0145.Binary-Tree-Postorder-Traversal/">Go</a></td>
<td align="center">Easy</td>
<td align="center">O(n)</td>
<td align="center">O(1)</td>
<td align="center"></td>
<td align="center">67.9%</td>
</tr>
<tr>
<td align="center">0150</td>
<td align="left">Evaluate Reverse Polish Notation</td>
<td align="center">
  <a href="/leetcode/en/ChapterFour/0100~0199/0150.Evaluate-Reverse-Polish-Notation/">Go</a></td>
<td align="center">Medium</td>
<td align="center">O(n)</td>
<td align="center">O(1)</td>
<td align="center"></td>
<td align="center">45.7%</td>
</tr>
<tr>
<td align="center">0155</td>
<td align="left">Min Stack</td>
<td align="center">
  <a href="/leetcode/en/ChapterFour/0100~0199/0155.Min-Stack/">Go</a></td>
<td align="center">Medium</td>
<td align="center">O(n)</td>
<td align="center">O(n)</td>
<td align="center"></td>
<td align="center">52.3%</td>
</tr>
<tr>
<td align="center">0173</td>
<td align="left">Binary Search Tree Iterator</td>
<td align="center">
  <a href="/leetcode/en/ChapterFour/0100~0199/0173.Binary-Search-Tree-Iterator/">Go</a></td>
<td align="center">Medium</td>
<td align="center">O(n)</td>
<td align="center">O(1)</td>
<td align="center"></td>
<td align="center">69.7%</td>
</tr>
<tr>
<td align="center">0224</td>
<td align="left">Basic Calculator</td>
<td align="center">
  <a href="/leetcode/en/ChapterFour/0200~0299/0224.Basic-Calculator/">Go</a></td>
<td align="center">Hard</td>
<td align="center">O(n)</td>
<td align="center">O(n)</td>
<td align="center"></td>
<td align="center">42.4%</td>
</tr>
<tr>
<td align="center">0225</td>
<td align="left">Implement Stack using Queues</td>
<td align="center">
  <a href="/leetcode/en/ChapterFour/0200~0299/0225.Implement-Stack-using-Queues/">Go</a></td>
<td align="center">Easy</td>
<td align="center">O(n)</td>
<td align="center">O(n)</td>
<td align="center"></td>
<td align="center">58.6%</td>
</tr>
<tr>
<td align="center">0227</td>
<td align="left">Basic Calculator II</td>
<td align="center">
  <a href="/leetcode/en/ChapterFour/0200~0299/0227.Basic-Calculator-II/">Go</a></td>
<td align="center">Medium</td>
<td align="center"></td>
<td align="center"></td>
<td align="center"></td>
<td align="center">42.4%</td>
</tr>
<tr>
<td align="center">0232</td>
<td align="left">Implement Queue using Stacks</td>
<td align="center">
  <a href="/leetcode/en/ChapterFour/0200~0299/0232.Implement-Queue-using-Stacks/">Go</a></td>
<td align="center">Easy</td>
<td align="center">O(n)</td>
<td align="center">O(n)</td>
<td align="center"></td>
<td align="center">63.2%</td>
</tr>
<tr>
<td align="center">0234</td>
<td align="left">Palindrome Linked List</td>
<td align="center">
  <a href="/leetcode/en/ChapterFour/0200~0299/0234.Palindrome-Linked-List/">Go</a></td>
<td align="center">Easy</td>
<td align="center"></td>
<td align="center"></td>
<td align="center"></td>
<td align="center">50.2%</td>
</tr>
<tr>
<td align="center">0331</td>
<td align="left">Verify Preorder Serialization of a Binary Tree</td>
<td align="center">
  <a href="/leetcode/en/ChapterFour/0300~0399/0331.Verify-Preorder-Serialization-of-a-Binary-Tree/">Go</a></td>
<td align="center">Medium</td>
<td align="center">O(n)</td>
<td align="center">O(1)</td>
<td align="center"></td>
<td align="center">44.6%</td>
</tr>
<tr>
<td align="center">0341</td>
<td align="left">Flatten Nested List Iterator</td>
<td align="center">
  <a href="/leetcode/en/ChapterFour/0300~0399/0341.Flatten-Nested-List-Iterator/">Go</a></td>
<td align="center">Medium</td>
<td align="center"></td>
<td align="center"></td>
<td align="center"></td>
<td align="center">61.8%</td>
</tr>
<tr>
<td align="center">0385</td>
<td align="left">Mini Parser</td>
<td align="center">
  <a href="/leetcode/en/ChapterFour/0300~0399/0385.Mini-Parser/">Go</a></td>
<td align="center">Medium</td>
<td align="center"></td>
<td align="center"></td>
<td align="center"></td>
<td align="center">36.9%</td>
</tr>
<tr>
<td align="center">0394</td>
<td align="left">Decode String</td>
<td align="center">
  <a href="/leetcode/en/ChapterFour/0300~0399/0394.Decode-String/">Go</a></td>
<td align="center">Medium</td>
<td align="center">O(n)</td>
<td align="center">O(n)</td>
<td align="center"></td>
<td align="center">57.9%</td>
</tr>
<tr>
<td align="center">0402</td>
<td align="left">Remove K Digits</td>
<td align="center">
  <a href="/leetcode/en/ChapterFour/0400~0499/0402.Remove-K-Digits/">Go</a></td>
<td align="center">Medium</td>
<td align="center">O(n)</td>
<td align="center">O(1)</td>
<td align="center"></td>
<td align="center">30.6%</td>
</tr>
<tr>
<td align="center">0445</td>
<td align="left">Add Two Numbers II</td>
<td align="center">
  <a href="/leetcode/en/ChapterFour/0400~0499/0445.Add-Two-Numbers-II/">Go</a></td>
<td align="center">Medium</td>
<td align="center"></td>
<td align="center"></td>
<td align="center"></td>
<td align="center">59.6%</td>
</tr>
<tr>
<td align="center">0456</td>
<td align="left">132 Pattern</td>
<td align="center">
  <a href="/leetcode/en/ChapterFour/0400~0499/0456.132-Pattern/">Go</a></td>
<td align="center">Medium</td>
<td align="center">O(n)</td>
<td align="center">O(n)</td>
<td align="center"></td>
<td align="center">32.4%</td>
</tr>
<tr>
<td align="center">0496</td>
<td align="left">Next Greater Element I</td>
<td align="center">
  <a href="/leetcode/en/ChapterFour/0400~0499/0496.Next-Greater-Element-I/">Go</a></td>
<td align="center">Easy</td>
<td align="center">O(n)</td>
<td align="center">O(n)</td>
<td align="center"></td>
<td align="center">71.4%</td>
</tr>
<tr>
<td align="center">0503</td>
<td align="left">Next Greater Element II</td>
<td align="center">
  <a href="/leetcode/en/ChapterFour/0500~0599/0503.Next-Greater-Element-II/">Go</a></td>
<td align="center">Medium</td>
<td align="center">O(n)</td>
<td align="center">O(n)</td>
<td align="center"></td>
<td align="center">63.2%</td>
</tr>
<tr>
<td align="center">0581</td>
<td align="left">Shortest Unsorted Continuous Subarray</td>
<td align="center">
  <a href="/leetcode/en/ChapterFour/0500~0599/0581.Shortest-Unsorted-Continuous-Subarray/">Go</a></td>
<td align="center">Medium</td>
<td align="center"></td>
<td align="center"></td>
<td align="center"></td>
<td align="center">36.4%</td>
</tr>
<tr>
<td align="center">0589</td>
<td align="left">N-ary Tree Preorder Traversal</td>
<td align="center">
  <a href="/leetcode/en/ChapterFour/0500~0599/0589.N-ary-Tree-Preorder-Traversal/">Go</a></td>
<td align="center">Easy</td>
<td align="center"></td>
<td align="center"></td>
<td align="center"></td>
<td align="center">75.9%</td>
</tr>
<tr>
<td align="center">0636</td>
<td align="left">Exclusive Time of Functions</td>
<td align="center">
  <a href="/leetcode/en/ChapterFour/0600~0699/0636.Exclusive-Time-of-Functions/">Go</a></td>
<td align="center">Medium</td>
<td align="center">O(n)</td>
<td align="center">O(n)</td>
<td align="center"></td>
<td align="center">61.2%</td>
</tr>
<tr>
<td align="center">0682</td>
<td align="left">Baseball Game</td>
<td align="center">
  <a href="/leetcode/en/ChapterFour/0600~0699/0682.Baseball-Game/">Go</a></td>
<td align="center">Easy</td>
<td align="center">O(n)</td>
<td align="center">O(n)</td>
<td align="center"></td>
<td align="center">74.3%</td>
</tr>
<tr>
<td align="center">0726</td>
<td align="left">Number of Atoms</td>
<td align="center">
  <a href="/leetcode/en/ChapterFour/0700~0799/0726.Number-of-Atoms/">Go</a></td>
<td align="center">Hard</td>
<td align="center">O(n)</td>
<td align="center">O(n)</td>
<td align="center">❤️</td>
<td align="center">52.1%</td>
</tr>
<tr>
<td align="center">0735</td>
<td align="left">Asteroid Collision</td>
<td align="center">
  <a href="/leetcode/en/ChapterFour/0700~0799/0735.Asteroid-Collision/">Go</a></td>
<td align="center">Medium</td>
<td align="center">O(n)</td>
<td align="center">O(n)</td>
<td align="center"></td>
<td align="center">44.4%</td>
</tr>
<tr>
<td align="center">0739</td>
<td align="left">Daily Temperatures</td>
<td align="center">
  <a href="/leetcode/en/ChapterFour/0700~0799/0739.Daily-Temperatures/">Go</a></td>
<td align="center">Medium</td>
<td align="center">O(n)</td>
<td align="center">O(n)</td>
<td align="center"></td>
<td align="center">66.3%</td>
</tr>
<tr>
<td align="center">0844</td>
<td align="left">Backspace String Compare</td>
<td align="center">
  <a href="/leetcode/en/ChapterFour/0800~0899/0844.Backspace-String-Compare/">Go</a></td>
<td align="center">Easy</td>
<td align="center">O(n)</td>
<td align="center">O(n)</td>
<td align="center"></td>
<td align="center">48.1%</td>
</tr>
<tr>
<td align="center">0853</td>
<td align="left">Car Fleet</td>
<td align="center">
  <a href="/leetcode/en/ChapterFour/0800~0899/0853.Car-Fleet/">Go</a></td>
<td align="center">Medium</td>
<td align="center"></td>
<td align="center"></td>
<td align="center"></td>
<td align="center">50.3%</td>
</tr>
<tr>
<td align="center">0856</td>
<td align="left">Score of Parentheses</td>
<td align="center">
  <a href="/leetcode/en/ChapterFour/0800~0899/0856.Score-of-Parentheses/">Go</a></td>
<td align="center">Medium</td>
<td align="center">O(n)</td>
<td align="center">O(n)</td>
<td align="center"></td>
<td align="center">64.8%</td>
</tr>
<tr>
<td align="center">0880</td>
<td align="left">Decoded String at Index</td>
<td align="center">
  <a href="/leetcode/en/ChapterFour/0800~0899/0880.Decoded-String-at-Index/">Go</a></td>
<td align="center">Medium</td>
<td align="center">O(n)</td>
<td align="center">O(n)</td>
<td align="center"></td>
<td align="center">28.3%</td>
</tr>
<tr>
<td align="center">0895</td>
<td align="left">Maximum Frequency Stack</td>
<td align="center">
  <a href="/leetcode/en/ChapterFour/0800~0899/0895.Maximum-Frequency-Stack/">Go</a></td>
<td align="center">Hard</td>
<td align="center">O(n)</td>
<td align="center">O(n)</td>
<td align="center"></td>
<td align="center">66.6%</td>
</tr>
<tr>
<td align="center">0897</td>
<td align="left">Increasing Order Search Tree</td>
<td align="center">
  <a href="/leetcode/en/ChapterFour/0800~0899/0897.Increasing-Order-Search-Tree/">Go</a></td>
<td align="center">Easy</td>
<td align="center"></td>
<td align="center"></td>
<td align="center"></td>
<td align="center">78.4%</td>
</tr>
<tr>
<td align="center">0901</td>
<td align="left">Online Stock Span</td>
<td align="center">
  <a href="/leetcode/en/ChapterFour/0900~0999/0901.Online-Stock-Span/">Go</a></td>
<td align="center">Medium</td>
<td align="center">O(n)</td>
<td align="center">O(n)</td>
<td align="center"></td>
<td align="center">65.2%</td>
</tr>
<tr>
<td align="center">0907</td>
<td align="left">Sum of Subarray Minimums</td>
<td align="center">
  <a href="/leetcode/en/ChapterFour/0900~0999/0907.Sum-of-Subarray-Minimums/">Go</a></td>
<td align="center">Medium</td>
<td align="center">O(n)</td>
<td align="center">O(n)</td>
<td align="center">❤️</td>
<td align="center">35.8%</td>
</tr>
<tr>
<td align="center">0921</td>
<td align="left">Minimum Add to Make Parentheses Valid</td>
<td align="center">
  <a href="/leetcode/en/ChapterFour/0900~0999/0921.Minimum-Add-to-Make-Parentheses-Valid/">Go</a></td>
<td align="center">Medium</td>
<td align="center">O(n)</td>
<td align="center">O(n)</td>
<td align="center"></td>
<td align="center">75.8%</td>
</tr>
<tr>
<td align="center">0946</td>
<td align="left">Validate Stack Sequences</td>
<td align="center">
  <a href="/leetcode/en/ChapterFour/0900~0999/0946.Validate-Stack-Sequences/">Go</a></td>
<td align="center">Medium</td>
<td align="center">O(n)</td>
<td align="center">O(n)</td>
<td align="center"></td>
<td align="center">67.7%</td>
</tr>
<tr>
<td align="center">1003</td>
<td align="left">Check If Word Is Valid After Substitutions</td>
<td align="center">
  <a href="/leetcode/en/ChapterFour/1000~1099/1003.Check-If-Word-Is-Valid-After-Substitutions/">Go</a></td>
<td align="center">Medium</td>
<td align="center">O(n)</td>
<td align="center">O(1)</td>
<td align="center"></td>
<td align="center">58.2%</td>
</tr>
<tr>
<td align="center">1006</td>
<td align="left">Clumsy Factorial</td>
<td align="center">
  <a href="/leetcode/en/ChapterFour/1000~1099/1006.Clumsy-Factorial/">Go</a></td>
<td align="center">Medium</td>
<td align="center"></td>
<td align="center"></td>
<td align="center"></td>
<td align="center">55.4%</td>
</tr>
<tr>
<td align="center">1019</td>
<td align="left">Next Greater Node In Linked List</td>
<td align="center">
  <a href="/leetcode/en/ChapterFour/1000~1099/1019.Next-Greater-Node-In-Linked-List/">Go</a></td>
<td align="center">Medium</td>
<td align="center">O(n)</td>
<td align="center">O(1)</td>
<td align="center"></td>
<td align="center">59.9%</td>
</tr>
<tr>
<td align="center">1021</td>
<td align="left">Remove Outermost Parentheses</td>
<td align="center">
  <a href="/leetcode/en/ChapterFour/1000~1099/1021.Remove-Outermost-Parentheses/">Go</a></td>
<td align="center">Easy</td>
<td align="center">O(n)</td>
<td align="center">O(1)</td>
<td align="center"></td>
<td align="center">80.6%</td>
</tr>
<tr>
<td align="center">1047</td>
<td align="left">Remove All Adjacent Duplicates In String</td>
<td align="center">
  <a href="/leetcode/en/ChapterFour/1000~1099/1047.Remove-All-Adjacent-Duplicates-In-String/">Go</a></td>
<td align="center">Easy</td>
<td align="center">O(n)</td>
<td align="center">O(1)</td>
<td align="center"></td>
<td align="center">69.7%</td>
</tr>
<tr>
<td align="center">1111</td>
<td align="left">Maximum Nesting Depth of Two Valid Parentheses Strings</td>
<td align="center">
  <a href="/leetcode/en/ChapterFour/1100~1199/1111.Maximum-Nesting-Depth-of-Two-Valid-Parentheses-Strings/">Go</a></td>
<td align="center">Medium</td>
<td align="center"></td>
<td align="center"></td>
<td align="center"></td>
<td align="center">73.0%</td>
</tr>
<tr>
<td align="center">1190</td>
<td align="left">Reverse Substrings Between Each Pair of Parentheses</td>
<td align="center">
  <a href="/leetcode/en/ChapterFour/1100~1199/1190.Reverse-Substrings-Between-Each-Pair-of-Parentheses/">Go</a></td>
<td align="center">Medium</td>
<td align="center"></td>
<td align="center"></td>
<td align="center"></td>
<td align="center">65.9%</td>
</tr>
<tr>
<td align="center">1209</td>
<td align="left">Remove All Adjacent Duplicates in String II</td>
<td align="center">
  <a href="/leetcode/en/ChapterFour/1200~1299/1209.Remove-All-Adjacent-Duplicates-in-String-II/">Go</a></td>
<td align="center">Medium</td>
<td align="center"></td>
<td align="center"></td>
<td align="center"></td>
<td align="center">56.2%</td>
</tr>
<tr>
<td align="center">1249</td>
<td align="left">Minimum Remove to Make Valid Parentheses</td>
<td align="center">
  <a href="/leetcode/en/ChapterFour/1200~1299/1249.Minimum-Remove-to-Make-Valid-Parentheses/">Go</a></td>
<td align="center">Medium</td>
<td align="center"></td>
<td align="center"></td>
<td align="center"></td>
<td align="center">65.8%</td>
</tr>
<tr>
<td align="center">1614</td>
<td align="left">Maximum Nesting Depth of the Parentheses</td>
<td align="center">
  <a href="/leetcode/en/ChapterFour/1600~1699/1614.Maximum-Nesting-Depth-of-the-Parentheses/">Go</a></td>
<td align="center">Easy</td>
<td align="center"></td>
<td align="center"></td>
<td align="center"></td>
<td align="center">82.3%</td>
</tr>
<tr>
<td align="center">1653</td>
<td align="left">Minimum Deletions to Make String Balanced</td>
<td align="center">
  <a href="/leetcode/en/ChapterFour/1600~1699/1653.Minimum-Deletions-to-Make-String-Balanced/">Go</a></td>
<td align="center">Medium</td>
<td align="center"></td>
<td align="center"></td>
<td align="center"></td>
<td align="center">58.9%</td>
</tr>
<tr>
<td align="center">1673</td>
<td align="left">Find the Most Competitive Subsequence</td>
<td align="center">
  <a href="/leetcode/en/ChapterFour/1600~1699/1673.Find-the-Most-Competitive-Subsequence/">Go</a></td>
<td align="center">Medium</td>
<td align="center"></td>
<td align="center"></td>
<td align="center"></td>
<td align="center">49.3%</td>
</tr>
<tr>
<td align="center">1700</td>
<td align="left">Number of Students Unable to Eat Lunch</td>
<td align="center">
  <a href="/leetcode/en/ChapterFour/1700~1799/1700.Number-of-Students-Unable-to-Eat-Lunch/">Go</a></td>
<td align="center">Easy</td>
<td align="center"></td>
<td align="center"></td>
<td align="center"></td>
<td align="center">68.7%</td>
</tr>
</tbody>
</table>
</article>
 
      







<hr style="margin-top:2rem;" />
<div class="book-prev-next" style="display:flex;justify-content:space-between;align-items:center;gap:1rem;margin:1rem 0;">
  
  <a class="flex align-center" href="/leetcode/en/ChapterTwo/Linked_List/" rel="prev" title="2.04 ✅ Linked List">&larr; Previous</a>
  
  
  <a class="flex align-center" href="/leetcode/en/ChapterTwo/Tree/" rel="next" style="margin-left:auto;" title="2.06 Tree">Next &rarr;</a>
  
</div>




      <footer class="book-footer">
        
  <div class="flex flex-wrap justify-between">

  



  
    
  
    
  


  


<div class="book-languages" tabindex="0" aria-haspopup="true">
  <ul>
    <li class="flex align-center">
      <img src="/leetcode/svg/translate.svg" class="book-icon" alt="Languages" />
      English
    </li> 
  </ul>

  <ul class="book-languages-list">
    
    <li class="active">
      <a href="https://books.halfrost.com/leetcode/en/" data-lang="en" class="flex align-center">
        <img src="/leetcode/svg/translate.svg" class="book-icon" alt="Languages" />
        English
      </a>
    </li>
    
    <li class="">
      <a href="https://books.halfrost.com/leetcode/zh/ChapterTwo/Stack/" data-lang="zh" class="flex align-center">
        <img src="/leetcode/svg/translate.svg" class="book-icon" alt="Languages" />
        中文
      </a>
    </li>
    
  </ul>
</div>




  <div><a class="flex align-center" href="https://github.com/halfrost/LeetCode-Go/commit/33afb6f1674f8464073aaa46246fa4dde2a7c5ce" title='Last modified by halfrost | Jun 28, 2026' target="_blank" rel="noopener">
      <img src="/leetcode/svg/calendar.svg" class="book-icon" alt="Calendar" />
      <span>Jun 28, 2026</span>
    </a>
  </div>



  <div>
    <a class="flex align-center" href="https://github.com/halfrost/LeetCode-Go/tree/master/website//content.en/ChapterTwo/Stack.md" target="_blank" rel="noopener">
      <img src="/leetcode/svg/edit.svg" class="book-icon" alt="Edit" />
      <span>Edit this page</span>
    </a>
  </div>


<div id="gitalk-container" style="width : 100%;"></div>
<link rel="stylesheet" href="https://cdn.jsdelivr.net/npm/gitalk@1.8.0/dist/gitalk.css">
<script src="https://cdn.jsdelivr.net/npm/gitalk@1.8.0/dist/gitalk.min.js"></script>

<script src="https://cdn.jsdelivr.net/npm/blueimp-md5@2.19.0/js/md5.min.js"></script>
<script>
  
  
  
  const gitalkPath = location.pathname.replace(/\/(en|zh)\//, '/');
  const gitalk = new Gitalk({
    clientID: '75d9d747f200c623a0e6',
    clientSecret: 'e3cc2ff8d8f6ae3c894a827f226188de0d26f37e',
    repo: 'S2',
    owner: 'halfrost',
    admin: ['halfrost'],
    id: md5(gitalkPath), 
    distractionFreeMode: false, 
    body: location.href, 
    proxy: 'https:\/\/gitalk-oauth.ydz627.workers.dev' 
  });
  (function() {
    if (["localhost", "127.0.0.1"].indexOf(window.location.hostname) != -1) {
      document.getElementById('gitalk-container').innerHTML = 'Gitalk comments not available by default when the website is previewed locally.';
      return;
    }
    gitalk.render('gitalk-container');
  })();
</script>



<span id="busuanzi_container_site_pv">Total visits: <span id="busuanzi_value_site_pv"></span> &nbsp;</span>
<span id="busuanzi_container_site_uv">You are visitor No. <span id="busuanzi_value_site_uv"></span></span>

</div>

 
        
      </footer>

      
  
 

      <label for="menu-control" class="hidden book-menu-overlay"></label>
    </div>

    
    <aside class="book-toc">
      <div class="book-toc-content">
        
  
<nav id="TableOfContents"></nav>


 
      </div>
    </aside>
    
  </main>

  <a class="lang-switch-top" href="https://books.halfrost.com/leetcode/zh/ChapterTwo/Stack/" data-lang="zh" title="Switch language" aria-label="Switch language">
  <img src="/leetcode/svg/translate.svg" alt="" style="height:1em;width:1em;vertical-align:-0.12em;margin-right:.35em;" />中文
</a>
<script>
  
  
  (function () {
    document.addEventListener('click', function (e) {
      var a = e.target.closest && e.target.closest('[data-lang]');
      if (a && a.getAttribute('data-lang')) {
        try { localStorage.setItem('preferredLang', a.getAttribute('data-lang')); } catch (err) {}
      }
    }, true);
  })();
</script>
<style>
.lang-switch-top{position:fixed;bottom:22px;right:22px;z-index:101;display:inline-flex;align-items:center;
  padding:.4em 1em;border:1px solid var(--gray-300, #d0d7de);border-radius:999px;
  background:var(--body-background, #fff);color:var(--body-font-color, #24292f);
  font-size:.85rem;line-height:1;text-decoration:none;box-shadow:0 2px 8px rgba(0,0,0,.18);transition:border-color .15s ease, box-shadow .15s ease;}
.lang-switch-top:hover{border-color:#64CEAA;box-shadow:0 3px 12px rgba(0,0,0,.24);}
@media (max-width:768px){.lang-switch-top{bottom:14px;right:14px;padding:.34em .8em;font-size:.8rem;}}
</style>

<script>
  
  
  (function () {
    function wrapTables() {
      var tables = document.querySelectorAll('.markdown table');
      for (var i = 0; i < tables.length; i++) {
        var t = tables[i];
        if (t.closest('.table-scroll') || (t.parentElement && t.parentElement.classList.contains('highlight'))) continue;
        var w = document.createElement('div');
        w.className = 'table-scroll';
        t.parentNode.insertBefore(w, t);
        w.appendChild(t);
      }
    }
    if (document.readyState === 'loading') {
      document.addEventListener('DOMContentLoaded', wrapTables);
    } else {
      wrapTables();
    }
  })();
</script>
<script src="/leetcode/prism.js"></script>

<script async="async">
    var html = document.documentElement;
    var switcher = document.getElementsByClassName('js-toggle')[0];
    if(typeof(Storage) !== 'undefined') {
        if (localStorage.getItem('themeMode') == 'dark' || document.documentElement.getAttribute('data-theme') == 'dark') {
            switcher.classList.add('js-toggle--checked');
        }
        switcher.classList.add('js-toggle--focus');
    }
    
    switcher.addEventListener("click", function() {
            this.classList.toggle('js-toggle--checked');
            this.classList.add('js-toggle--focus');
            
            if (this.classList.contains('js-toggle--checked')) {
                html.setAttribute("data-theme","dark");
                
                localStorage.setItem('themeMode', 'dark');
            } else {
                html.setAttribute("data-theme","light");
                localStorage.setItem('themeMode', 'light');
            }
        })
</script>
</body>

</html>