# Category Archives: Pore Abar Bujhbo

best video:

pseudocode:

implementation: (I need to clear the radix sort part later..took help to implement)

Reference:

Radix Sort – Explanation, Pseudocode and Implementation

Time complexity: O(d*n)==O(n)
Where d is the digit of the number

## Hackerearth – Jarvis and Numbers

code i have understand for last 6 hours:
problem statement was little bit clumsy but understood atlast:

accepted code took help from editorial:

official editorial:

## Codeforces: A. Next Round

My code: didn’t passed all testcase:

Then looked out the solution but din’t understand one thing but implemented my own:

https://tausiq.wordpress.com/2014/07/13/cf-158a-next-round/

code:

another code:

code:

## Array of String

theortecical concept source:
http://stackoverflow.com/questions/20347170/char-array-and-char-array

code:

Problem:
source: 101cproblems:

# Problem 80: Array of String

Take an array of string named fruitNames and store four fruit names (“Mango”, “Jack-fruit”, “Banana”, “Litchi”). Now iterate the array using loop and print the names of the fruits each in a separate line.

code: