Programming Fundamentals

  • Turning bugs into tests

    Test your knowledge of turning software bugs into minimal reproducible cases and writing failing unit or integration tests—with mocks and stubs—to validate bug fixes and prevent regressions. Perfect for anyone seeking to strengthen their debugging and testing skills.

  • Boolean logic in conditionals

    Test your understanding of Boolean logic in conditionals, including operator precedence, associativity, short-circuit evaluation, and techniques for preventing null or undefined access. Assess your skills in writing safe, efficient logical expressions with &&, ||, and !.

  • Numeric expressions and comparisons

    Test your knowledge on numeric expressions, integer versus floating-point division, modulo operation with negatives, number overflows, underflows, and precision checks. This quiz covers basic concepts and evaluation rules central to programming with numeric data types.

  • DSA Basic Quiz

    Test your understanding of Data Structures and Algorithms basics with these straightforward questions. This quiz covers key DSA concepts, basic definitions, and essential operations to help reinforce your foundational knowledge.

  • Understanding Parameter Passing and Side Effects

    Assess your knowledge of parameter passing techniques, reference vs value semantics, and side effects in programming. This quiz covers core concepts including immutability, argument behavior, and function effects.

  • Foundations of Hash Maps and Sets

    Test your knowledge of hash maps and sets, including concepts like frequency counting, deduplication, and constant-time lookups. This quiz is designed for those new to these core data structures.

  • Advanced Segment Trees and Fenwick Trees: Range Queries Challenged

    Test your understanding of advanced data structures, focusing on segment trees and Fenwick trees, with applications in range queries, updates, and prefix sums. This quiz is designed for learners mastering efficient query handling and candidates preparing for competitive programming interviews.

  • Advanced Data Structures: Tries and Prefix Trees

    Test your understanding of advanced data structures, focusing on tries, prefix trees, and their applications in efficient string storage and retrieval. This quiz is designed for learners expanding their knowledge of specialized structures and candidates preparing for interview questions on string algorithms.

  • Advanced Disjoint Set Union and Applications Quiz

    Test your knowledge of disjoint set union (DSU), including union-find operations, path compression, and applications in connectivity problems and Kruskal’s algorithm. This quiz is designed for learners strengthening their grasp of graph-related data structures and candidates preparing for advanced interview questions.

  • Dynamic Programming and Bit Manipulation Advanced Concepts Quiz

    Test your understanding of dynamic programming and bit manipulation, including state transitions, memoization, subset generation, and optimization tricks with bitwise operations. This quiz is designed for learners mastering advanced problem-solving skills and candidates preparing for tough interview challenges.

  • Advanced Graph Algorithms and Structures Quiz

    Test your understanding of advanced graph algorithms, including Dijkstra’s, Bellman-Ford, Floyd-Warshall, and network flow, as well as structures like adjacency lists and matrices. This quiz is designed for learners deepening their graph theory skills and candidates preparing for challenging interview problems.

  • Challenging Concepts in Heaps & Priority Queues

    Test your knowledge of heaps and priority queues, including heap construction, heapify operations, priority scheduling, and applications in algorithms like heapsort and Dijkstra’s. This quiz is designed for learners deepening their understanding of priority-based structures and candidates preparing for advanced interview questions.

  • Binary Search Trees and Balanced BSTs: Advanced Concepts Quiz

    Test your understanding of binary search trees and balanced BSTs, including AVL trees, Red-Black trees, rotations, and height balancing. This quiz is designed for learners advancing their data structure knowledge and candidates preparing for complex interview questions.

  • Complex Tree Traversals and Core Binary Tree Concepts

    Test your knowledge of binary tree fundamentals, including preorder, inorder, postorder, and level-order traversals, along with key structural properties. This quiz is designed for learners strengthening their tree problem-solving skills and candidates preparing for technical interview questions.