Some time ago, I applied for a software QA position and was given this assignment: Problem Given 2 input files with rows in the format: <account ID><billing ID><Sign-up Date in MM-DD-YYYY format> Write a python script to print: All accounts …

# Tag Archives: Big O

## Sorting Algorithms Explained by Examples

Introduction Today, I am going to dive into the awesome world of sorting. It reminds me with entry level computer science courses and algorithm design. The goal of this article is to summarize popular sorting algorithms and put it in …

## NP Complete Problems

Introduction One of the – confusing – topics in Algorithm design is the concept of NP completeness. If you search the topic on the internet you will probably find tons of articles and lectures on the subject however in this …

## Making change problem dynamic programming example

Dynamic programming making change algorithm Today we are going to discuss a new problem that can be solved using Dynamic Programming technique. We will talk about the well known problem of making change using a minimum number of coins. If …

## Dynamic Programming Longest Increasing Sub Sequence

Longest Increasing Sub Sequence Welcome to the 6th part of our discussion on Dynamic Programming. You can refer to the first article (introduction) here. In this article we are going to discuss the “Longest Increasing Sub Sequence” problem which can …

## Dynamic Programming Longest Common Subsequence

Longest Common Subsequence Welcome to the 4th article on Dynamic Programming. You can refer to the first article (introduction) here. I will be using the shortcut LCS to refer to longest common sub-sequence. Let us get started. Introduction One of …

## Combining and Merging Two Arrays

Merging Two Arrays Problem Given two sorted arrays A and B of different sizes m and n. Describe an algorithm to combine the two arrays into one array. The output array must not have duplicates. The output array must maintain …