# Software Engineeing

- [Special Topics](/unofficialsendoh/c/u.md)
- [Meeting Hours Optimization](/unofficialsendoh/c/u/meeting-hours-optimization.md)
- [3 Ways to Implement Factory Pattern](/unofficialsendoh/c/u/3-ways-to-implement-factory-pattern.md)
- [Implement a Max Heap Using Dynamic Array](/unofficialsendoh/c/u/implementheap.md)
- [Implement Shared Pointer](/unofficialsendoh/c/u/implement-shared-pointer.md)
- [Circular Reference and Weak Pointer](/unofficialsendoh/c/u/circular-reference-and-weak-pointer.md)
- [ID Allocator](/unofficialsendoh/c/u/id-allocator.md)
- [Interview Questions](/unofficialsendoh/c/l.md)
- [Leetcode 2461. Maximum Sum of Distinct Subarrays With Length K](/unofficialsendoh/c/l/leetcode-2461.-maximum-sum-of-distinct-subarrays-with-length-k.md)
- [Leetcode 1891.  Cutting Ribbons](/unofficialsendoh/c/l/leetcode-1891.-cutting-ribbons.md)
- [Leetcode 729. My Calendar I](/unofficialsendoh/c/l/leetcode-729.-my-calendar-i.md)
- [Closest Coin](/unofficialsendoh/c/l/closest-coin.md)
- [Leetcode 1609. Even Odd Tree](/unofficialsendoh/c/l/leetcode-1609.-even-odd-tree.md)
- [Print Folder Structure](/unofficialsendoh/c/l/print-folder-structure.md)
- [Leetcode 1976. Number of Ways to Arrive at Destination](/unofficialsendoh/c/l/leetcode-1976.-number-of-ways-to-arrive-at-destination.md)
- [Leetcode1727. Largest Submatrix With Rearrangements](/unofficialsendoh/c/l/leetcode1727.md)
- [Leetcode 358. Rearrange String k Distance Apart](/unofficialsendoh/c/l/leetcode358.md)
- [Leetcode 1838. Frequency of the Most Frequent Element](/unofficialsendoh/c/l/leetcode1838.md)
- [Leetcode 1557. Minimum Number of Vertices to Reach All Nodes](/unofficialsendoh/c/l/leetcode1557.md)
- [Leetcode 370. Range Addition](/unofficialsendoh/c/l/leetcode370.md)
- [Leetcode 706. Design Hashmap](/unofficialsendoh/c/l/leetcode706.md)
- [Leetcode 1060. Missing Element in Sorted Array](/unofficialsendoh/c/l/leetcode1060.md)
- [Leetcode 1055. Shortest Way to Format String](/unofficialsendoh/c/l/leetcode1055.md)
- [Leetcode 300. Longest Increasing Subsequence](/unofficialsendoh/c/l/leetcode300.md)
- [Leetcode 1143. Longest Common Subsequence](/unofficialsendoh/c/l/leetcode1143.md)
- [Leetcode 1249. Minimum Remove to Make Valid Parentheses](/unofficialsendoh/c/l/leetcode1249.md)
- [Leetcode 416. Partition Equal Subset Sum](/unofficialsendoh/c/l/leetcode416.md)
- [Leetcode 465. Optimal Account Balancing](/unofficialsendoh/c/l/leetcode465.md)
- [Leetcode 715. Range Module](/unofficialsendoh/c/l/leetcode715.md)
- [Leetcode 684. Redundant Connection](/unofficialsendoh/c/l/leetcode684.md)
- [Leetcode 426. Convert Binary Search Tree to Sorted Doubly Linked list](/unofficialsendoh/c/l/leetcode426.md)
- [Leetcode 1110. Delete Nodes And Return Forest](/unofficialsendoh/c/l/leetcode1110.md)
- [Leetcode 1168. Optimize Water Distribution in a Village](/unofficialsendoh/c/l/leetcode1168.md)
- [Leetcode 971. Flip Binary Tree To Match Preorder Traversal](/unofficialsendoh/c/l/leetcode971.md)
- [Leetcode 675. Cut Off Trees for Golf Event](/unofficialsendoh/c/l/leetcode675.md)