- 👀 I love coding and solving problems
- 🧑🎓 I cherish Science and Mathematics
- 💞️ I'll appreciate your collaboration to my project
- 📫 How to reach me
- ekademiks 📖 for academic use
After my data analytic training by Google, I decided to learn more about R programming language.
Some of the interesting things about R that spurred by interest includes its:
- Computational powers
- Data cleaning powers
- Visualization powers
- Great mathematical tools and libraries
In my journey to learning more about R I decided to use this interesting book R for Data Science by Hadley Wickham & Garret Grolemund
Note: The responses to the exercises on this book were not the authors', but the reader's, Me😆
- 👌 Chapter 1 - Data Visualization with ggplot2
- 👜 Data Transformation with with
dplyr - 🌞 Workflow: Script
- 🌝Exploratory Data Analysis
- ✴️Workflow: Projects
- 🪐Tibbles with
tibble - 🌧️Data Import with
readr - 🐧Tidy Data with tidyr
-
♦️ Relational Data withdplyr - 🌳Strings with
stringr - 🌩️Factors with
forcats - 🗓️Dates and Times with
lubridate - ⛓️Pipes with
magrittr - 👨🏫Functions
- 🚡Vectors
- ➿Iteration with
purrr - 🖼️Model Basics with
modelr - 🏗️Model Building
- 🧹Many Models with
purrrandbroom - 🎧R Markdown
- ☎️Graphs for Communication with
ggplot2 - 🎤R Markdown Formats
- 📞R Markdown Workflow
🧮 Exercises & project on Data Structure and Algorithm with the nicely resource Algorithms, FOURTH EDITION and different other dsa challenges (miscellaneous challenges).
Note: The responses to the exercises on this book were not the authors', but the reader's, Me 👨🔬; hence, might not have been the best approach for implementations.
-
👍 DSA Exercises
- Matrix transposition
- Infix algorithm
- Histogram
- Four-Sum algorithm
- Farthest pair algorithm
- Conditional 2D boolean
- Common factor conditional array
- Closest pair algorithm
- Binary number implementation
- Array elements intersection
- Generic linked list sorting algorithm
- Generic linked list shuffling algorithm
- Min method in priority queue implementation
- Reverse domain name implementation
- Dynamic Median Find
- E A S Y Q U E S T I O N Heap implementation
- Frequency of strings
- Minimum-maximum priority queue implementation
- String duplicates removal
- Priority queue sequence
- Two-word compound tracker
- Unordered array symbol table
- Ordered sequential search symbol table
- Heap arrangement diagram
- Heap positioning
- BST with equality chekcs
- BST root certification algorithm
- BST caching algorithm
- BST non recursive order checks
- BST non recursive min(), max(),select(), ceiling() & floor()