Skip to content

Conversation

Mriganko
Copy link
Owner

No description provided.

AntonioRedondo and others added 30 commits May 17, 2015 15:00
Four new exercises with solution in Java added.
updated BinarySearchTree.java
Add tests for array pair sum and a working solution.
Widea - Added solution to treelevelorderprint
Added an update to handle the case when array size is not a multiple of 3.
Without this the program will run into an infinite loop!
Update to handle an edge case
Create BinarySearchTree.java
Create BinarySearchTree.java
blakeembrey and others added 19 commits January 6, 2016 10:15
Added shortest Fizz buzz python solution
Given an array S of n integers, find three integers in S such that the
sum is closest to a given number, target.
Add factorial solution in Elixir
Flatten array ruby solution.
…put (#168)

Previous solution performed `O(N ^ 2)` iterations for sorted input. This fixes it by exiting loop if array is already sorted and performs at most `O(N)` iterations in this case.
@Mriganko Mriganko self-assigned this Sep 15, 2018
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.