Hello! I am Monyuy a software engineer. A day in my life consists of prepping web art, fixing front end bugs, adding API endpoint, database design and blogging.
When working with medical imaging tools in real clinical environments, one thing becomes obvious very quickly: Powerful software is not always usable software. While building an imaging solution for
Building and deploying an application on the cloud can be time-consuming and a painful task, especially if like me you are new to cloud infrastructure. Fortunately, there's a service in AWS that can simplify this task. AWS Elastic Beanstalk provides ...
Quick sort is an efficient, recursive, divide-and-conquer approach to sorting an array. In this method, a pivot value is chosen in the general array, the array is partitioned into two subarrays of values less than and greater than the pivot. We combi...
Insertion sort is a sorting algorithm in which elements are transferred one at a time to their correct position. It can be considered as shifting around and inserting elements in their right order to sort an unsorted array of any size. The array is s...
Selection Sort is one of the easier sorting algorithms to understand and implement. This algorithm splits the array into two parts: Sorted Unsorted The Sorted part is at the beginning of the array and the Unsorted part afterward. For each pass...
How does Bubble Sort Work?
Given an integer array nums, return an array answer such that answer[i] is equal to the product of all the elements of nums except nums[i]. The product of any prefix or suffix of nums is guaranteed to fit in a 32-bit integer. You must write an algori...
When you create the table on PostgreSQL and want to use UUID Generator V4 on uuid field but turns out that you got this error. Function uuid_generate_v4() does not exist SOLUTION: The extension is not installed in the particular database you are usi...
Given a sorted array of size N and an integer K, find the position at which K is present in the array using binary search. SOLUTION: Binary search divides the input array by half at every step. After every step, either we find the index we are lookin...
