Een multiset is een set waar repetities zijn toegestaan (ex: MS1 = (1,1,2,2,2,3,3,4,4,4,4,4,5,7,7,9...) Probleem: schrijf een programma dat twee multisets ontvangt en twee intersecties teruggeeft (element 2 verschijnt drie keer op MS1 en vijf keer op MS2
Given two binary trees T1 and T2. Find if T2 is a sub-tree of T1.
Implement the toLowerCase() method
Make a program that writes a Binary Search Tree to a file. Now create a program that reads those files and recreates a Binary Search Tree.
You are given an array of numbers. You need to print the length of the maximum continuous sequence that you encounter. For example if input is [3,8,10,1,9,6,5,7,2 ], the continuous sequences are{1,2,3} and {5,6,7,8,9,10} the latter is the longest one so the answer becomes 6. O(n) solution was asked for, assuming you have a hash map which supports O(1) insertion and fetching operations
If you have all the numbers from 1 to 1'000,000, except one of them. How would you find out which number is missing?
Assume there is a method provided getNextperson() which gives Person objects which have comparable interface implemented, now read from a file records and sort it and give first 1000 records, write code on the paper
Print out, from small to big, of a sequence intergers, without sorting.
What are Exceptions in Java.
1st round was apti round then 2nd round was they give an question we have to write progamme to solve this one and also wrrite a flow chart for the same programme
Viewing 531 - 540 interview questions