Coding
Word
1 sections, 7 questions
What will be the output of the following C code?
#include <stdio.h>
int main() {
int x = 5;
printf("%d", x++ + ++x);
return 0;
}
x++ is post-increment: uses value 5, then increments to 6
++x is pre-increment: increments 6 to 7, then uses value 7
Result: 5 + 7 = 12
How many times will the loop execute?
int i = 0;
while (i < 5) {
printf("%d ", i);
i++;
}
Loop executes for i = 0, 1, 2, 3, 4 (5 times)
Find the second largest element in an array.
Example:
Input: [12, 35, 1, 10, 34, 1]
Output: 34
Iterate through array maintaining first and second largest elements.
public int findSecondLargest(int[] arr) {
if (arr.length < 2) return -1;
int largest = Integer.MIN_VALUE;
int secondLargest = Integer.MIN_VALUE;
for (int num : arr) {
if (num > largest) {
secondLargest = largest;
largest = num;
} else if (num > secondLargest && num != largest) {
secondLargest = num;
}
}
return secondLargest == Integer.MIN_VALUE ? -1 : secondLargest;
}#include <limits.h>
int findSecondLargest(int arr[], int n) {
if (n < 2) return -1;
int largest = INT_MIN;
int secondLargest = INT_MIN;
for (int i = 0; i < n; i++) {
if (arr[i] > largest) {
secondLargest = largest;
largest = arr[i];
} else if (arr[i] > secondLargest && arr[i] != largest) {
secondLargest = arr[i];
}
}
return secondLargest == INT_MIN ? -1 : secondLargest;
}def find_second_largest(arr):
if len(arr) < 2:
return -1
largest = second_largest = float('-inf')
for num in arr:
if num > largest:
second_largest = largest
largest = num
elif num > second_largest and num != largest:
second_largest = num
return -1 if second_largest == float('-inf') else second_largestReverse words in a string.
Example:
Input: "the sky is blue"
Output: "blue is sky the"
Split string into words, reverse the order, and join.
public String reverseWords(String s) {
String[] words = s.trim().split("\\s+");
StringBuilder result = new StringBuilder();
for (int i = words.length - 1; i >= 0; i--) {
result.append(words[i]);
if (i > 0) result.append(" ");
}
return result.toString();
}def reverse_words(s):
words = s.strip().split()
return ' '.join(reversed(words))Rotate an array to the right by k positions.
Example:
Input: nums = [1,2,3,4,5,6,7], k = 3
Output: [5,6,7,1,2,3,4]
Use reversal algorithm for in-place rotation.
public void rotate(int[] nums, int k) {
int n = nums.length;
k = k % n;
reverse(nums, 0, n - 1);
reverse(nums, 0, k - 1);
reverse(nums, k, n - 1);
}
private void reverse(int[] nums, int start, int end) {
while (start < end) {
int temp = nums[start];
nums[start] = nums[end];
nums[end] = temp;
start++;
end--;
}
}def rotate(nums, k):
k = k % len(nums)
nums.reverse()
nums[:k] = reversed(nums[:k])
nums[k:] = reversed(nums[k:])Check if a number is palindrome.
Example:
Input: 121
Output: true
Reverse the number and compare with original.
public boolean isPalindrome(int x) {
if (x < 0) return false;
int original = x;
int reversed = 0;
while (x > 0) {
reversed = reversed * 10 + x % 10;
x /= 10;
}
return original == reversed;
}int isPalindrome(int x) {
if (x < 0) return 0;
int original = x;
int reversed = 0;
while (x > 0) {
reversed = reversed * 10 + x % 10;
x /= 10;
}
return original == reversed;
}def is_palindrome(x):
if x < 0:
return False
original = x
reversed_num = 0
while x > 0:
reversed_num = reversed_num * 10 + x % 10
x //= 10
return original == reversed_numCalculate factorial of a number.
Example:
Input: 5
Output: 120
Multiply all numbers from 1 to n.
public long factorial(int n) {
if (n <= 1) return 1;
long result = 1;
for (int i = 2; i <= n; i++) {
result *= i;
}
return result;
}long factorial(int n) {
if (n <= 1) return 1;
long result = 1;
for (int i = 2; i <= n; i++) {
result *= i;
}
return result;
}def factorial(n):
if n <= 1:
return 1
result = 1
for i in range(2, n + 1):
result *= i
return result