Echo's Home

234. Palindrome Linked List

Description

Difficulty: Easy

25. Reverse Nodes in k-Group

Description

Difficulty: Hard

Designing Data-Intensive Applications

• Reliable, scalable, and maintainable applications
  • Reliability
  • Scalability
  • Maintainability
• Data models and query language
  • Relational model vs document model
  • Query languages for data
  • Graph-like data models
• Storage and retrieval
  • Data structures that power up your database
  • Transaction processing or analytics?
  • Column-oriented storage
• Encoding and evolution
  • Formats for encoding data
  • Modes of dataflow
• Replication
  • Leaders and followers
  • Problems with replication lag
  • Multi-leader replication
  • Leaderless replication
• Partitioning
  • Partitioning and replication
  • Partition of key-value data
  • Partitioning and secondary indexes
  • Rebalancing partitions
  • Request routing
• Transactions
  • The slippery concept of a transaction
  • Weak isolation levels
  • Serializability
• The trouble with distributed systems
  • Faults and partial failures
  • Unreliable networks
  • Unreliable clocks
  • Knowledge, truth and lies
• Consistency and consensus
  • Consistency guarantees
  • Linearizability
  • Ordering guarantees
  • Distributed transactions and consensus
• Batch processing
  • Batch processing with Unix tools
  • Map reduce and distributed filesystems
  • Beyond MapReduce
• Stream processing
  • Transmitting event streams
  • Databases and streams
  • Processing Streams
• The future of data systems
  • Data integration
  • Unbundling databases
  • Aiming for correctness
  • Doing the right thing

Reliable, scalable, and maintainable applications

92. Reverse Linked List II

Description

Difficulty: Medium

206. Reverse Linked List

Description

Difficulty: Easy

160. Intersection of Two Linked Lists

Description

Difficulty: Easy

142. Linked List Cycle II

Description

Difficulty: Medium

141. Linked List Cycle

Description

Difficulty: Easy

876. Middle of the Linked List

Description

Difficulty: Easy

19. Remove Nth Node From End of List

Description

Difficulty: Medium