Computer Science Challenges

  1. Review of Linked Lists
    2. A quick review of linked lists in preparation for the exercises
  2. Stack Implementation in C using a Linked List
    3. Design and implementation of a stack in C
  3. Linked List Remove Function
    4. Implementation of the remove function of a linked list in C
  4. Find the Bugs in Linked List Remove Head Function
    5. Fix the bugs in a given function in C
  5. Mth to last Element of a Linked List
    6. Challenge to design a function retrieving the mth to last element of a linked list
  6. List Flattening and Unflattening Brain Teaser
    7. Brain teaser designed to test your skills at handling linked lists C
  7. Cyclic or Acyclic Linked List
    8. Write a function to determine if a linked list is cyclic or acyclic
  8. Binary Search Tree: Find (Lookup) Method
    9. Recursive and non-recursive implementations of the lookup method of a binary search tree
  9. Binary Tree Traversal
    10. Implementation of binary tree traversal algorithms (preorder, postorder, inorder) recursively and non-recursively in Java
  10. Lowest Common Ancestor in a BST
    11. CS challenge to find the lowest common ancestor node of two given nodes in a binary search tree
  11. First Non-Repeated Character in a String
    12. Write a function that finds the first non-repeated character in a given string
  12. Delete Characters from String
    13. Write a function in Java/C# that deletes specific characters from a string.
  13. Reverse Word Order in a String Challenge
    14. Write an efficient function that reverses the words in a strong (common interview problem).
  14. Convert a String to an Integer in Java
    15. Write a method in Java that converts a String to its int representation.
  15. Convert an Integer to a String in Java
    16. Write a method in Java that converts an int to its String representation.
  16. Permutations of a String
    17. Write a method that prints out all the permutations of the characters in a string.
  17. Combinations of a String
    18. Write a method that prints out all the combinations of the characters in a string.