摘要：
Difficulty: Easy Problem You are given an array of strings. Two strings and are special equivalent if after any number of moves , S == T. A move consi 阅读全文
摘要：
Difficulty: Medium Problem Given an array , we can perform a pancake flip : We choose some positive integer `k PancakeSort(int[] A) { int max = A.Leng 阅读全文
摘要：
Difficulty: Easy Problem Given a string and a character , return an array of integers representing the shortest distance from the character in the str 阅读全文
摘要：
Difficulty: Medium Problem On a 2 dimensional grid with rows and columns, we start at facing east. Here, the north west corner of the grid is at the f 阅读全文
摘要：
Difficulty: Easy Question We have an array of integers, and an array of queries. For the th query , we add to . Then, the answer to the th query is th 阅读全文
摘要：
Difficulty: Easy Problem We have a list of on the plane. Find the closest points to the origin . (Here, the distance between two points on a plane is 阅读全文
摘要：
Difficulty: Medium Problem In a deck of cards, every card has a unique integer. You can order the deck in any order you want. Initially, all the cards 阅读全文
