---
title: "#competitiveprogramming articles | Hashnode"
description: "Explore 4 articles tagged #competitiveprogramming on Hashnode. Tutorials, guides, and how-tos from the community."
url: "https://hashnode.com/tag/competitiveprogramming"
---

Tag

# #competitiveprogramming

4 posts · 0 followers

[Anshul](https://hashnode.com/@geekyyanshul) · [Jan 27](https://hashnode.com/posts/codechef-premium-review-is-it-worth-it-and-how-to-get-it-cheaper/69791eecdc5c331136d8f4c3)

### [CodeChef Premium Review: Is It Worth It and How to Get It Cheaper](https://geekyyanshul.hashnode.dev/codechef-premium-review-is-it-worth-it-and-how-to-get-it-cheaper?utm_source=hashnode&utm_medium=feed)

This article is a personal CodeChef Premium review where I share whether CodeChef Premium is worth it and how you can use a CodeChef Premium coupon code to

3 min read · [geekyyanshul.hashnode.dev](https://geekyyanshul.hashnode.dev/codechef-premium-review-is-it-worth-it-and-how-to-get-it-cheaper?utm_source=hashnode&utm_medium=feed)

[Arka Infotech](https://hashnode.com/@arkainfotech) · [Jan 11, 2025](https://hashnode.com/posts/treap-data-structure-combining-bsts-and-heaps/678241c869a098a8b146cd3f)

### [Treap Data Structure: Combining BSTs and Heaps](https://blogs.arkainfotech.in/treap-data-structure-combining-bsts-and-heaps?utm_source=hashnode&utm_medium=feed)

Explore the Treap data structure, a hybrid of Binary Search Trees and Heaps, featuring properties, operations, and Python implementation

6 min read · [blogs.arkainfotech.in](https://blogs.arkainfotech.in/treap-data-structure-combining-bsts-and-heaps?utm_source=hashnode&utm_medium=feed)

[Arka Infotech](https://hashnode.com/@arkainfotech) · [Jan 11, 2025](https://hashnode.com/posts/fenwick-tree-vs-segment-tree-which-one-to-use/678207f98a97f974a8cd923d)

### [Fenwick Tree vs Segment Tree: Which One to Use?](https://blogs.arkainfotech.in/fenwick-tree-vs-segment-tree-which-one-to-use?utm_source=hashnode&utm_medium=feed)

Compare Fenwick Trees and Segment Trees for range query problems, highlighting their differences in performance, use cases, and complexity

8 min read · [blogs.arkainfotech.in](https://blogs.arkainfotech.in/fenwick-tree-vs-segment-tree-which-one-to-use?utm_source=hashnode&utm_medium=feed)

[Arka Infotech](https://hashnode.com/@arkainfotech) · [Jan 11, 2025](https://hashnode.com/posts/euler-tour-technique-for-tree-problems/67822178775a84088f600c53)

### [Euler Tour Technique for Tree Problems](https://blogs.arkainfotech.in/euler-tour-technique-for-tree-problems?utm_source=hashnode&utm_medium=feed)

Learn the Euler Tour Technique to efficiently solve tree problems like LCA queries and subtree queries with examples and code implementation

7 min read · [blogs.arkainfotech.in](https://blogs.arkainfotech.in/euler-tour-technique-for-tree-problems?utm_source=hashnode&utm_medium=feed)
