Fragen im Vorstellungsgespräch für Principal Consultant
8187
Fragen aus Vorstellungsgesprächen für „ Principal Consultant“, von Bewerbern geteiltTop-Fragen in Vorstellungsgesprächen
If John Locke from lost was running for president of the island what would be his campaign slogan.
6 Antworten↳
"Don't ever tell us what we can't do. Ever."
↳
Learn how to walk again before we can run!
↳
But John Locke is dead. It's 'Smoky' that's taking his form. Smoky is already the president of the island especially after the death of Jacob. Smoky's slogan is 'tirihihik tirihihik, tirihihik tirihihik, (you know the sound that the smoke monster does). Weniger
Common algorithm question
3 Antworten↳
I solved this problem correctly and explained what I did , also during writing each line I was explaining why I am writing it. But still no next round . Very useless .... I suggest do not spend your energy for this dead old company. Weniger
↳
Could you please share the leetcode difficulty of the problems asked during the interview? Weniger
↳
The key in these questions is to cover the fundamentals, and be ready for the back-and-forth with the interviewer. Might be worth doing a mock interview with one of the Oracle or ex-Oracle Principal Software Engineer experts on Prepfully? They give real-world practice and guidance, which is pretty helpful. prepfully.com/practice-interviews Weniger
Given a large document and a short pattern consisting of a few words (eg. W1 W2 W3), find the shortest string that has all the words in any order (for eg. W2 foo bar dog W1 cat W3 -- is a valid pattern)
3 Antworten↳
This is a classic minimal window problem described in detail here - http://www.leetcode.com/2010/11/finding-minimum-window-in-s-which.html. Weniger
↳
import java.util.*; class Untitled { public static void main(String[] args) { String[] strs = {"a","b","d","e","x","b","z","s","x","c","e","c","d","b"}; String[] pattern = {"b","z","x"}; getMin(strs, pattern); } private static void getMin(String[] strs, String[] pattern){ //initialize the set HashSet set = new HashSet(); for(int i = 0; i map = new HashMap(); for(head = 0; head map, String[] strs, int position){ if (!map.containsKey(strs[position])) return true; if (map.get(strs[position]) <= 1) return false; return true; } } Weniger
↳
Could you please explain this??
What are you interested in working on?
3 Antworten↳
Metal , welding it to make it support things with force is absolutely amazing!!
↳
Cyber Security analyst auditor investigator
↳
Safety, i’m a very conscientious safety person, I have heard of Northrop Grumman many times before and I respect them as a company. Roy is close to my home. Weniger
Code for some rest services where a user can see & buy the applicable games.
3 Antworten↳
If anyone needs the code which I wrote, then comment & I will share the code. As this code will give you basic setup at least, so that you can concentrate to develop your innovative ideas. Weniger
↳
Just don't believe on the positive Glassdoor reviews for a company which has recently started. Weniger
↳
Don't believe on the positive reviews directly, these companies fake such positive feedback to trap the talent & may be at low price. Weniger
Design round: Design an api rate limiter Coding round: simple manipulation of arrays and maps Craft round: Design an ML Labelling system
3 Antworten↳
There will be many documents in a document database. The labelling system must use machine learning to label into different categories. Eg help desk, system document, technical. There will a small train dataset available but not entirely reliable. Weniger
↳
The correct answer would be to use a combination of weak learning methods and gradually incorporate feedback and make it stronger Weniger
↳
APi rate limiter was really simple, just look at uber/ratelimit on git and thats it. Rest was farily easy Weniger
Coding in each round, Firewall, networking questions
3 Antworten↳
LC Medium or Hard.
↳
LC Medium or Hard?
↳
Through questions like this, interviewers are mostly trying to test your skillset (and its relevance to the role) as robustly as possible, so be prepared for multiple offshoots and followups. It could be a useful exercise to do mocks with friends or colleagues in Palo Alto Networks to get a real sense of what the interview is actually like. Alternatively Prepfully has a ton of Palo Alto Networks Principal Software Engineer experts who provide mock interviews for a pretty reasonable amount. prepfully.com/practice-interviews Weniger
analytical- there are 50 floors in a building. You are given two balls which can break at a certain f trheight . Give a solution where you can determine the critical height at which a ball breaks. the solution should be optimised to give the least no. of tries for the worst case scenario(i.e where the ball breaks on the 50th floor only)
3 Antworten↳
first ball --- throw it every floor from the iteration the second balls breaks second ball --- throw it every 3 or 4 or 5 floor ... When the second ball breaks, you know there are only 3 or 4 or 5 floors to check ... O (log n) complexity ... best case O(1) Weniger
↳
i'll go with binary search procedure..since it stands a better chance
↳
think over !!
Standard questions like why you choose the organisation and why you wish to leave your current post etc.
3 Antworten↳
They offered me within 2 weeks after my 2 nd interview.
↳
Wish to seek new avenues to expand my career.
↳
How long did they took to get back to you after the second interview?
TTD with pair programming.
3 Antworten↳
what was the data structure implementation, if you don't mind?
↳
How soon were these interviews scheduled ?
↳
Through questions like this, interviewers are mostly trying to test your skillset (and its relevance to the role) as robustly as possible, so be prepared for multiple offshoots and followups. It could be a useful exercise to do mocks with friends or colleagues in Dell to get a real sense of what the interview is actually like. Alternatively Prepfully has a ton of Dell Principal Software Engineer experts who provide mock interviews for a pretty reasonable amount. prepfully.com/practice-interviews Weniger