Floyd-Warshall algorithm - Algoritmy.net find the shorthest (longest) paths among all pairs of nodes...

Please Visit: http://ift.tt/1ajReyV

Floyd-Warshall algorithm - Algoritmy.net

find the shorthest (longest) paths among all pairs of nodes in a graph, which does not contain any cycles of negative lenght. The main advantage of Floyd-Warshall algorithm is its simplicity.

http://ift.tt/1wg5ILt

http://ift.tt/VYhxuL

Floyd-Warshall algorithm - Algoritmy.net

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/1wg5ILv

via LifeLong Community

Fast String Searching With Suffix Trees http://ift.tt/1cwNdws

Please Visit: http://ift.tt/1ajReyV

Fast String Searching With Suffix Trees

http://ift.tt/1cwNdws

Fast String Searching With Suffix Trees

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/VYhxef

via LifeLong Community

Nikita's blog: Fuzzy string search Levenshtein distance Damerau-Levenshtein distance Bitap algorithm...

Please Visit: http://ift.tt/1ajReyV

Nikita's blog: Fuzzy string search

Levenshtein distance

Damerau-Levenshtein distance

Bitap algorithm with modifications by Wu and Manber

Spell-checker method

N-gram method

Signature hashing method

BK-trees

http://ift.tt/vIqOTw

http://ift.tt/U0cNTI

Nikita's blog: Fuzzy string search

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/W8mdPf

via LifeLong Community

How to Write a Spelling Corrector http://ift.tt/nHoZuL

Please Visit: http://ift.tt/1ajReyV

How to Write a Spelling Corrector

http://ift.tt/nHoZuL

How to Write a Spelling Corrector

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/U0cPek

via LifeLong Community

http://ift.tt/UhMv03

Please Visit: http://ift.tt/1ajReyV

http://ift.tt/UhMv03

http://ift.tt/UhMv03

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/W8mdyw

via LifeLong Community

Fuzzy String Matching with Edit Distance - CodeProject http://ift.tt/1y8XuYg...

Please Visit: http://ift.tt/1ajReyV

Fuzzy String Matching with Edit Distance - CodeProject

http://ift.tt/1mtnYAa

Fuzzy String Matching with Edit Distance - CodeProject

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/1y8XwiU

via LifeLong Community

Please Visit: http://ift.tt/1ajReyV

Simple Fuzzy String Similarity in Java - CodeProject

public double dice(List<char[]> bigram1, List<char[]> bigram2)

{

List<char[]> copy = new ArrayList<char[]>(bigram2);

int matches = 0;

for (int I = bigram1.size(); --i >= 0;)

{

char[] bigram = bigram1.get(i);

for (int j = copy.size(); --j >= 0;)

{

char[] toMatch = copy.get(j);

if (bigram[0] == toMatch[0] && bigram[1] == toMatch[1])

{

copy.remove(j);

matches += 2;

break;

}

}

}

return (double) matches / (bigram1.size() + bigram2.size());

}

http://ift.tt/1y8XsQ9

http://ift.tt/1mtnVo5

Simple Fuzzy String Similarity in Java - CodeProject

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/1y8XsQb

via LifeLong Community

Edit Distance - Algorithmist Given two strings s1 and s2, the edit distance between s1 and s2 is the...

Please Visit: http://ift.tt/1ajReyV

Edit Distance - Algorithmist



Given two strings s1 and s2, the edit distance between s1 and s2 is the minimum number of operations required to convert string s1 to s2. The following operations are typically used:

Replacing one character of string by another character.

Deleting a character from string

Adding a character to string

http://ift.tt/1mtnV7q

http://ift.tt/1y8XszD

Edit Distance - Algorithmist

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/1mtnV7s

via LifeLong Community

Dynamic Programming | Set 7 (Coin Change) | GeeksforGeeks Given a value N, if we want to make change...

Please Visit: http://ift.tt/1ajReyV

Dynamic Programming | Set 7 (Coin Change) | GeeksforGeeks

Given a value N, if we want to make change for N cents, and we have infinite supply of each of S = { S1, S2, .. , Sm} valued coins, how many ways can we make the change? The order of coins doesn’t matter.

http://ift.tt/1phAVvC

http://ift.tt/1mtnUjL

Dynamic Programming | Set 7 (Coin Change) | GeeksforGeeks

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/1mtnUjN

via LifeLong Community

http://ift.tt/1y8Xjw8

