brightlightkim

Given an m x n 2D binary grid grid which represents a map of '1's (land) and '0's (water), return the number of islands. An island is surrounded by water and is formed by connecting adjacent lands horizontally or vertically. You may assume all four edges of the grid are all surrounded by water. Example 1: Input: grid = [ ["1","1","1","1","0"], ["1","1","0","1","0"], ["1","1","0","0","0"], ["0","..

def insertionSort(array): counter = 0 for i in range(len(array)): min = array[i] for comp in range(counter + 1, len(array)): if array[comp] < min: min = array[comp] array[i], array[comp] = array[comp], array[i] counter += 1 return array

def bubbleSort(array): sorted = False while not sorted: sorted = True for x in range(len(array)-1): if array[x] > array[x+1]: array[x], array[x+1] = array[x+1], array[x] sorted = False return array

def findThreeLargestNumbers(array): array.sort() return [array[len(array)-3], array[len(array)-2], array[len(array)-1]]

import math def binarySearch(array, target): left = 0 right = len(array)-1 middle = math.trunc((right + left) / 2) while left target: right = middle - 1 else: left = middle + 1 middle = math.trunc((right + left) / 2) return -1

You are given an array prices where prices[i] is the price of a given stock on the ith day. You want to maximize your profit by choosing a single day to buy one stock and choosing a different day in the future to sell that stock. Return the maximum profit you can achieve from this transaction. If you cannot achieve any profit, return 0. Example 1: Input: prices = [7,1,5,3,6,4] Output: 5 Explanat..

Given two positive integers, determine whether the first one is larger than the second one. Input The single line of input contains two positive integers, a and b (0b, 0 otherwise.

A common problem in mathematics is to determine which quadrant a given point lies in. There are four quadrants, numbered from 1 to 4, as shown in the diagram below: For example, the point A, which is at coordinates (12,5) lies in quadrant 1 since both its x and y values are positive, and point B lies in quadrant 2 since its x value is negative and its y value is positive. Your job is to take a p..

Given the head of a linked list, return the node where the cycle begins. If there is no cycle, return null. There is a cycle in a linked list if there is some node in the list that can be reached again by continuously following the next pointer. Internally, pos is used to denote the index of the node that tail's next pointer is connected to (0-indexed). It is -1 if there is no cycle. Note that p..

# Tip: You can use the type(element) function to check whether an item # is a list or an integer. def productSum(array): # Write your code here. return productHelper(array, 1) # m: multiply value def productHelper(array, m): sum = 0 for x in array: if type(x) == list: sum += (m+1) * productHelper(x, m+1) else: sum += x return sum