Google Coding Interview with an ex-Microsoft Software Engineer -  免费在线视频最佳电影电视节目 -  Viveos.Net

Google Coding Interview with an ex-Microsoft Software Engineer

Share
Embed
  • Loading...
  • Published on:  Saturday, August 24, 2019
  • 👀https://rachitiitr.com - My Personal Portfolio and things I recommend for Coding Interviews.

    Rachit, an ex-Microsoft Software Engineer and Clement, an ex-Google Software Engineer do a Mock Coding Interview.

    Part II: https://www.viveos.net/video/xUHohVsidLA/video.html
    🔥https://algoexpert.io/rachit
    ➡ AlgoExpert: 70 Video Explanations to Interview Problems - Must For Beginners
    💰Use "rachit" as coupon code to get 30% off.




    🔥 System Design Course: Educative - Must for experienced SDEs
    ➡ https://www.educative.io/collection/5668639101419520/5649050225344512?affiliate_id=4549609873473536
    💰First 100 Users can use "Rachit" as coupon code to get 10% off.

    🔥 DailyCodingProblem: Access to Facebook, Google Interview Questions
    ➡ https://dailycodingproblem.com/rachit
    💰Use "rachit" as coupon code to get 10$ off.

    SUBSCRIBE AND HIT BELL ICON TO CHECK MORE OF MY CONTENT
    http://youtube.com/RachitJain?sub_confirmation=1

    Social Profiles -
    👀https://rachitiitr.com
    👀https://www.instagram.com/rachitjain2095
    👀https://twitter.com/rachitiitr
    👀 https://fb.me/AlgorithmsWithRachitJain
    👀https://linkedin.com/in/rachitiitr

    ================
    Important Playlists:
    ================
    🔥 30 Days of Interview Prep ➡ https://www.viveos.net/video/FzCnuFJnjcE/video.html
    🔥 Software Interview Experiences ➡ https://www.viveos.net/video/C6aM_QpXco4/video.html
    🔥 Life Lessons I learnt for Success ➡ https://www.viveos.net/video/IIJ3mobGVOU/video.html


    MyProgrammingBlog
    ===============
    Programming Blog ► http://rachitiitr.blogspot.com
    Github ► https://github.com/rachitiitr/DataStructures-Algorithms

    MyProgrammingProfiles:
    ===================
    CodeForces ► http://www.codeforces.com/profile/rachitjain
    CodeChef ► http://www.codechef.com/users/rachitiitr
  • Source: https://youtu.be/tOD6g7rF7NA
Loading...

