A long time ago, where Google did not even exist, searching the web was a whole other exercise by itself. It was like running a 10km run after having a complete cross-fit workout. The sites suggested by the older search engines were too often irrelevant and old, while the ones…

Over the past few weeks, I have participated in various hackathons varying from different themes, such as medical transportation to digitalizing farming. Luckily, I was able to come top three with my team in these hackathons! For sure, our solution and our pitch might be great, which is why we…

As programmers, we are constantly faced with data structures; rather it would be complex, linear, or even both. Data structures are important because they help organize data very efficiently, which can be used very effectively, for example, using algorithms to automate certain tasks. …

The two most favorite coding interview questions of big tech companies simplified in plain English. — If you are into the IT industry and love to code, you probably know what coding interviews are and how much work it takes to pass an interview successfully, let alone preparing for the interview itself. For the people who don't, there are essentially like giving a test. The interviewer(s)…

Is the way we Measure and see Distance really Showing us the Reality of the Length between Two Points? — Zeno’s paradox has been a problem that has left mathematicians, philosophers, and scientists on the edge of their chairs. This problem may sound easy to comprehend, but it is relatively difficult to prove or find an actual solution. When I first heard about the problem myself when I was studying…

An Intriguing Exploration by a Highschooler in One of the Most Difficult Problems in Math. — The Collatz Conjecture is by far one of the most interesting, yet mind-boggling problems that have been puzzling mathematicians for decades. Before we dive into our exploration in this whole new field of Pure Mathematics and Number Theory, let us first define what the conjecture really is. When you first…

Two Approached Basic Computer Science Methods to Solve the Famous Puzzling Problem Without the Use of Quantum Algorithms. — A few weeks ago, I was reading articles about recent physics and math publications on Apple News, until I came across the publication Wired. Typically, I don’t read articles on Wired, but there was this one article that stuck out to me. This article was called “Euler’s 243-Year-Old ‘Impossible’ Puzzle…

The Sieve of Eratosthenes is one of the oldest algorithms known today. However, regardless of its age and its process, why do people still use it, and how can we optimize this algorithm to match the processes of today? — There are many algorithms in this world. When we think about examples of algorithms, we think of Binary Search, A* Search, BFS and DFS, and a lot more algorithms. The algorithms we know today are among the best theoretical computer science computations we as humans have discovered to date (which…

Eulerian cycles and paths are by far one of the most influential concepts in Graph Theory. However, what really are Eulerian cycles and paths, and how is the 18th-century path meaningful to the futuristic 21st century? — Eulerian Cycles and paths are by far one of the most influential concepts of graph theory in the world of mathematics and innovative technology. These circuits and paths were first discovered by Euler in 1736, therefore giving the name “Eulerian Cycles” and “Eulerian Paths.” When it comes to graph theory…