Benchmarking Block-Swapping Algorithms | Dr Dobb's http://ift.tt/1rYbAeK...

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

Benchmarking Block-Swapping Algorithms | Dr Dobb's

http://ift.tt/1m85DEN

Benchmarking Block-Swapping Algorithms | Dr Dobb's

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

via LifeLong Community

Maximum sum such that no two elements are adjacent | GeeksforGeeks Question: Given an array of positive...

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

Maximum sum such that no two elements are adjacent | GeeksforGeeks

Question: Given an array of positive numbers, find the maximum sum of a subsequence with the constraint that no 2 numbers in the sequence should be adjacent in the array. So 3 2 7 10 should return 13 (sum of 3 and 10) or 3 2 5 10 7 should return 15 (sum of 3, 5 and 7).

http://ift.tt/1rYbzYu

http://ift.tt/1m85Dos

Maximum sum such that no two elements are adjacent | GeeksforGeeks

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

via LifeLong Community

Statistics 110: Probability http://ift.tt/1tFhMJf

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

Statistics 110: Probability

http://ift.tt/1tFhMJf

Statistics 110 (Probability) has been taught at Harvard University by Joe Blitzstein (Professor of the Practice in Statistics, Harvard University) each year ...

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

via LifeLong Community

MIT 6.041SC Probabilistic Systems Analysis and Applied Probability, Fall 2013 1. Probability Models ...

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

MIT 6.041SC Probabilistic Systems Analysis and Applied Probability, Fall 2013

1. Probability Models and Axioms

1. Probability Models and Axioms

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

via LifeLong Community

Math: Free Courses Online | Open Culture http://ift.tt/PIvcAO

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

Math: Free Courses Online | Open Culture

http://ift.tt/PIvcAO

Math: Free Courses Online | Open Culture

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

via LifeLong Community

The 25 Best Places To Take Free Online Computer Science Classes - Edudemic http://ift.tt/1kc8SzL...

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

The 25 Best Places To Take Free Online Computer Science Classes - Edudemic

http://ift.tt/1hQHDDq

The 25 Best Places To Take Free Online Computer Science Classes - Edudemic

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

via LifeLong Community

Maximum circular subarray sum | GeeksforGeeks http://ift.tt/1qAVx2f...

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

Maximum circular subarray sum | GeeksforGeeks

http://ift.tt/1kc8SzD

Maximum circular subarray sum | GeeksforGeeks

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

via LifeLong Community

Count the number of possible triangles | GeeksforGeeks http://ift.tt/1AINWFH...

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

Count the number of possible triangles | GeeksforGeeks

http://ift.tt/1zEX6BB

Count the number of possible triangles | GeeksforGeeks

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

via LifeLong Community

A Pancake Sorting Problem | GeeksforGeeks http://ift.tt/1xLsVpr

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

A Pancake Sorting Problem | GeeksforGeeks

http://ift.tt/1xLsVpr

A Pancake Sorting Problem | GeeksforGeeks

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

via LifeLong Community

Count all possible groups of size 2 or 3 that have sum as multiple of 3 | GeeksforGeeks http://www.g...

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

Count all possible groups of size 2 or 3 that have sum as multiple of 3 | GeeksforGeeks

http://ift.tt/1rn6iHv

Count all possible groups of size 2 or 3 that have sum as multiple of 3 | GeeksforGeeks

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

via LifeLong Community

Stable Marriage Problem | GeeksforGeeks Given N men and N women, where each person has ranked all members...

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

Stable Marriage Problem | GeeksforGeeks

