Facebook Onsite Interview Preparation Part 1: Motivation/Bahavio

  • 时间：2020-09-24 11:41:27
  • 分类：网络文摘
  • 阅读：150 次
Congratulations! You have passed the CV screening and the telephone coding assessment of Facebook. Facebook interviews are hard, like other Giants: Google, Amazon, or Microsoft. In Facebook, every engineer should be able to design and imple... ...

Breadth-First Search Algorithm to Solve Puzzle (Rotting Oranges)

  • 时间：2020-09-24 11:41:27
  • 分类：网络文摘
  • 阅读：139 次
In a given grid, each cell can have one of three values: the value 0 representing an empty cell; the value 1 representing a fresh orange; the value 2 representing a rotten orange. Every minute, any fresh orange that is adjacent (4-directio... ...

The Process Killing Algorithms using Depth First Search or Bread

  • 时间：2020-09-24 11:41:27
  • 分类：网络文摘
  • 阅读：159 次
Given n processes, each process has a unique PID (process id) and its PPID (parent process id). Each process only has one parent process, but may have one or more children processes. This is just like a tree structure. Only one process has... ...

Facebook Onsite Interview Preparation Part 2: Coding Questions

  • 时间：2020-09-24 11:41:27
  • 分类：网络文摘
  • 阅读：155 次
The Facebook Onsite Interview will generally consist of three parts: Motivations, and Part 2 Coding, and Part 3 Product Design. This is the Part Two: Coding. At least 2x 45mins interviews where you need to know your data structures and algo... ...

The Facebook Initial Coding Interview Experience

  • 时间：2020-09-24 11:41:27
  • 分类：网络文摘
  • 阅读：146 次
Update: I have been careful enough not to leak any confidential information after signing the NDA (non-disclouse agreement) with Facebook. I think, the NDA refers to confidential information such as the important projects ongoing by company... ...

How to Design a Tic-Tac-Toe Game?

  • 时间：2020-09-24 11:41:27
  • 分类：网络文摘
  • 阅读：126 次
Design a Tic-tac-toe game that is played between two players on a n x n grid. You may assume the following rules: A move is guaranteed to be valid and is placed on an empty block. Once a winning condition is reached, no more moves is allo... ...

How to Compute the Greatest Common Divisor of Strings?

  • 时间：2020-09-24 11:41:27
  • 分类：网络文摘
  • 阅读：132 次
For strings S and T, we say “T divides S” if and only if S = T + … + T (T concatenated with itself 1 or more times) Return the largest string X such that X divides str1 and X divides str2. Example 1: Input: str1 = “... ...

The O(N) Increasing Triplet Subsequence Algorithm

  • 时间：2020-09-24 11:41:27
  • 分类：网络文摘
  • 阅读：119 次
Given an unsorted array return whether an increasing subsequence of length 3 exists or not in the array. Formally the function should: Return true if there exists i, j, k such that arr[i] < arr[j] < arr[k] given 0 ≤ i < j < k ≤... ...

The Algorithm to Make Words Bold in HTML

  • 时间：2020-09-24 11:41:27
  • 分类：网络文摘
  • 阅读：132 次
Given a set of keywords words and a string S, make all appearances of all keywords in S bold. Any letters between and tags become bold. The returned string should use the least number of tags possible, and of course the tags should form ... ...

How to Compute the Min Cost of Climbing Stairs via Dynamic Progr

  • 时间：2020-09-24 11:41:27
  • 分类：网络文摘
  • 阅读：145 次
On a staircase, the i-th step has some non-negative cost cost[i] assigned (0 indexed). Once you pay the cost, you can either climb one or two steps. You need to find minimum cost to reach the top of the floor, and you can either start from... ...