"I always ask to clarify if this is a brand new team. If so, then I focus on bringing in people with strong technical aptitudes(since I'm hiring for software engineering), but also team members that have experience mentoring and good communication is a must. I look for people who have leadership qualities. I emphasize that building a brand new team isn't something I can do on my own, so the initial hires of that team are very important to help me expand it."
Catherine I. - "I always ask to clarify if this is a brand new team. If so, then I focus on bringing in people with strong technical aptitudes(since I'm hiring for software engineering), but also team members that have experience mentoring and good communication is a must. I look for people who have leadership qualities. I emphasize that building a brand new team isn't something I can do on my own, so the initial hires of that team are very important to help me expand it."See full answer
"I suggest a 4 step process:
Ensure your recruitment process and company's branding are inclusive. This means using inclusive language in your job postings, avoiding gender stereotypes, and making sure your company's website and social media presence are welcoming to people from all backgrounds.
Partner with nonprofit and cultural organizations to reach a more diverse pool of candidates. Many organizations can help you connect with candidates from underrepresented groups. These org"
gdecuri - "I suggest a 4 step process:
Ensure your recruitment process and company's branding are inclusive. This means using inclusive language in your job postings, avoiding gender stereotypes, and making sure your company's website and social media presence are welcoming to people from all backgrounds.
Partner with nonprofit and cultural organizations to reach a more diverse pool of candidates. Many organizations can help you connect with candidates from underrepresented groups. These org"See full answer
"Definitely nice to think of this without memorization, but there is a well known algorithm for this problem, which is the Levenshtein Distance.
Lev(a,b) = len(a) if len(b) == 0
= len(b) if len(a) == 0
= lev(a[1:], b[1:] if a[0] == b[0]
= 1 + min (lev(a, b[1:]), lev(a[1:], b), lev(a[1:], b[1:]))
https://en.wikipedia.org/wiki/Levenshtein_distance
I'm sure some optimizations could be made with heuristic."
Nicholas S. - "Definitely nice to think of this without memorization, but there is a well known algorithm for this problem, which is the Levenshtein Distance.
Lev(a,b) = len(a) if len(b) == 0
= len(b) if len(a) == 0
= lev(a[1:], b[1:] if a[0] == b[0]
= 1 + min (lev(a, b[1:]), lev(a[1:], b), lev(a[1:], b[1:]))
https://en.wikipedia.org/wiki/Levenshtein_distance
I'm sure some optimizations could be made with heuristic."See full answer