Pagini recente » Atasamentele paginii Profil ibogdan25 | Diferente pentru blog/probleme-de-formula intre reviziile 19 si 18 | Diferente pentru blog/problema-saptamanii-2007-10-30 intre reviziile 3 si 4 | Atasamentele paginii Profil TheShieldRO | Diferente pentru blog/heaps-shortlist intre reviziile 6 si 7
Nu exista diferente intre titluri.
Diferente intre continut:
6. Given a min heap A, give an efficient algorithm that outputs its kth smallest element.
7. Print out the first k numbers of the type 2^i^ * 3^j^.
8. Build a data structure where you can do insert(x) in O(log n), findMedian() in O(1) and deleteMedian() in O(log n).
9. Given A and B sorted arrays of length n, find out the k smallest numbers of the form A[i] + B[i].
9. Given A and B sorted arrays of length n, find out the k smallest numbers of the form A[i] + B[j].
Nu exista diferente intre securitate.
Topicul de forum nu a fost schimbat.
