Core Programming

57 interview prep topics with adaptive MCQ tests.

Python
Python remains a cornerstone in software development, data science, machine learning, and AI engineering in 2026. Its…
Start Test →
Advanced Python
Advanced Python Interview Questions target the deepest layers of the CPython runtime, object model, and execution…
Start Test →
SQL
SQL (Structured Query Language) remains the cornerstone for interacting with relational databases, a fundamental skill…
Start Test →
Algorithms
Algorithms are the bedrock of computer science and software engineering, defining the step-by-step procedures that…
Start Test →
Data Structures
Data structures are the fundamental building blocks of software engineering, defining how data is organized, managed,…
Start Test →
Dynamic Programming Patterns
Dynamic Programming (DP) is a foundational algorithmic technique used to solve complex problems by breaking them down…
Start Test →
Graph Traversal (BFS, DFS)
Graph traversal refers to the process of visiting all nodes in a graph systematically. In 2026, proficiency in BFS and…
Start Test →
LRU Cache Implementation
The Least Recently Used (LRU) cache is a foundational data structure design problem that tests a candidate's ability to…
Start Test →
Sliding Window Technique
The Sliding Window Technique is a powerful algorithmic approach used to solve problems on arrays, strings, or linked…
Start Test →
Generators and Iterators
Generators and iterators are foundational concepts in Python that enable memory-efficient data processing and lazy…
Start Test →
Python Metaprogramming
Python Metaprogramming is the practice of writing code that manipulates, creates, or modifies other code at runtime. In…
Start Test →
Python Context Managers
Python context managers are a fundamental language feature designed to manage resources—such as file handles, network…
Start Test →
Python Dataclasses vs Pydantic
In modern Python development, managing data structures effectively is critical for system reliability. Python…
Start Test →
Python Decorators
Python decorators are a powerful, expressive feature that allows for the modification or extension of function and…
Start Test →
Python GIL
The Global Interpreter Lock (GIL) is a mutex that protects access to Python objects, preventing multiple native threads…
Start Test →
Python Memory Management
Python memory management is a foundational topic for senior-level software engineering interviews, particularly for…
Start Test →
Python Packaging and Dependency Management
Python packaging has evolved significantly by 2026, moving away from legacy setup.py-based workflows toward…
Start Test →
Python Structured Concurrency (TaskGroups)
Python Structured Concurrency, introduced via asyncio.TaskGroup in Python 3.11, represents a paradigm shift in how…
Start Test →
Python Protocols and Generics
In the modern Python ecosystem, static type checking has evolved from an optional utility to a cornerstone of…
Start Test →
Kadane's Algorithm
Array manipulation problems involving maximum subarray sums represent a staple of technical screening interviews across…
Start Test →
Backtracking Coding Patterns
Backtracking is an algorithmic paradigm for systematically searching through the solution space of constraint…
Start Test →
Big O Notation & Complexity Analysis
Big O notation and algorithmic complexity analysis form the mathematical foundation of modern software engineering…
Start Test →
Binary Indexed Tree
The Binary Indexed Tree, universally known as the Fenwick Tree, stands as one of the most elegant and space-efficient…
Start Test →
Binary Search Interview Patterns
Binary Search Interview Patterns represent one of the most critical foundational testing pillars in technical software…
Start Test →
Binary Tree Lowest Common Ancestor
The Lowest Common Ancestor (LCA) of two nodes, p and q, in a binary tree is defined as the lowest node in the tree that…
Start Test →
Binary Tree Traversals (In/Pre/Post/Level)
Binary tree traversal algorithms represent foundational paradigms in computer science, governing how data structures…
Start Test →
Bit Manipulation Coding Tricks
Bit manipulation coding tricks represent an essential class of low-level algorithms that operate directly on the binary…
Start Test →
Concurrency vs Parallelism
The distinction between concurrency and parallelism is one of the most fundamental pillars of modern systems…
Start Test →
Dijkstra's Shortest Path Algorithm
Dijkstra's Shortest Path Algorithm stands as a cornerstone of weighted graph theory, foundational for computing the…
Start Test →
Divide and Conquer Algorithm
The divide and conquer algorithmic pattern is a foundational paradigm in computer science, breaking complex problems…
Start Test →
Dynamic Programming Common Subsequences
Mastering dynamic programming questions involving common subsequences is a critical capability for software engineers…
Start Test →
Dynamic Programming: Edit Distance (Levenshtein)
Dynamic Programming: Edit Distance (Levenshtein) interview questions rank among the most frequently tested algorithmic…
Start Test →
Dynamic Programming: Knapsack Problems
Dynamic Programming: Knapsack Problems represent a foundational class of combinatorial optimization challenges that…
Start Test →
Fast & Slow Pointers (Cycle Detection)
The Fast & Slow Pointers pattern, widely recognized as Floyd's Tortoise and Hare algorithm, is a foundational…
Start Test →
Garbage Collection Algorithms
Garbage collection (GC) algorithms represent a foundational cornerstone of modern runtime environments, automating…
Start Test →
Graph Traversal: Connected Components
Graph Traversal: Connected Components Interview Questions form a core pillar of advanced algorithmic assessments at…
Start Test →
Floyd-Warshall Algorithm
The Floyd-Warshall algorithm stands as a foundational pillar in computer science and graph theory, specifically…
Start Test →
Greedy Algorithmic Patterns
Greedy algorithmic patterns represent a foundational class of problem-solving strategies where at each decision step,…
Start Test →
Heap & Priority Queue Implementation
Mastering heap and priority queue implementation is an essential milestone for software engineers targeting technical…
Start Test →
K-Way Merge Coding Pattern
The K-Way Merge coding pattern is an essential algorithmic strategy designed to efficiently combine multiple…
Start Test →
LFU Cache Implementation
The Least Frequently Used (LFU) cache implementation is widely regarded as one of the most challenging algorithmic…
Start Test →
Merge Intervals Pattern
The Merge Intervals pattern is a foundational algorithmic strategy used to handle tasks involving arrays of paired…
Start Test →
Monotonic Stack Pattern
The monotonic stack pattern is an advanced algorithmic technique used to solve array-based problems requiring the…
Start Test →
Object-Oriented Programming OOP Core
Object-Oriented Programming (OOP) core interview questions remain a foundational pillar of technical evaluations across…
Start Test →
Regular Expressions (Regex) in Programming
Regular Expressions (Regex) form a foundational pillar of text processing, validation, lexical analysis, and pattern…
Start Test →
Segment Tree Optimization
Segment tree optimization stands as a foundational pillar in advanced algorithmic engineering and technical interviews,…
Start Test →
String Matching Algorithms
String matching algorithms form a cornerstone of core programming interviews, testing a candidate's ability to optimize…
Start Test →
Tail Recursion & Call Stack Tuning
Tail Recursion and Call Stack Tuning represent critical pillars of low-level runtime efficiency, memory governance, and…
Start Test →
Top K Elements Pattern (Heaps)
The Top K Elements Pattern utilizing binary heaps and priority queues is one of the most critical algorithmic…
Start Test →
Topological Sort Pattern
The topological sort pattern is a foundational algorithmic technique used to order the vertices of a Directed Acyclic…
Start Test →
Trapping Rain Water Coding Problem
The Trapping Rain Water coding problem stands as one of the most classic and frequently tested hard-tier algorithmic…
Start Test →
Trie (Prefix Tree) Implementation
The Trie (pronounced try), also referred to as a digital tree or prefix tree, is an ordered tree data structure used…
Start Test →
Two Pointer Coding Pattern
The two pointer coding pattern is a fundamental algorithmic strategy used extensively in technical interviews for…
Start Test →
Union-Find / Disjoint Set Union (DSU)
The Union-Find data structure, also widely known as Disjoint Set Union (DSU), is a fundamental algorithmic concept that…
Start Test →
Clean Code & Refactoring Practices
Clean Code & Refactoring Practices form the bedrock of sustainable software engineering, differentiating fragile,…
Start Test →
Software Design Patterns
Software design patterns represent time-tested, reusable solutions to recurring architectural and implementation…
Start Test →
SOLID design principles
SOLID design principles represent the foundational bedrock of modern object-oriented software engineering. Originally…
Start Test →
← All Interview Prep Topics