Ho presentato la mia candidatura tramite un'altra fonte. La procedura ha richiesto 4 settimane. Ho sostenuto un colloquio presso Salesforce (San Francisco, CA)
Colloquio
Overall the interview process was the best I've ever experienced. The initial online assessment was challenging in the volume of questions asked (but the questions themselves were straightforward). After the online assessment I flew out for an onsite interview that consisted of four interviews.
I was extremely impressed with my HR representative. She was extremely prompt in replying to my emails and getting answers to my questions. The offer negotiation went smoothly thanks to her. Although I knew she worked for Salesforce, it felt as though she was fighting for me to get the best offer possible.
Domande di colloquio [4]
Domanda 1
Algorithm question (a classical NP problem) that I was able to solve followed by a distributed system debugging question
System design interview - more of a classical system design interview except they were particularly focused on the database schema rather than the actual system
Ho sostenuto un colloquio presso Salesforce (Bengaluru)
Colloquio
Round 1: DSA in Hackerrank. 80% is cutoff. 2 questions will be given 1 easy and 1 medium to hard. Easy must be solved and for other one atleast 12 out of 15 tests must be passing to get 80% score
Round 2: system design
Domande di colloquio [1]
Domanda 1
Standard leet code questions and hackerrank questions
Diving into the technical round, I was presented with a merging intervals problem that required careful thought on overlapping intervals. The solution needed to be efficient, and I felt comfortable tackling it thanks to my prep. A total stroke of luck hit me when I realized the question was nearly identical to one I worked on at PracHub. After that, I moved through a behavioral interview discussing my previous experiences, and overall, it felt like a solid exchange. I received an offer shortly after and accepted.
Domande di colloquio [1]
Domanda 1
Merge Intervals - given an array of intervals where intervals[i] = [start, end], merge all overlapping intervals and return an array of the non-overlapping intervals that cover all the intervals in the input
Ho sostenuto un colloquio presso Salesforce (Dublino, Dublino)
Colloquio
First they do HR screening , after that one manager interview , manger ask done md level java technical question. then hackerank coding online coding test . After there will 2 hours then two live coding and one discussion about existing code block. After that one system design , testing feature related interview
Domande di colloquio [1]
Domanda 1
I can’t tell details , but mid level leetcode problem