im not sure how to do this: there are some that are blank so i think they are immediate data?

i dont know how to simplify boolean algebra expressions so these were just part of my answers I most likely got them wrong so yeah 1. (NOT(AB)+A)*(NOT(B+C)) 2. NOT(NOT((BC+A)*C)+A)

Solitare Solution: (did this in a leetcode style problem) cards = input() class Solution: def solitare(cards): newlist = cards.split(", ") ret = "" newlist.pop(0) for i in range(0, len(newlist)-1): if newlist[len(newlist)-1][0] == newlist[len(newlist)-2][0] or newlist[len(newlist)-1][1] == newlist[len(newlist)-2][1]: newlist.pop(0) for i in range(0, len(newlist)-1): ret += newlist[i] + ", " ret += newlist[len(newlist)-1] return ret print(Solution.solitare(cards))

3. 111000 i think i messed up on this 4. X = 11001 ahh this was so confusing ^

class Solution: def findMedianSortedArrays(self, nums1: List[int], nums2: List[int]) -> float: return median(nums1+nums2)

Should we email our code?

time complexity absolutely sucks lol Runtime: 6449 ms, faster than 8.58% of Python3 online submissions for Two Sum

class Solution: def twoSum(self, nums: List[int], target: int) -> List[int]: for frontIndex in range(0, len(nums)): for nextIndex in range(frontIndex+1, len(nums)): if nums[frontIndex] + nums[nextIndex] == target: return frontIndex, nextIndex

3. f(f(f(f(-5)))): Answer: 6 4. Find the smallest value of n such that f(n) > 200 Answer: 6 Note: I don't know if there was a more efficient way to do it, because I did it in O(n) time

import java.util.*; public class Main { public static void main(String args[]) { ArrayList al = new ArrayList<>(); al.add(1); al.add(3); al.add(5); al.add(7); al.add(9); al.add(11); al.add(13); al.add(15); al.add(17); al.add(19); System.out.println(al); } }

class Main { public static void main(String[] args) { System.out.println(1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + 10); } }

Here's My code: import java.util.Scanner; class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); System.out.println("Player 1 Score: "); int scoreA = sc.nextInt(); System.out.println("Player 2 Score: "); int scoreB = sc.nextInt(); if (scoreB > scoreA) { System.out.println("B Won"); } else if (scoreA > scoreB) { System.out.println("A Won"); } else { System.out.println("Tie"); } } }

d 18 pizza

Starting: //convert variables to final values str = "harry" n = 5 mystery = str.substring(0,1) + str.substring(4,5) Output: //hy Explanation: //notice that mystery is a string, which means it will concatenate. str.substring(0,1) is starting from h, and does not include a. So the first one is h. The next one is also pretty straightforward. Beginning index and ending index. String str = "harry"; int n = str.length();//finds the length of str String mystery = str.substring(0,1) + str.substring(n - 1, n); System.out.println(mystery); Output: hy

I'm not sure about the scanner, but here is my code: import java.lang.Math; class Main { public static void main(String[] args) { double num2 = 5.5; long num3 = Math.round(num2); double num4 = num3 * 2; System.out.println(num4); } }

So far, I only figured out the second one which is f(6, 3) = 22. Still working on the first one

ok

do we write this in python or java?