Morning

o/ Namaste

@Dro beere ?

@sha Hi o/

@sha Hi \o

@sha hi o/

~ India: A Magician of Benares

@TheLittleNaruto yo bro

@DroidDev Have one Algo related doubt

Let's say you have list of numbers and its location

For Example Shadow'number is 12345 and location is Antartica

There is a view

In that you enter a number and fetch the location of it from the file where those list of numbers are there

It's upto you that how you want to store the records

But The records can be millions

How would you do that ?

So basically User'll enter any number and you will display the location associated to the entered number.

@TheLittleNaruto are these sequential numbers or random numbers?

@DroidDev It can be sequential. It's upto you how you want them stored

But searching should be very optimized

@TheLittleNaruto I think you can just take an array(list?), and store the location at the same index as that number.

For example, Antartica will be stored at index 12345

direct O(1) access!

@DroidDev In that case 0-99999999 spaces will be wasted, no ?

@TheLittleNaruto so the numbers don't start from 0?

@DroidDev ArrayList has some threshold AFAIR

@DroidDev It's a phone number

oh

> still thinking

Okay

if records are in millions, then we have to store in database, but I don't know what optimization we'll perform on queries.

dunno much about database optimisation

@TheLittleNaruto we can store numbers in binary tree nodes as well. That's log n search time. But millions of records won't be store in RAM, where tree's memory will reside

@DroidDev using database is not allowed

database queries are best and faster than the Flash

@DroidDev Right That's what I also told but interviewer was not happy

then files are last resort. We'll store numbers in files. Lets say all the numbers starting with 99 will be stored in one file. That'll provide sharding to our number dataset, which'll be in files. Now these files can be stored on disk as well.

@DroidDev I can't tell if that's an optimal solution

next is searching, so searching for file is fairly easy. We can just have another dataset, which store all the addresses to files. So, we'll see what the number starts with, then get the address of that file in O(1). We'll open the file, here, all the numbers will be stored in sorted manner, where we can do binary search and find the name.

how about this @TheLittleNaruto

and we can keep making files until system runs out of storage space, so its really upto how much money the interviewer has :P

@DroidDev LOL

millions will look peanuts in front of this. We can have billions of records

Yeah

also, we can optimise this further, but you get the idea, right?

But that sounds reasonable, however I can't verify what he was looking for.

I forgot to ask him too

I just designed an optimised and sharded database for you man. You can scale it vertically, as well as horizontally. You can even have multiple databases saving files, and then you can have even more storage space.

sometimes, if you listen carefully, you can hear my genius at work :P

@DroidDev haha I did listened to you carefully. But I am still not sure what he was looking for.

hmm....but I think this should do man.

@DroidDev Yeah looks promising.

Also one question was to implement own Integer.parseInt(String input) method

And one more was to find set of integers in a string

For example if String input = "aabb55wew123dasdfs3ssdfsa567"

Then output should be "55", "123", "3", "567" @Dro

both of above problems were easy for me.

@DroidDev How ?

@TheLittleNaruto how did you do this one?

@DroidDev I had created this variable String digits ="0123456789"

@TheLittleNaruto multiply the existing number by 10, add the new number to last place. That sort of logic. If I put the pen down, I can do it on paper

And rest was easy job

@DroidDev Yes I did same

@TheLittleNaruto so every time you checked with contains?

for every character in string?

@DroidDev Yes there was no other way I could think of at that moment

Oh boy I could have applied regex instead

@TheLittleNaruto yeah, what you did was worst way to do it actually. It has O(n^2) complexity. Contain function works with linear search man

@DroidDev Yeah right

I am still feeling happy because I could make up to 2nd round of the interview

And that too without any preparation lol

which company?

hmmm

Life Style is one of the brand of this company

~ Echo ... E c h o ...... E c h o .....

~ Shadow of a Woman

~ You rang?

~ What is this? Weekend?

LOL

~ Who needs sleep here?

~ The Magnificent Six and ½: The Magician