Naming Convention

Maintaining a consistent naming system is key to optimizing solving time. Some benefits include:

Below is the naming convention I use for commonly used variables

e.g. I always call my arrays/lists, A, 99% of the time so I never have to think about what my array is called because it will always, most certainly, be A.

variable name	description
`A`	array
`v`	value in an array
`n`, `size`	array size
`M`	matrix
`m`	number of row in a matrix
`n`	number of columns in a matrix
`i`, `j`	indices to element `M[i][j]`
`y`, `x`	indices to element `M[y][x]`
`ii`, `jj`	neighbors of `(i, j)`
`dy`, `dx`	change in `y` and change in `x`
`#`	character used to mark visited elements in matrix
`offsets`	stores changes in (dy, dx)
`G`	graph
`a`, `b`	edge a and b
`nei`	neighbor of a graph node
`q`	queue
`heap`, `h`	heap
`d`, `hm`	dictionary
`stack`	stack
`left`, `right`	left and right pointers
`mid`	middle
`prefix`, `suffix`	prefix/suffix sum/product or values
`head`, `tail`, `dummy`	pointer to a list node
`tmp`	temporary variable
`c`	character in string
`s`, `e`	start, end
`ps`, `pe`	previous start, previous end
`slow`, `fast`	slow, fast pointers
`pre`	previous list node
`cur`	current list node
`nxt`	next list node
`p`, `q`, `node`	pointer to tree nodes
`uf`	union find
`visited`	visited elements
`seen`	seen elements
`have`	elements that are available for use
`dp`, `cache`, `memo`	dynamic programming, caching computed values
`helper()`, `fn()`	helper functions
`dfs()`, `bfs()`	depth/breadth first search
`dft()`, `bft()`	depth/breadth first traversal
`result`	result