Please Visit: http://ift.tt/1ajReyV

http://ift.tt/1y8Xjw8

http://ift.tt/1y8Xjw8

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/1y8XhVd

via LifeLong Community

The Fibonacci heap ruins my life at Mary Rose Cook http://ift.tt/1osIn50...

Please Visit: http://ift.tt/1ajReyV

The Fibonacci heap ruins my life at Mary Rose Cook

http://ift.tt/1vLN5ib

The Fibonacci heap ruins my life at Mary Rose Cook

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/1osIn52

via LifeLong Community

Java里多个Map的性能比较（TreeMap、HashMap、ConcurrentSkipListMap） | Hongtium后端技术 http://ift.tt/1osu1BF...

Please Visit: http://ift.tt/1ajReyV

Java里多个Map的性能比较（TreeMap、HashMap、ConcurrentSkipListMap） | Hongtium后端技术

http://ift.tt/1mIhb53

Java里多个Map的性能比较（TreeMap、HashMap、ConcurrentSkipListMap） | Hongtium后端技术

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/1osu1BH

via LifeLong Community

Skip lists are fascinating! http://ift.tt/1fxPCUv

Please Visit: http://ift.tt/1ajReyV

Skip lists are fascinating!

http://ift.tt/1fxPCUv

Skip lists are fascinating!

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/1osu1Bv

via LifeLong Community

Find local minima in an array | Data Structures and Algorithm Given an array of unique integers whose...

Please Visit: http://ift.tt/1ajReyV

Find local minima in an array | Data Structures and Algorithm

Given an array of unique integers whose first two numbers are decreasing and last two numbers are increasing, find a number in the array which is local minima. A number in the array is called local minima if it is smaller than both its left and right numbers. For example in the array 9,7,2,8,5,6,3,4

2 is a local minima as it is smaller than its left and right number 7 and 8. Similarly 5 is another local minima as it is between 8 and 6, both larger than 5. You need to find any one of the local minima.

http://ift.tt/1y4AOs7

http://ift.tt/1mSqkcV

Find local minima in an array | Data Structures and Algorithm

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/1mSqiSq

via LifeLong Community

Find local minima in an array | Data Structures and Algorithm Given an array of unique integers whose...

Please Visit: http://ift.tt/1ajReyV

Find local minima in an array | Data Structures and Algorithm

Given an array of unique integers whose first two numbers are decreasing and last two numbers are increasing, find a number in the array which is local minima. A number in the array is called local minima if it is smaller than both its left and right numbers. For example in the array 9,7,2,8,5,6,3,4

2 is a local minima as it is smaller than its left and right number 7 and 8. Similarly 5 is another local minima as it is between 8 and 6, both larger than 5. You need to find any one of the local minima.

http://ift.tt/1y4AOs7

http://ift.tt/1y4APw9

Find local minima in an array | Data Structures and Algorithm

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/1mSqgKc

via LifeLong Community

Median of Medians http://ift.tt/18pmmkm

Please Visit: http://ift.tt/1ajReyV

Median of Medians

http://ift.tt/18pmmkm

Median of Medians

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/1qQXUQC

via LifeLong Community

Finding the Median in Linear Time Pick randomly a number a from A = {a1, ..., an}. Partition the n ...

Please Visit: http://ift.tt/1ajReyV

Finding the Median in Linear Time

Pick randomly a number a from A = {a1,

..., an}.



Partition the n numbers into two sets:



S - all the numbers smaller than a

B - all the numbers bigger than a





If |S| = K-1 then a is the required

K-median. Return a

If |S| < K-1 then the K-median lies

somewhere in B. Call recursively to

FindKMedian( B, K - |S| - 1 )



Else, call recursively to FindKMedian( S, K ).

http://ift.tt/1qQXUjF

http://ift.tt/1oqw1u7

Finding the Median in Linear Time

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/1qQXUjK

via LifeLong Community

Reconstruct tree from pre-order traversal | PROGRAMMING INTERVIEWS Question: A tree has a special property...

Please Visit: http://ift.tt/1ajReyV

Reconstruct tree from pre-order traversal | PROGRAMMING INTERVIEWS

Question: A tree has a special property where leaves are represented with ‘L’ and non-leaf with ‘N’. Each node has either 0 or 2 children. If given preorder traversal of this tree, construct the tree.

http://ift.tt/1jwhHo7

http://ift.tt/1jwhHo9

