Scribd
Upload
3 views1 page

Array String Questions Final-3

The document lists various interview questions categorized into Array and String topics, with challenges ranging from easy to hard. Array questions include tasks like finding the largest element, reversing an array, and solving the Two Sum problem. String questions cover tasks such as checking for palindromes, counting vowels, and finding the longest substring without repeating characters.

Uploaded by

skw2909
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
3 views1 page

Array String Questions Final-3

The document lists various interview questions categorized into Array and String topics, with challenges ranging from easy to hard. Array questions include tasks like finding the largest element, reversing an array, and solving the Two Sum problem. String questions cover tasks such as checking for palindromes, counting vowels, and finding the longest substring without repeating characters.

Uploaded by

skw2909
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Array and String Interview Questions (Easy,

Medium, Hard)

Array Questions

• Find largest element in array.

• Reverse an array.

• Check if array is sorted.

• Move all zeros to end of array.

• Find second largest element in array.

• Rotate array by K positions.

• Two Sum problem.

• Find missing number in array (1 to n).

• Merge two sorted arrays.

• Maximum subarray sum (Kadane’s Algorithm).

• Find majority element (Moore’s Voting Algorithm).

• Trapping rain water problem.

• Maximum product subarray.

• Median of two sorted arrays.

String Questions

• Reverse a string.

• Check if string is palindrome.

• Count vowels in a string.

• Check if two strings are anagrams.

• Find first non-repeating character in string.

• Remove duplicates from string.

• Longest substring without repeating characters.

• String compression (aaabb → a3b2).

• Minimum window substring.

Apurva, you can do it ■■

You might also like