BlackRockSoftware EngineerSoftware EngineerQuestion #25
Solve the intersection of two linked lists from scratch, including implementing the linked list data structure. Start with a brute-force approach and optimize it. Also, explain the difference between arrays and linked lists.
Unlock the Full Solution
Enter your email to get the detailed step-by-step solution to this BlackRock interview question, plus access to free interview prep resources.
We'll also send you a free HFT mock interview video.
More BlackRock Software Engineer Questions
Write an algorithm that sorts a hashmap.Given a string, determine if it is a palindrome, ignoring any characters that are not alphabetic.1) Reverse a number: Given an integer input, output its digits in reverse order. For example, input: 9966, output: 6699.
2) Word count in a string: Given a string, return the count of each unique word. For example, input: 'The lovely lady is looking lovely as all lady look lovely' output: The: 1, lovely: 3, lady: 2, is: 1, looking: 1, as: 1, all: 1, look: 1.
3) Swap two numbers without using a temporary variable: Given two numbers, swap their values without using a third variable. For example, input: a = 10, b = 20. Output: a = 20, b = 10.Given a singly linked list, find and return the value of the middle node.1) Find the nth node from the end of a linked list. 2) Find the second largest number in an array.
Get All 104+ BlackRock Questions with Solutions
Plus 16+ hours of video lectures, resume tailoring, and 1:1 mentorship from quants.
Schedule a Call