* Clarify definition of "symmetric difference"
* Add definition of binary operation
* Adjust wording in "Symmetric Difference"
* Improve preposition use
* Move instructions to the Instructions section
Co-authored-by: Eric Leung <eric@erictleung.com>
* Improve formatting and clarity in "Subset"
* Change method name to isSubsetOf
Co-authored-by: Eric Leung <eric@erictleung.com>
* Change method name to isSubsetOf
Co-authored-by: Eric Leung <eric@erictleung.com>
* Fix method name in tests
* Fix variable name aIsSubsetOfB
* Fix method name in solution
Co-authored-by: Eric Leung <eric@erictleung.com>
* Fixed a Typo in Eulers Problem 70
Line 15 should say "Find the value of <var>n</var>, 1 < <var>n</var> < 10**7, for which φ(<var>n</var>) is a permutation of <var>n</var> and the ratio <var>n</var>/φ(<var>n</var>) produces a minimum." instead of Find the value of <var>n</var>, 1 < <var>n</var> < 107, for which φ(<var>n</var>) is a permutation of <var>n</var> and the ratio <var>n</var>/φ(<var>n</var>) produces a minimum.
* Updated the Markdown
Fixes the markdown to display proper superscript rather than just using ** to denote a superscript
* changes to bfs instructions
* added description on visual representation
* Added to the animation description
* Added information about stacks in the description
* Edited description for clarity
* Edited small details for grammar and clarity
* Apply suggested wording and typo fixes
Co-authored-by: Eric Leung <eric@erictleung.com>
* Add typo fixes to BFS challenge
Co-authored-by: Kyla Yujiri <27860923+kylayujiri@users.noreply.github.com>
Co-authored-by: Eric Leung <eric@erictleung.com>
* Update use-breadth-first-search-in-a-binary-search-tree.english.md
* Update curriculum/challenges/english/08-coding-interview-prep/data-structures/use-breadth-first-search-in-a-binary-search-tree.english.md
Committed suggested changes
Co-Authored-By: Tom <20648924+moT01@users.noreply.github.com>
* add debugging function to solution
Ensured seed code and solution matched-up.
Co-Authored-By: Tom <20648924+moT01@users.noreply.github.com>
Co-authored-by: Tom <20648924+moT01@users.noreply.github.com>
Co-authored-by: Shaun Hamilton <51722130+Sky020@users.noreply.github.com>
* fix(curriculum): replace comments with empty strings in merge-sort challenge
* Update curriculum/challenges/english/08-coding-interview-prep/algorithms/implement-merge-sort.english.md
Co-Authored-By: Tom <20648924+moT01@users.noreply.github.com>
Co-authored-by: Tom <20648924+moT01@users.noreply.github.com>
* Adding a test in problem-14-Longest-collatz-sequence.english.md
Adding a test in problem-14-Longest-collatz-sequence.english.md
* fix(curriculum): use more efficient algorithm
Co-authored-by: Oliver Eyton-Williams <ojeytonwilliams@gmail.com>
* add: solution to project euler 22 md file
* Copied the array instead of using it directly
Co-Authored-By: Oliver Eyton-Williams <ojeytonwilliams@gmail.com>
Co-authored-by: Oliver Eyton-Williams <ojeytonwilliams@gmail.com>
* fix: improve Project Euler descriptions and test case
Improve formatting of Project Euler test descriptions. Also add poker hands array and new test case for problem 54
* feat: add typeof tests and gave functions proper names for first 100 challenges
* fix: continue fixing test descriptions and adding "before test" sections
* fix: address review comments
* fix: adjust grids in 18 and 67 and fix some text that reference files rather than the given arrays
* fix: implement bug fixes and improvements from review
* fix: remove console.log statements from seed and solution
* Added meaning of ones in the matrix
* Apply suggestions from code review
Co-Authored-By: Oliver Eyton-Williams <ojeytonwilliams@gmail.com>
* fix: add slash to avoid markdown lint error
Co-authored-by: mrugesh <1884376+raisedadead@users.noreply.github.com>
Co-authored-by: Oliver Eyton-Williams <ojeytonwilliams@gmail.com>
* add: solution to project euler problem 20
* Update curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-20-factorial-digit-sum.english.md
Accidentally added last line. Calling function is unnecessary in solution.
Co-Authored-By: Oliver Eyton-Williams <ojeytonwilliams@gmail.com>
* right place for starting braces
Co-Authored-By: Manish Giri <manish.giri.me@gmail.com>
* moved starting brace to previous line.
Co-Authored-By: Manish Giri <manish.giri.me@gmail.com>
Co-authored-by: Oliver Eyton-Williams <ojeytonwilliams@gmail.com>
Co-authored-by: Manish Giri <manish.giri.me@gmail.com>
* fix: correct test and add solution
I also changed the seed to report the results of an easier example to
the user, since just evaluating the function mostly wastes time.
* fix: use a better solution
* fix: credit original author
* Correct ProjectEuler:002 definition and tests
From projecteuler.net:
By considering the terms in the Fibonacci sequence whose values do not exceed four million, find the sum of the even-valued terms.
Correct: take all f(n) where f(n) <= 4,000,000 and f(n) is even
Incorrect: take all f(n) where n <= 4,000,000 and f(n) is even
* Incorporate PR review suggestios to ProjectEuler 002
Reword the problem statement
Co-Authored-By: Tom <20648924+moT01@users.noreply.github.com>
Co-authored-by: Tom <20648924+moT01@users.noreply.github.com>
* fix: Correct paths in English exercises by prefixing "/" before "learn"
* fix(lang): Correct paths to exercises by prefixing "/" before "learn" in remaining languages
Either improved the algorithm or reduced the difficulty for the slowest
tests. All these pass with testProtectTimeout = 500, so should be safe
on most machines with the current timeout of 2500.
Oliver Eyton-Williams
Ty Mick
Shaun Hamilton
Anthony Zeng
anastasiasoenjoto
Daksh Goyal
Rostyslav Ugryniuk
Hassaan Pasha
Bhanu Pratap Singh Rathore
Sagar Kharabe
Ashraf Nazar
yitzhak-bloy
Keith Warter
Tom
Agata Stawarz
Sanket Kogekar
Randell Dawson
Hassaan Pasha
Shivam
Kristofer Koishigawa
Harsh Savergaonkar
srdubya
Josh Soref
Sidtharthan A N
Kiara Barias
David Lau
Obba Paschal
Dylan Cutler
Andree Amaro Gonzalez