DataStructures – do: code; while(true)

Check permutations of a string for palindromes

Problem: Given a string, check if any permutations of that string are a palindrome Solution 1: Use a hashtable to count each time a character is used

Problem: Implement a queue using stacks. Solution 1: Use a helper stack

Problem: Implement a stack using queues. Solution 1: Use a helper queue

Problem: Get the height of a binary tree. Solution 1: Iterate Solution 2: Recursive

Problem: Traverse a given binary tree, depth first. Solution 1: Iterate via a Stack

Problem: Traverse a given binary tree, breadth first. Solution 1: Iterate via a Queue

Design a site like this with WordPress.com