Important Questions | Mixed | 2

Trapping Rain Water. LeetCode. Code Write a program to calculate pow(x,n). GFG Time Complexity : O(logn) int power(int x, unsigned int y) {     int temp;     if( y == 0)         return 1;     temp = power(x, y/2);     if (y%2 == 0)         return temp*temp;     else         return x*temp*temp; } Write an efficient function that tells us whether or not… Continue reading Important Questions | Mixed | 2

UUID

How is UUID unique(version 1 ) There is more than one type of UUID, so "how safe" depends on which type (which the UUID specifications call "version") you are using. Version 1 is the time based plus MAC address UUID. The 128-bits contains 48-bits for the network card's MAC address (which is uniquely assigned by… Continue reading UUID