Jan 27 · 3 min read · My Experience with CodeChef Premium (and How You Can Get It Cheaper) "Which problem should I solve next?"If you've ever opened CodeChef and felt overwhelmed about what to practice, you're not alone. I was caught in the same cycle — tackling random pr...
Join discussionJan 11, 2025 · 6 min read · Introduction The Treap is a fascinating hybrid data structure that combines the properties of a Binary Search Tree (BST) and a Heap. It is designed to maintain both the binary search property of BSTs and the heap property based on priorities. This du...
Join discussion
Jan 11, 2025 · 8 min read · Introduction In the world of data structures, Fenwick Trees and Segment Trees are two powerful tools used to solve range query problems efficiently. Both are designed to perform fast updates and queries on an array, but they differ significantly in t...
Join discussion
Jan 11, 2025 · 7 min read · Introduction Trees are one of the most fundamental data structures in computer science. They are widely used to represent hierarchical structures, such as organizational charts, file systems, and network routing tables. One of the most powerful techn...
Join discussion