Given a method that takes in a string of letters and returns if it is a valid word, how do you solve the problem of word segmentation? In other words, given a string of letters (a-z only) and return a valid break down of the string into an array of words. There are be multiple different valid answers, and your solution need only return one of them. Example: segment("hellohowareyou") returns ["hello", "how", "are", "you]
Questions on design patterns. Design system for a hypothetical e-commerce store...entities...design it to be distributed.
Given a matrix of n x n dimensions, write an algorithm such that each number (from 1 to n) appears only once in a column and a row. (Look up magic square for an example)
Implement LRU Cache
sort a linked list having alt. ascending and decreasing nodes. find max. pair sum in an array in O(n) time.
The technical questions are:1. How do you find if a directed graph is a tree and code for it? 2. Dynamic programming - 5 Painters to paint homes at the least cost - given different cost for painting with different colors(3 choice colors). Conditon: No adjacent homes in the 5 houses that are in a row can't have same color. 3. Design a scalable notification system.
How do you teamwork with other people
Revise the order of a list
implement strlen
How do you reverse a linked list?
Viewing 3491 - 3500 interview questions