Here is the link.
Friday, January 28, 2022
Thursday, January 27, 2022
Scotia debit card: My mistake | Credit line card | Credit card
Jan. 27, 2022
I chose to use scotia bank debit card instead of credit card to pay my grocery, so that I got charged $7.5 for service fee. I just figured out. The reason I made mistake is that I got credit line credit card, so that I thought that it is my new credit card, but I failed to pay grocery, so that I used a few weeks for my grocery using debit card instead.
Message:Response to your message of January 25, 2022.
Jan. 26, 2022
Dear Jianmin,
Thank you for taking the time to contact Scotiabank. We hope you and your loved
ones are doing well. We appreciate the opportunity to assist you with your
monthly fee inquiry.
Upon a review of your account, our records indicate your account ending in 420
is a Powerchequing and it has a monthly fee of $6.95 per cycle due to the
following benefits:
? 12 self-service or teller-assisted debit transactions per month or statement
cycle.
? Ten free Interac e-transfers
? Monthly fee automatically waived when a minimum daily balance of $3,000 is
maintained for the month or statement period.
Note: If during the cycle, there are more than 12 debit transactions, but the
daily closing balance was maintained, the system will charge an additional fee.
The fee per transactions is $1.25.
Our records indicate in your last cycle (from December 23rd to January 22nd)
you exceeded the 12 debit transactions, you made 18 and for that reason and
additional fee was charged per transaction (6 additional charges * $1.25 :
$7.50).
We kindly advise you to do not exceed the 12 debit transactions. Alternatively,
you can switch to an account that gives you unlimited debit transactions such
as the Preferred Package chequing account in which the monthly fee is $16.95.
This account has a monthly fee due to the following benefits:
- Unlimited debit transactions and e-Transfers
- Fee waived on one non-Scotiabank ABM withdrawal per month in Canada
- No monthly account fee by maintaining a minimum daily closing balance of
$4,000 for the entire month
If you would like to switch the account, please proceed as follows:
Online:
1. From your Accounts page, select Manage My Accounts
2. Select Additional Services
3. Go to Day to Day Banking and select Change your account type
Scotia app:
1. From the app?s Home screen, tap the account you?d like to change
2. Tap Manage
3. Tap Change account type
Alternatively, you can contact the number listed below and one of our
representatives can assist you making the account type switch.
Note: To get more information about the type of chequing account we offer,
please visit the following link:
https://www.scotiabank.com/ca/en/personal/bank-accounts/chequing-accounts.html
Should you have further inquiries, you are welcome to write back or call the
Contact Centre. Our Representatives are available 24 hours per day within North
America at 1-800-472-6842 or from outside North America call collect at (416)
288-3899.
Thank you for choosing Scotiabank. We value your patronage and look forward to
assisting you again in the future.
Sincerely,
Sarid A | Customer care advisor
Scotiabank | P.O. Box 4100, Postal Station ?A? Toronto, Ontario. M5W 1T1
Scotiabank.com
Scotiabank is a business name used by The bank of Nova Scotia
On 1/25/22 2:04 PM, @solinbox.bns wrote:
> January 22, 2022 Service Charge
> MONTHLY FEES
> 7.50
>
>
> I like to get detail about this monthly charge on my checking account. Can
you help me figure out what it is about and how to avoid the service charge?
jianmin chen
>
Microsoft 2022 SDE1 | Algorithm review
Microsoft 2022 SDE186 views
9. Permutations
10. Rotate Image
11. Jump Game
14. Word Search
20. Word Ladder
21. Word Break
23. LRU Cache
24. Min Stack
27. Word Search II
30. Ugly Number
31. Game of Life
41. Shortest Bridge
Go over all algorithms one by one in two hours.
How to prepare for a virtual interview
Jan. 27, 2022
Here is the link.
Microsoft is closely following the Coronavirus Disease (COVID-19) and working on our own response including implementing processes that promote candidate and employee safety. We have shifted all in-person interviews globally to be held virtually until further notice. We will make every effort to provide guidance along the way and minimize any disruptions to ensure a great candidate experience.
Wednesday, January 26, 2022
How to prepare for your Microsoft Interview: Business Functions
Jan. 26, 2022
Here is the link.
Microsoft provides opportunities to empower you to create things that help others and change the world. Understand the Microsoft interview process for Business Functions roles and what to expect to prepare. Come as you are, do what you love. Visit https://www.microsoft.com/university to learn more.
How to prepare for your Microsoft Interview: Program Management
Jan. 26, 2022
Here is the link.
Are you a university student or recent grad preparing for a Program Management interview with Microsoft? Prepare for your interview with tips, tricks, and the inside scoop from program managers Anjay and Grace, and Chelsea, university recruiter. Visit https://aka.ms/StudentInterviewTips for more.
5:31/ 10:35
Key attributes:
- Customer focus
- Adaptability and deal with ambiguity
- Collaboration and communication
- Diversity and inclusion
- Growth mindset
- Drive for results
- Problem solving
- Influencing without authority
I like to watch the video every day at home. Every day I like to cook meals for myself, and I like to enjoy cooking by learning program manager - Microsoft interview video.
Leetcode discuss: 210. Course Schedule II | DFS | Learn from others | Challenging work
Jan. 26, 2022
Here is the link.
C# | DFS algorithm | Study Leetcode discuss C# code | Jan. 26, 2022
Jan. 26, 2022
Introduction
It is so interesting to read C# code with meaningful comments and good variable names. I did learn a few things from studying one of C# discuss post using DFS. What I can learn from 20 minutes to read and also running C# code? I like to write a post first, and then come back to review later.
C# | DFS algorithm | Simple to detect cycle | Style talk
The algorithm can be modelled as a simple directed unweighted graph to solve. There are two approaches, one is to work on nodes with indegree 0 first, and remove edges connected to those nodes. Repeat the process. I called it BFS, and the other one is to apply depth first search algorithm.
Assume that the graph may have cycle, it is challenge to solve the problem using DFS and also detect cycle in the same time. I chose to study one of discuss post instead after I studied DFS solution shared by Leetcode solution shared only for premium users. Here is the post.
Code study | Code review | DFS algorithm base case | Play with test case
Two variables are added to help DFS algorithm, isVisited and isAdded.
I like to learn from a few discuss using C# and see what I can do better this time.
case 2: 4, [[1,0],[2,0],[3,1],[3,2]]
output: [0,2,1,3]
A few things to look into more carefully, write down in the following:
- Only need to find one path. So in DFS, no need to apply backtracking; I like to question this statement in the comment written by the user: https://leetcode.com/bacon/;
- Use private variables, so that function runDepthFirstSearch has less than five arguments. Two are private variables to store courses taken in the order to meet prerequisite requirement.
- Work on test case II in main function, start from course 3 to run DFS, 3 -> 1 -> 0, so how to mark those three nodes using isVisited and isAdded? Think about more carefully in the design stage.
- More on step 3, if first visit is node 3, and then start DFS from node 3, mark isVisited[3] = true, and let the search go through 1 and then go through 0. Node 0 is found and then isAdded[0] = true, reset all isVisited to false; isVisited is helpful to detect cycle.
- More on step 4, isAdded is helpful to terminate DFS search as a base case.
- More on step 3, path A: from 1 -> 0, path B: from 3->1->0, node 1 will be visited more than once, so isVisited has to be reset all the time. For example, if path A is checked first, isVisited[1] should be false again, then path B can be examined properly.
Improvements:
- DFS algorithm - make base case the first statement - clear and not hidden in the if the statement, and also save cost to avoid visit removed edges in the graph.
- Move isVisited variable inside for loop.
Challenge to be expert on algorithm | Take risk | Do my best
It takes time for me to ask questions on reviewing C# code written by others. I do think that this DFS approach is very good example for me to learn from my own experience as an excellent reviewer with patience to work on a simple test case.
The following code passes online judge.
using System;
using System.Collections.Generic;
using System.Diagnostics;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
namespace _210_course_schedule_2
{
class Program
{
static void Main(string[] args)
{
// case 2: 4, [[1,0],[2,0],[3,1],[3,2]]
// output: [0,2,1,3]
var case2 = new int[4][];
case2[0] = new int[] { 1, 0 };
case2[1] = new int[] { 2, 0 };
case2[2] = new int[] { 3, 1 };
case2[3] = new int[] { 3, 2 };
var test = new Program();
var output = test.FindOrder(4, case2);
Debug.Assert(string.Join("->", output).CompareTo("0->2->1->3") == 0);
}
// Style talk: Using private variables, good comment about DFS, cycle detection, meaningful variable names
// do not need backtracking because we only need one solution.
private int[] coursesInOrder;
private int index = 0;
/// <summary>
/// Jan. 26, 2022
/// DFS algorithm
/// Learn C# code from https://leetcode.com/problems/course-schedule-ii/discuss/294815/C-DFS
/// </summary>
/// <param name="numCourses"></param>
/// <param name="prerequisites"></param>
/// <returns></returns>
public int[] FindOrder(int numCourses, int[][] prerequisites)
{
coursesInOrder = new int[numCourses];
var adjacencyMatrix = new HashSet<int>[numCourses]; // adjacencyMatrix is better name compared to takenFirst
for (int i = 0; i < numCourses; i++)
{
adjacencyMatrix[i] = new HashSet<int>();
}
foreach (var fromTo in prerequisites)
{
var from = fromTo[0];
var to = fromTo[1];
adjacencyMatrix[from].Add(to); // from, to variables are more meaningful than first, next
}
//var isVisited = new bool[numCourses]; // move into for loop
var isAdded = new bool[numCourses];
for (int i = 0; i < numCourses; i++)
{
var isVisited = new bool[numCourses];
if (isAdded[i])
{
continue;
}
var noCyclic = runDepthFirstSearch(i, adjacencyMatrix, isVisited, isAdded);
if (!noCyclic)
{
return new int[0];
}
}
return coursesInOrder;
}
/// <summary>
/// Jan. 26, 2022
/// Return false - no cycle in the graph
/// true - no cycle
/// </summary>
/// <param name="courseId"></param>
/// <param name="adjacencyMatrix"></param>
/// <param name="isVisited"></param>
/// <param name="isAdded"></param>
/// <returns></returns>
private bool runDepthFirstSearch(int courseId, HashSet<int>[] adjacencyMatrix, bool[] isVisited, bool[] isAdded)
{
if(isAdded[courseId]) // I added the statement - this should be base case, make it clear!
{
return true;
}
if (isVisited[courseId]) // detect a cycle - quit!
{
return false;
}
isVisited[courseId] = true;
var nextCourses = adjacencyMatrix[courseId];
foreach (var next in nextCourses)
{
var noCycle = runDepthFirstSearch(next, adjacencyMatrix, isVisited, isAdded);
if (!noCycle)
{
return false;
}
}
// backtracking is challenging, think about more since I did not write original C# code - Jan. 26, 2022
// if (!isAdded[courseId]) // play with if statement, argue that not visited must be not added ? not true
{
coursesInOrder[index] = courseId;
index++;
isAdded[courseId] = true;
}
isVisited[courseId] = false; // play with this reset, why?
return true;
}
}
}Leetcode discuss: 210. Course Schedule II | DFS | Learn from others | Challenging work
Jan. 26, 2022
Here is the link.
C# | DFS algorithm | Study Leetcode discuss C# code | Jan. 26, 2022
Jan. 26, 2022
Introduction
It is so interesting to read C# code with meaningful comments and good variable names. I did learn a few things from studying one of C# discuss post using DFS. What I can learn from 20 minutes to read and also running C# code? I like to write a post first, and then come back to review later.
C# | DFS algorithm | Simple to detect cycle | Style talk
Two variables are added to help DFS algorithm, isVisited and isAdded.
I like to learn from a few discuss using C# and see what I can do better this time.
case 2: 4, [[1,0],[2,0],[3,1],[3,2]]
output: [0,2,1,3]
A few things to look into more carefully, write down in the following:
- Only need to find one path. So in DFS, no need to apply backtracking; I like to question this statement in the comment written by the user: https://leetcode.com/bacon/;
- Use private variables, so that function runDepthFirstSearch has less than five arguments. Two are private variables to store courses taken in the order to meet prerequisite requirement.
- Work on test case II in main function, start from course 3 to run DFS, 3 -> 1 -> 0, so how to mark those three nodes using isVisited and isAdded? Think about more carefully in the design stage.
- More on step 3, if first visit is node 3, and then start DFS from node 3, mark isVisited[3] = true, and let the search go through 1 and then go through 0. Node 0 is found and then isAdded[0] = true, reset all isVisited to false; isVisited is helpful to detect cycle.
- More on step 4, isAdded is helpful to terminate DFS search as a base case.
- More on step 3, path A: from 1 -> 0, path B: from 3->1->0, node 1 will be visited more than once, so isVisited has to be reset all the time.
Improvements:
- DFS algorithm - make base case the first statement - clear and not hidden in the if the statement, and also save cost to avoid visit removed edges in the graph.
- Move isVisited variable inside for loop.
Challenge to be expert on algorithm | Take risk | Do my best
It takes time for me to ask questions on reviewing C# code written by others. I do think that this DFS approach is very good example for me to learn from my own experience.
The following code passes online judge.
using System;
using System.Collections.Generic;
using System.Diagnostics;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
namespace _210_course_schedule_2
{
class Program
{
static void Main(string[] args)
{
// case 2: 4, [[1,0],[2,0],[3,1],[3,2]]
// output: [0,2,1,3]
var case2 = new int[4][];
case2[0] = new int[] { 1, 0 };
case2[1] = new int[] { 2, 0 };
case2[2] = new int[] { 3, 1 };
case2[3] = new int[] { 3, 2 };
var test = new Program();
var output = test.FindOrder(4, case2);
Debug.Assert(string.Join("->", output).CompareTo("0->2->1->3") == 0);
}
// Style talk: Using private variables, good comment about DFS, cycle detection, meaningful variable names
// do not need backtracking because we only need one solution.
private int[] coursesInOrder;
private int index = 0;
/// <summary>
/// Jan. 26, 2022
/// DFS algorithm
/// Learn C# code from https://leetcode.com/problems/course-schedule-ii/discuss/294815/C-DFS
/// </summary>
/// <param name="numCourses"></param>
/// <param name="prerequisites"></param>
/// <returns></returns>
public int[] FindOrder(int numCourses, int[][] prerequisites)
{
coursesInOrder = new int[numCourses];
var adjacencyMatrix = new HashSet<int>[numCourses]; // adjacencyMatrix is better name compared to takenFirst
for (int i = 0; i < numCourses; i++)
{
adjacencyMatrix[i] = new HashSet<int>();
}
foreach (var fromTo in prerequisites)
{
var from = fromTo[0];
var to = fromTo[1];
adjacencyMatrix[from].Add(to); // from, to variables are more meaningful than first, next
}
//var isVisited = new bool[numCourses]; // move into for loop
var isAdded = new bool[numCourses];
for (int i = 0; i < numCourses; i++)
{
var isVisited = new bool[numCourses];
if (isAdded[i])
{
continue;
}
var noCyclic = runDepthFirstSearch(i, adjacencyMatrix, isVisited, isAdded);
if (!noCyclic)
{
return new int[0];
}
}
return coursesInOrder;
}
/// <summary>
/// Jan. 26, 2022
/// Return false - no cycle in the graph
/// true - no cycle
/// </summary>
/// <param name="courseId"></param>
/// <param name="adjacencyMatrix"></param>
/// <param name="isVisited"></param>
/// <param name="isAdded"></param>
/// <returns></returns>
private bool runDepthFirstSearch(int courseId, HashSet<int>[] adjacencyMatrix, bool[] isVisited, bool[] isAdded)
{
if(isAdded[courseId]) // I added the statement - this should be base case, make it clear!
{
return true;
}
if (isVisited[courseId]) // detect a cycle - quit!
{
return false;
}
isVisited[courseId] = true;
var nextCourses = adjacencyMatrix[courseId];
foreach (var next in nextCourses)
{
var noCycle = runDepthFirstSearch(next, adjacencyMatrix, isVisited, isAdded);
if (!noCycle)
{
return false;
}
}
// backtracking is challenging, think about more since I did not write original C# code - Jan. 26, 2022
// if (!isAdded[courseId]) // play with if statement, argue that not visited must be not added ? not true
{
coursesInOrder[index] = courseId;
index++;
isAdded[courseId] = true;
}
isVisited[courseId] = false; // play with this reset, why?
return true;
}
}
}
Subscribe to:
Posts (Atom)