Given N men and N women, where each person has ranked all members of the opposite sex in order of preference, marry the men and women together such that there are no two people of opposite sex who would both rather have each other than their current partners. If there are no such people, all the marriages are “stable” (Source Wiki (Link->http://ift.tt/1nbii9z) ).

http://ift.tt/1AHwO30

http://ift.tt/1nbieXp

Stable Marriage Problem | GeeksforGeeks

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

via LifeLong Community

Find the point where a monotonically increasing function becomes positive first time | GeeksforGeeks...

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

Find the point where a monotonically increasing function becomes positive first time | GeeksforGeeks

http://ift.tt/1n9iKVQ

Find the point where a monotonically increasing function becomes positive first time | GeeksforGeeks

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

via LifeLong Community

Find the Increasing subsequence of length three with maximum product | GeeksforGeeks http://www.geek...

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

Find the Increasing subsequence of length three with maximum product | GeeksforGeeks

http://ift.tt/1n9iKFv

Find the Increasing subsequence of length three with maximum product | GeeksforGeeks

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

via LifeLong Community

Divide and Conquer | Set 5 (Strassen's Matrix Multiplication) | GeeksforGeeks http://ift.tt/12zZ8j4...

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

Divide and Conquer | Set 5 (Strassen's Matrix Multiplication) | GeeksforGeeks

http://ift.tt/1gaA0qh

Divide and Conquer | Set 5 (Strassen's Matrix Multiplication) | GeeksforGeeks

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

via LifeLong Community

org.apache.lucene.codecs.lucene49 (Lucene 4.9.0 API) http://ift.tt/Xlukbn...

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

org.apache.lucene.codecs.lucene49 (Lucene 4.9.0 API)

http://ift.tt/UOGasA

org.apache.lucene.codecs.lucene49 (Lucene 4.9.0 API)

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

via LifeLong Community

Lucene学习总结之二：Lucene的总体架构 - 觉先 - 博客园 http://ift.tt/1m2l5Ct...

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

Lucene学习总结之二：Lucene的总体架构 - 觉先 - 博客园

http://ift.tt/1oRZ26a

Lucene学习总结之二：Lucene的总体架构 - 觉先 - 博客园

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

via LifeLong Community

Write an Efficient Method to Check if a Number is Multiple of 3 | GeeksforGeeks http://ift.tt/12zZ8j4...

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

Write an Efficient Method to Check if a Number is Multiple of 3 | GeeksforGeeks

http://ift.tt/1lnStlF

Write an Efficient Method to Check if a Number is Multiple of 3 | GeeksforGeeks

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

via LifeLong Community

Next Power of 2 | GeeksforGeeks Write a function that, for a given no n, finds a number p which is greater...

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

Next Power of 2 | GeeksforGeeks

Write a function that, for a given no n, finds a number p which is greater than or equal to n and is a power of 2.

http://ift.tt/1pJ3e4F

http://ift.tt/1nNW3f1

Next Power of 2 | GeeksforGeeks

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

via LifeLong Community

Count total set bits in all numbers from 1 to n | GeeksforGeeks http://ift.tt/1u24Jiu...

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

Count total set bits in all numbers from 1 to n | GeeksforGeeks

http://ift.tt/1qMkTPq

Count total set bits in all numbers from 1 to n | GeeksforGeeks

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

via LifeLong Community

Binary representation of a given number | GeeksforGeeks http://ift.tt/1u24Jig...

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

Binary representation of a given number | GeeksforGeeks

http://ift.tt/1qMkTPi

Binary representation of a given number | GeeksforGeeks

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

via LifeLong Community

Add two bit strings | GeeksforGeeks 1. Make them equal sized by adding 0s at the begining of smaller...

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

Add two bit strings | GeeksforGeeks

1. Make them equal sized by adding 0s at the begining of smaller string.

2. Perform bit addition

…..Boolean expression for adding 3 bits a, b, c

…..Sum = a XOR b XOR c

…..Carry = (a AND b) OR ( b AND c ) OR ( c AND a )

http://ift.tt/1u24KCX

http://ift.tt/1qMkVH8

Add two bit strings | GeeksforGeeks

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

via LifeLong Community

Swap all odd and even bits | GeeksforGeeks http://ift.tt/1tvDT4F

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

Swap all odd and even bits | GeeksforGeeks

http://ift.tt/1tvDT4F

Swap all odd and even bits | GeeksforGeeks

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

via LifeLong Community

Write one line C function to find whether a no is power of two | GeeksforGeeks http://ift.tt/12zZ8j4...

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

Write one line C function to find whether a no is power of two | GeeksforGeeks

http://ift.tt/1tvDQG3

Write one line C function to find whether a no is power of two | GeeksforGeeks

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

via LifeLong Community

Write a program to add two numbers in base 14 | GeeksforGeeks http://ift.tt/1leaKmG...

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

Write a program to add two numbers in base 14 | GeeksforGeeks

http://ift.tt/1oMSVA8

Write a program to add two numbers in base 14 | GeeksforGeeks

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

via LifeLong Community

Reverse a stack using recursion | GeeksforGeeks http://ift.tt/1oMSRAq...

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

Reverse a stack using recursion | GeeksforGeeks

http://ift.tt/1leaGmZ

Reverse a stack using recursion | GeeksforGeeks

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

via LifeLong Community

Multiply two integers without using multiplication, division and bitwise operators, and no loops | G...

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

Multiply two integers without using multiplication, division and bitwise operators, and no loops | GeeksforGeeks

http://ift.tt/1leaDrw

Multiply two integers without using multiplication, division and bitwise operators, and no loops | GeeksforGeeks

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

via LifeLong Community

Dynamic Programming | Set 11 (Egg Dropping Puzzle) | GeeksforGeeks http://ift.tt/1yekVzB...

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

Dynamic Programming | Set 11 (Egg Dropping Puzzle) | GeeksforGeeks

http://ift.tt/1nGLvOE

Dynamic Programming | Set 11 (Egg Dropping Puzzle) | GeeksforGeeks

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

via LifeLong Community

Comparison of Inheritance in C++ and Java | GeeksforGeeks http://ift.tt/1qkpZ0v...

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

Comparison of Inheritance in C++ and Java | GeeksforGeeks

http://ift.tt/1qkpZgJ

Comparison of Inheritance in C++ and Java | GeeksforGeeks

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

via LifeLong Community

Accessing Grandparent’s member in Java | GeeksforGeeks http://ift.tt/1qkpZ0f

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

Accessing Grandparent’s member in Java | GeeksforGeeks

http://ift.tt/1qkpZ0f

Accessing Grandparent’s member in Java | GeeksforGeeks

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

via LifeLong Community

Dynamic Programming | Set 14 (Maximum Sum Increasing Subsequence) | GeeksforGeeks Given an array of ...

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

Dynamic Programming | Set 14 (Maximum Sum Increasing Subsequence) | GeeksforGeeks

Given an array of n positive integers. Write a program to find the sum of maximum sum subsequence of the given array such that the intgers in the subsequence are sorted in increasing order.

http://ift.tt/1jFuLYq

http://ift.tt/1nGLsSR

Dynamic Programming | Set 14 (Maximum Sum Increasing Subsequence) | GeeksforGeeks

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

via LifeLong Community

Check for Identical BSTs without building the trees | GeeksforGeeks Given two arrays which represent...

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

Check for Identical BSTs without building the trees | GeeksforGeeks

Given two arrays which represent a sequence of keys. Imagine we make a Binary Search Tree (BST) from each array. We need to tell whether two BSTs will be identical or not without actually constructing the tree.

http://ift.tt/1tqsvr0

http://ift.tt/1n1hwvS

Check for Identical BSTs without building the trees | GeeksforGeeks

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

via LifeLong Community

DFA based division | GeeksforGeeks Deterministic Finite Automaton (DFA) (Link->http://ift.tt/12zZ8j4...

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

DFA based division | GeeksforGeeks



Deterministic Finite Automaton (DFA) (Link->http://ift.tt/1n1hvIj) can be used to check whether a number “num” is divisible by “k” or not. If the number is not divisible, remainder can also be obtained using DFA.

We consider the binary representation of ‘num’ and build a DFA with k states. The DFA has transition function for both 0 and 1. Once the DFA is built, we process ‘num’ over the DFA to get remainder.

http://ift.tt/1tqsvqO

http://ift.tt/1n1hvIl

DFA based division | GeeksforGeeks

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

via LifeLong Community

Sieve of Eratosthenes | GeeksforGeeks Create a list of consecutive integers from 2 to n: (2, 3, 4, …...

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

Sieve of Eratosthenes | GeeksforGeeks

Create a list of consecutive integers from 2 to n: (2, 3, 4, …, n).

Initially, let p equal 2, the first prime number.

Starting from p, count up in increments of p and mark each of these numbers greater than p itself in the list. These numbers will be 2p, 3p, 4p, etc.; note that some of them may have already been marked.

Find the first number greater than p in the list that is not marked. If there was no such number, stop. Otherwise, let p now equal this number (which is the next prime), and repeat from step 3.

When the algorithm terminates, all the numbers in the list that are not marked are prime.

http://ift.tt/1n1hvrQ

http://ift.tt/1tqsvah

Sieve of Eratosthenes | GeeksforGeeks

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

via LifeLong Community

Solr: form-urlencoded content length exceeds upload limit The Problem: Our Solr client application(...

HttpClient 4 Tutorial http://ift.tt/RuxVAo

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

HttpClient 4 Tutorial

http://ift.tt/RuxVAo

HttpClient 4 Tutorial

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

via LifeLong Community

HttpClient 4 Cookbook http://ift.tt/1hX4MKf

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

HttpClient 4 Cookbook

http://ift.tt/1hX4MKf

HttpClient 4 Cookbook

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

via LifeLong Community

Android - How to send gzipped JSON in HTTP request - Arnab Chakraborty http://ift.tt/1laZM1t...

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

Android - How to send gzipped JSON in HTTP request - Arnab Chakraborty

http://ift.tt/1laZM1v

Android - How to send gzipped JSON in HTTP request - Arnab Chakraborty

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

via LifeLong Community

Given a number, find the next smallest palindrome | GeeksforGeeks Given a number, find the next smallest...

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

Given a number, find the next smallest palindrome | GeeksforGeeks

Given a number, find the next smallest palindrome larger than this number. For example, if the input number is “2 3 5 4 5″, the output should be “2 3 6 3 2″. And if the input number is “9 9 9″, the output should be “1 0 0 1″.

http://ift.tt/1zqSuio

http://ift.tt/1tnLget

Given a number, find the next smallest palindrome | GeeksforGeeks

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

via LifeLong Community

Check whether a given point lies inside a triangle or not | GeeksforGeeks Given three corner points ...

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

Check whether a given point lies inside a triangle or not | GeeksforGeeks

Given three corner points of a triangle, and one more point P. Write a function to check whether P lies within the triangle or not.

http://ift.tt/1l8VpDZ

http://ift.tt/1oEeWB0

Check whether a given point lies inside a triangle or not | GeeksforGeeks

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

via LifeLong Community

Make a fair coin from a biased coin | GeeksforGeeks You are given a function foo() that represents a...

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

Make a fair coin from a biased coin | GeeksforGeeks

You are given a function foo() that represents a biased coin. When foo() is called, it returns 0 with 60% probability, and 1 with 40% probability. Write a new function that returns 0 and 1 with 50% probability each.

http://ift.tt/1oEeW3W

http://ift.tt/1oEeV06

Make a fair coin from a biased coin | GeeksforGeeks

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

via LifeLong Community

Select a random number from stream, with O(1) space | GeeksforGeeks 1) Initialize ‘count’ as 0, ‘count...

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

Select a random number from stream, with O(1) space | GeeksforGeeks

1) Initialize ‘count’ as 0, ‘count’ is used to store count of numbers seen so far in stream.

2) For each number ‘x’ from stream, do following

…..a) Increment ‘count’ by 1.

…..b) If count is 1, set result as x, and return result.

…..c) Generate a random number from 0 to ‘count-1′. Let the generated random number be i.

…..d) If i is equal to ‘count – 1′, update the result as x.

http://ift.tt/1rVrODY

http://ift.tt/1qdEx1D

Select a random number from stream, with O(1) space | GeeksforGeeks

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

via LifeLong Community

[TopTalent.in] How Tech companies Like Their Résumés | GeeksforGeeks http://ift.tt/1qdEvXJ...

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

[TopTalent.in] How Tech companies Like Their Résumés | GeeksforGeeks

http://ift.tt/1qdEwL9

[TopTalent.in] How Tech companies Like Their Résumés | GeeksforGeeks

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

via LifeLong Community

Program to find amount of water in a given glass | GeeksforGeeks http://ift.tt/1zl1p4O...

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

Program to find amount of water in a given glass | GeeksforGeeks

http://ift.tt/X286Lx

Program to find amount of water in a given glass | GeeksforGeeks

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

via LifeLong Community

Measure one litre using two vessels and infinite water supply There are two vessels of capacities ‘a...

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

Measure one litre using two vessels and infinite water supply

There are two vessels of capacities ‘a’ and ‘b’ respectively. We have infinite water supply. Give an efficient algorithm to make exactly 1 litre of water in one of the vessels. You can throw all the water from any vessel any point of time. Assume that ‘a’ and ‘b’ are Coprimes (Link->http://ift.tt/1lLnuBs) .

http://ift.tt/1oySQjB

http://ift.tt/1oySRnB

Measure one litre using two vessels and infinite water supply

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

via LifeLong Community

Largest Rectangular Area in a Histogram | Set 2 | GeeksforGeeks 1) Create an empty stack. 2) Start ...

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

Largest Rectangular Area in a Histogram | Set 2 | GeeksforGeeks



1) Create an empty stack.

