Software engineer new grad Interview Questions

Did you get to choose which programming language?

I guess, what happened is that I told them my strongest language was Java and they said you can write it in that language if you want. The "improve this piece of code" portion was in python, the loop tracing was in Java I believe, and the printing problem was open ended. But if you have programming experience you should be able to tell what the code does pretty easily, it's definitely not hard. Just know they might reject you regardless of if you do well. Maybe it's just the Covid-19 situation.

Did they ask salary expectations? Do you think you might have been rejected because you asked for too much $? And you say you answered everything correctly you think?

Possible Solution: not necessary the right one. Notes: Will recommend use non recursive version of quick sort since 5GB log file could be considered to generate URL data to 500 MB ball park and worst estimate. That would blow the below solution. Also keeping the file open all the time while reading rather than putting it in buffer, since 5GB is a large file size and that may not hold in the memory provided for the program. Will have to ensure that file remains untouched in those moments. # Program to find the URLS that have been most referenced and used from a log file. import sys # Function that will quicksort the list of tuples that have occurence number as first # element in tuple and the URL as the second element in the list. The list is sorted # from the least referenced to most referenced as done in classical quicksort. # From: www.algolist.net/Algorithms/Sorting/Quicksort def sortDict(impurllist, left, right): i, j = left, right - 1 pivot = impurllist[int((left + right) / 2)] while (i pivot[0]): j = j - 1 if (i len(urllist): for element in reversed(urllist): print(str(element[1]), '\t', str(element[0])) else: j = -1 for i in range(num): print(str(urllist[j][1]), '\t', str(urllist[j][0])) j = j - 1 # Definition of main. def main(): try: int(sys.argv[1]) except ValueError: print('Please input a integer for the number of URLs you want to view.') return # Terminate program execution if the arguments provided are not right. if len(sys.argv) != 3: print('Usage: python3.2 HighURLFinder.py #URLs_you_want Log_file') return else: logdict = readLogFile(sys.argv[2]) if logdict is None: return # Terminate execution since the file read program encountered error. else: impurllist = sortLogDict(logdict) showUrlLast(impurllist, int(sys.argv[1])) # The starting point of the program main()

Quick Sort is O ( n log n ) avg case, so we could do better O (n) Now, onto design : Do the lines have other information other than URL? If so, we need to filter them out using Regular Expressions. Possible O (n) solution: A hashmap with URL's as keys and number of hits as values would yield a O(n) run-time to populate it. Algo: while input from file getURL (or filter out URLs from line) if URL exists in hashmap, increment its count else add URL to hashmap Ofcourse, being a large data set, we might get a ton of random disk seeks due to paging of memory. After profiling, if we really find that to be a problem then we could do something like encode the urls into something smaller that takes less space and hence has a lesser probability of causing paging. I can think of few more solutions but I think this should be sufficient.

I would add a min-heap of size 100 to BetterSolution's answer (in order to get the top 100).

// Assume S1 and S2 are non-null pointers bool hasChar(char *s1, char *s2) { int ret=false; char *tmp; if (*s2 == '\0') return true; tmp = s1; while ((*tmp != '\0') && (*tmp != *s2)) tmp++ if (*tmp == '\0') return false; return hasChar(s1, s2++); }

Traverse string2 and create a map where the characters of string2 are used as keys. Then traverse string1. If the the character in string1 exists in the map, remove the key from the map. At the end if your map has anything in it, string1 did not contain all of the characters.

private static bool isEqual(string s1, string s2) { int[] first = new int[26]; int[] second = new int[26]; for (int i = 0; i 0) return false; } return true; }

Use the power of 2's to get to the answer.

Log base 2 of 15 billion

You should know offhand that 2^10 is 1024, so 2^20 = 1024^2 is approx a million, 2^30 is approx a billion, then you need four more years to get to 16 billion. Remember that you started with 1, not 2, so the answer is 35 years, not 34.

I was not used to this kind of question so I did not complete the task

Just curious, what common Python library is it? And what kind of issue do you have to fix?

Thus, what's the library....

count = 0 while(num) { num &= num-1; count++; } return count;

I thought the question was asking how to convert the integer to binary code and output it.

function getOnes($int) { return substr_count(decbin($int), '1'); }

Can you mention the questions asked in the coding test? Thanks.

Will you tell me about the onsite rounds in more detail .

I was curious, in regard to how long they took to get back to you with an offer after the on-site interview round?