> For the complete documentation index, see [llms.txt](https://aisuko.gitbook.io/wiki/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://aisuko.gitbook.io/wiki/freesoftware/algorithm/nd_array.md).

# N D Array

N D array consists of a sequence of elements. And the elements can be laid out in a rectangular grid rather than a line.

## The techniques related to the N D array

* Simulation technique
* Diagonal traversal technique

And here are programming techniques related to the N D array:

* Boundary check

All of these techniques have a basic requirement that the array's edge case must be handled properly. So, you need to know how to handle the edge case of the array. And then do more practice. The N D array part should be ok.

## Questions

* [Diagonal Traverse](https://leetcode.com/problems/diagonal-traverse/)
* [Spiral Matrix](https://leetcode.com/problems/spiral-matrix/)
* [Pascal's Triangle](https://leetcode.com/problems/pascals-triangle/)
