A string S of lowercase letters is given. We want to partition this string into as many parts as possible so that each letter appears in at most one part, and return a list of intergers representing the size of these parts.
ageismar
ageismar
/ Partition-Labels.md
Last active
October 15, 2019 20:14
ageismar
/ maximum-increasing-subsequence.md
Last active
October 3, 2019 21:42
Given an an array of numbers, return 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] so it would return 3.
longestIncreasingSubsequence([3, 4, 2, 1, 10, 6]);
// should return 3, the length of the longest increasing subsequence:
// 3, 4, 6 (or 3, 4, 10)
ageismar
/ Solve-Graph.md
Last active
September 26, 2019 13:07
class: center middle
Write a function that determines if a path exists between two vertices of a directed graph.
The graph will be represented as an object, each of whose keys represents a vertex of the graph and whose value represents all vertices that can be reached from the aforementioned key.
ageismar
/ DictionaryWordFinder.md
Created
September 18, 2019 14:31
— forked from smparelhoff/DictionaryWordFinder.md
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',
ageismar
/ deckofcards.md
Last active
August 20, 2019 22:33
OOP design requires you to think about real world items or systems technically, and organize your interpretations into classes that hold data and methods. These problems are meant to give insight into your coding style and mindset and how you approach a real world problem technically.
Deck of Cards: Design the data structures for a generic deck of cards. Explain how you would subclass the data structures to implement blackjack.