Don’t Miss These Pointer Questions Master Before Any Interview! (2026)

Don’t miss these must-know pointer questions for interviews. A simple, friendly guide covering basic to advanced pointers to help you prepare with confidence

Get interview-ready with this friendly and beginner-focused guide on the most important pointer questions. From simple pointer basics to advanced pointer tricks, everything is explained in an easy and clear way. Perfect for students, freshers, and professionals preparing for C, C++, or embedded interviews boost your confidence, strengthen your core concepts, and stay ahead in any technical round!

BEGINNER-LEVEL POINTER QUESTIONS

Basics

1. What is a pointer in C/C++?
2. Why do we use pointers?
3. How do you declare a pointer?
4. What is the size of a pointer?
5. What does a NULL pointer mean?
6. What is a wild pointer?
7. What is a dangling pointer?
8. What is pointer initialization?
9. What is the difference between a pointer and a normal variable?
10. What is the address-of operator (&)?
11. What is the dereference operator (*)?
12. How do you assign an address to a pointer?
13. Can a pointer store NULL?
14. What happens if you dereference an uninitialized pointer?
15. What is a void pointer?
16. What is the use of void *?
17. What is the difference between int *p and int* p?
18. What is const int *p?
19. What is int *const p?
20. What is const int *const p?

INTERMEDIATE-LEVEL POINTER QUESTIONS

Pointer Arithmetic

21. What is pointer arithmetic?
22. Why does pointer arithmetic depend on data type size?
23. Can we increment/decrement a void pointer?
24. What happens when you compare two pointers?
25. What is the difference between p++ and ++*p?
26. How do you find the difference between two pointers?
27. What is pointer scaling?

Function Pointers

28. What is a function pointer?
29. How do you declare a function pointer?
30. Why do we use function pointers?
31. What is a callback function?
32. What is typedef for function pointers?
33. How do you pass a function pointer as a parameter?
34. How do you return a function pointer from a function?
35. What is a pointer to member function in C++?

Pointers & Arrays

36. What is the relationship between pointers and arrays?
37. Why does array name act like a pointer?
38. Why can’t we assign to an array name?
39. What is the difference between arr and &arr?
40. What is the difference between arr and arr[0]?
41. How do you use pointer arithmetic to traverse an array?
42. What is a pointer to an array (int (*p)[5])?
43. What is an array of pointers (int* p[5])?
44. What is the difference between pointer to array and array of pointers?
45. How do you pass a 2D array to a function using pointers?

Dynamic Memory

46. What is dynamic memory allocation?
47. What is malloc, calloc, realloc, free?
48. What is memory leak?
49. How do you avoid memory leaks?
50. What is a double-free error?
51. Why must you free allocated memory?
52. What does malloc return?
53. Why should you check if malloc returned NULL?
54. What is segmentation fault in context of pointers?

ADVANCED-LEVEL POINTER QUESTIONS

Pointer to Pointer & Multi-Level Pointers

55. What is a pointer to pointer (int **p)?
56. Why do we use multiple levels of pointers?
57. What is triple pointer (int ***p) and where used?
58. How is pointer-to-pointer used in dynamic 2D arrays?

Constant Pointers & Qualifiers

59. What is immutable pointer?
60. What is mutable pointer?
61. What is the importance of const with pointers in APIs?

Memory Alignment & Pointers

62. What is memory alignment?
63. What happens when a pointer is misaligned?
64. What is strict aliasing rule?
65. Why is pointer aliasing dangerous?

Function Pointer Tables

66. What is a function pointer jump table?
67. How are function pointer tables used in drivers?
68. Why are function pointers used in State Machines?
69. How do virtual function tables (vtable) use pointers?

Pointer Casting

70. What is pointer typecasting?
71. Is casting between unrelated pointers safe?
72. What is reinterpret_cast in C++?
73. Why is reinterpret_cast dangerous?
74. What is static_cast?
75. What is dynamic_cast and when to use?

Pointers in Embedded / System Programming

