@trialnerr
Demystifying Algorithms, One Problem at a Time.
Hi there. My name is Bongi Sibanda and I am a software engineer with a background in Math education, and I enjoy solving data structure and algorithm challenges. This blog is meant to break down the intricacies of algorithms and data structures, making them accessible to both beginners and experienced developers. Whether you're preparing for coding interviews or simply looking to sharpen your skills, I hope my step-by-step guides and real-world examples will help you navigate the world of algorithms with confidence.
Nothing here yet.
Jan 22, 2025 · 3 min read · This is a continuation of the sorting algorithms series. This article will cover selection sort. . Problem Consider sorting n numbers stored in array A by first finding the smallest element of A and exchanging it with the element in A[0]. Then find t...
Join discussion
Dec 31, 2024 · 3 min read · I have been revisiting sorting algorithms, and decided to write about them to solidify my understanding, and spread the knowledge! Hope you enjoy! Problem: Given an unsorted array of integers, sort the array in ascending order in place and return the...
Join discussion
Nov 1, 2024 · 4 min read · This was a problem that I didn’t fully understand the first time I saw it. It took me a while to come up with a brute force solution. So I am very happy that I understand it enough to share not one but TWO solutions with you. https://media.giphy.com/...
Join discussionOct 25, 2024 · 5 min read · Problem: 169. Majority Element Given an array nums of size n, return the majority element. The majority element is the element that appears more than *⌊n / 2⌋ , times. You may assume that the majority element always exists in the array. * ⌊n⌋ means t...
MMichael commented