Unofficial Sendoh
  • Introduction
  • 中文介绍
  • AI DOMAIN
    • Machine Learning
      • Implement Binary Cross Entropy Loss
      • Implement Batch Normalization By Computational Graph
      • Implement Activation Layer in Deep Neural Network
      • Implement Dropout Layer in Deep Neural Network
      • Implement Forward and Backward Propagation for Fully Connected Layer in Deep Neural Network
    • Big Data
      • Join Pattern by PySpark
      • HackerRank MapReduce - Word Counts
      • Install PySpark on Google Colab / Ubuntu and Solve Word Count
      • Spark v.s Map Reduce and Summarization Pattern
      • Lintcode 556. Standard Bloom Filter
      • PySpark Fundamentals and Implement Top Ten Pattern
      • Dataframe and Partitioning Pattern by PySpark
    • Math Fundamentals
      • Probabilistic Fundamental and Interview Questions
      • Estimation Fundamentals and Interview Questions - MLE and MAP
      • Leetcode 710. Random Pick with Blacklist
    • CUDA Programming
      • Setup CUDA in google collab and an intro example
      • Thread Cooperation and Solution of Vector Dot Product
      • CUDA Events and Streams
      • CUDA Atomics
  • Software Engineeing
    • Special Topics
      • Meeting Hours Optimization
      • 3 Ways to Implement Factory Pattern
      • Implement a Max Heap Using Dynamic Array
      • Implement Shared Pointer
      • Circular Reference and Weak Pointer
      • ID Allocator
    • Interview Questions
      • Leetcode 2461. Maximum Sum of Distinct Subarrays With Length K
      • Leetcode 1891. Cutting Ribbons
      • Leetcode 729. My Calendar I
      • Closest Coin
      • Leetcode 1609. Even Odd Tree
      • Print Folder Structure
      • Leetcode 1976. Number of Ways to Arrive at Destination
      • Leetcode1727. Largest Submatrix With Rearrangements
      • Leetcode 358. Rearrange String k Distance Apart
      • Leetcode 1838. Frequency of the Most Frequent Element
      • Leetcode 1557. Minimum Number of Vertices to Reach All Nodes
      • Leetcode 370. Range Addition
      • Leetcode 706. Design Hashmap
      • Leetcode 1060. Missing Element in Sorted Array
      • Leetcode 1055. Shortest Way to Format String
      • Leetcode 300. Longest Increasing Subsequence
      • Leetcode 1143. Longest Common Subsequence
      • Leetcode 1249. Minimum Remove to Make Valid Parentheses
      • Leetcode 416. Partition Equal Subset Sum
      • Leetcode 465. Optimal Account Balancing
      • Leetcode 715. Range Module
      • Leetcode 684. Redundant Connection
      • Leetcode 426. Convert Binary Search Tree to Sorted Doubly Linked list
      • Leetcode 1110. Delete Nodes And Return Forest
      • Leetcode 1168. Optimize Water Distribution in a Village
      • Leetcode 971. Flip Binary Tree To Match Preorder Traversal
      • Leetcode 675. Cut Off Trees for Golf Event
Powered by GitBook
On this page

Was this helpful?

  1. Software Engineeing

Special Topics

Meeting Hours Optimization3 Ways to Implement Factory PatternImplement a Max Heap Using Dynamic ArrayImplement Shared PointerCircular Reference and Weak PointerID Allocator
PreviousCUDA AtomicsNextMeeting Hours Optimization

Last updated 3 years ago

Was this helpful?