Solutions to the Kickstart/CodeJam problems in Java
| Id | Title | Solution | Time | Space | Difficulty | Note |
|---|---|---|---|---|---|---|
| 1 | Oversized Pancake Flipper | Java | O(n*n) | O(1) | Medium | Bookmarked, O(n*n) works but how to solve in O(n) ? |
| Id | Title | Solution | Time | Space | Difficulty | Note |
|---|---|---|---|---|---|---|
| 1 | GBus count | Java | O(n*n) | O(1) | Easy | Bookmarked, Only I/O learning |
| 2 | Even Digits | Java | O(maxDigits in a number) | O(1) | Easy | Bookmarked, Just lower and higher number finding; Further opt. - if first odd digit is 9, higher number cannot be ans |
| 3 | Lucky Dip | Java | O(NK) | O(1) | Medium | Bookmarked, Can be improved by using binary search |