how to merge two linked lists without using temp node
Software Development Engineer In Test Interview Questions
6,448 software development engineer in test interview questions shared by candidates
given a linked list which has two types of pointers, a normal next pointer which points to next element in the list and random pointer which points to random element in the list. Question was to clone this linked list
Code a function in C to get the largest consecutive addition of integer numbers fron an array.
You are in a room by yourself and someone walks into the room, asks you to find the temperature, and leaves. How would you find the temperature in the room without leaving the room?
Write the algorithm for this: If you have a string aaabbc the output should be a3b2c1, for the string aabcc the output should be a2b1c2 and so on. You should not allocate memory for a new string and you can do this only by reading each character once. Ps: if the result is bigger than the original string (like abc -> a1b1c1) just return null or some message that makes that clear.
Medium- easy level coding question. Technical Testing/automation experience related questions
Find the majority element of an array.
Remove all characters of a string from another string. The algorithm should be less than O(m*n) where m & n are lengths of strings and the space used should be less than O(m+n).
Write a function to find the node where two linked lists meet.
Write a function which takes two strings as parameters and returns a string of common characters between the two strings but no duplicates. Use hash table to implement the algorithm.
Viewing 81 - 90 interview questions