Datasets:

---

mlfoundations-dev

/

codereview_800000_samples

Like 0

Follow

ML Foundations Development 141

ERROR: type should be string, got "https://youtu.be/XEt09iK8IXs?t=1264\nBen Awad did a mock interview with a React developer, and asked this question. There are a set of 100 holes (0-99). A rabbit is located in one of these holes. Every time you check a hole, the rabbit jumps to an adjacent (to its position) hole. The goal is to come up with an algorithm to find the rabbit.\nRather than focus on the algorithm, I wanted to try to create a working model of this scenario (I think I did implement the correct search, though). I created a Rabbit class that will keep track of where it is and determine how it should move. To properly test the search algorithm, I needed more than just random movement. It's possible the rabbit could just move back and forth between the same two holes forever, and randomly choosing left or right will practically never produce that behavior. To that end, I gave it 4 movement styles that it will choose at random and do constantly for the duration of the run:\nRandom - Randomly choose left or right\nRange - Same as random, but it will stay within a given range\nUp - The rabbit will always move right (unless it's at the furthest-right hole)\nDown - Opposite of Up\nThat certainly doesn't cover every possible movement behavior the rabbit could exhibit, but I figured it was variable enough for a simple test simulation. Actually, I'm pretty sure the search works regardless of how the rabbit moves, but it was worth creating the functionality for learning purposes; I'm still a beginner. For range movement, I picked a range that is 20% (unless it's too close to the 1st or last hole) the size of the \"space\" (the number of holes).\nimport random\nimport logging\n\nLOG_FORMAT = '%(levelname)s %(asctime)s - %(message)s'\nDATE_FORMAT = '%Y-%m-%d %H:%M:%S'\nlogging.basicConfig(filename='log.log', filemode='w', level=logging.INFO, format=LOG_FORMAT, datefmt=DATE_FORMAT)\n\n\nclass Rabbit:\n \"\"\"\n A class to represent a rabbit\n\n ...\n\n Attributes\n ----------\n space : int\n The number of holes to which the rabbit can travel\n start : int\n the start position of the rabbit\n pos : int\n The current position of the rabbit\n style : int\n A number representing one of the 4 possible movement behaviors of the rabbit {1: 'random', 2: 'range',\n 3: 'up', 4: 'down'}\n max_pos : int\n The number of the furthest-right hole to which the rabbit can travel\n min_pos : int\n The number of the furthest-left hole to which the rabbit can travel\n range_set : bool\n Indicates whether a range has been set to restrict the rabbit's movement\n style_list : list\n A list of available movement methods\n\n Methods\n -------\n move_random()\n Increments or Decrements the rabbit's current position by 1, randomly\n move_range()\n Calculates 10% the size of the space attribute, updates max_pos to the current position\n plus the 10% figure, updates min_pos to the current position minus the 10% figure,\n and then Increments or Decrements the rabbit's current position by 1, randomly\n move_up()\n Increments the rabbit's current position by 1\n move_down()\n Decrements the rabbit's current position by 1\n move()\n Calls the appropriate movement method based on style and style_list\n \"\"\"\n def __init__(self, space: int):\n self.space = space\n self.start = random.choice([i for i in range(space)])\n self.pos = self.start\n self.style = random.choice([0, 1, 2, 3])\n self.max_pos = space - 1\n self.min_pos = 0\n self.range_set = False\n self.style_list = [self.move_random, self.move_range, self.move_up, self.move_down]\n\n def move_random(self):\n \"\"\"Increments or Decrements the rabbit's current position by 1, randomly\"\"\"\n self.pos += random.choice([1, -1])\n\n def move_range(self):\n \"\"\"Calculates 10% the size of the space attribute, updates max_pos to the current position\n plus the 10% figure, updates min_pos to the current position minus the 10% figure,\n and then Increments or Decrements the rabbit's current position by 1, randomly\"\"\"\n if not self.range_set:\n self.max_pos = self.pos + min(int(self.space * .1), self.max_pos - self.pos)\n self.min_pos = self.pos - min(int(self.space * .1), self.pos)\n self.range_set = True\n self.move_random()\n\n def move_up(self):\n \"\"\"Increments the rabbit's current position by 1\"\"\"\n self.pos += 1\n\n def move_down(self):\n \"\"\"Decrements the rabbit's current position by 1\"\"\"\n self.pos -= 1\n\n def move(self):\n \"\"\"Increments or decrements the rabbit's position if it is at the first or last\n hole, respectively. Otherwise, it calls the appropriate movement method based on the current\n style, using style_list\"\"\"\n if self.pos == self.max_pos:\n self.move_down()\n return\n\n if self.pos == self.min_pos:\n self.move_up()\n return\n\n self.style_list[self.style]()\n\n\ndef main(space_size: int):\n \"\"\"Compares the rabbit's current position to the current position being checked. If they are not equal,\n the rabbit's position is updated based on its current movement style\"\"\"\n r = Rabbit(space_size)\n found = False\n step = 0\n check_pos = 0\n check_inc = 1\n while not found:\n found = check_pos == r.pos\n if found:\n break\n check_pos += check_inc\n r.move()\n step += 1\n if check_pos == space_size - 1 or check_pos == 0:\n check_inc *= -1\n check_pos += check_inc\n\n logging.info(f\"\"\"\\n\nRange: {r.min_pos} : {r.max_pos}\nRabbit start on : {r.start}\nRabbit found on step: {step}\nStyle: {r.style_list[r.style].__name__}\nRabbit found: {found}\n\"\"\")\n\n return found\n\n\nmain(100)\n\n\n"