Reconstruct tree from pre-order traversal | PROGRAMMING INTERVIEWS

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/1y1oxF5

via LifeLong Community

Video: The Internet and IP Introduction | 1-0: The Internet and IP | Networking Courseware | Stanford...

Please Visit: http://ift.tt/1ajReyV

Video: The Internet and IP Introduction | 1-0: The Internet and IP | Networking Courseware | Stanford Online

http://ift.tt/TW52OR

Video: The Internet and IP Introduction | 1-0: The Internet and IP | Networking Courseware | Stanford Online

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/1s0nAfC

via LifeLong Community

Incorporating Parameterized Construction in the Singleton Design Pattern - CodeProject http://www.co...

Please Visit: http://ift.tt/1ajReyV

Incorporating Parameterized Construction in the Singleton Design Pattern - CodeProject

http://ift.tt/1nbZdUo

Incorporating Parameterized Construction in the Singleton Design Pattern - CodeProject

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/1rZir7p

via LifeLong Community

Closest-pair problem - Rosetta Code http://ift.tt/1qxmzYT

Please Visit: http://ift.tt/1ajReyV

Closest-pair problem - Rosetta Code

http://ift.tt/1qxmzYT

Closest-pair problem - Rosetta Code

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/1rYJv6L

via LifeLong Community

Longest increasing subsequence - Rosetta Code A solution based on patience sorting, except that it ...

Please Visit: http://ift.tt/1ajReyV

Longest increasing subsequence - Rosetta Code



A solution based on patience sorting, except that it is not necessary to keep the whole pile, only the top (in solitaire, bottom) of the pile, along with pointers from each "card" to the top of its "previous" pile.

http://ift.tt/1ka8Q6b

http://ift.tt/1rYJxvw

Longest increasing subsequence - Rosetta Code

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/1rYJxvB

via LifeLong Community

