JobsJob TrackerJob alerts

ClearTrail · 17 questions

All 17Coding 7System Design 2Low-Level Design 1
  • Sorting types, complexities, and graphs
  • TCP/IP vs UDP and Process vs Processor
  • Java Strings, Immutable Class, and Singleton ClassLow-Level Design
  • Check whether an element is present in both arraysCoding
  • Check if an array is sortedCoding
  • Find n odd integers by recursionCoding
  • Design an app like WhatsAppSystem Design
  • Explain 4 principles of OOPs
  • Difference between Object Overloading and Object Overriding
  • SQL query for highest salary in IT departmentCoding
  • What are ACID properties in SQL?
  • Coconut checkpoint puzzle
  • Swap first and last digit of a numberCoding
  • Auto tyre distance puzzle
  • Palindrome checkCoding
  • Find kth bitCoding
  • Design module for min/max frequencySystem Design
← ClearTrail questions
  1. Interview questions
  2. ClearTrail
  3. Sorting types, complexities, and graphs

Sorting types, complexities, and graphs

Filed under ClearTrail

The question

Explain sorting, its types, time complexities, the difference between n log n and n^2, and how to draw a graph of n log n.

No write-up yet. Related questions below have one.

Related ClearTrail questions

  • TCP/IP vs UDP and Process vs Processor
  • Java Strings, Immutable Class, and Singleton Class
  • Check whether an element is present in both arrays
  • Check if an array is sorted
  • Find n odd integers by recursion
TCP/IP vs UDP and Process vs Processor →

Collected from public candidate posts and coding forums. Updated Nov 2026.