↳

This was one of the questions asked in my interview. You need to scope the situation and check if he is using Static IP or DHCP. If DHCP, do you have a valid lease. Try checking if DNS name resolution is working. My interview took it towards DNS. Pretty simple question. Less

↳

How are you supposed to get to joinme.com if the user can not get on the internet? Less

↳

Dont you have to be logged in as root to run the runuser command? That would mean you would have to su to root from your user account. Less

↳

su - user -c 'command'

↳

One of my greatest strength is my work ethic. When I'm committed to a deadline I do whatever it takes to deliver. While my greatest weakness is that sometimes I will be too honest to my coworkers and my team members when I provide feedback from work. I'm naturally very straightforward, but I have learned that there are times on the job when more diplomacy is required. Less

↳

Maintenance manager

↳

They said the solution should have to sorted the integer array, put two pointers at the end and front compare the sum of a and b, if it was more than 10 then bring the last pointer forward until end of array ... They best solution was (On), and I gave them( lgn)... The other solution was to build a dictionary with pairs and each time adding new element check to see if it already exited ... #include #include #include static std::map findPairsOfSum(int array[], int sum){ std::map myPair; int len = sizeof(array); if (array == NULL) return myPair; for (int i=0; i pairs; int myArray[] = {0,10,3,7,3,5,7,3}; pairs = findPairsOfSum(myArray,10); // printing map std::map :: iterator it; for (it = pairs.begin(); it != pairs.end(); ++it){ std::coutfirstsecond myPairs(int [] myArr, int sumUp){ Dictionary returnPair = new Dictionary (); int len = myArr.Length; Console.WriteLine("Array Size -> "+len); for (int i=0;i myDictionary = myPairs(myArray,10); foreach (var item in myDictionary) { Console.WriteLine("key {0} and value {0}",item.Key,item.Value); } } } } Less

↳

#include #include #include static std::map findPairsOfSum(int array[], int sum){ std::map myPair; int len = sizeof(array); if (array == NULL) return myPair; for (int i=0; i pairs; int myArray[] = {0,10,3,7,3,5,7,3}; pairs = findPairsOfSum(myArray,10); // printing map std::map :: iterator it; for (it = pairs.begin(); it != pairs.end(); ++it){ std::coutfirstsecond <<'\n'; } return 0; } Less

↳

I was a bit rattled and could not think clearly and did not expect to be grilled from a recruiter within the first 2 minutes of the conversation, so I blew it about giving him the information which I knew but mostly dribbled a response. Less

↳

It happens to virtually everyone. Just take a deep breath. If possible, write down the question and answers. Then explain it from the top of your head using the answers as reference. FSMO Roles: Infrastructure master, RID master, PDC Emulator master. RAID(0,1,5,10). 0 is mirroring, requires minimum of 2 disks; 1-striping(2 disk), 5-striping with parity bit(3 disk minimum). 10-Mirroring with striping(I think this is 3 not sure though). Configuring RAID is easy using dynamic volume in disk management on windows OS; or using mdadm in Linux OS. Security change replicated throughout domain depends on how fast the link is( with 10GE Ethernet, it is incredibly fast). DHCP allows dynamic assignment of IP addresses to computers in an Enterprise. Remember DORA when explaining DHCP. Less

↳

first I will try to understand the backgound information of the problem, essentially why we need to solve this problem and futher understand what is critical for answering this problem Less

↳

This is an interesting read: bit.ly/faang100

↳

Its compress air for intec valve and air prihiting

↳

using a left join and where blacklist.user is null

↳

Very open ended question, I think they're mostly interested to see your approach. You're not told/constrained to anything else other than this, so be very specific about the tests you'd perform. Less