## [f]izzbuzzer

### Looking for good programming challenges?

Use the search below to find our solutions for selected questions!

# Archive for September 2019

### Partition List

Problem Statment Given a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x. You should preserve the original relative order of the nodes in each of the two partitions. Example Input: head = 1->4->3->2->5->2, x . . . Read more

### Implement strStr()

Problem Statement Implement strStr(). Return the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack. Input: haystack = “hello”, needle = “ll” Output: 2 Solution

### Remove Element

Problem Statement Given an array nums and a value val, remove all instances of that value in-place and return the new length. Do not allocate extra space for another array, you must do this by modifying the input array in-place with O(1) extra memory. The order of elements can be . . . Read more

### Remove Duplicates from Sorted Array

Problem StatementGiven a sorted array nums, remove the duplicates in-place such that each element appear only once and return the new length. Do not allocate extra space for another array, you must do this by modifying the input array in-place with O(1) extra memory. Given nums = [0,0,1,1,1,2,2,3,3,4], Your function . . . Read more