Turing's Live Coding Challenge | Full Stack Development Mock Interview | Part 2

The second part of our episode on Full Stack Development Mock Interview takes a look at what a Live Coding Challenge looks like for a Full Stack Development Job at Turing. Watch the video to learn more about the platform and the kind of questions that get asked in a Live Coding Test.

Become a Turing software developer today.

To stay informed about the latest updates at Turing, follow us on:
...

#LiveCodingChallenge #MockInterview #FullStackDevelopment #FullStackDeveloper #FullStackMockInterview #TuringJobs #RemoteJobs #TuringDeveloper

Turing connects exceptionally talented software developers to remote engineering jobs at Silicon Valley and US-based companies. 200+ companies, including those backed by Google Ventures, Andreessen Horowitz, Founders Fund, Kleiner Perkins, and Bloomberg, have successfully hired Turing developers.

- Turing offers a wide range of long-term, full-time remote jobs for Full Stack, Front-End, Back-End, Mobile, DevOps, and AI/ML developers.
- Turing remote developers enjoy higher pay than local standards in most countries, a healthy work-life balance, a strong sense of community, and rapid career growth.

Turing is backed by well-known investors like WestBridge Capital, Foundation Capital, Facebook’s first CTO (Adam D’Angelo), executives from Google, Facebook, Amazon, Twitter, and Founders Fund (investors in Facebook, Tesla, Asana, etc.), among others. The company is led by serial AI entrepreneurs Jonathan Siddharth and Vijay Krishnan, whose previous firm leveraged remote talent and was successfully acquired.

The company was founded in 2018 and is headquartered in Palo Alto, California.

[nextDevSchoolLab]

Hello everyone, Jose here!! What do you think we start a new video series solving coding challenges and giving you practical tips on how to ace them? Like this video and this comment if you want it!

[mokshnigamsatsangi]

PLEASE DO SHARE THE NEXT VIDEO BECAUSE THIS MOCK TEST WAS VERY HELPFUL AND I'D LIKE TO SEE THE NEXT PART TOO. Thankyou !

[onemindawaken]

Very well executed i learned some new tricks as well, my doubt though looking at the solution it might fail at some point bases on the constraints i think there hasn't been any provision for the first one in the solution, when the string is more than 100 there should be an edge case to return back from the operation. Correct me if am wrong please. Also i completed Turing test it took me about 6 months to complete an pass about 8 tests including the coding challenge and i did speak to someone from Turing as well as well but almost three months no match message for me. I pray i get matched. All the best

[raphaelamponsah]

I would like to see the React Js challenge

[lusvd]

one liner for problem2:

from collections import Counter
import string

max(Counter([l for l in s if l in string.ascii_letters]).items(), key=lambda e: e[1])[1]

[kinax]

In c#
var test = str.Where(x => !int.TryParse(x.ToString(), out var num))
.GroupBy(x => x).ToDictionary(x => x.Key, b => b.Count()).MaxBy(x => x.Value).Key.ToString();

same idea you can do in js.

[peterkulik]

lol, in python:
alpha_dict = {c: s.count(c) for c in {c for c in s if c.isalpha()}}
return max(alpha_dict, key=alpha_dict.get)

Honestly I hate this kind of interviews/work. It is for micromanagement fans and begginers only.
This is not a real situation.
If a programmer get time to work without talking and camera, he/she delivers much better solution.

[mehammedbrhanabdelkadr]

this a good thing, that sharing how real technical interviews and live coding challenges look like.
happy if you do this for the PHP Laravel techstack too

[ahmeterdonmez]

function getMax (s) {
let max = 0,
maxChar = ''";
s= s.replaceAll(/\d+/g, "") //Move all digits
//After split sentence will be an array. For string problems mainly convert it to an array.
s.split(''").forEach(function (char) {
if (s.split(char).length > max) {
max = s.split(char).length;
maxChar = char;
}
});
return maxChar;
};

Idea is we split the sentence for each char. which char is included more means array will be splitted more, so length will be more ;) No need for loop inside another for loop bla bla...

[abdel-rahmanmostafa]

The solution of the first problem in JavaScript

const solution = (arr, target) => {
return arr.filter(el => el >= target).length;
}

[allamtajusarof]

love it!!! please upload the next episodes. it's lit

[AmOfGod]

I want to see the react JS challenge. Jose, You are awesome.

[abdulrafayakber]

Using map here would improve the time complexity to O(n)

[tmstechschool]

Thank you for sharing the experience, but I went to know that whether the real algorithm interview will be with interviewer or not, thank you.

[LuisRojasSalazarCR]

I want to see the react JS challenge. Great videos!

[ismailajallow]

Can't wait for the react js challenge

[Rafael]

I want to see the react JS challenge. João is rock.

[sohelrana]

In python

def
unique_letter = {}
for letter in letters:
if not letter.isalpha(): continue
if letter not in unique_letter:
unique_letter[letter]=1
else:

max_key = max(unique_letter, key=unique_letter.get)
return max_key

[MrChicano]

I would like to see the react js challenge !!!!

[weramenamenethan]

Waiting for the React Video. Please make it available asap.