I was having this discussion with my friend who had this question asked to him in the Interview. The Question goes like this. Write a Function which takes in a byte array(2 dimensional) as input along
Salute.. Let\'s see this example: int x,y,s; cin>>x>>y; s=x+y; here we hav开发者_如何学编程e three variables for adding two values..
There are n petrol bunks arranged in circle. Each bunk is separated from the rest by a certain distance. You choose some mode of travel which needs 1litre of petrol to cover 1km distance. You can\'t i
I have created a puzzle which is a derivative of the travelling salesman problem, which I call Trace Perfect.
Specifically I want O(log n) insertion/deletion times and O(1) operation for find_next_higher_element which given an element in the data structure returns the element just greater than it in constant
for example, when I ping mark.appspot.comand john.appspot.com, it returns 开发者_C百科the same IP, but these 2 URLs are different APPs.
I don\'t even know if a solution exists or not. Here is the proble开发者_如何学运维m in detail. You are a program that is accepting an infinitely long stream of characters (for simplicity you can assu
While the below code prints \'Wrong Thursday\',(10-FEB is a Thursday) BEGIN IF to_char(to_date(\'10-FEB-2011\',\'DD-MON-YYYY\'),\'Day\')=\'Thursday\' THEN
I have a list of size n which contains n consecutive members of an arithmetic progression which are not in order. I changed less than half of the elements in this list with some random integer. From t
I am currently working on a project to solve a 15 Puzzle using fitness functions. There are 3 kinds of fitness functions that can be used,