<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Mapoos]]></title><description><![CDATA[从零开始]]></description><link>https://blog.youkuaiyun.com/mapoos</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; mapoos]]></copyright><item><title><![CDATA[2020暑假实习-美团前端二面]]></title><link>https://blog.youkuaiyun.com/mapoos/article/details/105655445</link><guid>https://blog.youkuaiyun.com/mapoos/article/details/105655445</guid><author>mapoos</author><pubDate>Tue, 21 Apr 2020 12:35:16 +0800</pubDate><description><![CDATA[2020暑假实习-美团前端二面
因为不是科班出身，所以跳过了很多基础问题。


https的红锁和绿锁（证书认证，CA认证机构的公钥是放在操作系统里的）


localStorage满了怎么办   indexDB（不懂，提了清空或者放到sessionStorage）


加载页面长时间白屏，怎么分析这个问题（不懂，只说了一个dns污染之类的问题）


拉平数组（直接用ES6的flat函数，或者递归...]]></description><category></category></item><item><title><![CDATA[2020暑假实习-腾讯TEG前端二面]]></title><link>https://blog.youkuaiyun.com/mapoos/article/details/105556043</link><guid>https://blog.youkuaiyun.com/mapoos/article/details/105556043</guid><author>mapoos</author><pubDate>Thu, 16 Apr 2020 13:34:02 +0800</pubDate><description><![CDATA[2020暑假实习-腾讯TEG前端二面
机试部分
一、简答题
1. 常用的浏览器内核:

webkit
blink
gecko
trident
…

2. 外边距重叠
外边距重叠是指两个连续的元素，它们各自具有的margin会覆盖对方的margin，造成最终显示在浏览器上的效果是只存在较大的margin(不存在外边距重叠的话则会显示为两者的margin之和)
3. CSS3属性

opacity
t...]]></description><category></category></item><item><title><![CDATA[2020暑假实习-美团前端一面]]></title><link>https://blog.youkuaiyun.com/mapoos/article/details/105532330</link><guid>https://blog.youkuaiyun.com/mapoos/article/details/105532330</guid><author>mapoos</author><pubDate>Wed, 15 Apr 2020 12:33:15 +0800</pubDate><description><![CDATA[美团前端一面

介绍一下promise
如何网页优化；为什么减少请求数可以优化网页（同域名请求数有限，减少排队时间）
promise实现xhr
二分法实现开根
如何判断js数组的底层是数组还是链表（我的方法是自己写一个链表实现的array，与原生的Array都使用同样的数据同样的操作，最后对比执行时间判断）
node是如何保证可用性的（pm2）
instanceof和typeof的区别
有哪几种链...]]></description><category></category></item><item><title><![CDATA[2020暑假实习-腾讯TEG前端一面]]></title><link>https://blog.youkuaiyun.com/mapoos/article/details/105480502</link><guid>https://blog.youkuaiyun.com/mapoos/article/details/105480502</guid><author>mapoos</author><pubDate>Mon, 13 Apr 2020 03:15:44 +0800</pubDate><description><![CDATA[腾讯TEG前端一面

CSS切图会不会（不会…）
HTTP 状态码（1xx-5xx）
js如何获取字符串的最后三位（遍历 substring slice split  但应该还有更多）
ES6新特性
Promise原理（问的是事件循环）
Vue计算属性的原理（如何实现监听和变化，没答出来，defineProperty?）
let和var的区别（变量提升，重复声明，暂时性死区）
js的基础类型(6种...]]></description><category></category></item><item><title><![CDATA[2020暑假实习-百度前端一面&二面&三面]]></title><link>https://blog.youkuaiyun.com/mapoos/article/details/105470198</link><guid>https://blog.youkuaiyun.com/mapoos/article/details/105470198</guid><author>mapoos</author><pubDate>Sun, 12 Apr 2020 15:23:05 +0800</pubDate><description><![CDATA[百度前端一面&amp;二面&amp;三面
一面

算法题：JS实现二分搜索、随机打乱数组
HTML：

cookie、localStorage、sessionStorage区别
标签页之间的通信(cookie+setInterval，localStorage，websocket)


CSS：