2) Start from first bar, and do following for every bar ‘hist[i]‘ where ‘i’ varies from 0 to n-1.

……a) If stack is empty or hist[i] is higher than the bar at top of stack, then push ‘i’ to stack.

……b) If this bar is smaller than the top of stack, then keep removing the top of stack while top of the stack is greater. Let the removed bar be hist[tp]. Calculate area of rectangle with hist[tp] as smallest bar. For hist[tp], the ‘left index’ is previous (previous to tp) item in stack and ‘right index’ is ‘i’ (current index).

3) If the stack is not empty, then one by one remove all bars from stack and do step 2.b for every removed bar.

http://ift.tt/1pM1NWH

http://ift.tt/1lLnvoM

Largest Rectangular Area in a Histogram | Set 2 | GeeksforGeeks

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

via LifeLong Community

Dynamic Programming | Set 32 (Word Break Problem) | GeeksforGeeks Given an input string and a dictionary...

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

Dynamic Programming | Set 32 (Word Break Problem) | GeeksforGeeks

Given an input string and a dictionary of words, find out if the input string can be segmented into a space-separated sequence of dictionary words. See following examples for more details.

http://ift.tt/1oySQQr

http://ift.tt/1lLnukG

Dynamic Programming | Set 32 (Word Break Problem) | GeeksforGeeks

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

