Twitch 前端 Front End OA 面經

Twitch Online OA 總共 3題希望對各位朋友有幫助：

1. 考prototype:

You are given an array A consisting of N integers. Your task is to return an array of N objects that share the same prototype, each of whom should have a "value()" method, which called on i-th object should return the integer A[i].

The "value()" method of all objects must be the same method and it cannot be an own property of those objects (for an object O the following O.hasOwnProperty('value') should be false).

Write a function "solution" such that, given an array A of N integers, returns an array T of N JavaScript objects. For any two indices i, j < N, the following conditions should be true:

    T[j].value() === A[j]
    T[i].value === T[j].value
    !T[i].hasOwnProperty('value')
    !T[j].hasOwnProperty('value')

where T = solution(A).

For example, given A = [4, 2], your function should return such array T, that

    T[0].value() === 4
    T[1].value() === 2
    T[0].value === T[1].value
    !T[0].hasOwnProperty('value')
    !T[1].hasOwnProperty('value')</tt>

Assume that:

- N is an integer within the range 1 to 200
- each element of array A is an integer within the range −9,007,199,254,740,991 to 9,007,199,254,740,991

In your solution, focus on correctness. The performance of your solution will not be the focus of the assessment.

您好！
本帖隐藏的内容需要积分高于 188 才可浏览
您当前积分为 0。
使用VIP即刻解锁阅读权限或查看其他获取积分的方式

游客，您好！
本帖隐藏的内容需要积分高于 188 才可浏览
您当前积分为 0。
VIP即刻解锁阅读权限 或 查看其他获取积分的方式
Unlock interview details and practice with AI
Curated Interview Questions from Top Companies

sed, any one of them could be chosen.
Write a function:

function solution(S) such that, given a string S consisting of N characters, returns any string that can result from a sequence of transformations as described above.


For example, given string S = "ACCAABBC" the function may return "AC", because one of the possible sequences of transformations is as follows:

ACCAABBC -> AAABBC -> ABBC -> AC

Also, given string S = "ABCBBCBA" the function may return "", because one possible sequence of transformations is:

ABCBBCBA -> ABCCBA -> ABBA -> AA -> ""

Finally, for string S = "BABABA" the function must return "BABABA", because no rules can be applied to string S.
Write an efficient algorithm for the following assumptions:

string S consists only of the following characters: "A", "B" and/or "C".

#3

const process = (str) => {
  let i = 0;
  
  while(i<str.length-1) {
    if(str[i] === str[i+1]) {
      str = str.slice(0, i) + str.slice(i+2);
      i = Math.min(i-1, 0);
    } else {
      i++
    }
  }
  
  return str;
};

有后续面经吗 我过几天有个面试

yejiada 发表于 2020-9-4 03:31
有后续面经吗 我过几天有个面试

想问问你做codility了吗？

有没有电面的面经~

这第一题，啥意思。没太明白

同前端 求加微信交流一下 694537055