₦airaland Forum

1. add_user(string: user)
2. remove_user(string: user)
3. pick_random_winner() -> string

struct Lottery {
     map: HashMap<i32, String>,
}

impl Lottery {
    // first problem realized here, what would be the key? and i don already talk say na hash map go good for this things o chai  

    fn add_user(&mut self, string: user){
         // But this would not work it doesn't work that way. it would have made sense if the function has a signature for key.
         self.map.insert(user); error, where is the key ?  
     }

    fn remove_user(&mut self, string: user){
         //no key can't remove anything 
     }

    fn pick_random_user(&self){
         // impossible!!! no key no random - even if there was a key it doesn't  reorder it self unlike Vector. This might be possible in language like python  
     }
}

struct Lottery {
     user: Vec<String>,
}

impl Lottery {
    fn add_user(&mut self, string: user){
         // we just insert
         self.user.push(user); 
     }

    fn remove_user(&mut self, string: user){
         // linear search and then remove
        if self.participant.contains(&participant) {
            self.participant.retain(|x| x != &participant);
        }
     }

    fn pick_random_user(&self){
         let random_gen = // algorithm that generate random number
         let random = random_gen % self.user.len();
         self.user[random]
     }
}

Deicide:
Too much pressure that i couldn't even think straight. The question is not even that hard simple data structure question that i can't even believe i bombed it. Chai.

I was asked to implement a Lottery system. that has the following functionality.

1. add_user(string: user)
2. remove_user(string: user)
3. pick_random_winner() -> string

Yes that was how easy it was but i bombed. Immediately i saw add and remove my mind immediately went to the king of all data structure HashMap but boy i was wrong a vector would do just fine, the problem here is the functionality to pick_random_user and the function signature. how do you do that with a HashMap if data are stored anywhere in memory? meanwhile in Array everything stored contiguously. But i was busy thinking of speed

In as much as hash map would be good for add and removal in 0(1) time. it's bad for random access.

could use HashSet but random would still Bleep you up.

My bad implementation.

struct Lottery {
     map: HashMap<i32, String>,
}

impl Lottery {
    // first problem realized here, what would be the key? and i don already talk say na hash map go good for this things o chai  

    fn add_user(&mut self, string: user){
         // But this would not work it doesn't work that way. it would have made sense if the function has a signature for key.
         self.map.insert(user); error, where is the key ?  
     }

    fn remove_user(&mut self, string: user){
         //no key can't remove anything 
     }

    fn pick_random_user(&self){
         // impossible!!! no key no random - even if there was a key it doesn't  reorder it self unlike Vector. This might be possible in language like python  
     }
}

Now for a better implementation, that only came to my head as i was not overthinking immediately after the interview.

struct Lottery {
     user: Vec<String>,
}

impl Lottery {
    fn add_user(&mut self, string: user){
         // we just insert
         self.user.push(user); 
     }

    fn remove_user(&mut self, string: user){
         // linear search and then remove
        if self.participant.contains(&participant) {
            self.participant.retain(|x| x != &participant);
        }
     }

    fn pick_random_user(&self){
         let random_gen = // algorithm that generate random number
         let random = random_gen % self.user.len();
         self.user[random]
     }
}

Anyways we move!!. Best advice? CALM DOWN! Technical interview are fun but trust 9ja network to Bleep you up.

Deicide:
Too much pressure that i couldn't even think straight. The question is not even that hard simple data structure question that i can't even believe i bombed it. Chai.

I was asked to implement a Lottery system. that has the following functionality.

1. add_user(string: user)
2. remove_user(string: user)
3. pick_random_winner() -> string

Yes that was how easy it was but i bombed. Immediately i saw add and remove my mind immediately went to the king of all data structure HashMap but boy i was wrong a vector would do just fine, the problem here is the functionality to pick_random_user and the function signature. how do you do that with a HashMap if data are stored anywhere in memory? meanwhile in Array everything stored contiguously. But i was busy thinking of speed

In as much as hash map would be good for add and removal in 0(1) time. it's bad for random access.

could use HashSet but random would still Bleep you up.

My bad implementation.

struct Lottery {
     map: HashMap<i32, String>,
}

impl Lottery {
    // first problem realized here, what would be the key? and i don already talk say na hash map go good for this things o chai  

    fn add_user(&mut self, string: user){
         // But this would not work it doesn't work that way. it would have made sense if the function has a signature for key.
         self.map.insert(user); error, where is the key ?  
     }

    fn remove_user(&mut self, string: user){
         //no key can't remove anything 
     }

    fn pick_random_user(&self){
         // impossible!!! no key no random - even if there was a key it doesn't  reorder it self unlike Vector. This might be possible in language like python  
     }
}

Now for a better implementation, that only came to my head as i was not overthinking immediately after the interview.

struct Lottery {
     user: Vec<String>,
}

impl Lottery {
    fn add_user(&mut self, string: user){
         // we just insert
         self.user.push(user); 
     }

