next
Round
Technologies
Coding Problems
Bookmarks
Learning Paths
Login
next
Round
Technologies
Coding Problems
Bookmarks
Learning Paths
Login
</>
Loading Topics...
1
What is the Prefix Sum technique?
Expert
High
2
Why is insertion/deletion in the middle of an array O(n)?
Expert
High
3
Explain the concept of Amortized O(1) for Dynamic Array insertion.
Expert
High
4
How do you find the second largest element in an unsorted array?
Expert
High
5
What is the difference between a String and a Character Array?
Expert
High
6
What is the Sliding Window technique? Give a use case.
Expert
High
7
What is a Sparse Array? When is it useful?
Expert
High
8
Why is string concatenation in a loop O(n²)? How do you fix it? (StringBuilder)
Expert
High
9
What is the Two-Pointer technique? Give a use case.
Expert
High
10
What is a Dynamic Array (ArrayList/Vector)? How does it grow?
Expert
High
11
What are the advantages and disadvantages of Arrays?
Expert
High
12
What is an Array? How is it stored in memory?
Expert
High
13
Explain Kadane's Algorithm (Maximum Subarray Sum). What is its complexity?
Expert
High
14
Why are Strings immutable in Java/C#? What are the benefits?
Expert
High
15
What is String Interning?
Expert
High
16
Explain how to find the longest palindromic substring.
Expert
High
17
Why is accessing an array element O(1)?
Expert
High
18
How do you check if two strings are anagrams of each other?
Expert
High
19
How do you rotate an array by k positions? (In-place vs extra space)
Expert
High
All Topics
1
Foundations
0/2 topics · 0%
Basics
Complexity Analysis
2
Linear structures
0/4 topics · 0%
Arrays and Strings
Linked Lists
Stacks and Queues
Hash Tables