Search Results

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. …

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. …

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 …

Here are a few suggestions: You should get in the habit of wrapping all code that isn't contained in a function, in a main guard. This will protect the code from being run when the file is imported. …

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 …

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 …

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 …

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 …

""" Code written by: Linny Github: https://github.com/Linnydude3347 This program demonstrates a pathfinding algorithm """ from os import system, name import time import random import math def calculate_distance … go_down return spaces[1][0], spaces[1][1] GRID[x][y] = go_left return spaces[3][0], spaces[3][1] return -1, -1 def find(start_x, start_y): """ This is the main algorithm …

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

Unnecessary else after return In the body of an if, if you end up returning something in that body, an else is not required. A return will exit the body of the function, so the code in the else won't …

After a very quick pass, here's what I have for you: I assumed ... sorted(sides)[-1]: was a typo, so I removed the :. Return Expressions: It's better to return expressions than to just else: return …

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

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