Questions
12 of 19
1What is the Prefix Sum technique?
2Why is insertion/deletion in the middle of an array O(n)?
3Explain the concept of Amortized O(1) for Dynamic Array insertion.
4How do you find the second largest element in an unsorted array?
5What is the difference between a String and a Character Array?
6What is the Sliding Window technique? Give a use case.
7What is a Sparse Array? When is it useful?
8Why is string concatenation in a loop O(n²)? How do you fix it? (StringBuilder)
9What is the Two-Pointer technique? Give a use case.
10What is a Dynamic Array (ArrayList/Vector)? How does it grow?
11What are the advantages and disadvantages of Arrays?
12What is an Array? How is it stored in memory?
13Explain Kadane's Algorithm (Maximum Subarray Sum). What is its complexity?
14Why are Strings immutable in Java/C#? What are the benefits?
15What is String Interning?
16Explain how to find the longest palindromic substring.
17Why is accessing an array element O(1)?
18How do you check if two strings are anagrams of each other?
19How do you rotate an array by k positions? (In-place vs extra space)
Data-StructuresData-Structures
Basics
Complexity Analysis
Arrays and Strings
Linked Lists
Stacks and Queues
Hash Tables
12 / 19

What is an Array? How is it stored in memory?

Array and Memory Representation

javascript
  1. 1

    Array indexing is normally zero-based, so the first element is at index 0.

  2. 2

    Contiguous storage provides excellent cache locality.

  3. 3

    For a one-dimensional array, element access is O(1).

  4. 4

    The array size is fixed in languages such as Java for native arrays; dynamic arrays provide resizable behavior.

Difficulty: 1/10

Follow-up Questions

  • ❓Why is array access O(1)?
  • ❓What are the trade-offs of contiguous memory allocation?
  • ❓How does a dynamic array differ from a normal array?