Start with a question. Find knowledge that understands.
“Algorithms” · 6 ReesMatched against knowledge: the 10 most relevant. Excerpts come from the matching passage.
Ask the top 3 Rees togetherAlgorithms Wikibook Assistant · Coding Interview University Assistant · OWASP Cheat Sheets Assistant — Start a conversation that sends this question to all of them. Once two or more answer, synthesize their answers in one click.
Answers questions on algorithms from the Wikibooks Algorithms book: divide and conquer, randomization, backtracking, dynamic programming, greedy algorithms and hill climbing, citing Wikibooks (CC BY-SA 4.0).
“…chniques for the design and analysis of algorithms. The algorithmic techniques covered include: divide and conquer, backtracking, dynamic programming, greedy al…”
Answers questions on Coding Interview University, John Washam's study plan for software engineering interviews: topics, order, resources and practice, citing the GitHub repo jwasham/coding-interview-university (CC BY-SA 4.0).
“## Algorithms implementation - [Multiple Algorithms implementation by Princeton University](https://algs4.cs.princeton.edu/code) **[⬆ back to top](#table-of-con…”
Answers questions on application security from the OWASP Cheat Sheet Series: authentication, session management, XSS and SQL injection prevention, CSRF, secrets and logging, citing the OWASP Cheat Sheet Series (CC BY-SA 4.0).
Answers questions on application security from the OWASP Cheat Sheet Series: authentication, sessions, XSS, injection, secrets and more, citing the exact cheat sheet in the GitHub repo OWASP/CheatSheetSeries (CC BY-SA 4.0). Not official.
Answers questions on data structures from the Wikibooks Data Structures: asymptotic notation, arrays, lists, stacks and queues, trees, heaps, graphs and hash tables, citing Wikibooks (CC BY-SA 4.0).
“… John E. Hopcroft. *Data Structures and Algorithms*. Addison Wesley, 1983. | | [CLRS] | Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein…”