Tag :: Advanced

A

• AVL tree in C: solved exercise with basic rotations

  Learn C — solved exercises > Exercises > Data structures

B

• BFS in C: solved exercise

  Learn C — solved exercises > Exercises > Data structures

• Binary tree in C: solved insertion and search exercise

  Learn C — solved exercises > Exercises > Data structures

• Bitfields in C: solved exercise for compact flags

  Learn C — solved exercises > Exercises > Structs & files

• Bucket sort in C: solved exercise

  Learn C — solved exercises > Exercises > Algorithms

C

• Classes in C with struct: solved modular design exercise

  Learn C — solved exercises > Exercises > Structs & files

D

• Delete a node from a singly linked list in C: solved exercise

  Learn C — solved exercises > Exercises > Data structures

• DFS in C: solved exercise

  Learn C — solved exercises > Exercises > Data structures

• Dijkstra in C: solved exercise

  Learn C — solved exercises > Exercises > Algorithms

• Double free in C: solved exercise to avoid memory corruption

  Learn C — solved exercises > Exercises > Pointers & memory

E

• Error handling with errno in C: solved exercise

  Learn C — solved exercises > Exercises > Structs & files

G

• Graph adjacency list in C: solved exercise

  Learn C — solved exercises > Exercises > Data structures

H

• Hash table in C: solved exercise with chaining

  Learn C — solved exercises > Exercises > Data structures

• Heap sort in C: solved exercise with max heap

  Learn C — solved exercises > Exercises > Algorithms

• Height of a binary tree in C: solved exercise

  Learn C — solved exercises > Exercises > Data structures

I

• In-order traversal of a binary tree in C: solved exercise

  Learn C — solved exercises > Exercises > Data structures

• Inheritance in C: solved exercise with composition and pointers

  Learn C — solved exercises > Exercises > Structs & files

• Insert into a sorted linked list in C: solved exercise

  Learn C — solved exercises > Exercises > Data structures

• Interpolation search in C: solved exercise

  Learn C — solved exercises > Exercises > Algorithms

M

• Maximum subarray (Kadane) in C: solved exercise

  Learn C — solved exercises > Exercises > Algorithms

• Merge sort in C: solved exercise with divide and conquer

  Learn C — solved exercises > Exercises > Algorithms

• Min-heap in C: solved exercise

  Learn C — solved exercises > Exercises > Data structures

P

• Priority queue in C: solved exercise

  Learn C — solved exercises > Exercises > Data structures

Q

• Quicksort in C: solved exercise with Lomuto partition

  Learn C — solved exercises > Exercises > Algorithms

R

• Radix sort in C: solved exercise

  Learn C — solved exercises > Exercises > Algorithms

• Reverse a linked list in C: solved exercise

  Learn C — solved exercises > Exercises > Data structures

S

• Shell sort in C: solved exercise step by step

  Learn C — solved exercises > Exercises > Algorithms

• Sieve of Eratosthenes in C: solved exercise

  Learn C — solved exercises > Exercises > Algorithms

T

• Trie in C: solved exercise

  Learn C — solved exercises > Exercises > Data structures

V

• Void pointer in C: solved exercise

  Learn C — solved exercises > Exercises > Pointers & memory