this just need to trace the array two time : first time : find the maximum among negative integer's (including 0 ,if present in the array). second time : find the minimum among positive integer's (excluding 0). and just both of these ,you will find the solution.
Given an integer n, write a function that returns count of trailing zeroes in n!. Examples: Input: n = 5 Output: 1 Factorial of 5 is 20 which has one trailing 0. Input: n = 20 Output: 4 Factorial of 20 is 2432902008176640000 which has 4 trailing zeroes. Input: n = 100 Output: 24
Given a string containing only digits, restore it by returning all possible valid IP address combinations. For example: Given "25525511135" , return ["255.255.11.135", "255.255.111.35"] . (Order does not matter)
I want to play a game on a circular table; the rules of which are something like this. (i) I will declare how many people are there initially which is say n. (ii) I will declare the starting position (iiI) I will declare k, which is the person i will keep killing till there is one survival. Eg:: if n =6 and k=3 i will first kill 3rd person then 6th person and so on finally 1st will survive. Now since you are the intelligent among the lot so i want you to come up with a formula which given k and n can help you figuring out a seat for yourself so that you will survive.
this just need to trace the array two time :
ReplyDeletefirst time : find the maximum among negative integer's (including 0 ,if present in the array).
second time : find the minimum among positive integer's (excluding 0).
and just both of these ,you will find the solution.
sum the max and min to find the answer.
ReplyDelete@gaurav in the second parse you said find the minimum among positive integers which is 1 here.so according to your algo it should give -80 and 1.
ReplyDelete