nextRound
TechnologiesCoding ProblemsBookmarksLearning Paths
nextRound
TechnologiesCoding ProblemsBookmarksLearning Paths
nextRound

AI-powered interview preparation platform. Practice with curated questions, mock interviews, and personalized learning paths to crack your dream tech interview.

Quick Links

  • Technologies
  • Saved Questions
  • Pricing

Company

  • About Us
  • Contact Us

Legal

  • Privacy Policy
  • Terms of Use

© 2026 nextRound. All rights reserved.

1What is the Two-Pointer technique? Give a use case.Beginner2Why are Strings immutable in Java/C#? What are the benefits?Intermediate3What is a Dynamic Array (ArrayList/Vector)? How does it grow?Intermediate4Why is string concatenation in a loop O(n²)? How do you fix it? (StringBuilder)Intermediate5Explain the concept of Amortized O(1) for Dynamic Array insertion.Intermediate6Explain Kadane's Algorithm (Maximum Subarray Sum). What is its complexity?Intermediate7How do you rotate an array by k positions? (In-place vs extra space)Beginner8What is the difference between a String and a Character Array?Intermediate9Why is accessing an array element O(1)?Beginner10How do you check if two strings are anagrams of each other?Beginner11Explain how to find the longest palindromic substring.Intermediate12Why is insertion/deletion in the middle of an array O(n)?Beginner13What is an Array? How is it stored in memory?Beginner14What is the Sliding Window technique? Give a use case.Intermediate15What are the advantages and disadvantages of Arrays?Intermediate16What is String Interning?Intermediate17How do you find the second largest element in an unsorted array?Beginner18What is a Sparse Array? When is it useful?Intermediate19What is the Prefix Sum technique?Intermediate
All Topics
1
Basics
Complexity Analysis
2
Arrays and Strings
Linked Lists
Stacks and Queues
Hash Tables
3
Trees
Graphs
Sharethis topic

Share via WhatsApp, X, Facebook, LinkedIn or copy link. Open Graph preview enabled.