diff --git a/client/i18n/locales/english/intro.json b/client/i18n/locales/english/intro.json index 5a69182d242..ddc9b984478 100644 --- a/client/i18n/locales/english/intro.json +++ b/client/i18n/locales/english/intro.json @@ -1159,7 +1159,8 @@ "title": "Coding Interview Prep", "intro": [ "If you're looking for free coding exercises to prepare for your next job interview, we've got you covered.", - "This section contains hundreds of coding challenges that test your knowledge of algorithms, data structures, and mathematics. It also has a number of take-home projects you can use to strengthen your skills, or add to your portfolio." + "This section contains dozens of coding challenges that test your knowledge of algorithms, data structures, and mathematics. It also has a number of take-home projects you can use to strengthen your skills, or add to your portfolio.", + "This work incorporates material from Wikipedia, which is licensed under the Creative Commons Attribution-ShareAlike License 4.0. The original content might have been modified and adapted. For the unaltered version and additional details, see the original page on Wikipedia." ], "note": "The Project Euler Project and Rosetta Code have been moved to their own courses. Go back to the curriculum to see the list of courses we offer.", "blocks": { diff --git a/curriculum/challenges/english/10-coding-interview-prep/data-structures/breadth-first-search.md b/curriculum/challenges/english/10-coding-interview-prep/data-structures/breadth-first-search.md index 12070241354..2f128438fc7 100644 --- a/curriculum/challenges/english/10-coding-interview-prep/data-structures/breadth-first-search.md +++ b/curriculum/challenges/english/10-coding-interview-prep/data-structures/breadth-first-search.md @@ -16,7 +16,8 @@ This algorithm starts at one node and visits all its neighbors that are one edge An important data structure that will help implement the breadth-first search algorithm is the queue. This is an array where you can add elements to one end and remove elements from the other end. This is also known as a FIFO or First-In-First-Out data structure. -Visually, this is what the algorithm is doing. ![Breadth first search algorithm moving through a tree](https://camo.githubusercontent.com/2f57e6239884a1a03402912f13c49555dec76d06/68747470733a2f2f75706c6f61642e77696b696d656469612e6f72672f77696b6970656469612f636f6d6d6f6e732f342f34362f416e696d617465645f4246532e676966) +Visually, this is what the algorithm is doing: +animation showing the breadth first search algorithm The grey shading represents a node getting added into the queue and the black shading represents a node getting removed from the queue. See how every time a node gets removed from the queue (node turns black), all their neighbors get added into the queue (node turns grey). diff --git a/curriculum/challenges/english/10-coding-interview-prep/data-structures/depth-first-search.md b/curriculum/challenges/english/10-coding-interview-prep/data-structures/depth-first-search.md index 4ecce7b5cfc..5c66a2664c3 100644 --- a/curriculum/challenges/english/10-coding-interview-prep/data-structures/depth-first-search.md +++ b/curriculum/challenges/english/10-coding-interview-prep/data-structures/depth-first-search.md @@ -16,7 +16,7 @@ Once it reaches one end of a path, the search will backtrack to the last node wi The animation below shows how the algorithm works. The algorithm starts with the top node and visits the nodes in the numbered order. - +animation showing the depth first search algorithm Notice how, unlike breadth-first search, every time a node is visited, it doesn't visit all of its neighbors. Instead, it first visits one of its neighbors and continues down that path until there are no more nodes to be visited on that path.