via LifeLong Community

Dynamic Programming | Set 31 (Optimal Strategy for a Game) | GeeksforGeeks Problem statement: Consider...

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

Dynamic Programming | Set 31 (Optimal Strategy for a Game) | GeeksforGeeks

Problem statement: Consider a row of n coins of values v1 . . . vn, where n is even. We play a game against an opponent by alternating turns. In each turn, a player selects either the first or last coin from the row, removes it from the row permanently, and receives the value of the coin. Determine the maximum possible amount of money we can definitely win if we move first.

http://ift.tt/Vz36NW

http://ift.tt/1zkuzRP

Dynamic Programming | Set 31 (Optimal Strategy for a Game) | GeeksforGeeks

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

via LifeLong Community

Dynamic Programming | Set 28 (Minimum insertions to form a palindrome) | GeeksforGeeks Given a string...

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

Dynamic Programming | Set 28 (Minimum insertions to form a palindrome) | GeeksforGeeks

Given a string, find the minimum number of characters to be inserted to convert it to palindrome.

http://ift.tt/1zkuzkN

http://ift.tt/X1kyLt

Dynamic Programming | Set 28 (Minimum insertions to form a palindrome) | GeeksforGeeks

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

via LifeLong Community

Dynamic Programming | Set 30 (Dice Throw) | GeeksforGeeks Given n dice each with m faces, numbered from...

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

