Skip to content

ga-sf-study-group/june-10-2015

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

10 Commits
 
 
 
 
 
 

Repository files navigation

June 10, 2015

Problem 1 - Largest sequence

You are given an array of integers (both positive and negative) Find the continuous sequence with the largest sum. Return the sum.

Problem 2 - Words in a book

Design a method to find the frequency of occurrences of any given word in a book.

Problem 3 - Square Matrix

Imagine you have a square matrix, where each cell is filled with either black or white. Design an algorithm to find the maximum subsquare such that all four borders are filled with black pixels.

Problem 4 - Perfect Squares

Find the smallest x + y + z with integers x > y > z > 0 such that x + y, x − y, x + z, x − z, y + z, y − z are all perfect squares.

About

No description, website, or topics provided.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published