Monthly Archives: October 2015

https://leetcode.com/problems/word-break/ Word Break Total Accepted: 65299 Total Submissions: 278950 Difficulty: Medium Given a string s and a dictionary of words dict, determine if s can be segmented into a space-separated sequence of one or more dictionary words. For example, givens = "leetcode",dict = ["leet", "code"]. Return true because "leetcode" can be segmented as "leet code". …

Continue reading “Leetcode 139: WordBreak”

https://leetcode.com/problems/merge-k-sorted-lists/ Merge k Sorted Lists Total Accepted: 59265 Total Submissions: 278075 Difficulty: Hard Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity.   Code 1: import heapq # Definition for singly-linked list. # class ListNode(object): # def __init__(self, x): # self.val = x # self.next = None …

Continue reading “Leetcode 23: Merge k sorted lists”

https://leetcode.com/problems/alien-dictionary/ Alien Dictionary Total Accepted: 1390 Total Submissions: 8315 Difficulty: Hard There is a new alien language which uses the latin alphabet. However, the order among letters are unknown to you. You receive a list of words from the dictionary, where words are sorted lexicographically by the rules of this new language. Derive the order …

Continue reading “Leetcode 269: Alien Dictionary”

https://leetcode.com/problems/lru-cache/ LRU Cache Total Accepted: 50542 Total Submissions: 329169 Difficulty: Hard Design and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations: get and set. get(key) – Get the value (will always be positive) of the key if the key exists in the cache, otherwise return -1.set(key, value) …

Continue reading “Leetcode 146: LRU cache”

https://leetcode.com/problems/encode-and-decode-strings/ Encode and Decode Strings Total Accepted: 1272 Total Submissions: 4999 Difficulty: Medium Design an algorithm to encode a list of strings to a string. The encoded string is then sent over the network and is decoded back to the original list of strings. Machine 1 (sender) has the function: string encode(vector<string> strs) { // …

Continue reading “Leetcode 271: Encode and Decode Strings”

https://leetcode.com/problems/3sum/ 3Sum Total Accepted: 78227 Total Submissions: 457872 Difficulty: Medium Given an array S of n integers, are there elements a, b, c in S such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero. Note: Elements in a triplet (a,b,c) must be …

Continue reading “Leetcode 15: 3Sum”

https://leetcode.com/problems/two-sum/ Two Sum Total Accepted: 141545 Total Submissions: 770154 Difficulty: Medium Given an array of integers, find two numbers such that they add up to a specific target number. The function twoSum should return indices of the two numbers such that they add up to the target, where index1 must be less than index2. Please …

Continue reading “Leetcode 1: Two sums”

https://leetcode.com/problems/search-in-rotated-sorted-array/ Search in Rotated Sorted Array Total Accepted: 72911 Total Submissions: 252621 Difficulty: Hard Suppose a sorted array is rotated at some pivot unknown to you beforehand. (i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2). You are given a target value to search. If found in …

Continue reading “Leetcode 33: Search in Rotated Sorted Array”

https://leetcode.com/problems/closest-binary-search-tree-value-ii/ Closest Binary Search Tree Value II Total Accepted: 1212 Total Submissions: 4499 Difficulty: Hard Given a non-empty binary search tree and a target value, find k values in the BST that are closest to the target. Note: Given target value is a floating point. You may assume k is always valid, that is: k …

Continue reading “Leetcode 272: Closest Binary Search Tree Value II”