Index for Coding Problems
Master index of all coding problems covered on GyanByte — sorted by category: sorting, data structures, trees, graphs, arrays, strings, and LeetCode solutions.
The Archive of
Intentional Thought
Technical essays, architectural deep-dives, and practical guides at the intersection of code and design.
Page 22 of 28
What is Heap Data Structure
What a heap data structure is, how it's stored as an array, and the difference between max-heap and min-heap properties with parent-child index math.
Principles of Software Designing
Core software design principles — encapsulation, programming to interfaces, composition over inheritance, loose coupling, and SOLID — explained with practical examples.
Python 3 - Magical Methods and Tricks with extremely useful methods
A collection of useful Python 3 tricks and magical methods for writing concise and elegant code.
Git shortcuts - Helpful shortcuts for git users
A collection of useful GitHub web shortcuts that boost productivity when navigating repositories.
How to nail your Coding Interview
Tips for during the coding interview — how to approach problems, communicate with your interviewer, and avoid common mistakes.
Maximum Subarray Problem
Find the contiguous subarray with the maximum sum using divide-and-conquer and Kadane's algorithm, with time complexity analysis.
Quick Sort Algorithm
Learn Quick Sort — pick a pivot, partition the array so smaller elements go left and larger go right, then recurse. Includes Java code and complexity analysis.
Counting Inversions Coding Problem
Count the number of inversions in an array — pairs where a larger element appears before a smaller one. Solved using a modified merge sort.
Merge Sort Algorithm
Learn Merge Sort — a divide-and-conquer algorithm that splits the array into halves, sorts each recursively, then merges them back. Includes Java code.
Bubble Sort Algorithm
Learn how Bubble Sort works — repeatedly compare and swap adjacent elements to bubble the largest to the end. Includes Java code and complexity analysis.
Coding Interview - Useful Terms Cheatsheet
Quick reference for coding interview terms — Big-O notation, time vs space complexity, stable vs unstable sorts, in-place algorithms, and common complexity classes.