leetcode

commit 035a142bec1c976efd6a226dc0fa9e1aa6056e96
parent d274becd0d1f367aeb97244092e06710f554dfa5
Author: AndrewLockVI <andrewlaack1@gmail.com>
Date:   Sat, 29 Jul 2023 22:19:33 -0500

updated

Diffstat:
M
elimination-game/elimination-game.dart
 | 
2
+-

1 file changed, 1 insertion(+), 1 deletion(-)
diff --git a/elimination-game/elimination-game.dart b/elimination-game/elimination-game.dart
@@ -4,7 +4,7 @@
 //The time complexity of this code is O(n^2) where n is the length of the list
 //it is this slow because the a memcopy is required to remove a specific index from a list (O(n) time)
 //This code is too slow for leet code, but it is the intuitive solution to the problem.
-
+//
 class Solution {
   int lastRemaining(int n) {
     List<int> vals = [];