# Array Data Structure

An array is a data structure for storing elements of one data type sequentially. The elements of an array are allocated at the adjacent memory location. Each element of an array is uniquely identified by an array index or key. In general, the simplest form of data structure is a linear array known as a one-dimensional array.

Arrays are known to be the most important data structure because of its wide use as it's used in implementing other data structures as *hash-table*, *heaps*, *stack*, *queue*, etc. Arrays are one of the oldest data structures in the computer programming field.

Following diagram explains arrays:

The memory location of the first element of the array is, in general, is in general by the name of the array. For the above case, *Arr* is that location that points to the first element.

**Topics:**

TOP Interview Coding Problems/Challenges

- Run-length encoding (find/print frequency of letters in a string)
- Sort an array of 0's, 1's and 2's in linear time complexity
- Checking Anagrams (check whether two string is anagrams or not)
- Relative sorting algorithm
- Finding subarray with given sum
- Find the level in a binary tree with given sum K
- Check whether a Binary Tree is BST (Binary Search Tree) or not
- 1[0]1 Pattern Count
- Capitalize first and last letter of each word in a line
- Print vertical sum of a binary tree
- Print Boundary Sum of a Binary Tree
- Reverse a single linked list
- Greedy Strategy to solve major algorithm problems
- Job sequencing problem
- Root to leaf Path Sum
- Exit Point in a Matrix
- Find length of loop in a linked list
- Toppers of Class
- Print All Nodes that don't have Sibling
- Transform to Sum Tree
- Shortest Source to Destination Path

Comments and Discussions

**Ad:**
Are you a blogger? Join our Blogging forum.