1. # LeetCode in Swift: Word Search

Problem Statement Given a 2D board and a word, find if the word exists in the grid. The word can be constructed from letters of sequentially adjacent cell, where “adjacent” cells are those horizontally or vertically neighboring. The same letter cell may not be used more than once. For example, Given board =

2. # LeetCode in Swift: Binary Tree Preorder Traversal

Problem Statement Given a binary tree, return the preorder traversal of its nodes’ values. For example: Given binary tree {1,#,2,3},

return [1,2,3]. Note: Recursive solution is trivial, could you do it iteratively? Original LeetCode problem page My Solution in Swift Continue reading...

3. # LeetCode in Swift: Binary Tree Inorder Traversal

Problem Statement Given a binary tree, return the inorder traversal of its nodes’ values. For example: Given binary tree {1,#,2,3},

return [1,3,2]. Note: Recursive solution is trivial, could you do it iteratively? Original LeetCode problem page My Solution in Swift Continue reading...

4. # LeetCode in Swift: Binary Tree Postorder Traversal

Problem Statement Given a binary tree, return the postorder traversal of its nodes’ values. For example: Given binary tree {1,#,2,3},

return [3,2,1]. Note: Recursive solution is trivial, could you do it iteratively? Original LeetCode problem page My Solution in Swift Continue reading...