You have 2 linked lists, return a list with the intersection. For example: Input: L1 = { 1,2,5,10} L2 = {9,4,5,10,15} return {5,10}
Software Intern Interview Questions
17,728 software intern interview questions shared by candidates
How to check if a Binary tree is a BST?
Find the maximum depth of a B-tree
Why did you apply to Shopee
Write code to reverse a linked list in C++ or Java
How would you design the RSS functionality for a cellphone if the cellphone is placed behind a firewall.
How would you describe internet to kinder garden children?
1:1 round 2: Given a string find all the palindromes in the string.
1:1 round 3: This was the toughest for me . Given a database of string . And a record of words and replacement pairs , such that if a given word occured in the string it had to be replaced by the replacement pair provided in the record.
Reorder elements of linked list such that no two consecutive elements have the same parity. You have to reorder pointers, not just the values.
Viewing 891 - 900 interview questions