Search Results

The algorithm is: Get remainder of number with modulo by 10 If remainder is less than 5, return number minus remainder Else, return number + (10 - remainder) def closest_multiple_10(x): rem = x % …

I've been tasked with finding the distance between two letters in the alphabet. Below is my solution. My main concerns are if there is any shorter way to do this, and if there are any edge cases I'm n …

Below is my solution, with a description of the algorithm is provided in the docstring. The main thing I'm worried about is my solution. … sequences.append(line.strip()) return sequences # PROVIDE YOUR SOLUTION BELOW # from typing import Tuple # For code clarity def find_excluded() -> Tuple[str, bool]: """ This algorithm …

Remove print statements Printing to the console takes a significant amount of time, and you are printing for every iteration and every element in the list. Run it once with the statements, and once wi …

Your bubble sort algorithm has way too many variables. You don't need to keep track of the right and left item. …

You should really only use comments to explain a design choice or a complicated equation/algorithm. Comments like #if the condition is satisfied just clutters your code. …

Redundant calculations You calculate mult1 * mult2 three times. Instead, do this once, assign it to a variable, and use that. Since you want to never want to calculate when a value is 0, you can set …

Use built in methods! Your position_in_alphabets function can be reduced to one line. In fact, replace y = ... with the following: alphabets.index(character) + 1 index returns the first occurrence …

Class Names Classes should be in PascalCase, not lowercase. So your class should be App. Operator Spacing There should be a space before and after every operator (+-*/=, etc) in your program. It im …

Your function code can be simplified to one line. from itertools import combinations from typing import List def array_sum(inputs: List[int], tests: List[int]) -> bool: """ Determines if any …

Just a few things I noticed. Utilize built in functions This S = 0 for k in range(1, N): S += function[a + k * h] can be this S = sum(function[a + k * h] for k in range(1, N)) Python3's su …

Winning Bug When the board is at this stage and the user gets the next move: | | X | O | X | | ---------------------- | | | O …

Imports I notice you import re three times, once for each password check function. Why? Just import the library once at the top of the file, and you can use it in all of your functions. Returning B …

I would really only like suggestions on the actual algorithm, but anything else is appreciated. …

I'd like feedback mainly on the algorithm, as I wrote this up very quickly. I used comprehension syntax to find the largest num, which I'm trying to use more. …