76. What is memory-mapped I/O?
77. How are pointers used for register access?
78. Why do embedded systems use volatile with pointers?
79. What does volatile uint32_t* reg = (uint32_t*)0x40002000; mean?
80. Why is volatile pointer different from pointer-to-volatile?
81. Why do we use uintptr_t for pointer-to-integer conversions?
82. What happens if you access invalid memory in bare-metal?

Pointers & Data Structures

83. How are pointers used in linked lists?
84. How is a node created using pointers?
85. Why do trees heavily use pointers?
86. How do double pointers help in inserting nodes?
87. How do pointers enable dynamic queues?
88. Why are pointers critical in graph adjacency list?

Pointer Internals

89. What is pointer indirection level?
90. Why does pointer dereferencing take time?
91. What are near, far, huge pointers (old compilers)?
92. What is segmentation and offset in pointers?
93. How do pointers work in 64-bit architecture?
94. How do pointers behave in big-endian vs little-endian?
95. Why can void* be assigned to any pointer?
96. Why can’t you do arithmetic on void* in standard C?

Special Pointer Concepts

97. What is a smart pointer?
98. What is unique_ptr, shared_ptr, weak_ptr?
99. How do smart pointers prevent memory leaks?
100. What is custom deleter in smart pointers?

POINTER CODING EXERCISES

BEGINNER POINTER CODING EXERCISES

1. Print address and value using a pointer

Write a program to:

• Declare an int variable
• Store its address in a pointer
• Print the pointer value and pointed value

2. Swap two numbers using pointers

Use pointers to swap two integers without using a third variable.

3. Add two numbers using pointer variables

Pass pointer addresses to a function and return the sum.

4. Find length of a string using pointers

Implement strlen using only pointer arithmetic.

5. Copy string using pointers

Write custom strcpy using pointer-to-pointer increment.

6. Reverse a string using pointers

Use two pointers (start, end) to reverse a char array.

7. Print array elements using pointer arithmetic

Do not use indexing. Only *(p+i) or *p++.

8. Find maximum element in array using pointers

Pass array using pointer and find max using pointer arithmetic.

9. Count vowels in string using pointer traversal

Increment pointer to iterate over the string.

10. Check if the string is palindrome using pointers

Use two pointers: left and right.

INTERMEDIATE POINTER CODING EXERCISES

11. Dynamic array using malloc

• Ask user for size
• Allocate memory
• Fill and print elements

12. Implement your own strcat using pointers

Append second string to first using pointer increments.

13. Implement bubble sort using pointers

Sort using pointer arithmetic instead of indexing.

14. Create a function to return pointer to max element

Return pointer to largest element in an array.

15. Allocate memory for 2D array using double pointer

int **arr = malloc(rows * sizeof(int*)) … etc.

16. Write function to free dynamically allocated 2D array

Free inner + outer pointers properly.

17. Create a function pointer for arithmetic operations

Menu:

• add
• sub
• mul
• div

Select using function pointer array.

18. Use function pointers to implement a state machine

3 states: INIT → PROCESS → EXIT
Transitions via function pointer table.

19. Convert lowercase to uppercase using pointer traversal

Manipulate ASCII values via pointer.

20. Implement memory copy function (memcpy)

Use a pointer-to-pointer loop.

21. Implement strcmp using pointers

Return:

• 0 if equal
• -1 if first < second
• 1 if first > second

22. Pointer to array vs array of pointers

Write code demonstrating both with outputs.

23. Passing pointer-to-pointer to modify original pointer

Function should allocate memory and assign it back to caller.

24. Detect memory leak using pointers

Simulate:

• allocate
• forget to free
• show correction

ADVANCED POINTER CODING EXERCISES

25. Implement a dynamic linked list (insert/delete/traverse)

Use pointers heavily:

• malloc
• pointer-to-pointer for head

26. Implement a binary tree using struct pointers

Include:

• insert
• search
• inorder traversal

27. Create your own malloc() using static memory array

Simulate:

• Memory pool
• Allocation via pointers

28. Implement smart pointers in C++ (unique_ptr-like)

