Search Results

Docstrings You should always use triple double quotes for docstrings. ''' should be replaced with """ Comments Don't fill your code with comments. The actual code is harder to read. Comments shou …

You can use collections.Counter to solve this problem with a time complexity of O(N) and a space complexity of also O(N). from collections import Counter my_array = [1, 1, 1, 1, 2, 2, 3, 3, 3, 4, 4, …

""" Prints the next lexicographically smallest string infinitely: a, b, ..., z, aa, ab, ..., zz, aaa, ..., zzz, ... """ # Entering a list as default parameter should be avoided in python …

The code works not only as a normal run length encoder and decoder, but it also works for values like 3ABC (Prints ABCABCABC), but the same doesn't happen for encoding class DecodeError(BaseException …

Edit: If python 3.x is allowed: h, w = map(int, input("Enter EVEN 'height width' of trellis: ").split()) print('--' * (w+1), *(("|" + "/\\" * w + "|") + '\n' + ("|" + "\\/" * w + "|") for _ in range(h) …

The bool of empty values are False in python. …

Also, calculate_number should be from_base_minus_two Use type hints Instead of x == 0 python allows you to use use not x. Similarly, x != 0 can be replaced with x. …

Inspired by this question. Here's the code: class FishyError(Exception): __module__ = Exception.__module__ def string_to_fishy(string: str) -> str: """ Converts a string to fishy code …

I created this game inspired by this problem: https://www.codechef.com/ZCOPRAC/problems/ZCO14001 The problem needs you create a machine that can lift boxes and drop them in a new column. Then, when …

I created this program some time ago. It shows you how to solve tower of hanoi for n disks, step by step. Here's the code: from os import system from colorama import Fore, Style clear = lambda: sys …

I created this program originally for Project Euler 14. Here's the code: from sys import setrecursionlimit setrecursionlimit(10 ** 9) def memo(f): f.cache = {} def _f(*args): if ar …

I believe the code is slow because you are using normal Dijkstra, which takes O(V^2) where V is the number of vertices (Here, V would be N*M). This is because you are searching for the minimum by ite …

When order of RULES matter, prefer a list of tuples instead of a dict as a dict's order might change depending of the version. You can iterate through the tuple with for divider, value in RULES If al …

Link: https://projecteuler.net/problem=26 I tried to solve it in Python: My approach: For every d, assume you are solving for 1 / d by hand. … Here's my code following the above steps in Python: LIMIT = 1000 # The maximum length maxi = 0 # The 'd' that has maximum length maxi_d = 1 for d in range(1, LIMIT): quotient = [] # Stores the …

Parentheses for if statements should be avoided if (self.draw[0] == self.draw[1] and self.draw[1] == self.draw[2]) : should be replaced with if self.draw[0] == self.draw[1] and self.draw[1] == self.draw[2]: In python …