ERROR: type should be string, got "https://github.com/speedrun-program/small_array/blob/main/small_array.py\nAs a personal project, I wanted to try to make Snake Game in pygame where the grid can be arbitrarily large. I made these classes so I could make larger grids before running out of memory.\nclass nbitndarray:\n \"a class which lets you use a byte array as if it was an arbitrarily deeply nested \"\n \"array with each index being any number of bits wide\"\n \n def __init__(self, dimensions, bits_per_index):\n self.bits_per_index = bits_per_index\n self.dimensions = tuple(dimensions)\n \n if any(d <= 0 for d in dimensions):\n raise ValueError(\"all dimensions must be greater than 0\")\n elif bits_per_index <= 0:\n raise ValueError(\"bits_per_index must be greater than 0\")\n elif not dimensions:\n raise ValueError(\"no dimensions given\")\n \n total_bits = bits_per_index\n for d in dimensions:\n total_bits *= d\n \n total_bytes = (total_bits // 8) + (total_bits % 8 != 0)\n self._array = bytearray(total_bytes)\n \n \n def _index_generator(self, position):\n for depth, (pos, dimension_length) in enumerate(zip(position, self.dimensions)):\n actual_position = pos if pos >= 0 else dimension_length + pos\n if not 0 <= actual_position < dimension_length:\n raise IndexError(f\"attempted to access index {pos} of dimension {depth}, which is length {dimension_length}\")\n \n yield actual_position\n \n \n def _get_actual_position(self, position): # returns (start_byte, start_bit)\n if (len(position) != len(self.dimensions)):\n raise ValueError(\n f\"position argument had {len(position)} dimensions, \"\n f\"but self.dimensions has {len(self.dimensions)} dimensions\"\n )\n \n index_generator = self._index_generator(position)\n which_bit = next(index_generator)\n for i, pos in enumerate(index_generator, 1):\n which_bit = (which_bit * self.dimensions[i]) + pos\n which_bit *= self.bits_per_index\n \n return divmod(which_bit, 8)\n \n \n def zero_bytes(self):\n self._array.__init__(len(self._array))\n \n \n def get(self, position):\n which_byte, byte_start_position = self._get_actual_position(position)\n bits_left_to_read = self.bits_per_index\n current_bit_position = min(8 - byte_start_position, bits_left_to_read)\n \n # reading first byte\n value = (self._array[which_byte] >> byte_start_position) & ((1 << current_bit_position) - 1)\n bits_left_to_read -= current_bit_position\n which_byte += 1\n \n # reading middle byte(s)\n while bits_left_to_read >= 8:\n value += self._array[which_byte] << current_bit_position\n bits_left_to_read -= 8\n current_bit_position += 8\n which_byte += 1\n \n #reading last byte\n if bits_left_to_read > 0:\n value += (self._array[which_byte] & ((1 << bits_left_to_read) - 1)) << current_bit_position\n \n return value\n \n \n def set(self, position, new_value):\n if new_value > ((1 << self.bits_per_index) - 1) or new_value < 0:\n raise ValueError(f\"value must be in range(0, {((1 << self.bits_per_index) - 1)})\")\n \n which_byte, byte_start_position = self._get_actual_position(position)\n bits_left_to_set = self.bits_per_index\n \n # setting first byte\n bits_left_in_first_byte = min(8 - byte_start_position, bits_left_to_set)\n first_byte_start_bits = self._array[which_byte] & ((1 << byte_start_position) - 1)\n current_value_to_write = new_value & ((1 << bits_left_in_first_byte) - 1)\n self._array[which_byte] >>= byte_start_position + bits_left_in_first_byte\n self._array[which_byte] <<= bits_left_in_first_byte\n self._array[which_byte] += current_value_to_write\n self._array[which_byte] <<= byte_start_position\n self._array[which_byte] += first_byte_start_bits\n new_value >>= bits_left_in_first_byte\n bits_left_to_set -= bits_left_in_first_byte\n which_byte += 1\n \n # setting middle byte(s)\n while bits_left_to_set >= 8:\n current_value_to_write = new_value & 0b11111111\n self._array[which_byte] = new_value\n new_value >>= 8\n bits_left_to_set -= 8\n which_byte += 1\n \n # setting last bit\n if bits_left_to_set > 0:\n self._array[which_byte] >>= bits_left_to_set\n self._array[which_byte] <<= bits_left_to_set\n self._array[which_byte] += new_value\n\n\nclass nbitarray(nbitndarray):\n \"a class which lets you use a byte array as if it was an \"\n \"array with each index being any number of bits wide\"\n \n def __init__(self, bits_per_index, initial_length=0):\n if bits_per_index <= 0:\n raise ValueError(\"bits_per_index must be greater than 0\")\n elif initial_length < 0:\n raise ValueError(\"initial_length must be greater than or equal to 0\")\n \n self.bits_per_index = bits_per_index\n self.length = initial_length\n \n total_bits = bits_per_index * initial_length\n total_bytes = (total_bits // 8) + (total_bits % 8 != 0)\n self._array = bytearray(total_bytes)\n \n \n def _get_actual_position(self, idx):\n non_negative_idx = idx if idx >= 0 else self.length + idx\n \n if not 0 <= non_negative_idx < self.length:\n raise IndexError(f\"attempted to access index {idx} of nbitarray, which is length {self.length}\")\n \n return divmod(non_negative_idx * self.bits_per_index, 8)\n \n \n def append(self, new_value):\n # allocating more space if necessary\n total_bits = self.bits_per_index * (self.length + 1)\n total_bytes = (total_bits // 8) + (total_bits % 8 != 0)\n while len(self._array) < total_bytes:\n self._array.append(0)\n \n self.length += 1\n self.set(-1, new_value)\n\n"