Write an efficient algorithm for the following assumptions: N is an integer within the range [1..100,000]; each element of array A is an integer within the range [−1,000,000..1,000,000].

public static int permCheck( int A[]){ Set bucket = new HashSet (); int max = 0; int sum=0; for ( int counter=0; counter if (max if (bucket.add(A[counter])){ sum=sum+A[counter]; } else { return 0; } } System.out.println(max+ "->" +sum); int expectedSum = (max*(max+1))/2; if (expectedSum==sum) return 1; return 0; }

Answer

C# programming question

Olakunle Folorunsho

4.1k

Write an efficient algorithm for the following assumptions:

N is an integer within the range [1..100,000];
each element of array A is an integer within the range [−1,000,000..1,000,000].

Answers (1)

Next Recommended Forum

i want marquee scroll for gridview columns

draw a segmented cercle using c# and GDI+

Leaderboard

View all

Netaji Junghari

+79

George

Lokendra Singh

-1

View all

Yesterday's leader

Netaji Junghari

Bangalore (India)

897

103.9k

852

Member of the month

Shafaet Hossain

C#, .NET, ASP.NET, Blazor

Dhaka (Bangladesh)

711

9.7k

1.3k

Speaker of the month

Shubhankar Banerjee

Blockchain, Solidity, Polygon, C#, NodeJS, HTML, C Language, C++, JavaScript, CSS, ReactJS, MySQL

Kanpur (India)

156

117.7k

11.8k

500

Upcoming events

View all

Suggested for you

View all

Ashish Bhatnagar

Anuradha Rani

Ashish Makhija

Pranshu Singhal

Vikas Gupta

Forum Statistics

Please welcome our newest member Gleb .
3,078,373 users have contributed to 147,418 threads and 483,404
In the past 24 hours, we have 4 new threads, 21 new posts, and 68 new users.
In last week, the most popular thread is 'Get 24 months rollover value from database'.