Patience sorting - Wikipedia, the free encyclopedia played with the greedy strategy (Link->http://en...

Please Visit: http://ift.tt/1ajReyV

Patience sorting - Wikipedia, the free encyclopedia

played with the greedy strategy (Link->http://ift.tt/1ka8NXS) , i.e., placing each new card on the leftmost pile that is legally possible to use. At each stage of the game, under this strategy, the labels on the top cards of the piles are increasing from left to right. To recover the sorted sequence, repeatedly remove the minimum visible card.

http://ift.tt/1ksxkg8

http://ift.tt/1rYJu2S

Patience sorting - Wikipedia, the free encyclopedia

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/1ka8NXW

via LifeLong Community

Random number 1..5 to 1..7 int rand7() { int x = 22; while( x > 21) x = rand5() + 5*rand5() - 5; int...

Please Visit: http://ift.tt/1ajReyV

Random number 1..5 to 1..7

int rand7()

{

int x = 22;

while( x > 21)

x = rand5() + 5*rand5() - 5;

int r = 1 + (x % 7);

return r;

}

http://ift.tt/1rWeLTY

http://ift.tt/1k7XyiN

Random number 1..5 to 1..7

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/1k7XyiR

via LifeLong Community

Rejection sampling - Wikipedia, the free encyclopedia http://ift.tt/1qXCgvP...

Please Visit: http://ift.tt/1ajReyV

Rejection sampling - Wikipedia, the free encyclopedia

http://ift.tt/1qXCgvP

Rejection sampling - Wikipedia, the free encyclopedia

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/1qXCgvS

via LifeLong Community

Random number generator in arbitrary probability distribution fashion | GeeksforGeeks Given n numbers...

Please Visit: http://ift.tt/1ajReyV

Random number generator in arbitrary probability distribution fashion | GeeksforGeeks



Given n numbers, each with some frequency of occurrence. Return a random number with probability proportional to its frequency of occurrence.

http://ift.tt/1qXCgfn

http://ift.tt/1xVZxic

Random number generator in arbitrary probability distribution fashion | GeeksforGeeks

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/1xVZwLc

via LifeLong Community

Find the two non-repeating elements in an array of repeating elements | GeeksforGeeks http://www.gee...

Please Visit: http://ift.tt/1ajReyV

Find the two non-repeating elements in an array of repeating elements | GeeksforGeeks

http://ift.tt/1iw5iul

Find the two non-repeating elements in an array of repeating elements | GeeksforGeeks

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/1mB7CF7

via LifeLong Community

Find the two repeating elements in a given array | GeeksforGeeks http://ift.tt/1mB7CoD...

Please Visit: http://ift.tt/1ajReyV

Find the two repeating elements in a given array | GeeksforGeeks

http://ift.tt/1mB7Eg5

Find the two repeating elements in a given array | GeeksforGeeks

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/1mB7CoH

via LifeLong Community

First Repeated Number. | techpuzzl http://ift.tt/1szHXhc

Please Visit: http://ift.tt/1ajReyV

First Repeated Number. | techpuzzl

http://ift.tt/1szHXhc

First Repeated Number. | techpuzzl

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/1mB7DZH

via LifeLong Community

(18/1) Programming Interviews: Which is the best book to prepare for coding/programming interviews? ...

Please Visit: http://ift.tt/1ajReyV

(18/1) Programming Interviews: Which is the best book to prepare for coding/programming interviews? - Quora

http://ift.tt/1mB7BRE

(18/1) Programming Interviews: Which is the best book to prepare for coding/programming interviews? - Quora

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/1szHYSc

via LifeLong Community

8 Things Programmers Can Do at Weekends http://ift.tt/1szHYlc...

Please Visit: http://ift.tt/1ajReyV

8 Things Programmers Can Do at Weekends

http://ift.tt/TSn31k

8 Things Programmers Can Do at Weekends

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/1szHYlg

via LifeLong Community

The Generics Policeman Blog: Use Lucene’s MMapDirectory on 64bit platforms, please! http://blog.thetaphi.de...

Please Visit: http://ift.tt/1ajReyV

The Generics Policeman Blog: Use Lucene’s MMapDirectory on 64bit platforms, please!

http://ift.tt/1szHWtq

The Generics Policeman Blog: Use Lucene’s MMapDirectory on 64bit platforms, please!

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/1mB7Bkx

via LifeLong Community

Java and Computer Science Courses http://ift.tt/1szHV8S...

Please Visit: http://ift.tt/1ajReyV

Java and Computer Science Courses

http://ift.tt/TSn31i

Java and Computer Science Courses

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/1szHWcW

via LifeLong Community

LeetCode – Balanced Binary Tree (Java) http://ift.tt/1qVVvWG...

Please Visit: http://ift.tt/1ajReyV

LeetCode – Balanced Binary Tree (Java)

http://ift.tt/1qVVtxX

LeetCode – Balanced Binary Tree (Java)

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/1oHHZme

via LifeLong Community

Which way is east and west? http://ift.tt/1oFWRRZ

Please Visit: http://ift.tt/1ajReyV

Which way is east and west?

http://ift.tt/1oFWRRZ

Which way is east and west?

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/1jnWPPP

via LifeLong Community

Please Visit: http://ift.tt/1ajReyV

Maven Global dependency exclusion | Java Enterprise Ecosystem.

<dependency><groupId>dom4j</groupId><artifactId>dom4j</artifactId><version>1.4</version><scope>provided</scope></dependency>

The above XML snippet prohibits the packaging of DOM4j in the Web-INF/lib. Since the jar files isn’t present Application’s lib thus it’s loaded by the Jboss classloader as it’s present in the JBoss’s lib.

http://ift.tt/1rOLg6C

http://ift.tt/1k3nSdN

Maven Global dependency exclusion | Java Enterprise Ecosystem.

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/1rOLgmU

via LifeLong Community

LeetCode - Permutation Sequence | Darren's Blog Given nn and kk , return the k-thk\text{-th} permutation...

Please Visit: http://ift.tt/1ajReyV

LeetCode - Permutation Sequence | Darren's Blog

Given nn and kk , return the k-thk\text{-th} permutation sequence. Note: given nn will be between 1 and 9 inclusive.

http://ift.tt/1kB40yS

http://ift.tt/1kB40ic

LeetCode - Permutation Sequence | Darren's Blog

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/1znrEZA

via LifeLong Community

LeetCode - Next Permutation | Darren's Blog Implement next permutation, which rearranges numbers into...

Please Visit: http://ift.tt/1ajReyV

LeetCode - Next Permutation | Darren's Blog

Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers. If such arrangement is not possible, it must rearrange it as the lowest possible order (ie, sorted in ascending order). The replacement must be in-place, do not allocate extra memory

http://ift.tt/1znrC3F

http://ift.tt/1kB40ic

LeetCode - Next Permutation | Darren's Blog

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/1znrCAW

via LifeLong Community

LeetCode - Multiply Strings | Darren's Blog Given two numbers represented as strings, return multiplication...

Please Visit: http://ift.tt/1ajReyV

LeetCode - Multiply Strings | Darren's Blog



Given two numbers represented as strings, return multiplication of the numbers as a string. Note that the numbers can be arbitrarily large and are non-negative.

http://ift.tt/1jsv2YI

http://ift.tt/1lRv1hc

LeetCode - Multiply Strings | Darren's Blog

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/1pXvKpj

via LifeLong Community

off-line minimum problem - llhuii's Blog http://ift.tt/1pXvKp8

Please Visit: http://ift.tt/1ajReyV

off-line minimum problem - llhuii's Blog

http://ift.tt/1pXvKp8

off-line minimum problem - llhuii's Blog

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/1lRv1h2

via LifeLong Community

World of BROCK: How to find the longest continuous increasing sequence: algorithms, puzzles, howto's...

Please Visit: http://ift.tt/1ajReyV

World of BROCK: How to find the longest continuous increasing sequence: algorithms, puzzles, howto's and stuff... interview questions..etc

The idea for the O(n) solution is to keep track of the start of the longest continuous increasing sequence and it's length. At each item, if it's bigger than the previous, then we have a sequence. If it's longer then the current maximum length, then we have a new longest increasing sequence, longer than the previous one.

http://ift.tt/1pXvMxi

http://ift.tt/1pXvK8S

World of BROCK: How to find the longest continuous increasing sequence: algorithms, puzzles, howto's and stuff... interview questions..etc

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/1lRv1gV

via LifeLong Community

Versatile sorting - Adrien Grand http://ift.tt/1vUP6J4

Please Visit: http://ift.tt/1ajReyV

Versatile sorting - Adrien Grand

http://ift.tt/1vUP6J4

Versatile sorting - Adrien Grand

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/VCHX51

via LifeLong Community

How MoreLikeThis Works in Lucene | Aaron Johnson http://ift.tt/VCHTSS...

Please Visit: http://ift.tt/1ajReyV

How MoreLikeThis Works in Lucene | Aaron Johnson

http://ift.tt/VCHTSW

How MoreLikeThis Works in Lucene | Aaron Johnson

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/VCHWy4

via LifeLong Community

MoreLikeThis - Apache Solr Reference Guide - Apache Software Foundation http://ift.tt/VCHW12...

Please Visit: http://ift.tt/1ajReyV

MoreLikeThis - Apache Solr Reference Guide - Apache Software Foundation

http://ift.tt/1mabvBW

MoreLikeThis - Apache Solr Reference Guide - Apache Software Foundation

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/1vUP6c3

via LifeLong Community

How fast is bit packing? - Adrien Grand http://ift.tt/1mtACOX...

Please Visit: http://ift.tt/1ajReyV

How fast is bit packing? - Adrien Grand

http://ift.tt/1mtACOX

How fast is bit packing? - Adrien Grand

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/1mtACOY

via LifeLong Community

Sell Stock | Darren's Blog http://ift.tt/VB0bUF

Please Visit: http://ift.tt/1ajReyV

Sell Stock | Darren's Blog

http://ift.tt/VB0bUF

Sell Stock | Darren's Blog

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/1vTj67Z

via LifeLong Community

Please Visit: http://ift.tt/1ajReyV

Given a array, find the larges... | CareerCup

Pair LargestSubArray(int [] A, int sum) {



HashMap <int, int> H = new HasMap<int, int>();

// Cumulative sum is the key.

// The value is the leftmost index.



H.Insert(0, 0);

int Sum = 0;



int max_left = 0;

int max_right = 0;

int max_len = 0;



for(int j = 0; j < A.Length; j++) {

Sum += A[j];

if (H.containsKey(Sum-N)) {

int possible_left = H[Sum-N];

int possible_right = j;

int possible_len = possible_right - possible_left;



if (possible_len>= max_len) {

max_left = possible_left;

max_right = possible_right;

max_len = possible_len;

}

}



if (!H.ContainsKey(Sum)) {

H[Sum] = j+1;

}

}

return new Pair(max_left, max_right);

}

http://ift.tt/1vTj5kw

http://ift.tt/VB0b7a

Given a array, find the larges... | CareerCup

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/1vTj6Ff

via LifeLong Community

Largest subarray with equal number of 0s and 1s | GeeksforGeeks http://ift.tt/1vTj4NF...

Please Visit: http://ift.tt/1ajReyV

Largest subarray with equal number of 0s and 1s | GeeksforGeeks

http://ift.tt/1vTj3Js

Largest subarray with equal number of 0s and 1s | GeeksforGeeks

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/VB0a2U

via LifeLong Community

Two nodes of a BST are swapped, correct the BST | GeeksforGeeks http://ift.tt/1n18w9P...

Please Visit: http://ift.tt/1ajReyV

Two nodes of a BST are swapped, correct the BST | GeeksforGeeks

http://ift.tt/1n18w9R

Two nodes of a BST are swapped, correct the BST | GeeksforGeeks

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/1n18wq5

via LifeLong Community

Tips to crack a guess estimate (Analytics case study) http://ift.tt/1n18vT8...

Please Visit: http://ift.tt/1ajReyV

Tips to crack a guess estimate (Analytics case study)

http://ift.tt/1cSauaM

Tips to crack a guess estimate (Analytics case study)

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/1n18vTc

via LifeLong Community

Using Solr 4.9 new ChildDocTransformerFactory | Javalobby http://ift.tt/1mrxqmU...

Please Visit: http://ift.tt/1ajReyV

Using Solr 4.9 new ChildDocTransformerFactory | Javalobby

http://ift.tt/1pYIjMN

Using Solr 4.9 new ChildDocTransformerFactory | Javalobby

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/1oefKIJ

via LifeLong Community

Answers To 15 More Google Interview Questions That Will Make You Feel Stupid - Business Insider http...

Please Visit: http://ift.tt/1ajReyV

Answers To 15 More Google Interview Questions That Will Make You Feel Stupid - Business Insider

http://ift.tt/1oefHwq

Answers To 15 More Google Interview Questions That Will Make You Feel Stupid - Business Insider

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/1oefJV1

via LifeLong Community

Answers To 15 Google Interview Questions That Will Make You Feel Stupid - Business Insider http://ww...

Please Visit: http://ift.tt/1ajReyV

Answers To 15 Google Interview Questions That Will Make You Feel Stupid - Business Insider

http://ift.tt/1lzInm4

Answers To 15 Google Interview Questions That Will Make You Feel Stupid - Business Insider

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/1mrxjI7

via LifeLong Community

Answer to Puzzle #32: Two Creepers Climbing a Tree http://ift.tt/1xE7clg

Please Visit: http://ift.tt/1ajReyV

Answer to Puzzle #32: Two Creepers Climbing a Tree

http://ift.tt/1xE7clg

Answer to Puzzle #32: Two Creepers Climbing a Tree

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/1n6Jw5N

via LifeLong Community

Answer to Puzzle #37: An Aerople Takes a Roundtrip in the Wind http://ift.tt/1n6Jxqn...

Please Visit: http://ift.tt/1ajReyV

Answer to Puzzle #37: An Aerople Takes a Roundtrip in the Wind

http://ift.tt/1xE7c4K

Answer to Puzzle #37: An Aerople Takes a Roundtrip in the Wind

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/1n6JxGF

via LifeLong Community

Answer to Puzzle #40: 4 and 7 minute egg timers or hourglasses to measure 9 minutes http://puzzles.n...

Please Visit: http://ift.tt/1ajReyV

Answer to Puzzle #40: 4 and 7 minute egg timers or hourglasses to measure 9 minutes

http://ift.tt/1n6Jw5z

Answer to Puzzle #40: 4 and 7 minute egg timers or hourglasses to measure 9 minutes

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/1xE7bOi

via LifeLong Community

Answer to Puzzle #39: Google Puzzle. 100 Prisoners In a Line Survival Stratergy Executioner http://p...

Please Visit: http://ift.tt/1ajReyV

Answer to Puzzle #39: Google Puzzle. 100 Prisoners In a Line Survival Stratergy Executioner

http://ift.tt/1n6JvPf

Answer to Puzzle #39: Google Puzzle. 100 Prisoners In a Line Survival Stratergy Executioner

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/1xE7bO4

via LifeLong Community

Answer to Puzzle #23: Envelopes, Stick or Change http://ift.tt/1xE7bhc

Please Visit: http://ift.tt/1ajReyV

Answer to Puzzle #23: Envelopes, Stick or Change

http://ift.tt/1xE7bhc

Answer to Puzzle #23: Envelopes, Stick or Change

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/1n6Jx9K

via LifeLong Community

Answer to illusion #20: How Can This Be True http://ift.tt/1xE7854

Please Visit: http://ift.tt/1ajReyV

Answer to illusion #20: How Can This Be True

http://ift.tt/1xE7854

Answer to illusion #20: How Can This Be True

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/1n6JvyI

via LifeLong Community

Answer to Puzzle #14 - 52 Cards Win a Dollar http://ift.tt/1skKhID

Please Visit: http://ift.tt/1ajReyV

Answer to Puzzle #14 - 52 Cards Win a Dollar

http://ift.tt/1skKhID

Answer to Puzzle #14 - 52 Cards Win a Dollar

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/VxkoL7

via LifeLong Community

A Collection of Quant Riddles With Answers http://ift.tt/1skKhs4

Please Visit: http://ift.tt/1ajReyV

A Collection of Quant Riddles With Answers

http://ift.tt/1skKhs4

A Collection of Quant Riddles With Answers

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/1skKfRe

via LifeLong Community

How many times during the day do the hands of a clock overlap? - Mathlete's Corner How many times during...

Please Visit: http://ift.tt/1ajReyV

How many times during the day do the hands of a clock overlap? - Mathlete's Corner

How many times during the day do the hands of a clock overlap?

how many times during the day do the hands of a clock overlap | funproblemsolving

http://ift.tt/VwcYI2

How many times during the day do the hands of a clock overlap? - Mathlete's Corner

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/1vOABGE

via LifeLong Community

12 Identical Balls Problem » My Tech Interviews You are give 12 identical looking balls. One of them...

Please Visit: http://ift.tt/1ajReyV

12 Identical Balls Problem » My Tech Interviews

You are give 12 identical looking balls. One of them is fake (could be heavier or lighter) than the rest of the 11 (all the others weight exactly the same). You a provided with a simple mechanical balance and you are restricted to only 3 uses. Find the fake ball.

http://ift.tt/1oyWGrC

http://ift.tt/1qLxaCI

12 Identical Balls Problem » My Tech Interviews

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/1oyWFDS

via LifeLong Community

10 Famous Microsoft Interview Puzzles » My Tech Interviews http://ift.tt/1oyWEjj...

Please Visit: http://ift.tt/1ajReyV

10 Famous Microsoft Interview Puzzles » My Tech Interviews

http://ift.tt/hkAvGZ

10 Famous Microsoft Interview Puzzles » My Tech Interviews

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/1oyWEjl

via LifeLong Community

Probability » My Tech Interviews http://ift.tt/1qLx7qC

Please Visit: http://ift.tt/1ajReyV

Probability » My Tech Interviews

http://ift.tt/1qLx7qC

Probability » My Tech Interviews

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/1oyWCId

via LifeLong Community

10 Google Interview Puzzles » My Tech Interviews http://ift.tt/1oyWDMo...

Please Visit: http://ift.tt/1ajReyV

10 Google Interview Puzzles » My Tech Interviews

http://ift.tt/1qLx9yC

10 Google Interview Puzzles » My Tech Interviews

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/1oyWDMs

via LifeLong Community

Find number of squares chessboard How would you find the number of squares on a chessboard? http://w...

Please Visit: http://ift.tt/1ajReyV

Find number of squares chessboard

How would you find the number of squares on a chessboard?

http://ift.tt/1qLdAGN

http://ift.tt/1xB8uxv

Find number of squares chessboard

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/1qLdAGS

via LifeLong Community

3 Ants Triangle Puzzle Suppose that you have a triangle with 3 ants on different vertices (corners) ...

Please Visit: http://ift.tt/1ajReyV

3 Ants Triangle Puzzle

Suppose that you have a triangle with 3 ants on different vertices (corners) of the triangle. What is the probability that either 2 of the ants or all of the ants collide if all 3 ants start walking on the sides of the triangle?

http://ift.tt/1qLdAqm

http://ift.tt/1xB8ugU

3 Ants Triangle Puzzle

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/1qLdAGA

via LifeLong Community

2 Eggs 100 Floors What strategy should be taken in order to minimize the number of egg drops used to...

Please Visit: http://ift.tt/1ajReyV

2 Eggs 100 Floors

What strategy should be taken in order to minimize the number of egg drops used to find floor N (the threshold floor) for the egg? Also, what is the minimum number of drops for the worst case using this strategy?

http://ift.tt/1oZgHdU

http://ift.tt/1xB8tJZ

2 Eggs 100 Floors

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/1xB8sFQ

via LifeLong Community