Given a1, a2, .... a(n) integers & M, return true or false if there exist a(x) + a(y) = MOnce you're done, do it using a hash table.

guitarfox

 Profile Answers by guitarfox Questions by guitarfox

• Jun 19th, 2008

a(x) + a(y) = MGiven a1, a2, .... a(n) integers & M, return true or false if there exist a(x) + a(y) = MOnce you're done, do it using a hash table.actually using a hash there is a better solut...

tashageek

 Profile Answers by tashageek Questions by tashageek

• Jun 7th, 2008

Actually using a hash there is a better solution . you inititate the hash with all values from a. and then you go over a again and check if the complementry of a[j] ie M-a[j] is in the hash. this way the complexity is O(n) and not O(M+n)

Answer Question  Select Best Answer

What is recursion? Which data structure is used for recursion

Jitendra Chittoda

• Sep 4th, 2011

Stack data structure is used to maintain the information about the recursive functions.

kbjarnason

 Profile Answers by kbjarnason Questions by kbjarnason

• Jul 2nd, 2010

Recursion occurs when a function, either directly or indirectly, calls itself.  An example might be a factorial function:unsigned fact(unsigned n){   /* 0! is by definition 1; */ &...

Answer Question  Select Best Answer

Describe an algorithm to compute the average of two scores obtained by each of the 100 students

HAkizimfura Yves

• May 27th, 2014

Write an algorithm that will display the sum of 5 integers by using two variables only
NB: do not use loops!

Shikhar Singhal

• Jun 10th, 2013

Algorithm- Let score1[100] and score2[100] be the arrays storing respective marks of the 100 students let float avg[100] store the average of the respective students. for n=0 to 99 avg[n]= (f...

Answer Question  Select Best Answer

A carpenter is paid a contract fee of $2000.00 for 3 days work. He hires 3 workers who work for the 3 days at $75.00 a day: calculate and print the amount of money paid to each worker; the total paid to all workers and the amount the carpenter is left with.

asd

• May 17th, 2017

public class Test4 { public static void main(String[] args) { double contract; String days; int worker; double dailypaid; double Total; double profit; @Suppre...

mssodhi

• May 19th, 2016

$75/day. (3 days * $75) = $225. ($225 * 3 workers) = $675. $2000 - $675 = $1325 left for the carpenter

Answer Question  Select Best Answer

Give an algorithm that calculates the distance between two text strings (only operations you can have are: delete, add, and change, one by one).

rrc_83

 Profile Answers by rrc_83 Questions by rrc_83

• Jun 20th, 2010

In python - # Input is string s1 and string s2# Check which string is bigger (compares ascii value)if s1 > s2:  b, s = s1, s2else :  b, s  = s2, s1# Covert string to listl1, l2 = lis...

yzesong

 Profile Answers by yzesong Questions by yzesong

• Aug 9th, 2009

The distance of two strings, like "car" and "cat", is 1. So all we need to do is, compare two strings one character by one character and get the distance value. The complexity is O(max(m,n)), m, n are the length of each string.

Answer Question  Select Best Answer

When twice a certain number is subtracted from five times itself, the result equals 60. Find the number by using the try and error method. Use both pseudocode and flowchart.

Glenn

• May 8th, 2017

Function getBaseNum(num) {
return num / (5-2);
}
num = 60
60 / (5-2)
60 / 3 = 20

(20 * 5) - (20 * 2)
100 - 40 = 60

Ted

• Oct 17th, 2016

1 Start
2 Input try number X
3 C=5*X - 2*X
4 D=C - 60
5 If D=0, print "you found the number X which make the figure equal 60", go to step 8
6 If D

Answer Question  Select Best Answer

jjtharappel

 Profile Answers by jjtharappel Questions by jjtharappel

• Nov 24th, 2011

The one I posted on Nov23 will not sork. A slight modification. Below is the working code "cobol ACCEPT WS-SYSIN-DATA FROM SYSIN IF WS-SYSIN-NUM IS NUMERIC C...

jjtharappel

 Profile Answers by jjtharappel Questions by jjtharappel

• Nov 23rd, 2011

I = N / 10
J = I * 10
K = N - J
min_num = K

If I > 10
Do while I < 10
N = I
I = N / 10
j = I * 10
K = N - J
if K < min_num
min_num = K
end-if
end-do

Prinf "Minimum number is " min_num
Return

Answer Question  Select Best Answer

How many values can be held by an array with dimensions A(0:n), B(-1:n,1:m), C(-n:0,2)?

Mark Webb

• May 24th, 2018

A: n+1
B: m(n+2)
C: 2(n+1)

sweta sachan

• May 22nd, 2017

Sir how would you calculate it? Please share the solution

Answer Question  Select Best Answer

Write an algorithm that calculates all the elements of rows and columns of a square matrix and calculate the total of primary and secondary diagonal.

Kavya oleti

• Jan 22nd, 2017

If it is a square matrix order n
Primary diagonal
if(i==j)
{
sum+=a[i][j];
}
Secondary diagonal
if(i==(n-1)-j)
{
sum+=a[i][j];
}

hema

• Jan 3rd, 2015

Tested Java code"java package testCode; public class SquareMatrix { public static void main(String[] args) { int [][] squarematrix = { { 1,1,1,10}, { 1,10,-1,2}...

Answer Question  Select Best Answer

Example : 1)m = 3,n = 2 a11 a12 a21 a22a31 a32Output : a11 a21 a12 a31 a22 a322) m = 3, n = 4a11 a12 a13 a14a21 a22 a23 a24a31 a32 a33 a34Output : a11 a21 a12 a31 a22 a13 a32 a23 a14 a33 a24 a34

Amit Verma

• Feb 21st, 2015

A very basic solution and easy to understand

Code
span style="color: #666666;">" "" ";; 
                                r--;
                                c++;
                                
                        }
                }
        }

