Software Development and Programming Careers (Official Discussion Thread)

[null]

LeetCode - The World's Leading Online Programming Learning Platform

Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview.

leetcode.com

yeah you need to sort them and then pair-wise compare them. you can shortcut by discarding anything shorter than your running longest-common-value or anything where sub-strings of that length are not equal. i have an accepted solution on leet and i'll post it here in a bit. in c++. i don't know rust yet.

 

[TheAnointedOne]

yeah you need to sort them and then pair-wise compare them. you can shortcut by discarding anything shorter than your running longest-common-value or anything where sub-strings of that length are not equal. i have an accepted solution on leet and i'll post it here in a bit. in c++. i don't know rust yet.

Revised rust solution

fn longest_common_prefix(strs: Vec<String>) -> String {
    if strs.is_empty() {
        return "".to_string() ;
    }
    let mut strs = strs.clone() ;
    strs.sort() ;
    let (first, last) = ( strs.first().unwrap(), strs.last().unwrap() ) ;    
    let min = first.len().min( last.len() ) ;
    let mut count = 0 ;
    for itr in 0..min {
        if first.as_bytes()[ itr ] != last.as_bytes()[ itr ] {
            count = itr ;
            break ;            
        }
        count += 1 ;
    }
    first.chars().take( count ).collect()    
}

 

[FreshFromATL]

About to start studying for the Microsoft Azure Data Engineer certification (DP-203). Company paying me $1000 to get it. Looking to take the exam by the end of January which should be more than enough time to solidify my knowledge on ADF, Synapse, Databricks, etc.

 

[TheAnointedOne]

It's not enough to simply solve the problems though. The whole point of using something like rust is to write performant and safe code.

My solution for 'Plus One' (easy)

impl Solution {
    pub fn plus_one(digits: Vec<i32>) -> Vec<i32> {
        let mut ret = digits.clone() ;
        ret.reverse() ;

        for itr in ret.iter_mut() {

            println!( "{}", itr ) ;        

            if *itr < 9 {
                *itr += 1 ;
                break ;
            }

            *itr = 0 ;
        }

        if ret.last().unwrap() == &0 {
            ret.push(1) ;
        }
        
        ret.reverse() ;
        ret
    }
}

runtime 1ms beats 61.37%; memory 2.3mb beats 7.58%

So my shyt uses too much memory.


---------------------- Edit -------------------------------

New solution uses 2.1mb beats 74.1%

impl Solution {
    pub fn plus_one(digits: Vec<i32>) -> Vec<i32> {

        let mut digits = digits ;

        for itr in digits.iter_mut().rev() {
            if *itr < 9 {
                *itr += 1 ;
                return digits ;
            }

            *itr = 0 ;
        }

        digits.insert( 0, 1 ) ;
        digits    
    }
}

 

[null]

LeetCode - The World's Leading Online Programming Learning Platform

Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview.

leetcode.com

here is a c++ based solution. i did not submit it because ...

the idea is

1. sort the list - do this through pointers as cheaper
2. find the shortest common length - this could be done as part of the sort
3. then compare first and last in the list i.e. two elements (ONLY) for the longest common prefix of the two and return that

static std::string longestCommonPrefix(const std::vector<std::string>& strs) {
    if (strs.size() < 1) {
      return "";
    }
    if (strs.size() < 2) {
      return strs[0];
    }
    
    uint16_t max_common_length(std::min_element(strs.begin(), strs.end(), [&max_common_length](std::string_view s1, std::string_view s2) { return s1.length() < s2.length(); })->length());
    std::vector<const std::string*> sorted;
    sorted.reserve(strs.size());
    std::transform(strs.begin(), strs.end(), std::back_inserter(sorted), [](const std::string& s) { return &s; } );
    std::sort(sorted.begin(), sorted.end(), [](const std::string*& s1, const std::string*& s2) { return *s1 < *s2; });

    for (uint16_t i = 0; i<max_common_length; ++i) {
      if (sorted[0]->operator[](i) != sorted[sorted.size()-1]->operator[](i)) {
        return strs[0].substr(0, i);
      }
    }
    
    return strs[0].substr(0, max_common_length);
  }

 

[TheAnointedOne]

here is a c++ based solution. i did not submit it because ...

the idea is

1. sort the list - do this through pointers as cheaper
2. find the shortest common length - this could be done as part of the sort
3. then compare first and last in the list i.e. two elements (ONLY) for the longest common prefix of the two and return that

static std::string longestCommonPrefix(const std::vector<std::string>& strs) {
    if (strs.size() < 1) {
      return "";
    }
    if (strs.size() < 2) {
      return strs[0];
    }
   
    uint16_t max_common_length(std::min_element(strs.begin(), strs.end(), [&max_common_length](std::string_view s1, std::string_view s2) { return s1.length() < s2.length(); })->length());
    std::vector<const std::string*> sorted;
    sorted.reserve(strs.size());
    std::transform(strs.begin(), strs.end(), std::back_inserter(sorted), [](const std::string& s) { return &s; } );
    std::sort(sorted.begin(), sorted.end(), [](const std::string*& s1, const std::string*& s2) { return *s1 < *s2; });

    for (uint16_t i = 0; i<max_common_length; ++i) {
      if (sorted[0]->operator[](i) != sorted[sorted.size()-1]->operator[](i)) {
        return strs[0].substr(0, i);
      }
    }
   
    return strs[0].substr(0, max_common_length);
  }

1) How long did this take you?

2) You really should submit your answer to see the speed/memory usage.

 

[null]

1) How long did this take you?

2) You really should submit your answer to see the speed/memory usage.

I already solved the problem before so know how to do it.

The version above is one that I rewrote from one of my earlier solutions on my local laptop (Xcode) and then I ran some unit tests. my first solution didn't use transform and compared the entire list rather than just the first and last.

It took about 30 mins to rewrite (while I was watching the football and on thecoli)

 

[MyApps]

If I needed to find someone to develop an app for me, where should I start?

Any help is greatly appreciated.

 

[Don Juan]

X

 

[Neo. The Only. The One.]

If I needed to find someone to develop an app for me, where should I start?

Any help is greatly appreciated.

You should probably lead with your budget. There's plenty of brehs in this thread who can build it, but I'm sure nobody here is going to work for free.

 

[MyApps]

You should probably lead with your budget. There's plenty of brehs in this thread who can build it, but I'm sure nobody here is going to work for free.

Absolutely. Just need to have a quote of sorts.

 

[Neo. The Only. The One.]

Absolutely. Just need to have a quote of sorts.

I still think you have to give a budget. But I'll leave it alone.

 

[EzekelRAGE]

Absolutely. Just need to have a quote of sorts.

Would be hard to give a quote if the person doesnt know what you need done.
"I would like woo, woo, woo and I have a budget of X. Can anyone here do that or point me to someone who can?"

 

[MyApps]

Ok that's a start. I can work on a true outline.

But for starters, it would be an app similar in style and function as LYFT but for a different service.

Bear with me. I'm green at this.

 

[MyApps]

Budget of about 5k-8k