Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

Getting Deep into Complex Algorithms for Interviews with PHP

Go to class Write review

Overview

In this course, you'll delve deeply into algorithms and data structures, which are key topics in technical interviews. You'll tackle problems involving linked lists, binary trees, dynamic programming, and graph algorithms. Understanding these advanced topics will equip you with the tools needed to solve complex problems efficiently.

Syllabus

Unit 1: Linked List Operations in PHP

Determine if a Linked List is a Palindrome
Swap Nodes in a Singly Linked List
Remove Duplicates from Unsorted Linked List
Rotate Linked List to the Right with K Places in PHP
Detect Cycle in Linked List

Unit 2: Binary Tree Traversals in PHP

Postorder Traversal of a Binary Tree
Preorder Traversal Algorithm in PHP
Second Smallest Node in Binary Tree
Reverse a Binary Tree in PHP
Check if a Binary Tree is a Binary Search Tree

Unit 3: Dynamic Programming Basics in PHP

Factorial Calculation Using Dynamic Programming in PHP
Climbing Stairs Distinct Ways Calculation
Transform Zero to N
Coin Change Problem in PHP
Minimal Number of Perfect Squares

Unit 4: Graph Algorithms Implementation: Breadth-First Search (BFS) in PHP

Shortest Path in City Network Using BFS
Find Vertices Within a Certain Distance in a Graph
Calculating Minimal Strides with Obstacles using BFS in PHP
Shortest Path in Binary Matrix Using BFS
Knight's Minimum Moves on a Chessboard

Unit 5: Advanced Recursion Techniques in PHP

Generate All Unique Permutations Using Backtracking in PHP
All Combinations of String Characters
Generate Correct Parentheses Combinations
All Possible Letter Case Combinations
Word Game Combinations in PHP

Reviews

Start your review of Getting Deep into Complex Algorithms for Interviews with PHP