coding-interview-practice

  • K1_228332
    了解作者
  • 158.5KB
    文件大小
  • zip
    文件格式
  • 0
    收藏次数
  • VIP专享
    资源类型
  • 0
    下载次数
  • 2022-06-11 06:45
    上传日期
介绍 该存储库包含有关数据结构和算法相关问题的详细帖子和解决方案的列表。 下面是LeetCode帖子的表格。 职位范围从05/2020到现在。 在这段时间内,解决方案的质量从新手(05/2020-08/2020)逐渐发展到中级(08/2020-11/2020)到专家(11/2020-现在)。 问题编号链接到问题说明,解决方案链接到我的讨论帖子/解决方案。 大约10%的帖子需要LeetCode会员才能查看,其余的则不需要。 该存储库还包含一个名为old_practice_problems的文件夹。 该文件夹包含较旧的解决方案(02/2020)和我的思考过程第一次解决该问题。 在旁边 以下帖子质量的提高与我在竞争性计划中的进步( )紧密相关,可以将其与大量程序员。 LeetCode帖子 问题 标题和解决方案 解决方案类型 数组 数组 数组 数组 数组 两个非重叠子数组的最大和 数组
coding-interview-practice-master.zip
内容介绍
### <u>Introduction</u> This repository contains a list of detailed posts and solutions for data structure and algorithm related problems.<br> Below is a table of LeetCode posts. The posts span from 05/2020 through present. Over this time frame the quality of the solutions gradually progress from novice (05/2020 - 08/2020) to intermediate (08/2020 - 11/2020) to expert (11/2020 - present). <br> The problem number links to the problem statement and the solution links to my discussion post / solution.<br> About 10% of the posts require a LeetCode membership to view, the rest do not.<br> This repository also contains a folder called old_practice_problems. The folder contains older solutions (02/2020) and my thought process approaching the problem for the first time. ### <u>Aside</u> The progression in quality of the posts below is closely linked to my progression in competitive programmimg (<a href="https://clist.by/account/rowe1227/resource/leetcode.com/" target="_blank" rel='nofollow' onclick='return false;'><b>shown here</b></a>) which can be compared to a larger population of programmers <a href="https://clist.by/resource/leetcode.com/" target="_blank" rel='nofollow' onclick='return false;'><b>(shown here)</b></a>. ### <u>LeetCode Posts</u> <table class="center"> <colgroup> <col span="1" style="width: 10%;"> <col span="1" style="width: 55%;"> <col span="1" style="width: 35%;"> </colgroup> <thead> <tr> <th>Problem</th> <th>Title and Solution</th> <th>Solution Type</th> </tr> </thead><tbody id="myTable"> <tr> <td><a href="https://leetcode.com/problems/spiral-matrix-ii" target="_blank" rel='nofollow' onclick='return false;'>59</a></td> <td><a href="https://leetcode.com/problems/spiral-matrix-ii/discuss/963110/python-walk-forward-and-turn-right" target="_blank" rel='nofollow' onclick='return false;'>spiral matrix ii</a></td> <td>Arrays</td> </tr> <tr> <td><a href="https://leetcode.com/problems/number-of-corner-rectangles" target="_blank" rel='nofollow' onclick='return false;'>750</a></td> <td><a href="https://leetcode.com/problems/number-of-corner-rectangles/discuss/693174/Python-Beats-99.4-10-Lines-Three-Steps-Explained" target="_blank" rel='nofollow' onclick='return false;'>number of corner rectangles</a></td> <td>Arrays</td> </tr> <tr> <td><a href="https://leetcode.com/problems/largest-plus-sign" target="_blank" rel='nofollow' onclick='return false;'>764</a></td> <td><a href="https://leetcode.com/problems/largest-plus-sign/discuss/915912/python-nothing-fancy-3-steps" target="_blank" rel='nofollow' onclick='return false;'>largest plus sign</a></td> <td>Arrays</td> </tr> <tr> <td><a href="https://leetcode.com/problems/smallest-range-i" target="_blank" rel='nofollow' onclick='return false;'>908</a></td> <td><a href="https://leetcode.com/problems/smallest-range-i/discuss/641033/Python-Explained-Question-Simple-Solution-Bonus-1-Liner" target="_blank" rel='nofollow' onclick='return false;'>smallest range i</a></td> <td>Arrays</td> </tr> <tr> <td><a href="https://leetcode.com/problems/sort-array-by-parity-ii" target="_blank" rel='nofollow' onclick='return false;'>922</a></td> <td><a href="https://leetcode.com/problems/sort-array-by-parity-ii/discuss/639861/Python-3-Methods" target="_blank" rel='nofollow' onclick='return false;'>sort array by parity ii</a></td> <td>Arrays</td> </tr> <tr> <td><a href="https://leetcode.com/problems/maximum-sum-of-two-non-overlapping-subarrays" target="_blank" rel='nofollow' onclick='return false;'>1031</a></td> <td><a href="https://leetcode.com/problems/maximum-sum-of-two-non-overlapping-subarrays/discuss/923574/Python-4-simple-steps-using-presum-arrays" target="_blank" rel='nofollow' onclick='return false;'>maximum sum of two non overlapping subarrays</a></td> <td>Arrays</td> </tr> <tr> <td><a href="https://leetcode.com/problems/find-the-distance-value-between-two-arrays" target="_blank" rel='nofollow' onclick='return false;'>1385</a></td> <td><a href="https://leetcode.com/problems/find-the-distance-value-between-two-arrays/discuss/640002/Python-Short-and-Simple" target="_blank" rel='nofollow' onclick='return false;'>find the distance value between two arrays</a></td> <td>Arrays</td> </tr> <tr> <td><a href="https://leetcode.com/problems/build-an-array-with-stack-operations" target="_blank" rel='nofollow' onclick='return false;'>1441</a></td> <td><a href="https://leetcode.com/problems/build-an-array-with-stack-operations/discuss/636211/Python-98.6-Speed-8-lines" target="_blank" rel='nofollow' onclick='return false;'>build an array with stack operations</a></td> <td>Arrays</td> </tr> <tr> <td><a href="https://leetcode.com/problems/maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold" target="_blank" rel='nofollow' onclick='return false;'>1292</a></td> <td><a href="https://leetcode.com/problems/maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold/discuss/918872/Python-2D-Presum-Array-plus-Binary-Search" target="_blank" rel='nofollow' onclick='return false;'>maximum side length of a square with sum less than or equal to threshold</a></td> <td>Arrays<br>Binary Search</td> </tr> <tr> <td><a href="https://leetcode.com/problems/longest-palindromic-substring" target="_blank" rel='nofollow' onclick='return false;'>5</a></td> <td><a href="https://leetcode.com/problems/longest-palindromic-substring/discuss/838848/www.youtube.com/www.youtube.com/watch?v=nbTSfrEfo6M" target="_blank" rel='nofollow' onclick='return false;'>longest palindromic substring</a></td> <td>Binary Search</td> </tr> <tr> <td><a href="https://leetcode.com/problems/h-index-ii" target="_blank" rel='nofollow' onclick='return false;'>275</a></td> <td><a href="https://leetcode.com/problems/h-index-ii/discuss/769579/Python-Two-Approaches-Explained-Beats-99.19" target="_blank" rel='nofollow' onclick='return false;'>h index ii</a></td> <td>Binary Search</td> </tr> <tr> <td><a href="https://leetcode.com/problems/smallest-good-base" target="_blank" rel='nofollow' onclick='return false;'>483</a></td> <td><a href="https://leetcode.com/problems/smallest-good-base/discuss/1015543/Python-2-non-math-solutions-explained" target="_blank" rel='nofollow' onclick='return false;'>smallest good base</a></td> <td>Binary Search</td> </tr> <tr> <td><a href="https://leetcode.com/problems/maximum-length-of-repeated-subarray" target="_blank" rel='nofollow' onclick='return false;'>718</a></td> <td><a href="https://leetcode.com/problems/maximum-length-of-repeated-subarray/discuss/843718/Python-Binary-Search-2-Steps" target="_blank" rel='nofollow' onclick='return false;'>maximum length of repeated subarray</a></td> <td>Binary Search</td> </tr> <tr> <td><a href="https://leetcode.com/problems/friends-of-appropriate-ages" target="_blank" rel='nofollow' onclick='return false;'>825</a></td> <td><a href="https://leetcode.com/problems/friends-of-appropriate-ages/discuss/946865/python-binary-search" target="_blank" rel='nofollow' onclick='return false;'>friends of appropriate ages</a></td> <td>Binary Search</td> </tr> <tr> <td><a href="https://leetcode.com/problems/find-in-mountain-array" target="_blank" rel='nofollow' onclick='return false;'>1095</a></td> <td><a href="https://leetcode.com/problems/find-in-mountain-array/discuss/950567/Python-Binary-Search-3-steps" target="_blank" rel='nofollow' onclick='return false;'>find in mountain array</a></td> <td>Binary Search</td> </tr> <tr> <td><a href="https://leetcode.com/problems/find-the-smallest-divisor-given-a-threshold" target="_blank" rel='nofollow' onclick='return false;'>1283</a></td> <td><a href="https://leetcode.com/problems/find-the-smallest-divisor-given-a-threshold/discuss/926000/python-binary-search-for-best-divisor" target="_blank" rel='nofollow' onclick='return false;'>find the smallest divisor given a threshold</a></td> <td>Binary Search</td> </tr> <tr> <td><a href="https://leetcode.com/problems/leftmost-column-with-at-least-a-one" target="_blank" rel='nofollow' onclick='return false;'>1428</a></td> <td><a href="https://leetcode.com/problems/leftmost-column-with-at-least-a-one/discuss/699078/Python-beats-99.8-binary-search-approach-explained" target="_blank" rel='nofollow' onclick='return false;'>leftmost column with at least a one</a></td> <td>Binary Search</td> </tr> <tr> <td><a href="https://leetcode.com/problems/maximum-font-to-fit-a-sentence-in-a-screen" target="_blank" rel='nofollow' onclick='return false;'>1618</a></td> <td><a href="https://leetcode.com/problems/maximum-font-to-fit-a-sentence-in-a-screen/discuss/896448/Python-Binary-Search-Easy-to-Read" target="_blank" rel='nofollow' onclick='return false;'>maximum font to fit a sentence in a screen</a></td> <td>Binary Search</td> </tr> <tr> <td><a href="https://leetcode.com/problems/recover-binary-search-tree" target="_blank" rel='nofollow' onclick='return false;'>99</a></td> <td><a href="https://leetcode.com/problems/recover-binary-search-tree/discuss/917922/Python-3-Simple-Steps" target="_blank" rel='nofollow' onclick='return false;'>recover binary search tree</a></td> <td>Binary Search Trees (BST)</td> </tr> <tr> <td><a href="https://leetcode.com/problems/inorder-successor-in-bst-ii" target="_blank" rel='nofollow' onclick='return false;'>510</a></td> <td><a href="https://leetcode.com/problems/inorder-successor-in-bst-ii/discuss/771281/Python-Clean-and-Short-Explained" target="_blank" rel='nofollow' onclick='return false;'>inorder successor in bst
评论
    相关推荐