Comment

  • Rachit Jain

    Rachit Jain

     4 months ago +165

    Hope this was fun to watch as we simulated a real world Interview over Google Hangouts.
    "Going Greedy does result in minimization but it comes at a cost, and that cost is Wrong Answer".

    Part II and other links are in the description.

  • your dad

    your dad

     yesterday +2

    Google interview in a apple mac by an ex Microsoft guy😂




    Chronology samaj rahe hai ap!

  • Poul Julle

    Poul Julle

     3 days ago

    pi.. bla bla bla... the numbers are random... tf?

  • Poul Julle

    Poul Julle

     3 days ago

    tired of new algo website? ex google, why?

  • Karan paul

    Karan paul

     4 days ago

    i thought he is aman dhatterwal

  • sumit kumar

    sumit kumar

     6 days ago +2

    i just learnt how to write hello world in c and now this video is recommended to me.
    😶😶

  • INtEXPLORE

    INtEXPLORE

     7 days ago

    is this good ???


    string,tem = [],0
    for i in arr:
    if pi.find(i)==tem:
    string.append(i)
    tem = pi.find(i)+len(i)


    return ' '.join(x for x in string)

  • Jordan Moser

    Jordan Moser

     7 days ago +2

    Have no idea what I just watched but it was interesting

  • Bruria Hassidim

    Bruria Hassidim

     7 days ago

    C++ solution using trie, minimumString.
    struct Node
    {
    char ch;
    Node* children[26] = { nullptr };
    bool isWord;
    Node(char c) : ch(c), children(), isWord() {};
    };
    class Trie {
    public:
    Node *root;
    /** Initialize your data structure here. */
    Trie() {
    root = new Node(' ');
    }

    /** Inserts a word into the trie. */
    void insert(string word) {
    Node *t = root;
    for (char i : word)
    {
    if (t->children[i - 97] == nullptr)
    t->children[i - 97] = new Node(i);
    t = t->children[i - 97];
    }
    t->isWord = true;
    }

    /** Returns if the word is in the trie. */
    bool search(string word) {
    Node *t = root;
    for (char i : word)
    {
    if (t->children[i - 97] != nullptr)
    t = t->children[i - 97];
    else return false;
    }
    if (t->isWord)
    return true;
    else return false;
    }

    /** Returns if there is any word in the trie that starts with the given prefix. */
    bool startsWith(string prefix) {
    Node *t = root;
    for (char i : prefix)
    {
    if (t->children[i - 97] != nullptr)
    t = t->children[i - 97];
    else return false;
    }
    return true;
    }

    void minimumString(string s,string curr,vector allWordsByNow, vector> &valid)
    {
    if (s.length() == 0)
    {
    valid.push_back(allWordsByNow);
    }
    else if (s.length() < 0)
    return;
    for (int i = 1; i <=s.length(); i++)
    {
    string currWord = s.substr(0, i);
    if (search(currWord))
    {
    allWordsByNow.push_back(currWord);
    minimumString(s.substr(i),s.substr(0,i),allWordsByNow,valid);
    allWordsByNow.pop_back();
    }
    }
    }
    };


    int main()
    {
    Trie *trie = new Trie();
    string s = "abaabbc";
    vector diction = { "a","abbc","abaa","bc","b","abaab","baab","ab" };
    for (int i = 0; i < diction.size(); i++)
    trie->insert(diction[i]);
    vector allwordsbynow;
    vector> valid;
    trie->minimumString(s,"",allwordsbynow,valid);
    int max = 9999;
    for (vector i : valid)
    if (i.size() < max)
    max = i.size();
    cout << max;
    }

  • Pradip Neupane

    Pradip Neupane

     7 days ago

    C++ seems way too complicated: few lines in python :D


    s = "3141592653589793238462643383279"
    lst = ['314', '49', '9001', '15926535897', '14', '9323', '8462643383279', '14']

    def getPiArray(favArray):
    output = []
    global s
    for i in favArray:
    elLen = len(i)

    divided = s[0:elLen]
    if divided == i:
    output.append(divided)
    s = s[elLen:]

    return output

  • selvaplld

    selvaplld

     14 days ago

    Is this the kind of Interview that happens in Google or Microsoft? I guess no because we don't write code while explaining the algo. It's the work of Pseudocode which is easy to understand either of the sides. Moreover, if my understanding is correct, the question is to find the string which is in the array and put the spaces if those string found in the pi values. In that case, you should have mentioned Boyer-Moore algo to search quickly. Correct me if I am wrong? It will help me to learn further.

  • dennis de vulder

    dennis de vulder

     14 days ago +1

    These type of excercises are so abstract, I want to see someone at work trying to solve a problem that doesn't fit the scope of basic math knowledge. Just because you can remember a math equation and recreate it doesn't show value as a programmer since literally everything you are trying to do has been done 1000s of times and is widely available on the web. Therefor I think the ability to find instead of generate is of more value.

    But hey every programmer wants to re-invent the wheel anyway.

  • Alexandru Lupaescu

    Alexandru Lupaescu

     14 days ago

    Oh my God. India again.

  • chamarakv98 madushanka

    chamarakv98 madushanka

     14 days ago

    This is great great...Just motivated by watching a real programmer's coding. Today I got to know how programmers solving problems and how they are coding and about the steps also. Thank you soo much.lv ya.

  • Andy _

    Andy _

     14 days ago +11

    My blood pressure going high by seeing this video & imagine my future interviews 😥😥

  • stevema2

    stevema2

     14 days ago +2

    "hello...yup i am following" lmao :p

  • ARIHANT JAIN PATNI

    ARIHANT JAIN PATNI

     14 days ago

    Jai jinendra

  • Deepak Sharma

    Deepak Sharma

     21 days ago +1

    I don't know coding but I do know why you both are called "EX" Employees

  • Sriparno Baksi

    Sriparno Baksi

     21 days ago

    Linux Do Interview - Data Structures and Algorithms Learn .....ep JS is dead buffer overflow Apple.........

  • Adam Thomas

    Adam Thomas

     21 days ago

    Ex-Microsoft wearing AirPods 😏