---
title: "Bongi Sibanda (@trialnerr) | Hashnode"
description: "Demystifying Algorithms, One Problem at a Time. Read the latest articles by Bongi Sibanda on Hashnode."
url: "https://hashnode.com/@trialnerr"
---

@trialnerr

# Bongi Sibanda

@trialnerr · Rhode Island · Joined October 2024

Demystifying Algorithms, One Problem at a Time.

### [Sorting Algorithms: Part 2](https://trialnerr.hashnode.dev/sorting-algorithms-part-2?utm_source=hashnode&utm_medium=feed)

Selection Sort

3 min read · [trialnerr.hashnode.dev](https://trialnerr.hashnode.dev/sorting-algorithms-part-2?utm_source=hashnode&utm_medium=feed)

[Jan 22, 2025](https://hashnode.com/posts/sorting-algorithms-part-2/67917601cc29838fbf480ac1)

### [Sorting Algorithms: Part 1](https://trialnerr.hashnode.dev/sorting-algorithms-part-1?utm_source=hashnode&utm_medium=feed)

Insertion Sort

3 min read · [trialnerr.hashnode.dev](https://trialnerr.hashnode.dev/sorting-algorithms-part-1?utm_source=hashnode&utm_medium=feed)

[Dec 31, 2024](https://hashnode.com/posts/sorting-algorithms-part-1/67734a7d41847f03bb4f4dc1)

### [Solving Best Time to Buy and Sell Stock Leetcode Problem](https://trialnerr.hashnode.dev/solving-best-time-to-buy-and-sell-stock?utm_source=hashnode&utm_medium=feed)

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/...

4 min read · [trialnerr.hashnode.dev](https://trialnerr.hashnode.dev/solving-best-time-to-buy-and-sell-stock?utm_source=hashnode&utm_medium=feed)

[Nov 1, 2024](https://hashnode.com/posts/solving-best-time-to-buy-and-sell-stock/67251f352aaf46e70081e0b7)

### [Solving Majority Element Challenge](https://trialnerr.hashnode.dev/solving-majority-element-challenge?utm_source=hashnode&utm_medium=feed)

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...

5 min read · [trialnerr.hashnode.dev](https://trialnerr.hashnode.dev/solving-majority-element-challenge?utm_source=hashnode&utm_medium=feed)

[1](https://hashnode.com/posts/solving-majority-element-challenge/671b10ef6da81af0189ed802) [Oct 25, 2024](https://hashnode.com/posts/solving-majority-element-challenge/671b10ef6da81af0189ed802)
