Coding Questions 2025 - Interview Problems with Solutions

Coding Questions - PSU/Core Tech

Practice coding interview questions for PSU and core technology roles.

PSU Focus

PSU technical interviews focus on: Core fundamentals, C/C++ programming, Data structures, Domain knowledge.

Basic Programming

1. Reverse Array

C

void reverseArray(int arr[], int n) {
    int start = 0, end = n - 1;
    while (start < end) {
        int temp = arr[start];
        arr[start] = arr[end];
        arr[end] = temp;
        start++;
        end--;
    }
}

2. Find GCD

C

int gcd(int a, int b) {
    if (b == 0) return a;
    return gcd(b, a % b);
}

3. Binary Search

C

int binarySearch(int arr[], int n, int target) {
    int left = 0, right = n - 1;
    while (left <= right) {
        int mid = left + (right - left) / 2;
        if (arr[mid] == target) return mid;
        else if (arr[mid] < target) left = mid + 1;
        else right = mid - 1;
    }
    return -1;
}

4. Bubble Sort

C

void bubbleSort(int arr[], int n) {
    for (int i = 0; i < n - 1; i++) {
        for (int j = 0; j < n - i - 1; j++) {
            if (arr[j] > arr[j + 1]) {
                int temp = arr[j];
                arr[j] = arr[j + 1];
                arr[j + 1] = temp;
            }
        }
    }
}

5. Prime Number Check

C

int isPrime(int n) {
    if (n <= 1) return 0;
    for (int i = 2; i * i <= n; i++) {
        if (n % i == 0) return 0;
    }
    return 1;
}

6. Linked List Reversal

C

struct Node* reverse(struct Node* head) {
    struct Node *prev = NULL, *current = head, *next = NULL;
    while (current != NULL) {
        next = current->next;
        current->next = prev;
        prev = current;
        current = next;
    }
    return prev;
}

Related Resources

Interview Experience

Real interview experiences.

Preparation Guide

Complete preparation strategy.

---

Focus on C/C++ and core fundamentals!

Last updated: January 2026