### Max Priority Queue Implementation with Heap Data structure

Max Priority Queue is a data structure which manage a list of keys(values). And…

October 01, 2020

Replace all spaces in a string with ‘%20’ (three characters). Do this in place and assume you have enough space in array

This is the simplest solution which many people might think.

- Iterate from left side (begining)
- After encountering a space, first shift entire array by 2 places.
- Put
`%20`

at consecutive location - Repeat this process

Obviously, if you see you need to shift the remaining array as many times as number of spaces. And, is not an efficient algorithm.

I will not put this silly code.

The complexity would be close to `O(n^2)`

If you start from left side, you saw we need to shift the array. What if we start from the right side.

- First calculate number of spaces in array, this will help in calculating the resultant last index
- Start iterating from right most side.
- Maintain two index counters. One for original array characters, other for resultant index positions.
- Start copying character one by one.
- If found space, just copy consecutive
`%20`

At the end, you will achieve the purpose. Lets see the code

```
private static int countSpaces(char[] input) {
int c = 0;
for (int i=0; i<input.length; i++) {
if (input[i] == ' ') {
c ++;
}
}
return c;
}
public static int replace(char[] input, int len) {
int spaces = countSpaces(input);
if (spaces == 0) return len;
int lastIndex = (len-1) + (2 * spaces);
int resultIndex = lastIndex;
for (int i=len-1; i>=0; i--) {
if (input[i] == ' ') {
//copy %20
input[lastIndex] = '0';
input[lastIndex-1] = '2';
input[lastIndex-2] = '%';
lastIndex -= 3;
}
else {
//copy actual characters
input[lastIndex] = input[i];
lastIndex --;
}
}
return resultIndex;
}
```

The complexity is `O(n)`

Max Priority Queue is a data structure which manage a list of keys(values). And…

Problem Statement You are given a string text of words that are placed among…

Problem Statement Given an array of integers, find if the array contains any…

** Inversion There is an array(a) and two indexes i and j. Inversion is the…

Problem Statement You are given an array prices where prices[i] is the price of…

This algorithm is very useful for large input. And, is quite efficient one. It…

Introduction Lets assume we have a csv something similar to following: Python…

Introduction In last post, we saw How to read CSV with Headers into Dictionary…

Introduction Power BI is a wonderful tool to give life to your data, by…

Problem Statement You are given an array prices where prices[i] is the price of…

Introduction In this post we will see: How to prepare a docker image for your…

Introduction We have a page, for example a . And, upon submission we would want…