class: center, middle
Given two sorted arrays of numbers, return an array containing all values that appear in both arrays. The numbers in the resulting array (the "intersection") may be returned in any order, they needn't be sorted.
Given an alphabetical array of dictionary entries and a word to search for, find that word's definition (if it exists). A dictionary entry is just a string where the word's name appears first, followed by - [definition]
.
const dictionary = [
'a - Used when mentioning someone or something for the first time in a text or conversation',
Given an an array of numbers, find the length of the longest possible subsequence that is increasing. This subsequence can "jump" over numbers in the array. For example in [3, 10, 4, 5]
the longest increasing subsequence (LIS) is [3, 4, 5]
.
longestIncreasingSubsequence([3, 4, 2, 1, 10, 6]);
// should return 3, the length of the longest increasing subsequence:
// 3, 4, 6 (or 3, 4, 10)
React doesn't require JSX but it's makes writing web apps tremendously easier. It also allows React to show more useful error and warning messages.
React.createElement(component, props, ...children)
is equivalent to <Element prop={prop}><Child /></Element>