--- title: "Anubhav Kumar Gupta (@anubhav2103) | Hashnode" description: "馃殌 Data Engineer | Python, PySpark & SQL | Problem Solver | Tech Blogger. Read the latest articles by Anubhav Kumar Gupta on Hashnode." url: "https://hashnode.com/@anubhav2103" --- @anubhav2103 # Anubhav Kumar Gupta @anubhav2103 路 Bangalore, India 路 Joined August 2024 馃殌 Data Engineer | Python, PySpark & SQL | Problem Solver | Tech Blogger ### [馃殌 Mastering SQL Performance Optimization: The Ultimate Guide for Faster Queries 鈿(https://anubhav2103.hashnode.dev/mastering-sql-performance-optimization-the-ultimate-guide-for-faster-queries?utm_source=hashnode&utm_medium=feed) Optimize SQL queries with smarter data fetching, filtering, and indexing for faster, more efficient performance 3 min read 路 [anubhav2103.hashnode.dev](https://anubhav2103.hashnode.dev/mastering-sql-performance-optimization-the-ultimate-guide-for-faster-queries?utm_source=hashnode&utm_medium=feed) [Apr 24, 2025](https://hashnode.com/posts/mastering-sql-performance-optimization-the-ultimate-guide-for-faster-queries/68fae814c49e1df725354c4c) ### [Red-Black Trees.](https://anubhav2103.hashnode.dev/red-black-trees?utm_source=hashnode&utm_medium=feed) A Self-Balancing Binary Search Tree Introduction: A red-black tree is a type of self-balancing binary search tree where each node includes an extra bit, often interpreted as its color: red or black. These colors help maintain the tree鈥檚 balance dur... 4 min read 路 [anubhav2103.hashnode.dev](https://anubhav2103.hashnode.dev/red-black-trees?utm_source=hashnode&utm_medium=feed) [Jan 15, 2025](https://hashnode.com/posts/red-black-trees/678d434e2aba8aaca0afaf7f) ### [Python Interview Question.](https://anubhav2103.hashnode.dev/python-interview-question?utm_source=hashnode&utm_medium=feed) 饾棔饾棶饾榾饾椂饾棸: 饾棢饾棶饾槅饾椂饾椈饾棿 饾榿饾椀饾棽 饾棛饾椉饾槀饾椈饾棻饾棶饾榿饾椂饾椉饾椈. 1. What is Python, and its key features? Python is a General purpose, High Level programming language that is easy to read and write. It鈥檚 popular for its simplicity, flexibility, and a large col... 6 min read 路 [anubhav2103.hashnode.dev](https://anubhav2103.hashnode.dev/python-interview-question?utm_source=hashnode&utm_medium=feed) [Jan 11, 2025](https://hashnode.com/posts/python-interview-question/6791be2223d91642a8d8ed88) ### [Radix Sort.](https://anubhav2103.hashnode.dev/radix-sort?utm_source=hashnode&utm_medium=feed) A Unique Linear-Time Sorting Algorithm Sorting algorithms are essential in computer science, allowing us to organize data efficiently. While many popular sorting algorithms like Merge Sort, Heap Sort, and Quick Sort are comparison-based and have a lo... 4 min read 路 [anubhav2103.hashnode.dev](https://anubhav2103.hashnode.dev/radix-sort?utm_source=hashnode&utm_medium=feed) [Jan 7, 2025](https://hashnode.com/posts/radix-sort/678dcb05198a9395d5a59699) ### [SQL Self-Joins with Examples](https://anubhav2103.hashnode.dev/sql-self-joins-with-examples?utm_source=hashnode&utm_medium=feed) After learning about different joins, it鈥檚 now time to dive into self-joins! At first glance, self-joins might sound complicated, but they鈥檙e not. Think of it as a table joining itself, like a table of Amazon transactions comparing itself for insight... 4 min read 路 [anubhav2103.hashnode.dev](https://anubhav2103.hashnode.dev/sql-self-joins-with-examples?utm_source=hashnode&utm_medium=feed) [Dec 31, 2024](https://hashnode.com/posts/sql-self-joins-with-examples/6778f937d7e001c836faf5b3)