title
How to: Work at Google — Example Coding/Engineering Interview

description
Watch our video to see two Google engineers demonstrate a mock interview question. After they code, our engineers highlight best practices for interviewing at Google. Learn more about how we hire at http://goo.gl/xSD7jo, then head over to https://goo.gl/BEKV6Z to find your role. Also check out our companion video, How to Work at Google: Prepare for an Engineering Interview (https://goo.gl/e0i8rX). Subscribe to Life at Google for more videos → https://goo.gl/kqwUZd Follow us! Twitter: https://goo.gl/kdYxFP Facebook: https://goo.gl/hXDzLf LinkedIn: https://goo.gl/skdLCR #LifeAtGoogle

detail
{'title': 'How to: Work at Google — Example Coding/Engineering Interview', 'heatmap': [{'end': 693.964, 'start': 672.905, 'weight': 1}], 'summary': 'Covers pair sum problem solving and efficient approaches with o(n) complexity, c++ examples for finding pairs and complements, implementing complements using unordered set, and efficient processing of large input data with parallel processing. it also provides effective interview techniques emphasizing clarification, thinking out loud, thorough planning, and testing solutions.', 'chapters': [{'end': 392.125, 'segs': [{'end': 68.559, 'src': 'embed', 'start': 34.201, 'weight': 2, 'content': [{'end': 44.385, 'text': 'Okay So, for example, the collection of numbers could be one, two, three, and nine.', 'start': 34.201, 'duration': 10.184}, {'end': 52.188, 'text': "And the sum that I'm looking for is eight.", 'start': 46.906, 'duration': 5.282}, {'end': 63.991, 'text': 'Okay And then another example, just for another set of numbers, could be a one, a two, a four and a four.', 'start': 53.029, 'duration': 10.962}, {'end': 68.559, 'text': "And then again, the sum that I'm looking for is eight.", 'start': 65.354, 'duration': 3.205}], 'summary': 'Two sets of numbers, aiming for a sum of eight: 1, 2, 3, 9 and 1, 2, 4, 4.', 'duration': 34.358, 'max_score': 34.201, 'thumbnail': 'https://coursnap.oss-ap-southeast-1.aliyuncs.com/video-capture/XKu_SEDAykw/pics/XKu_SEDAykw34201.jpg'}, {'end': 168.606, 'src': 'embed', 'start': 94.958, 'weight': 1, 'content': [{'end': 100.923, 'text': 'and this is it yes, okay, yes, you ultimately have to tell me if the if okay.', 'start': 94.958, 'duration': 5.965}, {'end': 102.644, 'text': 'um so, how are these numbers given?', 'start': 100.923, 'duration': 1.721}, {'end': 105.767, 'text': "can i assume that they're like in memory?", 'start': 102.644, 'duration': 3.123}, {'end': 107.849, 'text': 'um an array or something?', 'start': 105.767, 'duration': 2.082}, {'end': 108.949, 'text': "yeah, they're in memory.", 'start': 107.849, 'duration': 1.1}, {'end': 110.11, 'text': 'you can go with an array.', 'start': 108.949, 'duration': 1.161}, {'end': 113.293, 'text': "you can also assume that they're, that they're ordered in sending order.", 'start': 110.11, 'duration': 3.183}, {'end': 119.318, 'text': 'okay, oh, interesting, okay, um so, how about repeating elements?', 'start': 113.293, 'duration': 6.025}, {'end': 126.394, 'text': "can i assume that there will be Like, for instance, here what if I didn't have that 4?", 'start': 119.318, 'duration': 7.076}, {'end': 129.816, 'text': 'Could I use the 4 and the 4 to get that 8?', 'start': 126.394, 'duration': 3.422}, {'end': 135.06, 'text': "You can't repeat the same element at the same index twice, but certainly the same number may appear twice.", 'start': 129.816, 'duration': 5.244}, {'end': 138.883, 'text': 'Okay, so like that would be a yes.', 'start': 135.28, 'duration': 3.603}, {'end': 145.948, 'text': "How about these numbers? Are they integers or are they floating point? You can assume they'll always be integers.", 'start': 139.743, 'duration': 6.205}, {'end': 149.891, 'text': 'Okay, negatives, positives? Negatives could happen.', 'start': 146.108, 'duration': 3.783}, {'end': 152.897, 'text': 'OK, cool.', 'start': 150.555, 'duration': 2.342}, {'end': 158.66, 'text': 'Well, the simplest solution, of course, is just comparing every single possible pair.', 'start': 154.277, 'duration': 4.383}, {'end': 165.204, 'text': 'So I could just have two for loops one scanning the whole thing and then the second one starting from.', 'start': 159.541, 'duration': 5.663}, {'end': 168.606, 'text': "let's say, you have the i loop and then the j loop, starting from i plus 1,", 'start': 165.204, 'duration': 3.402}], 'summary': 'Discussion on processing numbers in memory and handling repeating elements, with a focus on finding a solution for comparing every pair.', 'duration': 73.648, 'max_score': 94.958, 'thumbnail': 'https://coursnap.oss-ap-southeast-1.aliyuncs.com/video-capture/XKu_SEDAykw/pics/XKu_SEDAykw94958.jpg'}, {'end': 398.448, 'src': 'embed', 'start': 367.619, 'weight': 0, 'content': [{'end': 370.259, 'text': 'Yeah, so that would be a way of solving that problem.', 'start': 367.619, 'duration': 2.64}, {'end': 373.42, 'text': 'And how does it make that faster than a binary search?', 'start': 370.459, 'duration': 2.961}, {'end': 379.882, 'text': 'OK, so in the binary search case I was doing log for finding, but I had to repeat that for every element.', 'start': 374.24, 'duration': 5.642}, {'end': 381.522, 'text': 'So that was an n log n solution.', 'start': 379.902, 'duration': 1.62}, {'end': 389.204, 'text': 'In this case, I just need to do that moving, scanning the one time.', 'start': 382.702, 'duration': 6.502}, {'end': 390.584, 'text': "So it's a linear solution.", 'start': 389.244, 'duration': 1.34}, {'end': 391.544, 'text': "So that's faster.", 'start': 390.604, 'duration': 0.94}, {'end': 392.125, 'text': 'Right, right.', 'start': 391.584, 'duration': 0.541}, {'end': 398.448, 'text': 'OK, we could get to coding it, but before we do that, maybe you could explain so.', 'start': 392.225, 'duration': 6.223}], 'summary': 'Proposed a linear solution, faster than the n log n binary search, for the problem by scanning the elements just once.', 'duration': 30.829, 'max_score': 367.619, 'thumbnail': 'https://coursnap.oss-ap-southeast-1.aliyuncs.com/video-capture/XKu_SEDAykw/pics/XKu_SEDAykw367619.jpg'}], 'start': 10.123, 'title': 'Pair sum problem solving', 'summary': 'Discusses finding matching pairs of numbers for a given sum and efficient solving approaches, including a linear solution with o(n) complexity.', 'chapters': [{'end': 145.948, 'start': 10.123, 'title': 'Finding matching pairs for a given sum', 'summary': 'Discusses finding a matching pair of numbers from a given collection that equals a specific sum, providing examples and considerations for handling the numbers.', 'duration': 135.825, 'highlights': ['The chapter discusses finding a matching pair of numbers from a given collection that equals a specific sum.', 'Considerations for handling the numbers are discussed, including their presentation in memory and the possibility of repeating elements.', 'It is clarified that repeating the same element at the same index twice is not allowed, but the same number may appear twice in the collection.']}, {'end': 392.125, 'start': 146.108, 'title': 'Efficient pair sum problem solving', 'summary': 'Discusses different approaches for solving the pair sum problem, including a quadratic solution, a binary search approach, and a more efficient linear solution, with the latter being the fastest with a complexity of o(n).', 'duration': 246.017, 'highlights': ['The most efficient approach involves a linear solution, which scans the array once, making it faster than the quadratic and binary search solutions with a complexity of O(n).', 'The binary search approach, while better than quadratic, still results in an n log n solution due to the need to repeat the search for every element in the array.', 'The initial approach of comparing every possible pair results in a quadratic solution, which is not very efficient and time-consuming.']}], 'duration': 382.002, 'thumbnail': 'https://coursnap.oss-ap-southeast-1.aliyuncs.com/video-capture/XKu_SEDAykw/pics/XKu_SEDAykw10123.jpg', 'highlights': ['The most efficient approach involves a linear solution with O(n) complexity', 'Considerations for handling the numbers are discussed, including their presentation in memory and the possibility of repeating elements', 'The chapter discusses finding a matching pair of numbers from a given collection that equals a specific sum', 'The binary search approach results in an n log n solution due to the need to repeat the search for every element in the array', 'It is clarified that repeating the same element at the same index twice is not allowed, but the same number may appear twice in the collection', 'The initial approach of comparing every possible pair results in a quadratic solution, which is not very efficient and time-consuming']}, {'end': 841.549, 'segs': [{'end': 485.666, 'src': 'embed', 'start': 392.225, 'weight': 1, 'content': [{'end': 398.448, 'text': 'OK, we could get to coding it, but before we do that, maybe you could explain so.', 'start': 392.225, 'duration': 6.223}, {'end': 400.369, 'text': 'you explained it in a non-working example.', 'start': 398.448, 'duration': 1.921}, {'end': 402.71, 'text': 'maybe you could follow through that same process in a working example.', 'start': 400.369, 'duration': 2.341}, {'end': 410.613, 'text': "Okay, yeah, so here I would start with this and that right, so it's 5, it's smaller than 8, so I move this one here.", 'start': 402.73, 'duration': 7.883}, {'end': 415.876, 'text': "so that's 6, that's smaller than 8, so I go here and then that's 8, so that's true, and I return.", 'start': 410.613, 'duration': 5.263}, {'end': 417.797, 'text': 'Excellent Yeah, I think that would work.', 'start': 416.076, 'duration': 1.721}, {'end': 425.3, 'text': "Okay, so what coding language would you prefer to do this in? I prefer C++, if that's okay.", 'start': 417.817, 'duration': 7.483}, {'end': 426.321, 'text': 'C++ works.', 'start': 425.621, 'duration': 0.7}, {'end': 427.382, 'text': 'Okay Go for it.', 'start': 426.461, 'duration': 0.921}, {'end': 428.202, 'text': 'Ah, perfect.', 'start': 427.602, 'duration': 0.6}, {'end': 428.622, 'text': "Let's see.", 'start': 428.222, 'duration': 0.4}, {'end': 430.763, 'text': 'So, okay.', 'start': 429.343, 'duration': 1.42}, {'end': 434.625, 'text': "Now I realize that I haven't figured out what I need to return.", 'start': 432.064, 'duration': 2.561}, {'end': 441.509, 'text': 'So do I want the pair, the indices of the pair, or whether I just found it or not?', 'start': 435.386, 'duration': 6.123}, {'end': 446.429, 'text': "So, for the purposes of the example, we'll go with whether you're a founder or not.", 'start': 442.583, 'duration': 3.846}, {'end': 449.413, 'text': "But let's say you were going to return the pair.", 'start': 446.609, 'duration': 2.804}, {'end': 456.784, 'text': 'How could that become a problem if there was no pair? So I mean, building the pair would be easy, right? So I would just return the pair.', 'start': 449.494, 'duration': 7.29}, {'end': 462.245, 'text': "If I didn't find it, then I would need to return some sort of like boolean.", 'start': 458.2, 'duration': 4.045}, {'end': 467.932, 'text': 'So I guess I could make a data structure that has a boolean that denotes whether the pair is valid or not.', 'start': 462.305, 'duration': 5.627}, {'end': 470.875, 'text': 'Like has it been found? So like a bool found.', 'start': 467.992, 'duration': 2.883}, {'end': 477.561, 'text': 'and then a pair values or something like that.', 'start': 473.698, 'duration': 3.863}, {'end': 481.363, 'text': 'And then this is the thing that you return.', 'start': 478.902, 'duration': 2.461}, {'end': 485.666, 'text': "I mean, it's not very elegant, but it's workable.", 'start': 481.383, 'duration': 4.283}], 'summary': 'Discussed coding process, preferred language c++, and returning pair or boolean', 'duration': 93.441, 'max_score': 392.225, 'thumbnail': 'https://coursnap.oss-ap-southeast-1.aliyuncs.com/video-capture/XKu_SEDAykw/pics/XKu_SEDAykw392225.jpg'}, {'end': 693.964, 'src': 'heatmap', 'start': 672.905, 'weight': 1, 'content': [{'end': 682.311, 'text': 'I mean, if the first thing I do is just sort, of course, then I solve this problem the same way, right? So that would be still an n log n solution.', 'start': 672.905, 'duration': 9.406}, {'end': 683.032, 'text': 'It would.', 'start': 682.511, 'duration': 0.521}, {'end': 686.414, 'text': 'Which would be like the same as the binary search as well.', 'start': 683.352, 'duration': 3.062}, {'end': 687.995, 'text': "But it's too slow for Google.", 'start': 686.754, 'duration': 1.241}, {'end': 690.796, 'text': 'Okay, so you want faster than that, okay.', 'start': 688.295, 'duration': 2.501}, {'end': 693.964, 'text': "Okay, let's see.", 'start': 693.041, 'duration': 0.923}], 'summary': 'Discussing a problem-solving approach with n log n solution and the need for a faster method.', 'duration': 21.059, 'max_score': 672.905, 'thumbnail': 'https://coursnap.oss-ap-southeast-1.aliyuncs.com/video-capture/XKu_SEDAykw/pics/XKu_SEDAykw672905.jpg'}, {'end': 791.4, 'src': 'embed', 'start': 764.71, 'weight': 0, 'content': [{'end': 770.161, 'text': 'And then, when I get here, I ask Is this the complement of anything I have seen in the past?', 'start': 764.71, 'duration': 5.451}, {'end': 776.364, 'text': 'So I can use a data structure that is very good for lookups.', 'start': 771.281, 'duration': 5.083}, {'end': 780.366, 'text': 'So I can do something like a hash table, which has a constant time lookup.', 'start': 776.484, 'duration': 3.882}, {'end': 783.107, 'text': 'Hash table, though.', 'start': 781.807, 'duration': 1.3}, {'end': 784.108, 'text': 'Hash table.', 'start': 783.568, 'duration': 0.54}, {'end': 788.377, 'text': "Do you need a key in this case? I guess I don't need a.", 'start': 785.134, 'duration': 3.243}, {'end': 791.4, 'text': 'I mean, I just need the values, the elements.', 'start': 788.377, 'duration': 3.023}], 'summary': 'Using a hash table for constant time lookup without needing keys.', 'duration': 26.69, 'max_score': 764.71, 'thumbnail': 'https://coursnap.oss-ap-southeast-1.aliyuncs.com/video-capture/XKu_SEDAykw/pics/XKu_SEDAykw764710.jpg'}], 'start': 392.225, 'title': 'C++ examples and pair finding', 'summary': 'Covers explaining a working example in c++ and finding pairs and complements, including decision-making logic, efficient lookups, and avoiding duplicates.', 'chapters': [{'end': 434.625, 'start': 392.225, 'title': 'Explaining a working example in c++', 'summary': 'Discusses the process of explaining a working example in c++, including the comparison process and the decision-making logic, leading to the choice of c++ as the coding language.', 'duration': 42.4, 'highlights': ['The chapter discusses the process of explaining a working example in C++', 'The comparison process and the decision-making logic are explained', 'The choice of C++ as the coding language is confirmed']}, {'end': 841.549, 'start': 435.386, 'title': 'Finding pairs and complements', 'summary': 'Discusses the process of finding pairs and their complements in a collection, covering the options for returning a pair, handling cases with no viable result, and exploring alternative approaches using hash sets for efficient lookups and avoiding duplicate elements.', 'duration': 406.163, 'highlights': ['Using a boolean to denote whether the pair is valid or not', 'Exploring the use of hash sets for efficient lookups', 'Considering the process of returning a pair and handling cases with no viable result']}], 'duration': 449.324, 'thumbnail': 'https://coursnap.oss-ap-southeast-1.aliyuncs.com/video-capture/XKu_SEDAykw/pics/XKu_SEDAykw392225.jpg', 'highlights': ['Exploring the use of hash sets for efficient lookups', 'The comparison process and the decision-making logic are explained', 'The chapter discusses the process of explaining a working example in C++', 'Considering the process of returning a pair and handling cases with no viable result', 'The choice of C++ as the coding language is confirmed', 'Using a boolean to denote whether the pair is valid or not']}, {'end': 1131.473, 'segs': [{'end': 956.831, 'src': 'embed', 'start': 885.93, 'weight': 0, 'content': [{'end': 895.633, 'text': "So in C++, that's an unordered set of integers still.", 'start': 885.93, 'duration': 9.703}, {'end': 897.754, 'text': "And I'm going to call it complements.", 'start': 896.453, 'duration': 1.301}, {'end': 900.394, 'text': "Well, I don't want to write complements all the time.", 'start': 898.574, 'duration': 1.82}, {'end': 903.796, 'text': "So I'm just going to call it comp and say these are the complements.", 'start': 900.414, 'duration': 3.382}, {'end': 910.558, 'text': "I've seen whatever I need to get the target sum.", 'start': 907.337, 'duration': 3.221}, {'end': 915.915, 'text': 'And so as I said, I just need to be building it up little by little.', 'start': 912.494, 'duration': 3.421}, {'end': 923.997, 'text': 'So I do a for my int value for each of the values in the data.', 'start': 915.955, 'duration': 8.042}, {'end': 929.698, 'text': 'I am going to first check and then insert.', 'start': 926.498, 'duration': 3.2}, {'end': 935.56, 'text': 'So if my complement, so I check if I have seen it.', 'start': 930.159, 'duration': 5.401}, {'end': 939.481, 'text': 'First, yes.', 'start': 938.921, 'duration': 0.56}, {'end': 948.247, 'text': "And if I have seen it, so that means if it's not in the end, then that's it.", 'start': 940.563, 'duration': 7.684}, {'end': 950.428, 'text': 'That should be a return true.', 'start': 949.187, 'duration': 1.241}, {'end': 956.831, 'text': 'Because this current element and something that I have seen in the past add up to the sum.', 'start': 951.849, 'duration': 4.982}], 'summary': 'In c++, create an unordered set of integers to find complements and target sum, checking and inserting each value to return true if found.', 'duration': 70.901, 'max_score': 885.93, 'thumbnail': 'https://coursnap.oss-ap-southeast-1.aliyuncs.com/video-capture/XKu_SEDAykw/pics/XKu_SEDAykw885930.jpg'}, {'end': 1049.692, 'src': 'embed', 'start': 1020.748, 'weight': 5, 'content': [{'end': 1022.088, 'text': 'So I have nothing in.', 'start': 1020.748, 'duration': 1.34}, {'end': 1024.769, 'text': 'I check for my first value, which is a one.', 'start': 1023.129, 'duration': 1.64}, {'end': 1027.069, 'text': "I don't find anything, obviously.", 'start': 1025.689, 'duration': 1.38}, {'end': 1032.57, 'text': 'And then I add eight minus one, so I add a seven here.', 'start': 1027.89, 'duration': 4.68}, {'end': 1034.071, 'text': 'Okay, so now I have a seven.', 'start': 1032.59, 'duration': 1.481}, {'end': 1038.113, 'text': 'Then I go for the next one, two.', 'start': 1036.913, 'duration': 1.2}, {'end': 1041.443, 'text': "i look for whether there's a two there.", 'start': 1038.92, 'duration': 2.523}, {'end': 1042.364, 'text': "no, there isn't.", 'start': 1041.443, 'duration': 0.921}, {'end': 1048.109, 'text': 'but if i had had a six here, adding the complement would have find the two, so that would.', 'start': 1042.364, 'duration': 5.745}, {'end': 1048.771, 'text': 'that would be good.', 'start': 1048.109, 'duration': 0.662}, {'end': 1049.692, 'text': 'so that that makes sense.', 'start': 1048.771, 'duration': 0.921}], 'summary': 'Finding and adding specific values, like 7 and 2, in the transcript.', 'duration': 28.944, 'max_score': 1020.748, 'thumbnail': 'https://coursnap.oss-ap-southeast-1.aliyuncs.com/video-capture/XKu_SEDAykw/pics/XKu_SEDAykw1020748.jpg'}, {'end': 1131.473, 'src': 'embed', 'start': 1077.522, 'weight': 3, 'content': [{'end': 1079.683, 'text': 'So it would correctly return false.', 'start': 1077.522, 'duration': 2.161}, {'end': 1081.364, 'text': 'Right, What about the other one?', 'start': 1079.823, 'duration': 1.541}, {'end': 1085.509, 'text': 'the other case i get a four.', 'start': 1082.745, 'duration': 2.764}, {'end': 1091.579, 'text': "i have not seen the complement of four, so i put the four in okay, because it's eight.", 'start': 1085.509, 'duration': 6.07}, {'end': 1101.384, 'text': 'minus four is four, and then, When I get to this one, I have found it, so I correctly return true.', 'start': 1091.579, 'duration': 9.805}, {'end': 1102.884, 'text': 'Value is equal to complement.', 'start': 1101.544, 'duration': 1.34}, {'end': 1104.125, 'text': 'Yeah, yeah.', 'start': 1103.264, 'duration': 0.861}, {'end': 1105.925, 'text': 'So the value would be four.', 'start': 1104.485, 'duration': 1.44}, {'end': 1109.366, 'text': 'I look here in my complements, and I do find it, so I return true.', 'start': 1106.605, 'duration': 2.761}, {'end': 1110.226, 'text': 'OK, so that works.', 'start': 1109.466, 'duration': 0.76}, {'end': 1117.148, 'text': "What happens with an empty? The empty one should never return true because you don't have a pair, so that's fine.", 'start': 1111.207, 'duration': 5.941}, {'end': 1121.27, 'text': "If you have only one thing, you never would compare again, so that's fine.", 'start': 1117.529, 'duration': 3.741}, {'end': 1122.89, 'text': 'So it seems like that works.', 'start': 1121.33, 'duration': 1.56}, {'end': 1125.051, 'text': 'There is one issue.', 'start': 1123.69, 'duration': 1.361}, {'end': 1130.513, 'text': 'This could underflow, so.', 'start': 1126.371, 'duration': 4.142}, {'end': 1131.473, 'text': "Okay, let's not worry about that.", 'start': 1130.513, 'duration': 0.96}], 'summary': 'Function returns true if value is found in complements, else false.', 'duration': 53.951, 'max_score': 1077.522, 'thumbnail': 'https://coursnap.oss-ap-southeast-1.aliyuncs.com/video-capture/XKu_SEDAykw/pics/XKu_SEDAykw1077522.jpg'}], 'start': 843.73, 'title': 'Finding and implementing complements', 'summary': 'Covers the process of finding complements for a target sum using an unordered set in c++, and discusses the implementation of checking for complements in a list of values, aiming to return true or false based on the presence of the complement.', 'chapters': [{'end': 1019.888, 'start': 843.73, 'title': 'Finding complements for target sum', 'summary': 'Covers the process of finding complements for a target sum using an unordered set in c++, with a detailed explanation of the approach and the iteration process through the data, aiming to return true if the current element and a previous element add up to the sum.', 'duration': 176.158, 'highlights': ['The process involves iterating through the data to check and insert complements into an unordered set, aiming to return true if the current element and a previous element add up to the sum.', 'The complements are created using an unordered set in C++, with the aim of efficiently finding the necessary complements to reach the target sum.', 'The chapter outlines the approach of checking and inserting complements into the set, helping to efficiently track the elements needed to reach the target sum.']}, {'end': 1131.473, 'start': 1020.748, 'title': 'Implementation of complement check', 'summary': 'Discusses the process of checking for complements in a list of values, with an emphasis on the correct identification of complements and the return of true or false values based on the presence of the complement. in a sample set of values, the correct identification is demonstrated, resulting in the implementation effectively returning true or false based on the presence of the complement.', 'duration': 110.725, 'highlights': ['The correct identification of complements and the return of true or false values are emphasized in the process of checking for complements in a list of values.', 'Demonstration of the correct identification and return of true or false values based on the presence of the complement is provided using a sample set of values.', 'The process involves adding and comparing values, such as adding eight minus one to get seven and checking for the presence of the corresponding complement in the list.', 'The discussion includes scenarios where the complement is correctly identified and results in the implementation returning true, as well as situations where the complement is not present, leading to the return of false.', 'Attention is drawn to the possibility of underflow in the process, although it is noted that this particular concern is not a focus at the present moment.']}], 'duration': 287.743, 'thumbnail': 'https://coursnap.oss-ap-southeast-1.aliyuncs.com/video-capture/XKu_SEDAykw/pics/XKu_SEDAykw843730.jpg', 'highlights': ['The complements are created using an unordered set in C++, with the aim of efficiently finding the necessary complements to reach the target sum.', 'The process involves iterating through the data to check and insert complements into an unordered set, aiming to return true if the current element and a previous element add up to the sum.', 'The chapter outlines the approach of checking and inserting complements into the set, helping to efficiently track the elements needed to reach the target sum.', 'Demonstration of the correct identification and return of true or false values based on the presence of the complement is provided using a sample set of values.', 'The correct identification of complements and the return of true or false values are emphasized in the process of checking for complements in a list of values.', 'The process involves adding and comparing values, such as adding eight minus one to get seven and checking for the presence of the corresponding complement in the list.', 'The discussion includes scenarios where the complement is correctly identified and results in the implementation returning true, as well as situations where the complement is not present, leading to the return of false.', 'Attention is drawn to the possibility of underflow in the process, although it is noted that this particular concern is not a focus at the present moment.']}, {'end': 1431.495, 'segs': [{'end': 1165.027, 'src': 'embed', 'start': 1131.493, 'weight': 0, 'content': [{'end': 1134.274, 'text': 'So I think this is the right solution.', 'start': 1131.493, 'duration': 2.781}, {'end': 1140.816, 'text': "So it's linear, because I am doing constant amount of work.", 'start': 1136.475, 'duration': 4.341}, {'end': 1146.519, 'text': 'the lookup is constant, adding is constant for an ordered set and I do it for all of the values in the input.', 'start': 1140.816, 'duration': 5.703}, {'end': 1147.159, 'text': "so that's linear.", 'start': 1146.519, 'duration': 0.64}, {'end': 1155.442, 'text': 'And the memory is, I guess, linear as well, because the worst case scenario, I have added all of them to the set.', 'start': 1149.22, 'duration': 6.222}, {'end': 1165.027, 'text': "Would you do anything differently here if there were 10 million imagers in this collection? OK, so let's see.", 'start': 1156.377, 'duration': 8.65}], 'summary': 'Proposed solution is linear in time complexity and memory, suitable for large collections.', 'duration': 33.534, 'max_score': 1131.493, 'thumbnail': 'https://coursnap.oss-ap-southeast-1.aliyuncs.com/video-capture/XKu_SEDAykw/pics/XKu_SEDAykw1131493.jpg'}, {'end': 1250.092, 'src': 'embed', 'start': 1192.845, 'weight': 1, 'content': [{'end': 1199.009, 'text': "my whole input doesn't fit in memory, then I can just sort of process it in chunks right?", 'start': 1192.845, 'duration': 6.164}, {'end': 1202.471, 'text': 'I chunk it and I just put it in a set and I accumulate it in a set.', 'start': 1199.669, 'duration': 2.802}, {'end': 1207.214, 'text': "If we can do it in parallel, then it's kind of the same thing, right?", 'start': 1204.072, 'duration': 3.142}, {'end': 1220.126, 'text': 'So now you have multiple computers, each one processing each bit of it of the input, each one producing a set of compliments that this bit has seen,', 'start': 1207.254, 'duration': 12.872}, {'end': 1222.65, 'text': 'and we just sort of merge them.', 'start': 1220.126, 'duration': 2.524}, {'end': 1224.793, 'text': 'I think we have enough computers, Billy.', 'start': 1222.87, 'duration': 1.923}, {'end': 1235.745, 'text': "Yeah, so the merging would be a bit tricky because we want to make sure that, again, we don't sort of look for the thing that we have put in.", 'start': 1226.041, 'duration': 9.704}, {'end': 1247.511, 'text': 'So I guess, as long as each individual computer is testing this in the right order, when we merge them now we can say oh well,', 'start': 1235.825, 'duration': 11.686}, {'end': 1250.092, 'text': 'those two are correctly.', 'start': 1248.351, 'duration': 1.741}], 'summary': 'Process input in chunks, merge sets from multiple computers for efficient processing.', 'duration': 57.247, 'max_score': 1192.845, 'thumbnail': 'https://coursnap.oss-ap-southeast-1.aliyuncs.com/video-capture/XKu_SEDAykw/pics/XKu_SEDAykw1192845.jpg'}, {'end': 1333.269, 'src': 'embed', 'start': 1290.55, 'weight': 6, 'content': [{'end': 1292.171, 'text': 'you can write it down verbatim if needs be.', 'start': 1290.55, 'duration': 1.621}, {'end': 1295.253, 'text': 'whatever you need to do to get a complete understanding of the question.', 'start': 1292.171, 'duration': 3.082}, {'end': 1296.354, 'text': "that's being asked.", 'start': 1295.253, 'duration': 1.101}, {'end': 1302.018, 'text': 'And I think some of his clarification questions were could they be negative numbers or floating point numbers??', 'start': 1296.414, 'duration': 5.604}, {'end': 1305.38, 'text': 'And the answer to that really does affect the outcome of this code.', 'start': 1302.518, 'duration': 2.862}, {'end': 1307.041, 'text': 'so it was really great that he asked that question.', 'start': 1305.38, 'duration': 1.661}, {'end': 1316.346, 'text': 'Another thing that he did is while he was going through his solution, even before he started writing code down, he thought out loud constantly.', 'start': 1307.734, 'duration': 8.612}, {'end': 1320.391, 'text': 'Constantly thinking out loud is probably the best thing you can do in the interview,', 'start': 1317.047, 'duration': 3.344}, {'end': 1333.269, 'text': 'because it gives the interviewee the opportunity to see your thought process and use that to possibly course correct you more towards the question that they were asking,', 'start': 1320.391, 'duration': 12.878}], 'summary': "Interviewee clarified inputs and thought out loud, aiding interviewer's understanding and course correction.", 'duration': 42.719, 'max_score': 1290.55, 'thumbnail': 'https://coursnap.oss-ap-southeast-1.aliyuncs.com/video-capture/XKu_SEDAykw/pics/XKu_SEDAykw1290550.jpg'}, {'end': 1406.716, 'src': 'embed', 'start': 1364.749, 'weight': 4, 'content': [{'end': 1370.652, 'text': "The first thing, the thing at the top of his mind, wasn't the best solution and it's not gonna be the best solution for anybody.", 'start': 1364.749, 'duration': 5.903}, {'end': 1380.479, 'text': 'So think through what you wanna do, and then you might get challenged by the interviewer to think better, faster, quicker, more efficiently.', 'start': 1371.252, 'duration': 9.227}, {'end': 1386.026, 'text': "think through that solution and then ultimately, when you both feel like you're at a spot where you can code it,", 'start': 1380.479, 'duration': 5.547}, {'end': 1388.57, 'text': 'then you can start coding it down on the screen or on paper.', 'start': 1386.026, 'duration': 2.544}, {'end': 1391.054, 'text': "So that's another great thing to do.", 'start': 1389.311, 'duration': 1.743}, {'end': 1396.472, 'text': 'Another thing that he did really well that I would encourage everyone to do is to test it.', 'start': 1391.87, 'duration': 4.602}, {'end': 1397.452, 'text': 'Test it in real time.', 'start': 1396.492, 'duration': 0.96}, {'end': 1399.313, 'text': 'So I gave him two example sets here.', 'start': 1397.533, 'duration': 1.78}, {'end': 1402.515, 'text': 'He had something that he could test with.', 'start': 1399.934, 'duration': 2.581}, {'end': 1405.136, 'text': "If your interviewer doesn't give you an example, please make one up.", 'start': 1402.655, 'duration': 2.481}, {'end': 1406.716, 'text': 'Test your solution.', 'start': 1405.576, 'duration': 1.14}], 'summary': 'Prepare, think through, and test solutions for coding interviews to succeed.', 'duration': 41.967, 'max_score': 1364.749, 'thumbnail': 'https://coursnap.oss-ap-southeast-1.aliyuncs.com/video-capture/XKu_SEDAykw/pics/XKu_SEDAykw1364749.jpg'}], 'start': 1131.493, 'title': 'Efficient processing of large input data and effective interview techniques', 'summary': 'Covers an efficient linear solution for processing large input data and a parallel processing approach for scenarios where the input may not fit in memory. it also discusses effective interview techniques, emphasizing clarification, thinking out loud, thorough planning, and testing solutions, with practical advice and examples for candidates.', 'chapters': [{'end': 1270.684, 'start': 1131.493, 'title': 'Efficient processing of large input data', 'summary': 'Discusses an efficient linear solution for processing a large input data set, considering scenarios where the input may not fit in memory and proposing a parallel processing approach to handle large amounts of data.', 'duration': 139.191, 'highlights': ['The proposed solution is linear as it involves a constant amount of work for lookups and additions for an ordered set, making it efficient for processing all input values.', 'In scenarios where the input data set may not fit in memory, the chapter suggests chunking the data and processing it in parallel across multiple computers, with each producing a set of complements that are then merged to avoid duplicate entries.', 'The merging process in the parallel processing approach requires careful reconciliation of values to ensure the correct order and avoid duplicates, making it a crucial consideration for efficient data processing.', 'In cases where the input data set is too large to fit in memory, the chapter proposes a parallel processing approach where multiple computers process different parts of the input and produce sets of complements that are merged to efficiently handle large data volumes.']}, {'end': 1431.495, 'start': 1270.684, 'title': 'Effective interview techniques', 'summary': 'Discusses the effective interview techniques, emphasizing the importance of asking for clarification, thinking out loud, thorough planning, and testing solutions, with examples and practical advice for candidates.', 'duration': 160.811, 'highlights': ["Candidates should ask for clarification if they don't fully understand the question, as it can significantly impact the outcome of the code.", "Constantly thinking out loud during an interview is crucial, as it showcases the candidate's thought process and helps in working through the problem with the interviewer.", 'Thoroughly planning the solution before writing code and considering multiple iterations leads to a more efficient and effective approach.', "Testing the solution in real-time and considering edge cases is essential, as it demonstrates the candidate's thoroughness and problem-solving skills."]}], 'duration': 300.002, 'thumbnail': 'https://coursnap.oss-ap-southeast-1.aliyuncs.com/video-capture/XKu_SEDAykw/pics/XKu_SEDAykw1131493.jpg', 'highlights': ['The proposed solution is linear as it involves a constant amount of work for lookups and additions for an ordered set, making it efficient for processing all input values.', 'In scenarios where the input data set may not fit in memory, the chapter suggests chunking the data and processing it in parallel across multiple computers, with each producing a set of complements that are then merged to avoid duplicate entries.', 'The merging process in the parallel processing approach requires careful reconciliation of values to ensure the correct order and avoid duplicates, making it a crucial consideration for efficient data processing.', 'In cases where the input data set is too large to fit in memory, the chapter proposes a parallel processing approach where multiple computers process different parts of the input and produce sets of complements that are merged to efficiently handle large data volumes.', 'Thoroughly planning the solution before writing code and considering multiple iterations leads to a more efficient and effective approach.', "Testing the solution in real-time and considering edge cases is essential, as it demonstrates the candidate's thoroughness and problem-solving skills.", "Candidates should ask for clarification if they don't fully understand the question, as it can significantly impact the outcome of the code.", "Constantly thinking out loud during an interview is crucial, as it showcases the candidate's thought process and helps in working through the problem with the interviewer."]}], 'highlights': ['The proposed solution is linear with O(n) complexity for efficient processing of all input values', 'The chapter discusses finding a matching pair of numbers from a given collection that equals a specific sum', 'The complements are created using an unordered set in C++ for efficiently finding the necessary complements to reach the target sum', 'Thoroughly planning the solution before writing code and considering multiple iterations leads to a more efficient and effective approach', 'In scenarios where the input data set may not fit in memory, the chapter suggests chunking the data and processing it in parallel across multiple computers']}