Given an array all of whose elements are positive numbers, find the maximum sum of a subsequence with the constraint that no 2 numbers in the sequence should be adjacent in the array. So 3 2 7 10 should return 13 (sum of 3 and 10) or 3 2 5 10 7 should return 15 (sum of 3, 5 and 7)
No Answer is Posted For this Question
Be the First to Post Answer
Given an array of size n+1 which contains all the numbers from 1 to n.Find the number which is repeated in O(n) time.How do you proceed with the same with floating numbers from 0 to 1 instead of 1 to n?
iam confused among testing ,.net and java. can anybody help me.
How do you initialize a static member of a class with return value of some function?
public static void main(String args[]) describe it
What are the Short cut Keys of Tally ERP?
Is strus threadsafe or not?
4. What is the need of START 0? Instead if can we use any other numeric? If we use what will happen?
Always use scope terminator like End-If with IF, End- Evaluate with Evaluate statement.Can somebody explain me the detail logical explanation?
what is the difference between conversion and interface in bdc?
How to use string functions in QTP?give some examples
Even if all fields are initialized also in a program, I am getting COBOL/400 decimal data error .why is it coming?
what is dot net framework