BFS增加order。
11个class选择器可以干掉1个id选择器吗
今天遇到一个有趣的问题,class选择器权重是10,id选择器权重是100,那么11个class选择器可以干掉1个id选择器吗?😂
js链式调用和流程控制
实现new Person('xiaoming').say('hello').sleep(2).play('js').sleep(1).say('hhh')
前端价值在哪?
日常思考前端价值在哪。
实现中文排序、数字英文混合排序
JS排序:localeCompare() 方法实现中文排序、sort方法实现数字英文混合排序
动态规划模板
Before starting the topic let me introduce myself. I am a Mobile Developer currently working in Warsaw and spending my free time for interview preparations. I started to prepare for interviews two years ago. At that time I should say I could not solve the two sum problem. Easy problems seemed to me like hard ones so most of the time I had to look at editorials and discuss section. Currently, I have solved ~800 problems and time to time participate in contests. I usually solve 3 problems in a contest and sometimes 4 problems. Ok, lets come back to the topic.
Recently I have concentrated my attention on Dynamic Programming cause its one of the hardest topics in an interview prep. After solving ~140 problems in DP I have noticed that there are few patterns that can be found in different problems. So I did a research on that and find the following topics. I will not give complete ways how to solve problems but these patterns may be helpful in solving DP.
NPM和Yarn淘宝镜像
READ MOREleetcode-119
READ MOREleetcode-322
READ MORE链表问题集锦
链表问题在面试过程中也是很重要也很基础的一部分,链表本身很灵活,很考查编程功底,所以是很值得考的地方。我将复习过程中觉得比较好的链表问题整理了下。