Name: Jones Wafula Lukorito
Profile: Full-stack developer
LinkedIn: Wafula Lukorito
GitHub: WafulaLukorito
Skills and Technologies
LANGUAGESPython, JavaScript, Java, PHP, C#, R
FRAMEWORKSReact, Django, Bootstrap, Headless WordPress, Three.js
OTHER TOOLSSQL, Sass, HTML, CSS, HTML5 Canvas
SKILLSWeb Development, Game Development, E-Commerce site development, Mobile Development, Database Management, Sentiment Analysis, Natural Language Processing, Technical Writing
About me
I am an engineer with a strong Computer Science foundation with practical experience in full-stack web design, building and maintaining REST APIs, creating Django and PHP backends, and designing educational JavaScript games.
I boast of close to 3 years of experience building company websites and a personal e-commerce website with over 50,000 monthly visitors as well as an internship with an American retail company.
As a former journalist with years of experience in the newsroom, I possess the necessary skills to assimilate well within teams and foster a collaborative work atmosphere by applying empathic communication skills. Working across international boundaries has equipped me with the ability to navigate diverse cultures.
Portfolio Projects
In addition to professional experience, here are a few projects I've worked on on a personal capacity.
AfRecipe African Recipes Python API
Saka Search: Web Crawler and alternate Search Engine
Blog
At TechSavannah, I write about Africa's tech scene and my personal journey.
Coding Byte
Graphs: Understanding Kruskal’s Algorithm
Kruskal’s algorithm is used to find a minimum spanning forest or tree in an undirected graphs and connected graphs respectively. For graphs, minimum spanning trees are a subset of edges that form a tree which include all vertices, where the sum of all edges is kept to the smallest number possible.
Coding Byte
Binary Search: Deriving asymptotic analysis of the Binary Search Algorithm
How Does Binary Search Work? Binary search only works in sorted collections. It will thus be assumed that customer orders have been sorted before the implementation of the algorithm. Binary search works by recursively dividing a collection in halves, discarding the half that does not contain the element, and continuing to divide the portions that contain the item until we have one last item left.
Coding Byte
Dynamic Programming: Knapsack Problem
In the knapsack problem, a thief is filling up their knapsack with items that weigh differently and have various weights. The thief must design an algorithm that will help them determine what combination of items to carry that have maximum value without breaking their knapsack that can only hold up to limited weight.