Dynamic Programming | Set 30 (Dice Throw) | GeeksforGeeks

Given n dice each with m faces, numbered from 1 to m, find the number of ways to get sum X. X is the summation of values on each face when all the dice are thrown.

http://ift.tt/X1kyuU

http://ift.tt/1zkuzkw

Dynamic Programming | Set 30 (Dice Throw) | GeeksforGeeks

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

via LifeLong Community

Find the maximum distance covered using n bikes | GeeksforGeeks There are n bikes and each can cover...

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

Find the maximum distance covered using n bikes | GeeksforGeeks

There are n bikes and each can cover 100 km when fully fueled. What is the maximum amount of distance you can go using n bikes? You may assume that all bikes are similar and a bike takes 1 litre to cover 1 km.

http://ift.tt/1rs5XSz

http://ift.tt/1nNhsEw

Find the maximum distance covered using n bikes | GeeksforGeeks

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

via LifeLong Community

An Interesting Method to Generate Binary Numbers from 1 to n | GeeksforGeeks Given a number n, write...

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

An Interesting Method to Generate Binary Numbers from 1 to n | GeeksforGeeks

Given a number n, write a function that generates and prints all binary numbers with decimal values from 1 to n.

http://ift.tt/1mLEhUl

http://ift.tt/1lKlDfZ

