docs: update twitter handler

Author: amejiarosario

README.md

@@ -507,7 +507,7 @@ This project is also available in a [book](https://books.adrianmejia.com/dsajs-d
 
 Reach out to me at one of the following places!
 
-- Twitter at <a href="http://twitter.com/amejiarosario" target="_blank">`@amejiarosario`</a>
+- Twitter at <a href="http://twitter.com/iAmAdrianMejia" target="_blank">`@iAmAdrianMejia`</a>
 - Chat on <a href="https://dsajs-slackin.herokuapp.com" target="_blank">`dsajs.slack.com`</a>
 
 ## License

book/content/part04/dynamic-programming.asc

@@ -9,7 +9,7 @@ endif::[]
 (((Algorithmic Techniques, Dynamic Programming)))
 Dynamic programming (dp) is a way to solve algorithmic problems with *overlapping subproblems*. Algorithms using dp find the base case and building a solution from the ground-up. Dp _keep track_ of previous results to avoid re-computing the same operations.
 
-// https://twitter.com/amejiarosario/status/1103050924933726208
+// https://twitter.com/iAmAdrianMejia/status/1103050924933726208
 // https://www.quora.com/How-should-I-explain-dynamic-programming-to-a-4-year-old/answer/Jonathan-Paulson
 // https://medium.com/@codingfreak/top-50-dynamic-programming-practice-problems-4208fed71aa3
 // https://www.slideshare.net/balamoorthy39/greedy-algorithm-knapsack-problem

book/content/preface.asc

@@ -82,4 +82,4 @@ Measurement is the first step that leads to control and eventually to improvemen
 
 Your feedback is very welcome and valuable. Let us know what your thoughts about this book — what you like or ideas to make it better.
 
-To send us feedback, e-mail us at hello+dsajs@adrianmejia.com, send a tweet to https://twitter.com/amejiarosario[@amejiarosario], or using the hash tags `#dsaJS`, `#javascript` and `#algorithms`.
+To send us feedback, e-mail us at hello+dsajs@adrianmejia.com, send a tweet to https://twitter.com/iAmAdrianMejia[@iAmAdrianMejia], or using the hash tags `#dsaJS`, `#javascript` and `#algorithms`.