position介绍(5种)
行级元素、块级元素的区别；input、img能否调整宽高（input实际...]]></description><category></category></item><item><title><![CDATA[1405. Longest Happy String (M)]]></title><link>https://blog.youkuaiyun.com/mapoos/article/details/105338038</link><guid>https://blog.youkuaiyun.com/mapoos/article/details/105338038</guid><author>mapoos</author><pubDate>Mon, 06 Apr 2020 08:21:26 +0800</pubDate><description><![CDATA[Longest Happy String (M)
A string is called happy if it does not have any of the strings 'aaa', 'bbb' or 'ccc' as a substring.
Given three integers a, b and c, return any string s, which satisfies fol...]]></description><category></category></item><item><title><![CDATA[1404. Number of Steps to Reduce a Number in Binary Representation to One (M)]]></title><link>https://blog.youkuaiyun.com/mapoos/article/details/105337833</link><guid>https://blog.youkuaiyun.com/mapoos/article/details/105337833</guid><author>mapoos</author><pubDate>Mon, 06 Apr 2020 06:43:52 +0800</pubDate><description><![CDATA[Number of Steps to Reduce a Number in Binary Representation to One (M)
Given a number s in their binary representation. Return the number of steps to reduce it to 1 under the following rules:

If the ...]]></description><category></category></item><item><title><![CDATA[1403. Minimum Subsequence in Non-Increasing Order (E)]]></title><link>https://blog.youkuaiyun.com/mapoos/article/details/105327040</link><guid>https://blog.youkuaiyun.com/mapoos/article/details/105327040</guid><author>mapoos</author><pubDate>Sun, 05 Apr 2020 14:54:35 +0800</pubDate><description><![CDATA[Minimum Subsequence in Non-Increasing Order (E)
Given the array nums, obtain a subsequence of the array whose sum of elements is strictly greater than the sum of the non included elements in such subs...]]></description><category></category></item><item><title><![CDATA[332. Reconstruct Itinerary (M)]]></title><link>https://blog.youkuaiyun.com/mapoos/article/details/105190981</link><guid>https://blog.youkuaiyun.com/mapoos/article/details/105190981</guid><author>mapoos</author><pubDate>Mon, 30 Mar 2020 05:32:24 +0800</pubDate><description><![CDATA[Reconstruct Itinerary (M)
Given a list of airline tickets represented by pairs of departure and arrival airports [from, to], reconstruct the itinerary in order. All of the tickets belong to a man who ...]]></description><category></category></item><item><title><![CDATA[1396. Design Underground System M]]></title><link>https://blog.youkuaiyun.com/mapoos/article/details/105190878</link><guid>https://blog.youkuaiyun.com/mapoos/article/details/105190878</guid><author>mapoos</author><pubDate>Mon, 30 Mar 2020 02:16:08 +0800</pubDate><description><![CDATA[Design Underground System (M)
Implement the class UndergroundSystem that supports three methods:
1.checkIn(int id, string stationName, int t)

A customer with id card equal to id, gets in the station ...]]></description><category></category></item><item><title><![CDATA[1395. Count Number of Teams (M)]]></title><link>https://blog.youkuaiyun.com/mapoos/article/details/105190844</link><guid>https://blog.youkuaiyun.com/mapoos/article/details/105190844</guid><author>mapoos</author><pubDate>Mon, 30 Mar 2020 01:51:49 +0800</pubDate><description><![CDATA[Count Number of Teams (M)
There are n soldiers standing in a line. Each soldier is assigned a unique rating value.
You have to form a team of 3 soldiers amongst them under the following rules:

Choose...]]></description><category></category></item><item><title><![CDATA[1394. Find Lucky Integer in an Array (E)]]></title><link>https://blog.youkuaiyun.com/mapoos/article/details/105190813</link><guid>https://blog.youkuaiyun.com/mapoos/article/details/105190813</guid><author>mapoos</author><pubDate>Mon, 30 Mar 2020 01:37:29 +0800</pubDate><description><![CDATA[Find Lucky Integer in an Array (E)
Given an array of integers arr, a lucky integer is an integer which has a frequency in the array equal to its value.
Return a lucky integer in the array. If there ar...]]></description><category></category></item><item><title><![CDATA[28. Implement strStr() (E)]]></title><link>https://blog.youkuaiyun.com/mapoos/article/details/105040447</link><guid>https://blog.youkuaiyun.com/mapoos/article/details/105040447</guid><author>mapoos</author><pubDate>Mon, 23 Mar 2020 07:09:51 +0800</pubDate><description><![CDATA[Implement strStr() (E)
Implement strStr().
Return the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.
Example 1:
Input: haystack = "hello", needle = "ll"
...]]></description><category></category></item><item><title><![CDATA[1391. Check if There is a Valid Path in a Grid (M)]]></title><link>https://blog.youkuaiyun.com/mapoos/article/details/105040397</link><guid>https://blog.youkuaiyun.com/mapoos/article/details/105040397</guid><author>mapoos</author><pubDate>Mon, 23 Mar 2020 06:17:06 +0800</pubDate><description><![CDATA[Check if There is a Valid Path in a Grid (M)
Given a m x n grid. Each cell of the grid represents a street. The street of grid[i][j] can be:

