Great use of f-strings! Looks correct all around (other than your conditions, but we haven't gotten there yet). :)

Both answers look good! Remember to always use single quotes instead of double quotes if f-strings, though. :)

Looks good! :D You want to leave a space after you ask your question in input(), but I do like the story.

Short and sweet :) Good job balancing both concatenation and f-strings!

Great use of concatenation! Quick note: when you ask input, you typically want to leave a space after your question so that there's a space between where the user answers and where your question is. :)

Looks great! You've used some advanced skills that we won't get to in a bit, but they're all used correctly, so nice work. :)

If you'd like a shorter solution, here's one I coded: import random win = 0 loss = 0 draw = 0 userChoice = "" while True: compChoice = random.randint(1, 3) userChoice = input("Rock, paper, or scissors? ") if userChoice.lower() == "rock": userChoice = 1 elif userChoice.lower() == "paper": userChoice = 2 elif userChoice.lower() == "scissors": userChoice = 3 elif userChoice.lower() == "stop": print(f"You finished with {win} wins, {loss} losses, and {draw} draws.") break else: print("Enter a valid choice next time.") continue if userChoice == compChoice: draw += 1 print("Draw :\\") elif (userChoice % 3) > (compChoice % 3): win += 1 print("You win :D") else: loss += 1 print("You lose :(")

This looks really good, nice work! However, instead of making each part of your story a string and then concatenating them with one print statement, try to use f strings, which directly insert a variable’s value into the string. Look at Eric’s solution for an example!

That's a good start! We want the price to also be an input though, not just the number of items. You'd create and substitute a variable instead of using "5" and "10" for the prices. Let me know if that doesn't make sense.

For number 1, it'd be great if you could include examples of floats and strings too!

Prefix/Postfix: 1) 27 2) -32 3) / - 1 * 4 3 - + ^ 6 2 * * 2 9 9 / 2 3 Bit-string flicking (not sure if I did this right): 1) 00100 2) 01101 3) There are 4 different answers for A: 10000, 10100, 10010, 10110.

My code works for the input JAVA but not for all of XRAY... word = input().split(', ') def multiplier(number, points): index = 0 word_score = False for value in number: if value % 6 == 3: points[index] *= 2 elif value % 5 == 0: points[index] *= 3 elif value % 7 == 0: if word_score == False: sum = 0 for element in points: sum += element points[index] = sum * 2 del(points[:index]) index = 0 word_score = True elif value % 8 == 0: if word_score == False: sum = 0 for element in points: sum += element points[index] = sum * 3 del(points[:index]) index = 0 word_score = True index += 1 if type(points) == int: return [points] else: return points grand_total = [] for i in range(0, 5): score = [] for letter in word: if letter == 'A' or letter == 'E': score.append(1) elif letter == 'D' or letter == 'R': score.append(2) elif letter == 'B' or letter == 'M': score.append(3) elif letter == 'V' or letter == 'Y': score.append(4) elif letter == 'J' or letter == 'X': score.append(8) start = int(input()) num_list = [start, start + 1, start + 2, start + 3] multiplier(num_list, score) sum = 0 for item in score: sum += item grand_total.append(str(sum)) for item in grand_total: print(item)

It only works for some of the test input but I didn't know how to fix it: def toInt(char): if char == 'A': return 0 elif char == 'B': return 1 elif char == 'C': return 2 def toString(char): if char == 0: return 'A' elif char == 1: return 'B' elif char == 2: return 'C' letter_int = [0, 1, 2] starting = input().split(', ') grid = [[4, 4, 4], [4, 4, 4], [4, 4, 4]] for i in range(1, len(starting), 2): c = int(starting[i]) - 1 grid[c//3][c % 3] = toInt(starting[i + 1]) copy = [row[:] for row in grid] def assign(copy, row, col): unavail = [0, 0, 0] avail = -1 r = 0 c = 0 letter_index = 0 for c in range(0, 3): if copy[row][c] != 4: letter_index = copy[row][c] unavail[letter_index] = 1 for r in range (0, 3): if copy[r][col] != 4: letter_index = copy[r][col] unavail[letter_index] = 1 for letter_index in range (0, 3): if unavail[letter_index] == 0: avail = letter_int[letter_index] break return avail def once(board): for row in board: if row[0] + row[1] + row[2] != 3 or row[0]*row[1]*row[2] != 0: return False for col in range(0, 3): if board[0][col] + board[1][col] + board[2][col] != 3 or board[0][col] * board[1][col] * board[2][col] != 0: return False return True for s in range(0, 1): for row in range(0, 3): for col in range (0, 3): if copy[row][col] == 4: copy[row][col] = assign(copy, row, col) no_dup = once(copy) if no_dup == True: letter_grid = '' for row in copy: for char in row: letter_grid += toString(char) print(letter_grid)

