Open in app

Sign In

Write

Sign In

Bryan W.
Bryan W.

20 Followers

Home

About

Pinned

Automate Google Form Submissions With Selenium, AWS Lambda & Amazon EventBridge

Recently, I started noticing that I had to fill up and submit Google Forms on a weekly basis. As someone who loves automating mundane tasks, I quickly got to developing a solution. At a high level, I settled on creating a python script. There were two routes that I could…

AWS

4 min read

Automate Google Form Submissions With Selenium, AWS Lambda & Amazon EventBridge
Automate Google Form Submissions With Selenium, AWS Lambda & Amazon EventBridge
AWS

4 min read


Aug 22, 2021

Awesome Circular Progress Showcase— Salesforce LWC

Another Circular Progress? Imagine having a checklist whereby you want to display to users how far they are into that or a list of steps whereby you want to show the progress visually. …

Salesforce

2 min read

Awesome Circular Progress Showcase— Salesforce LWC
Awesome Circular Progress Showcase— Salesforce LWC
Salesforce

2 min read


May 16, 2021

Leetcode[65] Valid Number

A valid number can be split up into these components (in order): A decimal number or an integer. (Optional) An 'e' or 'E', followed by an integer. A decimal number can be split up into these components (in order): (Optional) A sign character (either '+' or '-'). One of the…

Programming

2 min read

Leetcode[65] Valid Number
Leetcode[65] Valid Number
Programming

2 min read


Mar 10, 2021

Leetcode[623] Add One Row to Tree

Given 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 is at depth 1. The adding rule is: given a positive integer depth d, for each NOT null…

Programming

2 min read

Leetcode[623] Add One Row to Tree
Leetcode[623] Add One Row to Tree
Programming

2 min read


Feb 8, 2021

Leetcode[594] Longest Harmonious Sequence

We define a harmonious array as an array where the difference between its maximum value and its minimum value is exactly 1. Given an integer array nums, return the length of its longest harmonious subsequence among all its possible subsequences. A subsequence of array is a sequence that can be…

Programming

1 min read

Leetcode[594] Longest Harmonious Sequence
Leetcode[594] Longest Harmonious Sequence
Programming

1 min read


Feb 3, 2021

Leetcode[859] Buddy Strings

Given 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, return false. Swapping letters is defined as taking two indices i and j (0-indexed) such that i != j and swapping the characters…

Programming

2 min read

Leetcode[859] Buddy Strings
Leetcode[859] Buddy Strings
Programming

2 min read


Feb 3, 2021

Leetcode[141] Linked List Cycle

Given head, the head of a linked list, determine if the linked list has a cycle in it. There is a cycle in a linked list if there is some node in the list that can be reached again by continuously following the next pointer. Internally, pos is used to…

Programming

1 min read

Leetcode[141] Linked List Cycle
Leetcode[141] Linked List Cycle
Programming

1 min read


Feb 2, 2021

Leetcode[669] Trim a Binary Search Tree

Given 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 in [low, high]. Trimming the tree should not change the relative structure of the elements that will remain in the tree (i.e., any…

Programming

1 min read

Leetcode[669] Trim a Binary Search Tree
Leetcode[669] Trim a Binary Search Tree
Programming

1 min read


Feb 1, 2021

Leetcode[191] Number of 1 Bits

Write a function that takes an unsigned integer and returns the number of ‘1’ bits it has (also known as the Hamming weight). Note: Note that in some languages such as Java, there is no unsigned integer type. In this case, the input will be given as a signed integer…

Programming

2 min read

Leetcode[191] Number of 1 Bits
Leetcode[191] Number of 1 Bits
Programming

2 min read


Jan 30, 2021

Leetcode[987] Vertical Order Traversal of a Binary Tree

Today, we will be looking at the following problem listed as hard with an acceptance rate of 38.6% at the time of writing. The problem goes as follows: Given the root of a binary tree, calculate the vertical order traversal of the binary tree. For each node at position (row…

Programming

2 min read

Leetcode[987] Vertical Order Traversal of a Binary Tree
Leetcode[987] Vertical Order Traversal of a Binary Tree
Programming

2 min read

Bryan W.

Bryan W.

20 Followers

I have a passion for coding | Salesforce Developer

Following
  • Anh T. Dang

    Anh T. Dang

  • @SalesforceEng

    @SalesforceEng

See all (13)

Help

Status

Writers

Blog

Careers

Privacy

Terms

About

Text to speech

Teams