Add: ans

Author: openset

problems/active-businesses/active_businesses.sql

@@ -0,0 +1 @@
+# Write your MySQL query statement below

problems/adding-two-negabinary-numbers/adding_two_negabinary_numbers.go

@@ -0,0 +1,38 @@
+package adding_two_negabinary_numbers
+
+func addNegabinary(A, B []int) []int {
+	i, j := len(A)-1, len(B)-1
+	res := make([]int, 0, i+j)
+	carry := 0
+	for i >= 0 || j >= 0 || carry != 0 {
+		if i >= 0 {
+			carry += A[i]
+			i--
+		}
+		if j >= 0 {
+			carry += B[j]
+			j--
+		}
+		res = append(res, carry&1)
+		carry = -(carry >> 1)
+	}
+
+	res = reverse(res)
+
+	// cut leading zero
+	i, end := 0, len(res)-1
+	for i < end && res[i] == 0 {
+		i++
+	}
+	return res[i:]
+}
+
+func reverse(A []int) []int {
+	i, j := 0, len(A)-1
+	for i < j {
+		A[i], A[j] = A[j], A[i]
+		i++
+		j--
+	}
+	return A
+}

problems/best-sightseeing-pair/best_sightseeing_pair.go

@@ -0,0 +1,18 @@
+package best_sightseeing_pair
+
+func maxScoreSightseeingPair(A []int) int {
+	a := A[0] // a is A[i]+i
+	res := 0
+	for j := 1; j < len(A); j++ {
+		res = max(res, a+A[j]-j)
+		a = max(a, A[j]+j)
+	}
+	return res
+}
+
+func max(a, b int) int {
+	if a > b {
+		return a
+	}
+	return b
+}

problems/binary-tree-cameras/binary_tree_cameras.go

@@ -0,0 +1 @@
+package binary_tree_cameras

problems/brace-expansion-ii/brace_expansion_ii.go

@@ -0,0 +1 @@
+package brace_expansion_ii

problems/broken-calculator/broken_calculator.go

@@ -0,0 +1 @@
+package broken_calculator

problems/building-h2o/building_h2o.py

@@ -0,0 +1,17 @@
+#!/usr/bin/env python
+
+class H2O:
+    def __init__(self):
+        pass
+
+
+    def hydrogen(self, releaseHydrogen: 'Callable[[], None]') -> None:
+        
+        # releaseHydrogen() outputs "H". Do not change or remove this line.
+        releaseHydrogen()
+
+
+    def oxygen(self, releaseOxygen: 'Callable[[], None]') -> None:
+        
+        # releaseOxygen() outputs "O". Do not change or remove this line.
+        releaseOxygen()

problems/capacity-to-ship-packages-within-d-days/capacity_to_ship_packages_within_d_days.go

@@ -0,0 +1,35 @@
+package capacity_to_ship_packages_within_d_days
+
+func shipWithinDays(weights []int, D int) int {
+	lo, hi := 0, 0
+	for _, w := range weights {
+		lo = max(lo, w)
+		hi += w
+	}
+
+	for lo < hi {
+		mid := (lo + hi) >> 1
+		days, cur := 1, 0
+		for _, w := range weights {
+			if cur+w > mid {
+				days++
+				cur = 0
+			}
+			cur += w
+		}
+		if days > D {
+			lo = mid + 1
+		} else {
+			hi = mid
+		}
+	}
+
+	return lo
+}
+
+func max(a, b int) int {
+	if a > b {
+		return a
+	}
+	return b
+}

problems/car-pooling/car_pooling.go

@@ -0,0 +1,19 @@
+package car_pooling
+
+func carPooling(trips [][]int, capacity int) bool {
+	location := [1001]int{}
+	for _, t := range trips {
+		num, start, end := t[0], t[1], t[2]
+		location[start] += num
+		location[end] -= num
+	}
+
+	p := 0
+	for _, c := range location {
+		p += c
+		if p > capacity {
+			return false
+		}
+	}
+	return true
+}

problems/check-if-word-is-valid-after-substitutions/check_if_word_is_valid_after_substitutions.go

@@ -0,0 +1,27 @@
+package check_if_word_is_valid_after_substitutions
+
+func isValid(S string) bool {
+	bs := []byte(S)
+	stack := make([]byte, len(S))
+	top := -1
+
+	for _, b := range bs {
+		top++
+		stack[top] = b
+		switch top {
+		case 0:
+			if b != 'a' {
+				return false
+			}
+		case 1:
+		default:
+			if b == 'c' &&
+				stack[top-1] == 'b' &&
+				stack[top-2] == 'a' {
+				top -= 3
+			}
+		}
+	}
+
+	return top == -1
+}