Binary Search Tree: Depth: 3 Internal path length: 15 External path length: 31 Number of external nodes: 9 Leaf nodes: A, D, R Heap (this one might be wrong): Depth: 3 Internal path length: 13 External path length: 26 Number of external nodes: 8 Leaf nodes: K, O, Y, R

final_answer = '' for i in range(0, 5): locations = [] expression = input() if '(' in expression: parenthesis = '(' elif ')' in expression: parenthesis = ')' paren_location = int(expression.index(parenthesis)) i = 0 for char in expression: if char.isdigit(): index = int(expression.index(char, i)) if parenthesis == '(': if index > paren_location and abs(index - paren_location) >= 2: locations.append(str(int(index + 2))) elif parenthesis == ')': if index < paren_location and abs((index - paren_location)) >= 2: locations.append(str(int(index + 1))) i += 1 for num in locations: if locations.index(num) == len(locations) - 1: final_answer += num + '\n' else: final_answer += num + ', ' print(final_answer) 2) Queue: Q Stack: N

board = [] array = input().split(', ') for item in array: while len(item) < 4: item = "0" + item line = [] for char in item: line.append(int(char)) board.append(line) for i in range(0, 5): copy = [row[:] for row in board] coords = input().split(', ') r = int(coords[0]) - 1 c = int(coords[1]) - 1 for j in range(0, 6): if copy[r][c] == 0: copy[r][c] = (copy[r][c] + 1) % 4 if c == 3: c = 0 else: c += 1 elif copy[r][c] == 1: copy[r][c] = (copy[r][c] + 1) % 4 if c == 0: c = 3 else: c -= 1 elif copy[r][c] == 2: copy[r][c] = (copy[r][c] + 1) % 4 if r == 0: r = 3 else: r -= 1 elif copy[r][c] == 3: copy[r][c] = (copy[r][c] + 1) % 4 if r == 3: r = 0 else: r += 1 print(str(r + 1) + ', ' + str(c + 1))

1) There is probably a shorter way but this works- def game(cards): opp_num = cards[0] opp_suit = cards[1] larger = [] smaller = [] for i in range(2, 11, 2): dealer_num = cards[i] dealer_suits = cards[i + 1] dealer_card = [dealer_num, dealer_suits] if dealer_suits != opp_suit: continue else: if dealer_num > opp_num: if larger == []: larger = dealer_card else: if dealer_num < larger[0]: larger = dealer_card else: if larger == []: smaller = dealer_card else: if dealer_num < smaller[0]: smaller = dealer_card if larger != []: return larger elif smaller != []: return smaller else: return 0 move_list = '' for num in range(0, 5): card_list = input().split(', ') move = game(card_list) if move != 0: move_list += str(move[0] + ', ' + move[1] + '\n') else: move_list += 'NONE\n' print(move_list) 2) f(6, 3) = 22

def recaman(n, seen): n = int(n) if n == 0: seen.append(0) return 0 else: a = recaman(n - 1, seen) minus = a - n plus = a + n if minus > 0 and minus not in seen: seen.append(minus) return minus else: seen.append(plus) return plus used = [ ] num = recaman(input('Number: '), used) print(num)

l = length, w = width 1) Find midpoints of both sides: l_mid = (l - 1)/2 w_mid = (w - 1)/2 2) Find the fringe gap on each side row_fringe = w_mid - 1 col_fringe = l_mid - 1 3) Find the difference of fringe gaps 4) Make loops for each row: for each column: if it's the first or last row, first or last column, or midpoint: print black square elif col_fringe is greater and it is the middle row: if the column number is abs(difference of fringe gaps) away from midpoint: print black square elif row_fringe is greater and it is the middle column: if row number is abs(difference of fringe gaps) away from midpoint: print black square else: print white square print line break I'm not sure what I did but I think it sort of works

1) 25 2) see below z = 0 n = 1000 while n <= 2000: a = int(n/1000) b = int((n - 1000 * a) / 10) c = int((n - 1000 * a - 100 * b)/10) d = n - 1000 * a - 100 * b - 10 * c if (a == d) and (b == c) and (a != b): z += 1 n += 1 print(z) Output: 1