Show:

• RAII
• destructor deleting memory

29. Pointer alignment demonstration

Write code that prints pointer addresses and checks misalignment.

30. Implement callback mechanism using function pointers

User function gets executed through a callback argument.

31. Implement circular buffer using pointers

Use:

• read pointer
• write pointer
• modulo arithmetic

32. Implement your own realloc

Shrink/expand memory and copy old elements manually.

33. Implement memory-mapped register access (embedded C)

Simulate:

#define REG (*(volatile uint32_t*)0x40020000)
REG = 0xFF;

34. Demonstrate pointer aliasing problem

Write code where:

• two pointers refer to same memory
• updates cause unexpected behavior

35. Implement a hash table using pointers

Use:

• dynamic arrays
• linked list chaining
• pointer-to-pointer for insert

36. Implement function pointer table for drivers

Simulate operations struct:

struct ops { void (*init)(); void (*read)(); void (*write)(); };

37. Demonstrate dangling pointer

Step:

• allocate
• free
• access again

Then fix it.

38. Implement double-pointer dynamic 2D matrix

Manually allocate:

• row pointers
• each row

Print, free.

39. Implement triple pointer for 3D array

Show how int ***p manages a 3D matrix.

40. Implement pointer-based stack

Use dynamic memory + pointers for:

• push
• pop

50 Pointer Snippet Questions

Beginner Pointer Snippets

1.

int x = 10;
int *p = &x;
printf("%d", *p);

2.

int x = 5;
int *p = &x;
*p = 20;
printf("%d", x);

3.

int x = 10;
int *p = NULL;
printf("%p", p);

4.

int x = 10;
int *p = &x;
p++;
printf("%d", *p);

5.

int arr[] = {10,20,30};
int *p = arr;
printf("%d", *(p+1));

6.

char s[] = "Hello";
char *p = s;
printf("%c", *p++);

7.

int a = 10;
int b = 20;
int *p = &a;
p = &b;
printf("%d", *p);

8.

int *p;
int x = 10;
*p = x;
printf("%d", *p);

9.

int x = 10;
int *p = &x;
printf("%p %p", &x, p);

10.

int x = 10;
int *p = &x;
printf("%d", *p+2);

Intermediate Pointer Snippets

11.

int x = 5;
int *p = &x;
int **pp = &p;
printf("%d", **pp);

12.

int arr[] = {1,2,3,4};
int *p = arr+2;
printf("%d", p[-1]);

13.

char *p = "ABC";
printf("%c", *(p+2));

14.

int a = 5;
void *vp = &a;
printf("%d", *(int*)vp);

15.

int arr[3] = {10,20,30};
int (*p)[3] = &arr;
printf("%d", (*p)[1]);

16.

int *p = NULL;
printf("%d", *p);

17.

int a = 10, b = 20;
int *p1 = &a, *p2 = &b;
printf("%d", *p1 + *p2);

18.

int x = 10;
int *p = &x;
printf("%lu", sizeof(p));

19.

int x = 10;
int *p = &x;
int **pp = &p;
pp++;
printf("%p", *pp);

20.

int arr[] = {5, 10, 15};
int *p = arr;
printf("%d", ++*p);

Advanced Pointer Snippets

21.

char str[] = "ABCDE";
char *p = str;
printf("%c", ++*p);

22.

int a = 10;
int *p = &a;
*p = ++a;
printf("%d", a);

23.

int a = 10;
int *p = &a;
int *q = p;
*q = 100;
printf("%d", a);

24.

int arr[5] = {1,2,3,4,5};
int *p = arr;
printf("%d", *(p++) + *(++p));

25.

int x = 10;
int *p = &x;
printf("%d", *p++);

26.

char *p = "hello";
p[0] = 'H';
printf("%s", p);

27.

int a = 10;
int *p = &a;
printf("%d %d", a, *p);
a = 50;
printf("%d %d", a, *p);

28.

int arr[] = {10,20,30,40};
int *p = arr + 3;
printf("%d", p[-2]);

29.

