I applied to a machine learning research role at Huawei Vancouver. Here’s what they promised vs. what actually happened during the interview process. Read before you apply.
Career mapping: A practical strategy for FAANG interview success
Cracking FAANG interviews is not only about technical skills but also about long-term planning. Career mapping helps software engineers identify their current abilities, improve interview readiness, and present their experience effectively.
In real life, career mapping connects DSA preparation, system design thinking, and resume strategy into one clear path. Engineers who follow this approach tend to make more confident career decisions and perform better in interviews.
Helpful resources that explain this in detail include:
This is the first video of the C++17 STL (Standard Template Library) series where I've explained the 3 crucial questions on LEGO 1. What is STL? 2. Why it wa...
Numerous contents are available on how to give better #programming Interviews, so here is my #vlog about how to take better programming #interviews
Given the surname of a player, determine how hard it is to pronounce. We assume that the difficulty of the surname is the maximum number of consecutive consonants in it.
Example
For surname = "Blaszczykowski", the output should be
hardSurname(surname) = 6;
For surname = "Papastathopoulos", the output should be
hardSurname(surname) = 2.
Credits: CodeFights
-----
When I first attempted this problem, I was very confused because it was hard for me to grasp what a “consecutive consonant” was. This is definitely a point I would clarify with a interviewer prior to starting to solve the problem.
I came up with a O(n) solution (hopefully -- correct me if I’m wrong!) which iterates through the given string and keeps track of the highest number of consecutive consonants. You can think of it as a “max number in array” problem.