Question Bank

What is the primary role of the Common Language Runtime (CLR)?

What is .NET?

Which data structure is most suitable for frequent insertions/deletions in the middle, but has slow (O(n)) access time?

How does the two-pointer technique find the middle of a linked list in a single pass?

What are the three pointers typically used in an iterative in-place linked list reversal?

What is the time complexity of deleting the last node of a Singly Linked List (without a tail pointer)?

In Floyd's 'Tortoise and Hare' algorithm for cycle detection, if a cycle exists, what is guaranteed to happen?

A Doubly Linked List requires less memory per node than a Singly Linked List because it allows bi-directional traversal.

In the Quickselect algorithm, what is the expected (average) time complexity for finding the kth largest element?

Why is inserting an element at the beginning of a standard fixed-size array an O(n) operation?

Which of the following is NOT typically stored in the underlying implementation of an array slice?

Using basic character counting compression, what would the string 'aabbccc' become?

What are the two common mathematical steps to rotate a 2D matrix by 90 degrees clockwise in-place?

Binary search can be performed on both sorted and unsorted arrays with O(log n) complexity.

If you use the sorting approach to find duplicates in an array, what is the best possible average time complexity assuming an efficient sorting algorithm is used?

What is the time complexity of accessing an element by its index in a standard array?

Which of the following describes an 'in-place' algorithm for reversing an array?

What does Ahead-of-Time (AOT) compilation provide to an Angular application compared to Just-in-Time (JIT)?

The async pipe automatically unsubscribes from Observables when a component is destroyed, preventing memory leaks.

What is the key difference between a 'pure' and an 'impure' pipe?