Day 28 Problem 946: Validate Stack Sequences Time Complexity: O(N) because we are going through the whole popped array Space Complexity: O(N) because we are using a stack and the worst case could be that no elements of pushed array match the sequence of popped array.
Day 27 Problem 32: Longest Valid Parenthesis Time Complexity: O(N) because we are traversing through the whole string once. Space Complexity: O(N) because in the worst case scenario, the stack we are using could just contain all opening brackets.
Day 22 Couldnt solve it within 20 mins. Proceeded to see the most upvoted solution and solved it.
Day 21 Repeated a problem today because i’m packed with studies and assignments
Day 13 couldn’t figure out the loop conditions within the time limit of 20 mins sometimes i really consider if i’m smart enough for this
Day 12 this is the second approach after seeing other’s solution. my first one was brute force but worse. i have to get better at thinking about the problem first and then jumping in to solve. i will do better next time in an easy question under the time constraint of 20 mins.
United States 趨勢
- 1. #FanCashDropPromotion 2,136 posts
- 2. Good Friday 62.6K posts
- 3. #FridayVibes 5,304 posts
- 4. #FursuitFriday 11.5K posts
- 5. Kenyon 1,176 posts
- 6. #FridayFeeling 2,809 posts
- 7. Happy Friyay 1,438 posts
- 8. #LastFourWatched N/A
- 9. Sedition 368K posts
- 10. LINGORM DIOR AT MACAU 644K posts
- 11. RED Friday 3,994 posts
- 12. Ja Rule 1,326 posts
- 13. Maggie 31.5K posts
- 14. Eric Swalwell 4,253 posts
- 15. woozi 44.3K posts
- 16. Mark Kelly 78K posts
- 17. Traitor 136K posts
- 18. ON SALE NOW 12K posts
- 19. Knox 6,473 posts
- 20. Allen 87.3K posts
Something went wrong.
Something went wrong.