DSA in Dart
What are the main collection types in Dart and when do you use each?
List: ordered, indexed, allows duplicates (O(1) access by index). Set: unordered, unique elements (O(1) loo...
10 XP3m
DSA in Dart
15 questions
Algorithms, data structures, complexity, problems
DSA in Dart
How do you sort collections in Dart?
List.sort() sorts in-place using a Comparator<T> function. Implement Comparable<T> on a class to make it na...
20 XP3m
DSA in Dart
How do you implement binary search in Dart?
Binary search on a sorted list runs in O(log n). Dart's collection package provides binarySearch(). Impleme...
30 XP3m
DSA in Dart
How do you implement a linked list in Dart?
Build a Node<T> class with value and next pointer. A LinkedList<T> holds a head reference. O(1) prepend/ins...
30 XP4m
DSA in Dart
How do you use recursion and when should you avoid it in Dart?
Recursion is clean for tree/graph traversal and divide-and-conquer algorithms. Avoid deep recursion in Dart...
30 XP3m
DSA in Dart
What are the time complexities of common Dart List operations?
List: O(1) access by index/add at end, O(n) insert/remove at front/middle, O(n) contains(). Set/Map (HashMa...
20 XP3m
DSA in Dart
How do you implement binary search in Dart and when is it applicable?
Binary search finds a value in a sorted list in O(log n) by repeatedly halving the search space. It's only ...
30 XP4m
DSA in Dart
What sorting algorithms does Dart use and how do you sort custom objects?
Dart's List.sort() uses Timsort — O(n log n) average/worst, O(n) best (nearly sorted). Sort custom objects ...
30 XP4m
DSA in Dart
How do you implement a linked list in Dart?
A linked list is a sequence of nodes where each node holds a value and a reference to the next node. O(1) i...
30 XP5m
DSA in Dart
How do you implement a stack and queue in Dart?
Stack (LIFO): use List with add/removeLast. Queue (FIFO): use dart:collection Queue with addLast/removeFirs...
20 XP3m
DSA in Dart
How does HashMap work internally and what is its time complexity?
HashMap stores key-value pairs in buckets indexed by key.hashCode % bucketCount. Lookup/insert/delete are O...
40 XP5m
DSA in Dart
How do you apply recursion and memoization in Dart?
Recursion breaks a problem into smaller subproblems. Memoization caches results of expensive recursive call...
40 XP5m
DSA in Dart
How do you implement BFS and DFS in Dart?
BFS (Breadth-First Search) explores level by level using a Queue — finds shortest path. DFS (Depth-First Se...
40 XP6m
DSA in Dart
What are the two-pointer and sliding window techniques?
Two-pointer: use left/right pointers to solve pair/range problems in O(n) instead of O(n²). Sliding window:...
40 XP5m
DSA in Dart
How do you implement a priority queue in Dart?
Dart's package:collection provides HeapPriorityQueue<E> — a min-heap by default. O(log n) add, O(log n) rem...
40 XP4m