The Algorithm to Make Words Bold in HTML
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 …
The O(N) Increasing Triplet Subsequence Algorithm
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, …
How to Compute the Greatest Common Divisor of Strings?
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) …
Facebook Onsite Interview Preparation Part 3: How to Ace a Design Interview?
July 7, 2019
Engineering, facebook, interview questions, interviews, Software Engineering
No Comments
The Facebook Onsite Interview will generally consist of three parts: Motivations, and Part 2 Coding/Algorithm, and Part 3 Product Design. This is the Part Three: Design. The so-called Design …
How to Delete Nodes from Binary Tree and Make a Forest?
Given the root of a binary tree, each node in the tree has a distinct value. After deleting all nodes with a value in to_delete, we are left with …
Count the Binary Watch Stats using Bruteforce Algorithm via C++ BitSet or Compiler Intrinsics __builtin_popcount
A binary watch has 4 LEDs on the top which represent the hours (0-11), and the 6 LEDs on the bottom represent the minutes (0-59). Each LED represents a …