Online Round
2 coding questions were given, and the time was 75 minutes.
1. There are n trees in a circle. Each tree has a fruit value associated with it. A bird can sit on a tree for 0.5 sec and then he has to move to a neighbouring tree. It takes the bird 0.5 seconds to move from one tree to another. The bird gets the fruit value when she sits on a tree. We are given n and m (the number of seconds the bird has), and the fruit values of the trees. We have to maximise the total fruit value that the bird can gather. The bird can start from any tree.
I forgot the examples, sorry:(
2. You are given the encoding for a base 58 number. You have to convert all the numbers from 1 to n to a base 58 number using the encoding given.
The questions were not difficult, and the shortlisting basis was very strange. My friend finished much before me, but he was not shortlisted. I think they looked at your CV and projects.
1st telephonic round
Introduce yourself and tell me about your projects. Then he asked me 2 algorithmic questions.
1. You are given the start time and finish time of n intervals. You have to write a a function that returns boolean value indicating if there was any overlapping interval in the set of existing intervals. (Sort and check, time complexity O(nlogn))
2. You have 2 sparse vectors (large number of 0’s). First tell me a way to represent and store them, and then find the dot product.
(To store them, we should store the value and index of those indexes that have a non-zero value, and then finding the dot product is very straight forward).
2nd telephonic round
The interviewer was not the same. Introduce yourself and tell me about your projects. Even he asked me 2 algorithmic question.
1. You have an array of n elements, and a sum. Check if any 2 elements in the array sum to the given sum. ( Expected time complexity O(n). Use hashing)
2. Extended the previous problem to sum of 3 elements in the array summing up to the given sum.
A few pointers:
? Always explain what you’re doing and why.
? First explain the algorithm and then start coding.
? If he gives a hint, take it and use it.
相关推荐
Iphone开发系列源码——FaceBook基于Iphone的多个应用源码Iphone开发系列源码——FaceBook基于Iphone的多个应用源码Iphone开发系列源码——FaceBook基于Iphone的多个应用源码Iphone开发系列源码——FaceBook基于...
The Facebook Data Scientist Interview - Towards Data Science,Facebook数据科学家面试揭秘,by Jay Feng。
https://github.com/mission-peace/interview/wiki Like my facebook page for latest updates on my youtube channel https://www.facebook.com/tusharroy25 Contribution Please contribute to this repository...
这本书的书名——《打造Facebook:亲历Facebook爆发的5年》很嚣张,谁有资格可以说这句话呢,当然,扎克伯格最有资格,但他不会亲自来告诉你,至少从目前的情况来看,近几年都不大可能。而且,这不是一个人的公司。...
Facebook PHP SDK 4.0
Facebook面试 leetcode中的一些问题 一些后续行动 用Java实现的一些高频问题
facebook 分享文档 twitter 分享文档 vue 使用 facebook 使用分享 找到index.html 添加一下代码 <!-- facebook 分享 --> <div id=fb-root></div> [removed](function (d, s, id) { var js, fjs = d....
Cracking The Coding Interview CTCI最新版6th 美国亚马逊best seller,面试facebook,google, amazon, apple和microsoft必备面试宝典。
Companies covered include Google, Amazon, Yahoo, Microsoft, Apple and Facebook. Special Situations This section explains the process for experience candidates, Program Managers, Dev Managers, ...
facebook分享实例代码
facebook安卓安装包,Facebook 是一个联系朋友的社交工具。大家可以通过它和朋友、同事、同学以及周围的人保持互动交流,分享无限上传的图片,发布链接和视频,更可以增进对朋友的 ...
里面包含facebook 的登录SDK 和 facebook的数据统计依赖工程
Facebook开发包 Facebook开发包 Facebook开发包 Facebook开发包
2019Facebook旅游白皮书-Facebook-201910.pdf2019Facebook旅游白皮书-Facebook-201910.pdf
Companies covered include Google, Amazon, Yahoo, Microsoft, Apple and Facebook. Special Situations This section explains the process for experience candidates, Program Managers, Dev Managers, ...
Facebook-Android-sdk-4.8.2.zip
Facebook基础培训
前几天弄过来的 facebook api挂出来希望对大家有帮助
Facebook 数据中心曝光 机密信息一览无遗 一.Facebook 数据中心概括 【PConline 资讯】据来自 Google 的 Double Click 服务标准显示,Facebook 是目前世界上最受欢迎的网站,每月有超过 6900 亿的页面浏览量。...
Facebook社交图景剖析,详细分析facebook是如何拉近人们之间的关系的。