charlypa

 Profile Answers by charlypa Questions by charlypa

• Jun 19th, 2009

define two varibles initial_x and initial_y define another two varibles x and yint initial_x =  m;int initial_y = n;while (x != m && y! =n){ print (x,y) x--; y++; // Traverse downwar...

Answer Question  Select Best Answer

vivgrn

 Profile Answers by vivgrn Questions by vivgrn

• Oct 6th, 2009

7 =111thusx*7 = (x <<2) + (x<<1) + x

Casul

 Profile Answers by Casul Questions by Casul

• May 22nd, 2008

Operator+ is not a bitwise operation ....

Answer Question  Select Best Answer

How to find the kth largest element in a linked list? Can you do this without using extra memory and also without modifying (sorting) the list?

Anonymous

• Jun 19th, 2017

It does not work when duplicate elements are present.

batman

• Oct 4th, 2011

Not enough information about the data in the linked list. Solution 1. Assuming int & no duplicates & rather small [min,max] interval: Iterate through the list once to find the min&max. Make a bi...

Answer Question  Select Best Answer

Implement an algorithm that takes two strings as input, and returns the intersection of the two, with each letter represented at most once. Speed it up and test it.

kaushurtz

 Profile Answers by kaushurtz Questions by kaushurtz

• Mar 2nd, 2010

Using HashSet as in case of jave will be better than HashMap. We can just iterate over the characters of both the strings and put them in set.

yzesong

 Profile Answers by yzesong Questions by yzesong

• Aug 9th, 2009

I think of an idea to do this by using a hash table. First, loop through first string, creat map<char, int>, we can use ascii value of the char as the value. Only insert the char/int pair when a...

Answer Question  Select Best Answer

loki

• Feb 27th, 2018

Searching means finding whether the element is present in the list or not whereas sorting means Arranging the list in ascending or descending order.

Jeff

• Jun 4th, 2017

Searching mean when you are performing an operation looking for a specific thing that you need...the thing that you are looking for does not alike to any thing so you have to find your exact requireme...

Answer Question  Select Best Answer

You have an array of size '2n' of these, 'n+1' elements are distinct and 1 element is repeated 'n' times. You must find the repeated element and say how many times it has repeated. Your solution must use minimum no. of comparisons. Also, say how many comparisons your solution will make in the worst case?

cullensun

 Profile Answers by cullensun Questions by cullensun

• Sep 23rd, 2013

1st, 2nd, 3rd,......, (n-1)th, (n)th, (n+1)th, (n+2)th, ...... (2n)th Focus: Identify the the repeated element 1. take the 1st element to compare with the rest one by one, worst case: compare wi...

shankar

• Oct 16th, 2012

Since an element is repeated more than half the occurance of the array, for every two didtinct elements discard them from the array. At the end of the loop, the most repeated element will be left.

This is O(n)

Answer Question  Select Best Answer

How will you reverse a singly linked list?

Code2Live

• Jun 9th, 2015

"java reverse(Node root) { Node x = root; if (x != null) { Stack nodes = new Stack(); while(x != null) { nodes.push(x); x = x.next; } ...

Asad

• Jun 7th, 2015

Code
 

Answer Question  Select Best Answer

You are given a matrix. The matrix elements are such that they are sorted both horizontally and vertically. Given an element of the matrix, your job is to obtain its position in an efficient manner.Example: 10 20 30 15 35 98 48 76 110Input: 76Output: 3rd row, 2nd column.

sandy

• Mar 24th, 2013

I assume you can do it in the following way: "python class Coordinate: def __init__(self,x=0,y=0): self.x = x self.y = y def findElement(a,n): if a == Non...

frogInSea

 Profile Answers by frogInSea Questions by frogInSea

• Mar 14th, 2013

I think it can be solved in a two dimensional Binary-Search way

Answer Question  Select Best Answer

joseph

• Aug 27th, 2016

Can also be done using constructor overloading concept (by sending in different number of parameters)

Sushobhit Singh

 Profile Answers by Sushobhit Singh Questions by Sushobhit Singh

• Feb 28th, 2016

I think this is the right answer. :)

Answer Question  Select Best Answer

maneesh

• Aug 8th, 2011

Push the characters onto a stack and then pop every1. Or get the string length and then iterate backwards from the last character.

guest

• Aug 5th, 2011

#This is why Perl Rocks!

Code
#!/usr/bin/perl
"Enter String: 
""$revers 
";
 

Answer Question  Select Best Answer

Read Best Answer

Editorial / Best Answer

Answered by: David Rachutin

• Dec 27th, 2006

---

use the following method:

mark the missing number as M and the duplicated as D

1) compute the sum of regular list of numbers from 1 to N call it RegularSum

2) compute the sum of your array (the one with M and D) call it MySum

now you know that MySum-M+D=RegularSum

this is one equation.

the second one uses multiplication:

3) compute the multiplication of numbers of regular list of numbers from 1 to N call it RegularMultiplication

4) compute the multiplication of numbers of your list  (the one with M and D) call it MyMultiplication

now you know that MyMultiplication=RegularMultiplication*D/M

at this point you have two equations with two parameters, solve and rule!

Gaurav.khurana

 Profile Answers by Gaurav.khurana Questions by Gaurav.khurana

• Apr 25th, 2015

@vandita Just a minor correction i think we should go till n-1 only so the in for loop it should be and should use i+1 since nbrs are starting from 1 and not 0

Code
span style="font-style: italic;">//since 1 is stored at 0th position

bakesh

• Mar 16th, 2015

9

Improve Answer