You have an array randomly filled with red, blue and green items. How do you order this list so the red items are at the beginning, followed by the blue ones, followed by the green ones? The algorithm should be in-place (no extra storage, or only constant extra storage) and the algorithm should only walk threw the array once (every position can only be read once).
Given only a pointer to an arbitrary node in a singly-linked list, how would you delete that node? Are there any cases where this is impossible?
inorder traverse of a tree without.recursive
What is your age
write a logic to print * pattern square matrix with diagonal elements if n=5 print * * * * * * * * * * * * * * * * * * * * * i wrote the code with 5 loops but they asked me to write in 2 loops....!
reverse the words of a string
write scpy function
On the order of execution of Java code blocks when a class extends another class
one web form for coding
Write a function to print the first letter of every word in a string.
Viewing 1451 - 1460 interview questions