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