    fn remove_user(&mut self, string: user){
         // linear search and then remove
        if self.participant.contains(&participant) {
            self.participant.retain(|x| x != &participant);
        }
     }

    fn pick_random_user(&self){
         let random_gen = // algorithm that generate random number
         let random = random_gen % self.user.len();
         self.user[random]
     }
}

Anyways we move!!. Best advice? CALM DOWN! Technical interview are fun but trust 9ja network to Bleep you up.

robinhood171200:
better luck next time bro. another opportunity will surely come. can i dm you privately or send you an email? i'd like to ask for your opinion/advice on some tech related issues.

Temmylee01:
What language is this

Deicide:
Too much pressure that i couldn't even think straight. The question is not even that hard simple data structure question that i can't even believe i bombed it. Chai.

I was asked to implement a Lottery system. that has the following functionality.

1. add_user(string: user)
2. remove_user(string: user)
3. pick_random_winner() -> string

Yes that was how easy it was but i bombed. Immediately i saw add and remove my mind immediately went to the king of all data structure HashMap but boy i was wrong a vector would do just fine, the problem here is the functionality to pick_random_user and the function signature. how do you do that with a HashMap if data are stored anywhere in memory? meanwhile in Array everything stored contiguously. But i was busy thinking of speed

In as much as hash map would be good for add and removal in 0(1) time. it's bad for random access.

could use HashSet but random would still Bleep you up.

My bad implementation.

struct Lottery {
     map: HashMap<i32, String>,
}

impl Lottery {
    // first problem realized here, what would be the key? and i don already talk say na hash map go good for this things o chai  

    fn add_user(&mut self, string: user){
         // But this would not work it doesn't work that way. it would have made sense if the function has a signature for key.
         self.map.insert(user); error, where is the key ?  
     }

    fn remove_user(&mut self, string: user){
         //no key can't remove anything 
     }

    fn pick_random_user(&self){
         // impossible!!! no key no random - even if there was a key it doesn't  reorder it self unlike Vector. This might be possible in language like python  
     }
}

Now for a better implementation, that only came to my head as i was not overthinking immediately after the interview.

struct Lottery {
     user: Vec<String>,
}

impl Lottery {
    fn add_user(&mut self, string: user){
         // we just insert
         self.user.push(user); 
     }

    fn remove_user(&mut self, string: user){
         // linear search and then remove
        if self.participant.contains(&participant) {
            self.participant.retain(|x| x != &participant);
        }
     }

    fn pick_random_user(&self){
         let random_gen = // algorithm that generate random number
         let random = random_gen % self.user.len();
         self.user[random]
     }
}

Anyways we move!!. Best advice? CALM DOWN! Technical interview are fun but trust 9ja network to Bleep you up.

Deicide:
The almighty Rust

Deicide:
My Email on this account, I don't even know the password

robinhood171200:
whatsapp? twitter? anywhwere i could text you privately.

richebony:
Hope u don't mind my asking, but how many programming languages do u actually know.,because I have seen u write in several languages

Deicide:
Too much pressure that i couldn't even think straight. The question is not even that hard simple data structure question that i can't even believe i bombed it. Chai.

I was asked to implement a Lottery system. that has the following functionality.

1. add_user(string: user)
2. remove_user(string: user)
3. pick_random_winner() -> string

Yes that was how easy it was but i bombed. Immediately i saw add and remove my mind immediately went to the king of all data structure HashMap but boy i was wrong a vector would do just fine, the problem here is the functionality to pick_random_user and the function signature. how do you do that with a HashMap if data are stored anywhere in memory? meanwhile in Array everything stored contiguously. But i was busy thinking of speed

In as much as hash map would be good for add and removal in 0(1) time. it's bad for random access.

could use HashSet but random would still Bleep you up.

My bad implementation.

struct Lottery {
     map: HashMap<i32, String>,
}

impl Lottery {
    // first problem realized here, what would be the key? and i don already talk say na hash map go good for this things o chai  

    fn add_user(&mut self, string: user){
         // But this would not work it doesn't work that way. it would have made sense if the function has a signature for key.
         self.map.insert(user); error, where is the key ?  
     }

    fn remove_user(&mut self, string: user){
         //no key can't remove anything 
     }

    fn pick_random_user(&self){
         // impossible!!! no key no random - even if there was a key it doesn't  reorder it self unlike Vector. This might be possible in language like python  
     }
}

Now for a better implementation, that only came to my head as i was not overthinking immediately after the interview.

struct Lottery {
     user: Vec<String>,
}

impl Lottery {
    fn add_user(&mut self, string: user){
         // we just insert
         self.user.push(user); 
     }

    fn remove_user(&mut self, string: user){
         // linear search and then remove
        if self.participant.contains(&participant) {
            self.participant.retain(|x| x != &participant);
        }
     }

    fn pick_random_user(&self){
         let random_gen = // algorithm that generate random number
         let random = random_gen % self.user.len();
         self.user[random]
     }
}

Akonimohate12:

satandeterrible:
Shame on you.