FLAGSHIP CURRICULUM REPOSITORY (5,023 VERIFIED QUESTIONS)
GrowCode Problem Bank & Competence Engine.
Master engineering competence across 11 core subjects. Filter 5,018+ questions by Subject, Topic, Difficulty, and Question Type.
Showing 25 of 5,023 questions (Page 1 of 201)
BEGINNERCMCQOperators
What is the result of applying the bitwise XOR operator (^) to a number with itself?FUNDAMENTALSCMCQPointers
In C, what occurs when attempting to dereference a NULL pointer?BEGINNERPythonMCQData Structures
Which Python data structure provides O(1) average time complexity for key lookups?INTERMEDIATEJavaScriptMCQAsynchronous JavaScript
What is the event loop's task priority order between microtasks (Promises) and macrotasks (setTimeout)?FUNDAMENTALSDBMSSQL_QUERYSQL Queries
Which SQL clause is used to filter aggregated data generated by a GROUP BY clause?FUNDAMENTALSOperating SystemsCONCEPTUALProcess Management
What state transition occurs when a process executing in CPU requests an I/O operation?FUNDAMENTALSComputer NetworksCONCEPTUALTransport Layer
Which transport layer protocol provides reliable, connection-oriented byte stream transfer with flow control?INTERMEDIATEAptitudeCOMPLEXITY_ANALYSISComplexity Analysis
What is the worst-case asymptotic time complexity of building a heap from an unsorted array of N elements?BEGINNERDSACODINGVariable Swap Invariants
Write a function that swaps two integer variables without using any temporary variable.Time: O(1) | Space: O(1)
ADVANCEDDSACODINGBinary Tree Path Invariant Validation
Given the root of a binary tree, compute the maximum path sum between any two nodes.Time: O(N) | Space: O(H)
BEGINNERDSACODINGString Character Frequency Anagram Verification
Write a function that determines whether string t is an anagram of string s using character frequency arrays.Time: O(N) | Space: O(1)
INTERMEDIATEDSACODINGSubarray Target Sum Invariant Verification
Given a sorted array of positive integers and a target sum, find continuous start and end indices matching tar…Time: O(N) | Space: O(1)
BEGINNERDSACODINGStack Parenthesis Balance Verification
Determine if a string containing '()', '{}', and '[]' characters is validly balanced.Time: O(N) | Space: O(N)
INTERMEDIATEDSACODINGRotated Sorted Array Search Invariants
Search for a target value in a rotated sorted array in O(log N) runtime.Time: O(log N) | Space: O(1)
INTERMEDIATEDSACODINGFloyd's Fast-Slow Pointer Cycle Verification
Determine if a singly linked list contains a cycle using O(1) auxiliary memory.Time: O(N) | Space: O(1)
ADVANCEDDSACODING2D Grid Connected Component Traversal
Count the number of distinct islands in a 2D binary grid where '1' is land and '0' is water.Time: O(M * N) | Space: O(M * N)
INTERMEDIATECCODINGMinimum Coin Change Dynamic Programming
Given coin denominations and a total amount, return the minimum number of coins needed to make up that amount.Time: O(N * Amount) | Space: O(Amount)
INTERMEDIATEDSACODINGMin-Heap Top K Frequent Elements
Given an integer array nums and an integer k, return the k most frequent elements in O(N log k) time.Time: O(N log k) | Space: O(N)
BEGINNERCMCQVariables & Data Types
In C (Variables & Data Types), what is the primary behavior when evaluating key operation #1?Time: O(1) | Space: O(1)
FUNDAMENTALSC++OUTPUT_PREDICTIONTemplates & Generic Programming
Predict the output of the following C++ code snippet covering Templates & Generic Programming:
```
// Scenario…Time: O(N) | Space: O(1)
INTERMEDIATEPythonDEBUGGINGGenerators & Iterators
Analyze the core conceptual invariant of Generators & Iterators in Python (Scenario #3).Time: O(N) | Space: O(1)
ADVANCEDJavaScriptCONCEPTUALPrototypes & Inheritance
Analyze the core conceptual invariant of Prototypes & Inheritance in JavaScript (Scenario #4).Time: O(N) | Space: O(1)
EXPERTDSACOMPLEXITY_ANALYSISSliding Window
What is the worst-case time complexity of performing operations on Sliding Window in DSA?Time: O(N) | Space: O(1)
BEGINNERDBMSTRACE_EXECUTIONER Modeling & Keys
Analyze the core conceptual invariant of ER Modeling & Keys in DBMS (Scenario #6).Time: O(1) | Space: O(1)
FUNDAMENTALSOperating SystemsSQL_QUERYProcess States & Lifecycle
Analyze the core conceptual invariant of Process States & Lifecycle in Operating Systems (Scenario #7).Time: O(N) | Space: O(1)
Page 1 of 201