void fun(int *p) { *p = 100; }
int x = 10;
fun(&x);
printf("%d", x);

30.

int *p = malloc(sizeof(int));
*p = 20;
printf("%d", *p);
free(p);
printf("%d", *p);

Deep Advanced & Tricky Snippets

31.

int a = 10;
int *p = &a;
*p = *p + (*p++);  
printf("%d", a);

32.

int arr[] = {10,20,30,40};
int *p = arr;
printf("%d", *++p + ++*p);

33.

int x = 0;
int *p = &x;
if (p)
    printf("Pointer is not NULL");

34.

int x = 10;
int y = 20;
int *p = &x;
*p = y;
printf("%d %d", x, y);

35.

int x = 5;
int *p = &x;
printf("%d", (++*p)++);

36.

int arr[] = {4,3,2,1};
int *p = arr;
printf("%d", *p + *(p+1) + *(p+2));

37.

int x = 5;
int *p = &x;
int **pp = &p;
**pp = 50;
printf("%d", x);

38.

char *s = "HELLO";
printf("%c", *s + 32);

39.

int a = 10;
int *p = &a;
printf("%d", *p + *(p));

40.

int x = 10;
int *p = &x;
printf("%p %p", p, &p);

Pointer + Function Snippets

41.

void fun(int *p) {
    p = NULL;
}
int x = 10;
int *p = &x;
fun(p);
printf("%p", p);

42.

void fun(int **p) {
    *p = NULL;
}
int x = 10;
int *p = &x;
fun(&p);
printf("%p", p);

43.

void fun(int *p) { *p = 200; }
int a = 10;
fun(&a);
printf("%d", a);

44.

void fun(int *p) { p++; }
int arr[] = {10,20,30};
int *p = arr;
fun(p);
printf("%d", *p);

45.

void fun(int p) { p = 100; }
int x = 10;
fun(x);
printf("%d", x);

46.

int fun() { return 5; }
int (*fp)() = fun;
printf("%d", fp());

47.

int add(int a, int b) { return a+b; }
int (*fp)(int,int) = add;
printf("%d", fp(5,6));

48.

int arr[] = {1,2,3};
int *p = arr;
printf("%d", (*p)++);

49.

int x = 10;
int *p = &x;
printf("%d", ++(*p));

50.

int arr[3] = {1,2,3};
int *p = arr;
printf("%d", *p + *(p+2));

When it comes to mastering ESP microcontrollers, developers often struggle to find a single place where everything from basics to advanced real-world projects—is explained clearly.
That’s why resources like Embedded Prep Master have become extremely valuable for students, embedded engineers, and hobbyists.

One of the best guides available today is:

Complete ESP Tutorials (Beginner to Advanced) : ESP32 Tutorials

This guide is a complete gateway for anyone who wants to learn ESP32, ESP8266, IoT development, sensor interfacing, Wi-Fi programming, and real embedded-system projects.

Raj Kumar

Mr. Raj Kumar is a highly experienced Technical Content Engineer with 7 years of dedicated expertise in the intricate field of embedded systems. At Embedded Prep, Raj is at the forefront of creating and curating high-quality technical content designed to educate and empower aspiring and seasoned professionals in the embedded domain.

Throughout his career, Raj has honed a unique skill set that bridges the gap between deep technical understanding and effective communication. His work encompasses a wide range of educational materials, including in-depth tutorials, practical guides, course modules, and insightful articles focused on embedded hardware and software solutions. He possesses a strong grasp of embedded architectures, microcontrollers, real-time operating systems (RTOS), firmware development, and various communication protocols relevant to the embedded industry.

Raj is adept at collaborating closely with subject matter experts, engineers, and instructional designers to ensure the accuracy, completeness, and pedagogical effectiveness of the content. His meticulous attention to detail and commitment to clarity are instrumental in transforming complex embedded concepts into easily digestible and engaging learning experiences. At Embedded Prep, he plays a crucial role in building a robust knowledge base that helps learners master the complexities of embedded technologies.

embeddedprep.com/