updated

Author: ashwanikumar04

AllQuestions.md

@@ -612,8 +612,8 @@ tree.
 The power set of a set is the set of all its subsets. Write a function that,
 given a set, generates its power set.
 
-For example, given the set {1, 2, 3}, it should return {{}, {1}, {2}, {3}, {1,
-2}, {1, 3}, {2, 3}, {1, 2, 3}}.
+For example, given the set `{1, 2, 3}`, it should return `{{}, {1}, {2}, {3}, {1,
+2}, {1, 3}, {2, 3}, {1, 2, 3}}`.
 
 You may also use a list or array to represent a set.
 

build.gradle

@@ -13,4 +13,6 @@ repositories {
 
 dependencies {
     testImplementation('org.junit.jupiter:junit-jupiter:5.4.2')
+
+
 }

src/main/java/in/ashwanik/dcp/problems/p91_120/p99/Solution.java

@@ -17,11 +17,13 @@ int getLongestConsecutiveSequenceLength(int[] numbers) {
         int max = 0;
         for (int n : numbers) {
             int k = n;
-            int count = 1;
-            while (set.contains(++k)) {
-                count++;
+            if (!set.contains(k - 1)) {
+                int count = 1;
+                while (set.contains(++k)) {
+                    count++;
+                }
+                max = Math.max(max, count);
             }
-            max = Math.max(max, count);
         }
         return max;
     }