1 which means a street connecting the left cell and the ri...]]></description><category></category></item><item><title><![CDATA[1392. Longest Happy Prefix (H)]]></title><link>https://blog.youkuaiyun.com/mapoos/article/details/105028069</link><guid>https://blog.youkuaiyun.com/mapoos/article/details/105028069</guid><author>mapoos</author><pubDate>Sun, 22 Mar 2020 14:55:04 +0800</pubDate><description><![CDATA[Longest Happy Prefix (H)
A string is called a happy prefix if is a non-empty prefix which is also a suffix (excluding itself).
Given a string s. Return the longest happy prefix of s .
Return an empty ...]]></description><category></category></item><item><title><![CDATA[1390. Four Divisors (M)]]></title><link>https://blog.youkuaiyun.com/mapoos/article/details/105027318</link><guid>https://blog.youkuaiyun.com/mapoos/article/details/105027318</guid><author>mapoos</author><pubDate>Sun, 22 Mar 2020 14:12:47 +0800</pubDate><description><![CDATA[Four Divisors (M)
Given an integer array nums, return the sum of divisors of the integers in that array that have exactly four divisors.
If there is no such integer in the array, return 0.
Example 1:
...]]></description><category></category></item><item><title><![CDATA[1389. Create Target Array in the Given Order (E)]]></title><link>https://blog.youkuaiyun.com/mapoos/article/details/105026955</link><guid>https://blog.youkuaiyun.com/mapoos/article/details/105026955</guid><author>mapoos</author><pubDate>Sun, 22 Mar 2020 13:49:19 +0800</pubDate><description><![CDATA[Create Target Array in the Given Order (E)
Given two arrays of integers nums and index. Your task is to create target array under the following rules:

Initially target array is empty.
From left to ri...]]></description><category></category></item><item><title><![CDATA[1383. Maximum Performance of a Team (H)]]></title><link>https://blog.youkuaiyun.com/mapoos/article/details/104890858</link><guid>https://blog.youkuaiyun.com/mapoos/article/details/104890858</guid><author>mapoos</author><pubDate>Mon, 16 Mar 2020 03:38:22 +0800</pubDate><description><![CDATA[Maximum Performance of a Team (H)
There are n engineers numbered from 1 to n and two arrays: speed and efficiency, where speed[i] and efficiency[i] represent the speed and efficiency for the i-th engi...]]></description><category></category></item><item><title><![CDATA[1381. Design a Stack With Increment Operation (M)]]></title><link>https://blog.youkuaiyun.com/mapoos/article/details/104877336</link><guid>https://blog.youkuaiyun.com/mapoos/article/details/104877336</guid><author>mapoos</author><pubDate>Sun, 15 Mar 2020 13:22:30 +0800</pubDate><description><![CDATA[Design a Stack With Increment Operation (M)
Design a stack which supports the following operations.
Implement the CustomStack class:

CustomStack(int maxSize) Initializes the object with maxSize which...]]></description><category></category></item><item><title><![CDATA[1382. Balance a Binary Search Tree (M)]]></title><link>https://blog.youkuaiyun.com/mapoos/article/details/104876835</link><guid>https://blog.youkuaiyun.com/mapoos/article/details/104876835</guid><author>mapoos</author><pubDate>Sun, 15 Mar 2020 12:50:56 +0800</pubDate><description><![CDATA[Balance a Binary Search Tree (M)
Given a binary search tree, return a balanced binary search tree with the same node values.
A binary search tree is balanced if and only if the depth of the two subtre...]]></description><category></category></item></channel></rss>