🐍 Python problems

#901 Binary search 🔒 #902 Elements less than x 🔒 #903 Maximum subarray sum 🔒 #904 Longest increasing subsequence 🔒 #905 Longest common subsequence 🔒 #906 Edit distance 🔒 #907 Stairs: 1-2 steps 🔒 #908 Stairs: steps 1, 3 🔒 #909 Fewest coins 1, 5, 10, 25 🔒 #910 Ways to make change 1, 5, 10, 25 🔒 #911 Knapsack (0/1) 🔒 #912 Balanced brackets 🔒 #913 Postfix expression 🔒 #914 Evaluate an expression (+, -) 🔒 #915 Largest prime gap 🔒 #916 Prefix sum queries 🔒 #917 2D prefix sums 🔒 #918 Sort pairs 🔒 #919 Scoreboard 🔒 #920 Paths in a grid 🔒 #921 Grid paths with walls 🔒 #922 Minimum path sum 🔒 #923 Maze (BFS) 🔒 #924 Number of islands 🔒 #925 Largest island 🔒 #926 Spiral reading 🔒 #927 Build a spiral matrix 🔒 #928 Two pointers: sum k 🔒 #929 Longest substring without repeats 🔒 #930 Josephus problem (k=2) 🔒 #931 Fast power (mod 1000000007) 🔒 #932 GCD of a list 🔒 #933 LCM of a list 🔒 #934 From base 2 to base 10 🔒 #935 Digit sum of n! 🔒 #936 Number of digits of n! 🔒 #937 Activity selection 🔒 #938 Fewest platforms 🔒 #939 Split into two equal parts 🔒 #940 Subset sum 🔒 #941 Circular Kadane 🔒 #942 Rain water 🔒 #943 Stocks: one trade 🔒 #944 Stocks: many trades 🔒 #945 Fibonacci mod 10⁹+7 (big n) 🔒 #946 Next permutation 🔒 #947 All combinations 🔒 #948 n queens 🔒 #949 2-bonacci 🔒 #950 Row n of Pascal's triangle 🔒 #951 Catalan number Cₙ 🔒 #952 Number of derangements (permutations where nothing stays in its place) 🔒 #953 Number of ways to write n as a sum p(n) 🔒 #954 Longest part with sum at most S 🔒 #955 Subarrays with sum k 🔒 #956 Majority element 🔒 #957 k-th smallest element 🔒 #958 Merge intervals 🔒 #959 Shortest path (Dijkstra) 🔒 #960 Topological sort 🔒 #961 Connected components 🔒 #962 Bipartite graph? 🔒 #963 Decode ways 🔒 #964 Longest palindromic substring 🔒 #965 Longest run of 1s with k flips 🔒 #966 Fewest jumps 🔒 #967 Gray code 🔒 #968 Longest common prefix 🔒 #969 Maximum bracket depth 🔒 #970 Stairs: 1-3 steps 🔒 #971 Stairs: steps 2, 3 🔒 #972 Fewest coins 1, 3, 4 🔒 #973 Ways to make change 1, 3, 4 🔒 #974 Josephus problem (k=3) 🔒 #975 Fast power (mod 1000) 🔒 #976 From base 10 to base 2 🔒 #977 3-bonacci 🔒 #978 Stairs: 1-4 steps 🔒 #979 Stairs: steps 1, 2, 5 🔒 #980 Fewest coins 2, 5 🔒 #981 Ways to make change 2, 5 🔒 #982 Josephus problem (k=4) 🔒 #983 Fast power (mod 997) 🔒 #984 From base 8 to base 2 🔒 #985 4-bonacci 🔒 #986 Stairs: 1-5 steps 🔒 #987 Fewest coins 1, 7, 10 🔒 #988 Ways to make change 1, 7, 10 🔒 #989 Josephus problem (k=5) 🔒 #990 From base 2 to base 8 🔒 #991 5-bonacci 🔒 #992 Fewest coins 3, 5, 7 🔒 #993 Ways to make change 3, 5, 7 🔒 #994 Josephus problem (k=6) 🔒 #995 From base 3 to base 10 🔒 #996 6-bonacci 🔒 #997 Fewest coins 5, 10, 20, 50, 100 🔒 #998 Ways to make change 5, 10, 20, 50, 100 🔒 #999 Josephus problem (k=7) 🔒 #1000 From base 10 to base 7 🔒