Easy-level Solana interview questions covering blockchain basics, programs, and development. Q1: What is Solana and how does it work? Answer: Solana is a high-performance blockchain designed for scalability. graph TB A[Solana] --> B[Proof of History<br/>PoH] A --> C[Tower BFT<br/>Consensus] A --> D[Gulf …

Hard-level Solana interview questions covering advanced optimization, security, and complex program design. Q1: How do you implement advanced account compression and state optimization? Answer: State Compression: 1// Use Merkle trees for state 2use merkle_tree::MerkleTree; 3 4pub struct CompressedState { 5 tree: …

Medium-level Solana interview questions covering advanced program development, optimization, and architecture. Q1: How do you implement cross-program invocations (CPIs)? Answer: CPI Basics: 1use solana_program::{ 2 program::invoke, 3 account_info::AccountInfo, 4}; 5 6pub fn call_other_program( 7 program_id: &Pubkey, 8 …

Solana consensus algorithm interview questions covering Proof of History (PoH) combined with Proof of Stake. Q1: How does Solana Proof of History (PoH) consensus work? Answer: Solana uses a unique consensus mechanism combining Proof of History (PoH) with Proof of Stake (PoS). PoH provides a cryptographic timestamp for …

Tendermint consensus algorithm interview questions covering the Byzantine Fault Tolerant consensus used in Cosmos chains. Q1: How does Tendermint consensus work? Answer: Tendermint is a Byzantine Fault Tolerant consensus algorithm used in Cosmos chains. Sequence Diagram: sequenceDiagram participant Proposer participant …

Easy-level Web3 interview questions covering blockchain fundamentals, Ethereum, smart contracts, and decentralized applications. Q1: What is blockchain and how does it work? Answer: graph TB A[Blockchain] --> B[Distributed<br/>Ledger] A --> C[Immutable<br/>Records] A --> D[Cryptographic<br/>Hashing] A --> …

Hard-level Web3 interview questions covering MEV, zero-knowledge proofs, advanced DeFi, and protocol design. Q1: Explain MEV (Maximal Extractable Value) and mitigation strategies. Answer: graph TB A[MEV] --> B[Front-Running<br/>See tx, submit before] A --> C[Back-Running<br/>Submit after] A --> D[Sandwich …

Medium-level Web3 interview questions covering DeFi, advanced Solidity, security, and protocol design. Q1: Explain DeFi and common DeFi protocols. Answer: graph TB A[DeFi<br/>Decentralized Finance] --> B[Lending/Borrowing<br/>Aave, Compound] A --> C[DEX<br/>Uniswap, Curve] A --> D[Stablecoins<br/>DAI, USDC] A --> …

Easy-level AI/ML interview questions with LangChain examples and Mermaid diagrams. Q1: What is the difference between supervised and unsupervised learning? Answer: graph TB subgraph Supervised["🎯 Supervised Learning"] A1[Labeled Data<br/>X, y pairs] --> B1[Train Model] B1 --> C1[Predict y<br/>for new X] style A1 …

Hard-level AI/ML interview questions covering advanced architectures, optimization, and theoretical concepts. Q1: Implement attention mechanism from scratch. Answer: How It Works: Attention allows model to focus on relevant parts of input when producing output. Core Idea: Compute weighted sum of values, where weights …

Medium-level AI/ML interview questions covering neural networks, ensemble methods, and advanced concepts. Q1: Explain backpropagation in neural networks. Answer: How It Works: Backpropagation is the algorithm for training neural networks by computing gradients of the loss with respect to weights. Forward Pass: Input …

Easy-level software architecture interview questions covering fundamental patterns, principles, and concepts. Q1: Explain the difference between monolithic and microservices architecture. Answer: Monolithic Architecture Definition: Single unified application where all components are tightly coupled and deployed …

Hard-level software architecture interview questions covering advanced distributed systems, consensus, and complex patterns. Q1: Explain distributed consensus algorithms (Raft, Paxos). Answer: Problem: How do multiple nodes agree on a value in presence of failures? graph TB subgraph Raft["Raft Consensus"] L[Leader] --> …