Computer Science Interview Questions
400+ interview questions with detailed answers across 8 topics. Filter by topic and difficulty to prepare for your next interview.
400 Questions
8 Topics
3 Difficulty Levels
Browse by Topic
Critical 50
Data Structures
Arrays, linked lists, trees, graphs, hash tables, and advanced data structures
Critical 50
Algorithms
Sorting, searching, dynamic programming, greedy algorithms, and complexity analysis
Critical 50
Operating Systems
Processes, threads, memory management, scheduling, and synchronization
High 50
Database Systems
SQL, normalization, transactions, indexing, and NoSQL databases
High 50
Computer Networks
TCP/IP, protocols, network security, routing, and distributed networking
High 50
Software Engineering
SDLC, design patterns, testing, agile methodologies, and code quality
Critical 50
System Design
Scalability, microservices, distributed systems, caching, and load balancing
Critical 50
Programming & OOP
Java, Python, C++, OOP concepts, and programming paradigms
IIT Certified
Get IIT Jammu PG Certification
Master these interview topics with 175+ hours of industry projects and hands-on training.
Showing 400 questions
1
What is the difference between an array and a linked list?
Data Structures Easy
2
What is a stack and what are its main operations?
Data Structures Easy
3
What is a queue and how does it differ from a stack?
Data Structures Easy
4
What is a hash table and how does it work?
Data Structures Easy
5
What is a binary tree and what are its properties?
Data Structures Easy
6
What is the difference between singly and doubly linked lists?
Data Structures Easy
7
What is a Binary Search Tree (BST) and what property does it maintain?
Data Structures Easy
8
What is a graph data structure and what are its components?
Data Structures Easy
9
What is a heap and what are its types?
Data Structures Easy
10
What are the time complexities for common array operations?
Data Structures Easy
11
What are the different types of tree traversal?
Data Structures Easy
12
What is a hash collision and how can it be handled?
Data Structures Easy
13
What is a circular queue and why is it useful?
Data Structures Easy
14
What is the difference between adjacency matrix and adjacency list for graphs?
Data Structures Easy
15
What is a priority queue and how does it differ from a regular queue?
Data Structures Easy
16
How would you implement an LRU (Least Recently Used) cache?
Data Structures Medium
17
How do you detect a cycle in a linked list?
Data Structures Medium
18
How do you check if a binary tree is balanced?
Data Structures Medium
19
Compare BFS and DFS for graph traversal. When would you use each?
Data Structures Medium
20
How would you implement a stack using two queues?
Data Structures Medium
21
How do you find the Lowest Common Ancestor (LCA) in a binary tree?
Data Structures Medium
22
What is the load factor in a hash table and why is it important?
Data Structures Medium
23
How do you reverse a linked list iteratively and recursively?
Data Structures Medium
24
How do you validate if a binary tree is a valid BST?
Data Structures Medium
25
What is topological sorting and how do you implement it?
Data Structures Medium
26
Explain the heapify operation and its time complexity.
Data Structures Medium
27
What is a Trie and when would you use it?
Data Structures Medium
28
How do you detect a cycle in a directed graph?
Data Structures Medium
29
How do you serialize and deserialize a binary tree?
Data Structures Medium
30
How do you implement a queue using two stacks?
Data Structures Medium
31
How do you find the kth smallest element in a BST?
Data Structures Medium
32
Explain the Rabin-Karp algorithm for string matching.
Data Structures Medium
33
Design a stack that supports push, pop, and getMin in O(1) time.
Data Structures Medium
34
What is Union-Find (Disjoint Set Union) and its optimizations?
Data Structures Medium
35
How do you find the diameter of a binary tree?
Data Structures Medium
36
Explain the Skip List data structure and its probabilistic properties.
Data Structures Hard
37
Explain Red-Black tree properties and why they guarantee O(log n) operations.
Data Structures Hard
38
Why are B-trees used in databases instead of binary trees?
Data Structures Hard
39
Explain Bloom filters, their false positive rate, and applications.
Data Structures Hard
40
What is a Segment Tree and how does it support range queries?
Data Structures Hard
41
Compare AVL trees and Red-Black trees. When would you prefer one over the other?
Data Structures Hard
42
How do you find strongly connected components in a directed graph?
Data Structures Hard
43
Explain consistent hashing and its advantages for distributed systems.
Data Structures Hard
44
Explain Binary Indexed Trees (Fenwick Trees) and their applications.
Data Structures Hard
45
What are suffix arrays and how are they used in string processing?
Data Structures Hard
46
What is a Treap and how does it combine BST and heap properties?
Data Structures Hard
47
Explain LSM Trees and why they are used in write-optimized databases.
Data Structures Hard
48
What is a Count-Min Sketch and when would you use it?
Data Structures Hard
49
Explain persistent/immutable data structures and their benefits.
Data Structures Hard
50
Discuss lock-free data structures and their implementation challenges.
Data Structures Hard
51
What is the difference between time complexity and space complexity?
Algorithms Easy
52
Explain binary search and its time complexity.
Algorithms Easy
53
How does bubble sort work and what is its complexity?
Algorithms Easy
54
What is Big O notation and why is it used?
Algorithms Easy
55
What is linear search and when is it appropriate to use?
Algorithms Easy
56
Explain selection sort and its characteristics.
Algorithms Easy
57
How does insertion sort work and when is it efficient?
Algorithms Easy
58
What is recursion and what are its essential components?
Algorithms Easy
59
What is the difference between stable and unstable sorting algorithms?
Algorithms Easy
60
What is a greedy algorithm and give an example?
Algorithms Easy
61
Explain merge sort and its advantages.
Algorithms Easy
62
What is dynamic programming and when should it be used?
Algorithms Easy
63
How does quick sort work and what is its average complexity?
Algorithms Easy
64
What are DFS and BFS algorithms used for?
Algorithms Easy
65
Explain best case, average case, and worst case complexity.
Algorithms Easy
66
Compare different partition schemes in quick sort (Lomuto vs Hoare).
Algorithms Medium
67
How do you optimize Fibonacci computation using dynamic programming?
Algorithms Medium
68
Explain Dijkstra's algorithm for shortest path.
Algorithms Medium
69
Explain the 0/1 Knapsack problem and its DP solution.
Algorithms Medium
70
How does heap sort work and what are its properties?
Algorithms Medium
71
How do you find the Longest Common Subsequence (LCS) of two strings?
Algorithms Medium
72
Explain the activity selection problem and its greedy solution.
Algorithms Medium
73
How do you find first/last occurrence using binary search?
Algorithms Medium
74
Implement merge sort and explain the merge operation.
Algorithms Medium
75
When would you use Bellman-Ford over Dijkstra's algorithm?
Algorithms Medium
76
Explain counting sort and when is it most efficient?
Algorithms Medium
77
How do you solve the coin change problem using DP?
Algorithms Medium
78
Compare Kruskal's and Prim's algorithms for Minimum Spanning Tree.
Algorithms Medium
79
Explain the edit distance (Levenshtein distance) algorithm.
Algorithms Medium
80
What is backtracking and how does it differ from brute force?
Algorithms Medium
81
How does radix sort work and what is its complexity?
Algorithms Medium
82
Find the Longest Increasing Subsequence (LIS) efficiently.
Algorithms Medium
83
Explain the flood fill algorithm and its applications.
Algorithms Medium
84
Explain Huffman coding and its greedy approach.
Algorithms Medium
85
Explain the two-pointer technique and its applications.
Algorithms Medium
86
What are NP-complete problems and why are they significant?
Algorithms Hard
87
Explain Floyd-Warshall algorithm and its applications.
Algorithms Hard
88
Explain the KMP string matching algorithm.
Algorithms Hard
89
How does the A* pathfinding algorithm work?
Algorithms Hard
90
Solve the Matrix Chain Multiplication problem.
Algorithms Hard
91
Explain the Ford-Fulkerson method for maximum flow.
Algorithms Hard
92
What approaches exist for solving the Traveling Salesman Problem?
Algorithms Hard
93
What are suffix trees and their algorithmic applications?
Algorithms Hard
94
Explain amortized analysis and give examples.
Algorithms Hard
95
Compare algorithms for finding the convex hull.
Algorithms Hard
96
What are randomized algorithms and their analysis techniques?
Algorithms Hard
97
What are approximation algorithms and approximation ratios?
Algorithms Hard
98
Discuss parallel algorithm design and complexity measures.
Algorithms Hard
99
What are online algorithms and competitive analysis?
Algorithms Hard
100
Discuss advanced DP techniques: bitmask DP, digit DP, DP on trees.
Algorithms Hard
101
What is the difference between a process and a thread?
Operating Systems Easy
102
What is a kernel and what are its main functions?
Operating Systems Easy
103
What is CPU scheduling and why is it necessary?
Operating Systems Easy
104
What is virtual memory and why is it used?
Operating Systems Easy
105
What is a deadlock and what are its four necessary conditions?
Operating Systems Easy
106
What is context switching and what is its overhead?
Operating Systems Easy
107
What is the difference between a mutex and a semaphore?
Operating Systems Easy
108
What are the different states of a process?
Operating Systems Easy
109
What is paging in memory management?
Operating Systems Easy
110
What is a system call and give examples?
Operating Systems Easy
111
Explain First-Come-First-Serve (FCFS) scheduling.
Operating Systems Easy
112
What is a file system and what functions does it provide?
Operating Systems Easy
113
What is a race condition and how can it be prevented?
Operating Systems Easy
114
What is the difference between internal and external fragmentation?
Operating Systems Easy
115
What is an interrupt and how is it handled?
Operating Systems Easy
116
Explain Round Robin scheduling and its time quantum selection.
Operating Systems Medium
117
Compare FIFO, LRU, and Optimal page replacement algorithms.
Operating Systems Medium
118
What are the strategies for handling deadlocks?
Operating Systems Medium
119
Explain the Producer-Consumer problem and its solution.
Operating Systems Medium
120
What is a TLB and why is it important?
Operating Systems Medium
121
How does priority scheduling work and what is starvation?
Operating Systems Medium
122
Explain the Readers-Writers problem and its solutions.
Operating Systems Medium
123
Explain fork() and exec() system calls and their relationship.
Operating Systems Medium
124
What is demand paging and what is thrashing?
Operating Systems Medium
125
Compare disk scheduling algorithms: FCFS, SSTF, SCAN, C-SCAN.
Operating Systems Medium
126
What are the different Inter-Process Communication (IPC) mechanisms?
Operating Systems Medium
127
Compare contiguous, linked, and indexed file allocation methods.
Operating Systems Medium
128
What are condition variables and how are they used with mutexes?
Operating Systems Medium
129
Explain multilevel queue and multilevel feedback queue scheduling.
Operating Systems Medium
130
What is segmentation and how does it differ from paging?
Operating Systems Medium
131
What is the difference between kernel mode and user mode?
Operating Systems Medium
132
What is copy-on-write and how is it used in fork()?
Operating Systems Medium
133
What is a journaling file system and why is it important?
Operating Systems Medium
134
What are zombie and orphan processes?
Operating Systems Medium
135
When would you use a spinlock vs a mutex?
Operating Systems Medium
136
Explain the Banker's algorithm for deadlock avoidance.
Operating Systems Hard
137
Compare memory-mapped I/O with port-mapped I/O.
Operating Systems Hard
138
What is an inverted page table and when is it used?
Operating Systems Hard
139
Explain the Completely Fair Scheduler (CFS) in Linux.
Operating Systems Hard
140
What is priority inversion and how can it be solved?
Operating Systems Hard
141
What is NUMA and how does it affect OS design?
Operating Systems Hard
142
How do you solve the Dining Philosophers problem without deadlock?
Operating Systems Hard
143
Compare Type 1 and Type 2 hypervisors.
Operating Systems Hard
144
Explain Read-Copy-Update (RCU) synchronization.
Operating Systems Hard
145
Compare hard and soft real-time scheduling.
Operating Systems Hard
146
What is kernel bypass and why is it used in high-performance systems?
Operating Systems Hard
147
Explain memory consistency models: sequential, TSO, and relaxed.
Operating Systems Hard
148
How do containers differ from virtual machines at the OS level?
Operating Systems Hard
149
What is eBPF and how does it extend kernel functionality?
Operating Systems Hard
150
Compare microkernel and monolithic kernel architectures.
Operating Systems Hard
151
What is a database and what is a DBMS?
Database Systems Easy
152
What is the difference between a primary key and a foreign key?
Database Systems Easy
153
What are the ACID properties in database transactions?
Database Systems Easy
154
What are the different types of SQL JOINs?
Database Systems Easy
155
What is a database index and why is it used?
Database Systems Easy
156
What is the difference between SQL and NoSQL databases?
Database Systems Easy
157
What is database normalization and why is it important?
Database Systems Easy
158
What is the difference between WHERE and HAVING clauses in SQL?
Database Systems Easy
159
What is a database transaction?
Database Systems Easy
160
What is the difference between UNIQUE and PRIMARY KEY constraints?
Database Systems Easy
161
What are aggregate functions in SQL? Give examples.
Database Systems Easy
162
What is the difference between clustered and non-clustered indexes?
Database Systems Easy
163
How does NULL work in SQL and what are its implications?
Database Systems Easy
164
What is an ER diagram and what are its components?
Database Systems Easy
165
What is the difference between DELETE and TRUNCATE commands?
Database Systems Easy
166
Explain the different normal forms (1NF, 2NF, 3NF, BCNF).
Database Systems Medium
167
Explain the different transaction isolation levels.
Database Systems Medium
168
How does a composite index work and when should you use it?
Database Systems Medium
169
What is a query execution plan and how do you read it?
Database Systems Medium
170
What is database sharding and what are its strategies?
Database Systems Medium
171
When should you use a subquery vs a JOIN?
Database Systems Medium
172
What is database replication and what are the different types?
Database Systems Medium
173
What are stored procedures and what are their advantages and disadvantages?
Database Systems Medium
174
Compare document databases with relational databases.
Database Systems Medium
175
What is a database deadlock and how is it handled?
Database Systems Medium
176
What are SQL window functions and how are they used?
Database Systems Medium
177
Explain the CAP theorem and its implications.
Database Systems Medium
178
When should you NOT use an index?
Database Systems Medium
179
What is denormalization and when should you use it?
Database Systems Medium
180
Compare optimistic and pessimistic locking strategies.
Database Systems Medium
181
What data structures does Redis support and when would you use each?
Database Systems Medium
182
What are common SQL query optimization techniques?
Database Systems Medium
183
Explain the MongoDB aggregation pipeline.
Database Systems Medium
184
What is database connection pooling and why is it important?
Database Systems Medium
185
What are database views and materialized views?
Database Systems Medium
186
How does Multi-Version Concurrency Control (MVCC) work?
Database Systems Hard
187
Compare B-tree and LSM-tree storage engines.
Database Systems Hard
188
How do distributed transactions work (2PC, Saga pattern)?
Database Systems Hard
189
Explain horizontal vs vertical partitioning and partition strategies.
Database Systems Hard
190
How does a database query optimizer work?
Database Systems Hard
191
Explain the Raft consensus algorithm used in distributed databases.
Database Systems Hard
192
How are time-series databases optimized for temporal data?
Database Systems Hard
193
How do graph databases handle traversals differently from relational joins?
Database Systems Hard
194
What is Change Data Capture (CDC) and how is it implemented?
Database Systems Hard
195
Compare different database caching strategies.
Database Systems Hard
196
Explain Serializable Snapshot Isolation (SSI).
Database Systems Hard
197
How do columnar databases optimize for analytical workloads?
Database Systems Hard
198
How do globally distributed databases achieve low-latency writes?
Database Systems Hard
199
Explain table bloat and VACUUM in PostgreSQL.
Database Systems Hard
200
Design a database disaster recovery strategy.
Database Systems Hard
201
What are the seven layers of the OSI model?
Computer Networks Easy
202
What are the key differences between TCP and UDP?
Computer Networks Easy
203
What is the difference between IPv4 and IPv6?
Computer Networks Easy
204
What are the common HTTP methods and their purposes?
Computer Networks Easy
205
What is DNS and how does it work?
Computer Networks Easy
206
What is the difference between HTTP and HTTPS?
Computer Networks Easy
207
What is the difference between MAC address and IP address?
Computer Networks Easy
208
What are port numbers and what are some common ports?
Computer Networks Easy
209
What is a firewall and how does it work?
Computer Networks Easy
210
What is the difference between a router, switch, and hub?
Computer Networks Easy
211
Explain the TCP three-way handshake.
Computer Networks Easy
212
What is a CDN and why is it used?
Computer Networks Easy
213
What is NAT and why is it used?
Computer Networks Easy
214
What are HTTP cookies and sessions?
Computer Networks Easy
215
What is a socket in network programming?
Computer Networks Easy
216
Explain the TLS handshake process.
Computer Networks Medium
217
How does TCP congestion control work?
Computer Networks Medium
218
What improvements does HTTP/2 offer over HTTP/1.1?
Computer Networks Medium
219
What algorithms do load balancers use for traffic distribution?
Computer Networks Medium
220
How do WebSockets work and when would you use them?
Computer Networks Medium
221
Explain different DNS record types and their uses.
Computer Networks Medium
222
Compare REST and GraphQL API architectures.
Computer Networks Medium
223
What is a reverse proxy and what are its benefits?
Computer Networks Medium
224
What is CORS and how does it work?
Computer Networks Medium
225
Compare OSPF and BGP routing protocols.
Computer Networks Medium
226
Explain HTTP caching headers and their behavior.
Computer Networks Medium
227
Explain the OAuth 2.0 authorization flow.
Computer Networks Medium
228
What is gRPC and how does it compare to REST?
Computer Networks Medium
229
What is a DDoS attack and how is it mitigated?
Computer Networks Medium
230
Explain different types of VPNs and their uses.
Computer Networks Medium
231
What is TCP keep-alive and how does it work?
Computer Networks Medium
232
What is a service mesh and what problems does it solve?
Computer Networks Medium
233
Explain subnet masks and CIDR notation.
Computer Networks Medium
234
How does CDN cache invalidation work?
Computer Networks Medium
235
How do you implement API rate limiting?
Computer Networks Medium
236
What is TCP Fast Open (TFO) and how does it reduce latency?
Computer Networks Hard
237
How does QUIC improve upon TCP for modern web applications?
Computer Networks Hard
238
How does anycast routing work and what are its use cases?
Computer Networks Hard
239
Explain Zero Trust network architecture principles.
Computer Networks Hard
240
How does BBR congestion control differ from traditional algorithms?
Computer Networks Hard
241
How do you implement mTLS (mutual TLS) in a microservices architecture?
Computer Networks Hard
242
Design a global load balancing strategy for a multi-region application.
Computer Networks Hard
243
Explain Software-Defined Networking (SDN) architecture.
Computer Networks Hard
244
Explain SSL certificate chain validation and common issues.
Computer Networks Hard
245
What tools and techniques would you use to debug complex network issues?
Computer Networks Hard
246
Explain important HTTP security headers and their purposes.
Computer Networks Hard
247
How do you implement network observability in a distributed system?
Computer Networks Hard
248
How does DNSSEC prevent DNS spoofing attacks?
Computer Networks Hard
249
Design edge computing architecture for low-latency applications.
Computer Networks Hard
250
How would you optimize network performance for a high-traffic web application?
Computer Networks Hard
251
What is SDLC and what are its main phases?
Software Engineering Easy
252
What is the difference between Agile and Waterfall methodologies?
Software Engineering Easy
253
What is unit testing and why is it important?
Software Engineering Easy
254
What is Git and what are its basic operations?
Software Engineering Easy
255
What is a design pattern and why are they useful?
Software Engineering Easy
256
What are the SOLID principles in object-oriented design?
Software Engineering Easy
257
What is code review and what are its benefits?
Software Engineering Easy
258
What is Scrum and what are its key components?
Software Engineering Easy
259
What is the Singleton pattern and when should you use it?
Software Engineering Easy
260
What is CI/CD and why is it important?
Software Engineering Easy
261
What is the testing pyramid?
Software Engineering Easy
262
What are common Git branching strategies?
Software Engineering Easy
263
What is the DRY principle?
Software Engineering Easy
264
What is the MVC pattern?
Software Engineering Easy
265
What is technical debt and how do you manage it?
Software Engineering Easy
266
Explain the Factory pattern and its variations.
Software Engineering Medium
267
What is Test-Driven Development (TDD) and what are its benefits?
Software Engineering Medium
268
What is Dependency Injection and why is it useful?
Software Engineering Medium
269
Explain the Observer pattern and its use cases.
Software Engineering Medium
270
Compare git rebase and git merge. When would you use each?
Software Engineering Medium
271
What are common code smells and how do you address them?
Software Engineering Medium
272
What is mocking in testing and when should you use it?
Software Engineering Medium
273
Explain the Strategy pattern with examples.
Software Engineering Medium
274
Compare microservices and monolithic architectures.
Software Engineering Medium
275
What makes an effective sprint retrospective?
Software Engineering Medium
276
Explain the Decorator pattern and when to use it.
Software Engineering Medium
277
How would you design a CI/CD pipeline for a web application?
Software Engineering Medium
278
What are different strategies for API versioning?
Software Engineering Medium
279
What are best practices for integration testing?
Software Engineering Medium
280
Compare Kanban and Scrum methodologies.
Software Engineering Medium
281
What are feature flags and how do you manage them?
Software Engineering Medium
282
What is the Repository pattern?
Software Engineering Medium
283
What are the key principles of the Twelve-Factor App methodology?
Software Engineering Medium
284
What static analysis tools would you use and why?
Software Engineering Medium
285
Explain the Adapter pattern with examples.
Software Engineering Medium
286
Explain Domain-Driven Design (DDD) concepts and when to apply them.
Software Engineering Hard
287
What are Event Sourcing and CQRS patterns?
Software Engineering Hard
288
What is Chaos Engineering and how do you implement it?
Software Engineering Hard
289
Explain Hexagonal Architecture (Ports and Adapters).
Software Engineering Hard
290
What is mutation testing and how does it improve test quality?
Software Engineering Hard
291
Explain the Visitor pattern and its applications.
Software Engineering Hard
292
What is contract testing for microservices?
Software Engineering Hard
293
How do you implement the Saga pattern for distributed transactions?
Software Engineering Hard
294
What is GitOps and how does it differ from traditional CI/CD?
Software Engineering Hard
295
What is the Specification pattern and how is it used in domain modeling?
Software Engineering Hard
296
How do you quantify and prioritize technical debt?
Software Engineering Hard
297
What is a modular monolith and when is it appropriate?
Software Engineering Hard
298
What is property-based testing and when should you use it?
Software Engineering Hard
299
How do you implement semantic versioning for libraries and APIs?
Software Engineering Hard
300
What are Architecture Decision Records (ADRs) and how do you use them?
Software Engineering Hard
301
What is the difference between horizontal and vertical scaling?
System Design Easy
302
What is a load balancer and why is it needed?
System Design Easy
303
What is caching and why is it important in system design?
System Design Easy
304
When would you choose SQL vs NoSQL databases?
System Design Easy
305
What are the key principles of RESTful API design?
System Design Easy
306
What are the benefits and challenges of microservices architecture?
System Design Easy
307
What is a message queue and when would you use one?
System Design Easy
308
What is database replication and why is it used?
System Design Easy
309
What does it mean to design a stateless service?
System Design Easy
310
How does a CDN improve application performance?
System Design Easy
311
What is a single point of failure (SPOF) and how do you eliminate it?
System Design Easy
312
Why is API rate limiting important and how does it work?
System Design Easy
313
What is eventual consistency and when is it acceptable?
System Design Easy
314
What are health checks and why are they important?
System Design Easy
315
What is service discovery and why is it needed in microservices?
System Design Easy
316
What are different cache invalidation strategies?
System Design Medium
317
What are database sharding strategies and their trade-offs?
System Design Medium
318
What is the Circuit Breaker pattern and when should you use it?
System Design Medium
319
What is an API Gateway and what problems does it solve?
System Design Medium
320
What is event-driven architecture and what are its benefits?
System Design Medium
321
How does consistent hashing work and why is it used?
System Design Medium
322
What is idempotency and how do you design idempotent APIs?
System Design Medium
323
How do you implement read/write splitting for database scaling?
System Design Medium
324
How do you design a distributed logging system?
System Design Medium
325
How would you design a URL shortener like bit.ly?
System Design Medium
326
Compare Kafka and RabbitMQ. When would you use each?
System Design Medium
327
What are different API pagination strategies and their trade-offs?
System Design Medium
328
How would you design a blob storage system like S3?
System Design Medium
329
How do you handle transactions across microservices?
System Design Medium
330
How would you design a notification system for a mobile app?
System Design Medium
331
How do you handle content updates with a CDN?
System Design Medium
332
What is leader election and how is it implemented in distributed systems?
System Design Medium
333
Why is database connection pooling important and how do you configure it?
System Design Medium
334
How do you design a reliable webhook system?
System Design Medium
335
What is request coalescing and when should you use it?
System Design Medium
336
How would you design a distributed caching system like Memcached or Redis Cluster?
System Design Hard
337
How would you design a web search engine like Google?
System Design Hard
338
How would you design a real-time chat system like WhatsApp?
System Design Hard
339
How would you design a distributed rate limiter?
System Design Hard
340
How would you design a video streaming platform like YouTube?
System Design Hard
341
How would you implement a distributed locking mechanism?
System Design Hard
342
How would you design a social media news feed like Facebook?
System Design Hard
343
How would you design a search autocomplete/typeahead system?
System Design Hard
344
How would you design a ride-sharing system like Uber?
System Design Hard
345
How would you design a payment processing system?
System Design Hard
346
How would you design a distributed task scheduling system?
System Design Hard
347
How would you design a metrics collection and monitoring system?
System Design Hard
348
How would you design a distributed file system like HDFS or GFS?
System Design Hard
349
How would you design a real-time analytics dashboard system?
System Design Hard
350
How would you design a distributed key-value store like DynamoDB?
System Design Hard
351
What are the four pillars of Object-Oriented Programming?
Programming & OOP Easy
352
What is the difference between a class and an object?
Programming & OOP Easy
353
What is the difference between method overloading and method overriding?
Programming & OOP Easy
354
What is the difference between an abstract class and an interface?
Programming & OOP Easy
355
What is the difference between a list and a tuple in Python?
Programming & OOP Easy
356
What does the static keyword mean in Java?
Programming & OOP Easy
357
What is a constructor and what is its purpose?
Programming & OOP Easy
358
What are decorators in Python?
Programming & OOP Easy
359
What is the difference between pass by value and pass by reference?
Programming & OOP Easy
360
What does the final keyword do in Java?
Programming & OOP Easy
361
What is the difference between var, let, and const in JavaScript?
Programming & OOP Easy
362
What is encapsulation and why is it important?
Programming & OOP Easy
363
What is the purpose of 'self' in Python?
Programming & OOP Easy
364
What is the difference between pointers and references in C++?
Programming & OOP Easy
365
What are the different types of inheritance?
Programming & OOP Easy
366
Explain the SOLID principles of object-oriented design.
Programming & OOP Medium
367
How does garbage collection work in Java?
Programming & OOP Medium
368
What are generators in Python and when should you use them?
Programming & OOP Medium
369
How does synchronization work in Java?
Programming & OOP Medium
370
What are smart pointers in C++ and when should you use each type?
Programming & OOP Medium
371
What are closures in JavaScript and how are they used?
Programming & OOP Medium
372
Implement and explain the Singleton design pattern.
Programming & OOP Medium
373
What is the Global Interpreter Lock (GIL) in Python?
Programming & OOP Medium
374
Explain Java Streams API and its key operations.
Programming & OOP Medium
375
What is dependency injection and what are its benefits?
Programming & OOP Medium
376
Explain async/await in Python and when to use it.
Programming & OOP Medium
377
What is RAII in C++ and why is it important?
Programming & OOP Medium
378
Explain Promises and async/await in JavaScript.
Programming & OOP Medium
379
Explain exception handling in Java and best practices.
Programming & OOP Medium
380
When should you prefer composition over inheritance?
Programming & OOP Medium
381
What are metaclasses in Python?
Programming & OOP Medium
382
What are the key concepts of functional programming?
Programming & OOP Medium
383
Explain the Java Memory Model and volatile keyword.
Programming & OOP Medium
384
What are generics in TypeScript and how are they used?
Programming & OOP Medium
385
Explain move semantics in C++11 and when to use them.
Programming & OOP Medium
386
Explain the JVM architecture and class loading mechanism.
Programming & OOP Hard
387
How does Python manage memory and garbage collection?
Programming & OOP Hard
388
Explain common concurrency patterns and their implementations.
Programming & OOP Hard
389
What is template metaprogramming in C++ and what are its applications?
Programming & OOP Hard
390
How would you tune JVM performance for a high-throughput application?
Programming & OOP Hard
391
Explain Python's descriptor protocol and its applications.
Programming & OOP Hard
392
Explain lock-free programming and compare-and-swap operations.
Programming & OOP Hard
393
Explain the C++ memory model and memory ordering constraints.
Programming & OOP Hard
394
Explain the JavaScript event loop and task queues in detail.
Programming & OOP Hard
395
Explain the Visitor, Strategy, and Observer patterns with use cases.
Programming & OOP Hard
396
Explain Python's import system and how modules are loaded.
Programming & OOP Hard
397
Compare static and dynamic typing, and gradual typing systems.
Programming & OOP Hard
398
Explain Java Virtual Threads (Project Loom) and their impact.
Programming & OOP Hard
399
Explain C++20 Concepts and how they improve templates.
Programming & OOP Hard
400
Compare runtime characteristics of JVM, V8, and CPython.
Programming & OOP Hard