PinnedBryan W.Automate Google Form Submissions With Selenium, AWS Lambda & Amazon EventBridgeRecently, I started noticing that I had to fill up and submit Google Forms on a weekly basis. As someone who loves automating mundane…Sep 27, 20211Sep 27, 20211
Bryan W.Awesome Circular Progress Showcase— Salesforce LWCAnother Circular Progress?Aug 22, 2021Aug 22, 2021
Bryan W.Leetcode[65] Valid NumberA valid number can be split up into these components (in order):May 16, 2021May 16, 2021
Bryan W.Leetcode[623] Add One Row to TreeGiven the root of a binary tree, then value v and depth d, you need to add a row of nodes with value v at the given depth d. The root node…Mar 10, 2021Mar 10, 2021
Bryan W.Leetcode[594] Longest Harmonious SequenceWe define a harmonious array as an array where the difference between its maximum value and its minimum value is exactly 1.Feb 8, 2021Feb 8, 2021
Bryan W.Leetcode[859] Buddy StringsGiven two strings A and B of lowercase letters, return true if you can swap two letters in A so the result is equal to B, otherwise…Feb 3, 2021Feb 3, 2021
Bryan W.Leetcode[141] Linked List CycleGiven head, the head of a linked list, determine if the linked list has a cycle in it.Feb 3, 2021Feb 3, 2021
Bryan W.Leetcode[669] Trim a Binary Search TreeGiven the root of a binary search tree and the lowest and highest boundaries as low and high, trim the tree so that all its elements lies…Feb 2, 2021Feb 2, 2021
Bryan W.Leetcode[191] Number of 1 BitsWrite a function that takes an unsigned integer and returns the number of ‘1’ bits it has (also known as the Hamming weight).Feb 1, 2021Feb 1, 2021
Bryan W.Leetcode[987] Vertical Order Traversal of a Binary TreeToday, we will be looking at the following problem listed as hard with an acceptance rate of 38.6% at the time of writing.Jan 30, 2021Jan 30, 2021
![Leetcode[65] Valid Number](https://miro.medium.com/v2/resize:fill:160:106/1*X4V9JRJ0fJutgYszz6cGaQ.png)
![Leetcode[65] Valid Number](https://miro.medium.com/v2/resize:fill:320:214/1*X4V9JRJ0fJutgYszz6cGaQ.png)
![Leetcode[623] Add One Row to Tree](https://miro.medium.com/v2/resize:fill:160:106/1*zSOcTdQNqFkh22a9jPZCmw.png)
![Leetcode[623] Add One Row to Tree](https://miro.medium.com/v2/resize:fill:320:214/1*zSOcTdQNqFkh22a9jPZCmw.png)
