Given an array and a target, return the total number of continuous subarrays whose sum equals to the target.

1) Given an array of integers nums and an integer target, return the numbers from the list that sum up to the target. 2) Find the start and end indicies of a subarray that sums up to a given target.

Create some sort of data structure for storing and looking up text in a memory efficient manner.

1) Find the K closest points to a vertex. 2) How would you modify the solution if the input was an infinite streak of points?

Design an LRU Cache

1) Given a list of meeting objects (e.g. {name: 'MeetingName', hours: numHours}) and an integer haveHours denoting how many hours of one's schedule alloted to meetings, write a function that optimizes the total number of meetings in one's day 2) Using the same input, write a function that optimizes the total number of hours one spends in meetings

Write a function that takes two strings as arguments s (a string to match) and p (a regular expression pattern) and return a boolean denoting whether s matches p

Given two strings s1 and s2, return the longest common subsequence of s1 and s2 (with longest common subsequence defined as the longest sequence of characters such that all of them appear in both of the strings, possibly with other characters in between)