mangreen
commented
4 years ago 趨勢
1. https://leetcode.com/discuss/interview-question/398056/Microsoft-or-OA-2019-or-Max-Inserts-to-Obtain-String-Without-3-Consecutive-'a'
func maxInserts(S string) int {
countA, countOther := 0, 0
for i := 0; i < len(S); i++ {
if S[i] == 'a' {
countA++
} else {
countOther++
countA = 0
}
if countA == 3 {
return -1
}
}
// pairs of A's as separators and bookends for the non-a characters
return 2*(countOther+1) - (len(S) - countOther)
}2. https://github.com/it3xl/MaxBiValuedSlice
https://stackoverflow.com/questions/42786186/find-max-slice-of-array-javascript [1, 2, 3, 2] => [2, 3, 2] => ans: 3 [0, 5, 5, 4, 4, 5, 12] => [5, 5, 4, 4, 5] => ans: 5
func longestSubBiValuedArray(A []int) int {
count := 0
lp := 0
dict := []int{}
longest := 0
for i := 0; i < len(A); i++ {
if index(dict, A[i]) == -1 && len(dict) < 2 {
dict = append(dict, A[i])
lp = i
count++
} else if index(dict, A[i]) == -1 && len(dict) >= 2 {
dict = append(dict[1:], A[i])
count = i - lp + 1
} else if index(dict, A[i]) == 0 {
lp = i
count++
} else {
count++
}
longest = max(longest, count)
}
fmt.Println(dict, lp)
return longest
}
func index(dict []int, value int) int {
for pos, v := range dict {
if v == value {
return pos
}
}
return -1
}
func max(a, b int) int {
if a > b {
return a
}
return b
}func longestSubBiValuedArray(A []int) int {
q := []obj{{A[0], 1}}
count := 1
longest := 1
for _, a := range A[1:] {
last := q[len(q)-1]
if len(q) < 2 || q[0].val == a || q[1].val == a {
count++
} else {
count = last.count + 1
}
if last.val == a {
q[len(q)-1].count++
} else {
q = append(q, obj{a, 1})
if len(q) > 2 {
q = q[1:]
}
}
if count > longest {
longest = count
}
}
return longest
}
type obj struct {
val int
count int
}3. https://leetcode.com/discuss/interview-question/330356/Amazon-or-Online-Assessment-2019-or-Longest-string-without-3-consecutive-characters
Given A, B, C, find any string of maximum length that can be created such that no 3 consecutive characters are same. There can be at max A 'a', B 'b' and C 'c'.
Example 1: Input: A = 1, B = 1, C = 6 Output: "ccbccacc"
Example 2: Input: A = 1, B = 2, C = 3 Output: "acbcbc"
Related questions: https://leetcode.com/problems/reorganize-string https://leetcode.com/problems/distant-barcodes https://leetcode.com/problems/rearrange-string-k-distance-apart (premium)
Ans: https://leetcode.com/problems/longest-happy-string/
4. there are two wooden sticks of length a and b respectively...
給兩條sticks得到最大正方形的邊長 11, 13 => 5 1, 2 => 0 1, 8 => 2
func solution(A, B int) int {
if A+B < 4 {
return 0
}
l := (A + B) / 4
if B > A {
A, B = B, A
}
for l > 0 {
if A/2 >= l && B/2 >= l {
return l
}
if A/3 >= l && B >= l {
return l
}
if A/4 >= l {
return l
}
l--
}
return 0
}5. https://leetcode.com/discuss/interview-question/906783/moneris-interview-answers-are-welcomed
func solution(N int, K int) int {
count := 0
for N > 1 {
if K > 0 {
if N%2 == 0 {
N /= 2
K--
} else {
N--
}
count++
} else {
count += N - 1
N = 0
}
}
return count
}6. https://brainly.com/question/15405872
func solution(A []int) int {
n := len(A)
if n < 2 { // if no of elements are 2 then max groups are 2
return n
}
stack := []int{0} // stack to store the groups
for i := 1; i < n; i++ {
if A[i] >= A[i-1] {
stack = append(stack, i) // pushing elements if if ar[i] is greater than the previous element
}
for j := i; j > 0 && A[j] < A[j-1]; j-- { // finding the max number of grps
A[j], A[j-1] = A[j-1], A[j]
if j <= stack[len(stack)-1] {
stack = stack[:len(stack)-1]
}
}
}
return len(stack)
}
https://hackmd.io/@Rance