面试
文章平均质量分 79
junchen1992
Be the change that you wish to see in the world.
展开
-
Remove duplicates from array (Python)
1. 给定一个list, 写一个函数去掉其中的重复元素(不需要保持原始相对顺序)。原创 2016-08-21 07:58:47 · 552 阅读 · 0 评论 -
PIQ60: Leaders in an array
Problem StatementGiven an array of integers, find the leaders in the array. A leader is an element which is larger than all the elements in the array to its right.SolutionUse a stack.def leaders(nums):原创 2016-08-23 14:33:50 · 286 阅读 · 0 评论 -
PIQ59: Find the missing number in the increasing sequence
Problem StatementGiven an increasing sequence of numbers from 1 to n with only one missing number, how can you find that missing number without traversing the sequence in linear fashion. In other words原创 2016-08-23 12:51:52 · 380 阅读 · 0 评论 -
PIQ03: Find Majority Element in an Array
Description: Given an array of size n, find the element which occurs more than n/2 times. This element is called Majority Element. If not found, return null.Approach 1: use a counterdef majority_elemen原创 2016-08-22 07:33:40 · 324 阅读 · 0 评论 -
PIQ07: Longest Palindromic Subsequence
Problem StatementGiven a string S, Find the length of the longest palindromic subsequence.Approach 1Reverse S to T, then make use of the Longest Common Subsequence algorithm.Approach 2Dynamic programmi原创 2016-08-23 11:45:01 · 306 阅读 · 0 评论 -
PIQ26: Longest Palindromic Substring
Problem StatementGiven a string S, find the longest palindromic substring of S.def longest_palindromic_substring(s): if not s: return None n = len(s) lps, lps_len = s[0], 1 dp =原创 2016-08-23 09:46:27 · 216 阅读 · 0 评论 -
PIQ39: Longest Common Subsequence
Problem StatementGiven two string s1 and s2. Find the longest common subsequence between s1 and s2.Link@HackerRank: The Longest Common Subsequencedef longest_common_subsequence(s1, s2): """Find the原创 2016-08-23 09:00:05 · 307 阅读 · 0 评论 -
PIQ19: Longest Common Substring
Problem Statement:Given two strings S1 and S2, find the longest common substring between S1 and S2.Approach 1: Dynamic Programmingdef LCS(s1, s2): """ Time complexity: O(n^2) Space complexi原创 2016-08-22 14:15:41 · 268 阅读 · 0 评论 -
PIQ18: Delete middle node of a linked list
Problem statement Given a pointer to the middle node of the linked list, delete that node.Solution# Definition for singly-linked list.class ListNode(object): def __init__(self, x): self.v原创 2016-08-22 13:51:25 · 283 阅读 · 0 评论 -
PIQ12: Find pivot in a sorted rotated array
Description: Given a sorted integer array which may have been rotated once, find the pivot index, i.e. index of the minimum element of the array.Approach 1: Naive Solutiondef pivot(nums): """ T原创 2016-08-22 13:39:37 · 318 阅读 · 0 评论 -
Technical Interview Questions
算法面试题集锦。Google, Indeed等公司面试面经。原创 2016-11-12 10:25:59 · 537 阅读 · 0 评论