How to Pass the FE

Copyright © 2025 FE Prep

Developer Contacts

Study Plan - FE 100 - Crash Course

Ace Foundation Exam with 100 Qs

FE 100 - Crash Course

These were picked in a specific order to make learning easier, so I'd recommend sticking with it. Aim for 1-3 problems a day, and if you make it through the whole set, you'll be ready to pass the FE!

Dynamic Memory Management

Delete Dynamically Allocated TV Show List

Allocate and Initialize Juice Case Struct

Free Dynamic Array of Structs in C

Fix Linked List Memory Leak in C

Dynamic Employee Array Creation in C

Deallocate Memory for Book Structures

Dynamic Employee Array Memory Management

Dynamic Triangular Sum Calculation

Deep Copy 1980s Video Games Inventory

Linked Lists

Transform Linked List to Prefix Sum List

Convert Singly Linked List to Circular List

Convert Linked List to C String

Alternate Characters from Linked Lists

Check All Even in Linked List Recursively

Move Head Node to Second Last in Linked List

Delete Node from Doubly Linked List

Insert Node with Value 3 in Sorted Linked List

Swap Consecutive Nodes in Linked List

Stacks

Trace Stack Operations

Evaluate Postfix Expression 3

Infix to Postfix Evaluation 9

Palindrome Check Using Stack Operations

Valid Moves in Towers of Hanoi Using Stacks

Stack-Based Scoring Game with Sum Rules

Queues

Traffic Light Simulation Using Queues

Superhero Queue Simulation

Implement Add to Front in Deque Using Linked List

Implement Circular Queue Dequeue Function

Trace Circular Queue Operations

Binary Trees

Binary Tree Traversal and BST Validation

Recursive Postorder Traversal of Binary Tree

Sum Single Child Nodes in Binary Tree

Recursive Height Assignment in Binary Tree

Find Smallest Leaf in Binary Tree

Hashing

Quadratic Probing in Hash Table Insertion

Linear Probing with Flawed Hash Function

Quadratic Probing Hash Table Insertion

Determine Hash Indices for Banana

Quadratic Probing with Custom String Hashing

Heaps

MaxHeap Insertion Steps with Tree and Array

Minheap Insertion and Deletion Operations

Calculate Heap Height and Insert in Max-Heap

Heapsort Using Binary MinHeap in C

Non-Recursive Min-Heap Verification

Tries

Trie Node Count and AVL Tree Rotation

Trie Node Count and Deletion Challenge

Count Nodes in Trie After Word Insertion

Longest Prefix Match in Trie

Count Five Letter Words in a Trie

AVL Trees

AVL Tree Insertion and Deletion Balancing

Insert Element and Analyze AVL Tree Runtimes

AVL Tree Deletion and Double Rebalance

Insert and Balance AVL Tree with 48

AVL Tree Insertion and Rebalancing

Recursion

Recursive Count Down to One

Recursive Trailing Zeros in Factorial

Recursive Grid Virus Spread Activation

Recursive Frog Escape from Well

Recursive Sum of Even Numbers in Range

Count Even Numbers in Array Range Recursively

Recursive Leaf Removal in Binary Trees

Recursive Tic-Tac-Toe Win Checker

Sorting

Trace Selection Sort Iterations

Merge Sort Array State Before Final Merge

Iterative Insertion Sort and Complexity Analysis

Count Bubble Sort Swaps for Given Array

Implement One of Three Basic Sorting Algorithms

Sort Students by Last Name First Name ID

Stable Quicksort on Linked List with Blanks

Identify Sorting Algorithm from First Pass

Implement Merge Function for Merge Sort

Algorithm Analysis

Array Processing Time Calculation

Calculate Milliseconds for Logarithmic Search

Calculate Runtime for Scaled Input Size

Big O Analysis with Max(N M)

Runtime Analysis of Binary Search Halving

Recursive Array Analysis with Divide and Conquer

Analyze Recursive Hash Function Runtime

Two-Stack Queue Run-Time Analysis

Analyze Big O Complexity of Nested Loops

Summations

Evaluate and Simplify Nested Summations

Closed Form Solution for Summation of 2i 5

Closed Form Sum of Linear Sequence

Factor Nested Summation into Closed Form

Simplify Summation of Half Integer Series

Recurrence Relations

Closed Form for Recursive Division by Four

Iterative Big-Oh Analysis of Recurrence Relation

Find Big-Oh for Recursive 2T(n / 2) + n3 Using Iteration

Solve Recurrence 2T(n-1) + 5

Summation Proof Without Arithmetic Formula

Base Conversions

Hex to Binary Birthday Puzzle

Convert Decimal 375 to Binary

Base 8 to 16 Conversion Challenge

Convert 32456 to Hexadecimal Form

Master Base Conversion Techniques

Bitwise Operators

Evaluate Expressions Using C Bitwise Operators

Evaluate Bitwise Expressions in C

NIM Game Winning Strategy with XOR

Employee Drive Access with Bitwise Codes

Paint Fence with Bitwise Shifts