Leetcode 75 problem review
For each problem on the list, I want to make sure they in my dagzet database <</leetcode>>, and that solutions are submitted to LC.task id: LC75-review
2024-11-27 10:21: 1768: Merge strings alternately #LC75-review #timelog:00:10:54
2024-11-27 10:21: 1768 study #LC75-review #timelog:00:08:11
2024-11-27 10:43: 1071: greatest common diviser of strings #LC75-review #timelog:00:22:34
2024-11-28 10:33: 1071 Review #LC75-review #timelog:00:32:56
2024-11-28 20:41: 1431: kids with greatest number of candies #LC75-review #timelog:00:04:23
I feel like I'm missing something with this one.
2024-11-28 20:46: 1431 study #LC75-review #timelog:00:02:00
2024-11-28 20:50: 605 can place flowers #LC75-review #timelog:00:32:00
I don't like what I've done, but it works.
2024-11-28 21:23: 605 research #LC75-review #timelog:00:06:44
2024-11-28 21:32: 345 reverse vowels of a string #LC75-review #timelog:00:04:29
2024-11-28 21:37: 345 research #LC75-review #timelog:00:03:45
2024-12-01 19:18: 151: reverse words in string #LC75-review #timelog:00:15:00
2024-12-02 10:16: 151: 151 reverse words in string #LC75-review #timelog:00:08:00
2024-12-02 10:24: 334: 334 Increasing triplet subsequence #LC75-review #timelog:00:29:00
2024-12-02 10:52: 443: 443 String Compression #LC75-review #timelog:01:00:00
2024-12-02 11:52: 282: 282 Move zeroes #LC75-review #timelog:00:18:00
2024-12-02 12:12: 392: 392 Is subsequence #LC75-review #timelog:00:08:00
2024-12-04 21:19: 1679: Max number of K-sum pairs #LC75-review #timelog:00:10:34
2024-12-04 21:32: 643: maximum average subarray 1 #LC75-review #timelog:00:24:18
2024-12-05 17:52: LC 1456: maximum number of vowels in a substring of given length #LC75-review #timelog:00:17:27
2024-12-05 18:11: LC 1004: maximum consecutive ones #LC75-review #timelog:01:24:12
2024-12-05 19:36: LC 1004: Ouchie I keep falling into edge cases #LC75-review
Time to pull out.
2024-12-05 20:20: 1004 a little bit more struggle. #LC75-review #timelog:00:31:18
2024-12-06 08:30: One more swing #LC75-review #timelog:00:05:00
2024-12-06 08:35: 1004 review and editorial #LC75-review #timelog:00:13:00
2024-12-06 08:49: 1493 Longest Subarray of 1s after deleting one element #LC75-review #timelog:00:15:00
2024-12-06 09:06: 1732 Find The Highest Altitude #LC75-review #timelog:00:09:00
2024-12-06 09:16: 724 Find the pivot index #LC75-review #timelog:00:18:00
2024-12-06 09:59: 2215 Find the difference between two arrays #LC75-review #timelog:00:25:00
2024-12-06 10:27: 1207 Unique number of occurrences #LC75-review #timelog:00:10:00
2024-12-06 10:38: 1657 Determine if Two Strings are Close #LC75-review #timelog:00:14:00
2024-12-06 10:53: 2352 Equal row and column pairs #LC75-review #timelog:00:38:00
Edge case: my brute force doesn't account that the GCD also needs to divide into the smaller string. Will need to rethink.
Okay, I added some extra code in there and now it seems to work. The code is sloppy and should be refined.