Sipping lattes, diving into Linux, conquering Leetcode, and Lifting spirits (and weights) along the way! 馃殌
Leetcode, Algorithms, Random Projects, Marathons & Trekking!
Sep 1, 2024 路 3 min read 路 Quick Sort Quick sort is a sorting algorithm that uses divide and conquer approach. It is similar to merge sort, but it has a time complexity of O(n log n). Quick Sort Algorithm 馃攳 Purpose: Sort data structures in ascending order 馃攧 Minor tweaks: Ad...
Join discussion
Aug 7, 2024 路 3 min read 路 Solving the Two Sum Problem: Three Approaches in Java The Two Sum problem is a classic algorithmic challenge that appears frequently in coding interviews and competitive programming. The problem statement is simple: given an array of integers and a t...
Join discussion
Aug 6, 2024 路 3 min read 路 Bubble sort achieves sorting by continuously comparing and swapping adjacent elements. This process resembles bubbles rising from the bottom to the top, hence the name bubble sort. As shown in the figure below, the bubbling process can be simulated u...
Join discussion
Aug 4, 2024 路 3 min read 路 Merge sort is a sorting algorithm based on the divide-and-conquer strategy, involving the "divide" and "merge" phases shown in the figure below. Divide phase: Recursively split the array from the midpoint, transforming the sorting problem of a long ...
Join discussion
Jul 26, 2024 路 2 min read 路 I have had always been fan of neovim, but i have always used it in linux, but now i want to use this on Windows. Here i will document how you can install and use neovim on Windows. First install neovim from neovim on windows You can use Winget or Ch...
Join discussion
