Notes

these are my notes on some courses I have taken at UNSW / have not taken.

primarily this page serves as a place for me to jot down the prescribed texts for the different courses:

math2801#

Introduction to Mathematical Statistics

math2901 ATTACH#

• All of Statistics, by Wasserman
• Mathematical Statistics & Data Analysis by Rice
• A first look at rigorous probability theory, by Rosenthal

math3371 - Numerical Linear Algebra ATTACH#

• Peter J. Olver and Chehrzad Shakiban, Applied Linear Algebra, Second Edition, Springer 2018.

(Digital copy P 512.5/244)

Categorised Openings#

Double King Pawn Openings#

Semi-Open Games#

Double Queen Pawn Openings#

Other Queen Pawn Openings#

Indian Openings#

Flank Openings#

Modern Chess Openings

Fleeting Notes#

• the Caro Kann does not focus on a Kingside

naturally, the credit for the contents here go to refactoring.guru

dry#

don’t repeat yourself.

overview#

the Unified Modelling Language (UML) is a standardised visual language for specifying, constructing, and documenting software systems.

git checkout#

is deprecated.

git checkout --<file> will discard working tree changes.

recall that your working-tree is working-directory. similarly there is a staging area and a place to commit things.

finally, there is also the upstream repository that contains a copy of the code should shit go to fuck.

que

<figure><img src="https://ox-hugo.scripter.co/test/images/org-mode-unicorn-logo.png">
</figure>

He puts his claw against the divider. “Fist my bump.”

Andy Weir, Project Hail Mary

Read more >

setting the stage#

1. Mental Focus
2. Learn a programming language
3. Learn Data structures and algorithms
4. Complete Leetcode / programming practice
5. Software Engineering Concepts
6. Behavioural Practice
7. Best Methods of Applying
8. Interview Process & Internal Guidelines.

process for problem solving#

• always read the problem statement twice.
  • ask clarifying questions
• try think of different ways to solve the problem
• think end-to-end of the best solutions based on complexity
• write the algorithm from patterns in drawing
• code it out
• try and improve it once you think you’re finished.
• go through other solutions (even if you answered correctly)

problems#

arrays#

217. duplicate values | easy#

Given an integer array nums, return true if any value appears at least twice in the array, and return false if every element is distinct.