An Interesting Method to Generate Binary Numbers from 1 to n | GeeksforGeeks

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

via LifeLong Community

Horner's Method for Polynomial Evaluation | GeeksforGeeks Given a polynomial of the form cnxn + cn-1xn...

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

Horner's Method for Polynomial Evaluation | GeeksforGeeks

Given a polynomial of the form cnxn + cn-1xn-1 + cn-2xn-2 + … + c1x + c0 and a value of x, find the value of polynomial for a given value of x. Here cn, cn-1, .. are integers (may be negative) and n is a positive integer.

http://ift.tt/SeVkGI

http://ift.tt/1lKlARx

Horner's Method for Polynomial Evaluation | GeeksforGeeks

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

via LifeLong Community

Function to check if a singly linked list is palindrome | GeeksforGeeks Given a singly linked list of...

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

Function to check if a singly linked list is palindrome | GeeksforGeeks

Given a singly linked list of characters, write a function that returns true if the given list is palindrome, else false.

http://ift.tt/1ld29AZ

http://ift.tt/1zjhbgx

Function to check if a singly linked list is palindrome | GeeksforGeeks

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

via LifeLong Community

Compressor Head Introducing Compressor Head

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

Compressor Head

Introducing Compressor Head

Introducing Compressor Head

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

via LifeLong Community

Delete nodes which have a greater value on right side | GeeksforGeeks Given a singly linked list, remove...

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

Delete nodes which have a greater value on right side | GeeksforGeeks

Given a singly linked list, remove all the nodes which have a greater value on right side.

http://ift.tt/1ps8glS

http://ift.tt/1nvOoBV

Delete nodes which have a greater value on right side | GeeksforGeeks

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

via LifeLong Community