CareerCup

Write a program to return nearest elements from a binary search tree for input element.

There is a dictionary already implemented. Write a method , which takes input String without space, to replace the characters from the strings which are not present in dictionary with –

Example: Dictionary – a*
………….Input- aaabaa
………….Output- aaa_aa

There is a dictionary already implemented. Write a method, which takes input String without space, to prints all subsets of the input string which is present in dictionary.
Example: Dictionary – a*
………….Input- aaabaa
………….Output- a,a,a,aa,aa,aaa,a,a,aa

Given 2 sorted linked lists, return a linked list that has all the elements and is sorted.

Given 3 strings "s" ssearch" and "sreplace", search string s for the substring ssearch and for every instance of ssearch you find, replace that part of the string with sreplace

Given an NxN Boolean matrix, find how many true regions there are in the matrixj

Create a basic minesweeper game that allows for board creation with custom height, width and number of mines. Create a <click> function that will take in a board location and return whether the user has won, lost, or the number of surrounding mines.

Given a string, print out all of the unique characters and the number of times it appeared in the string

Given a singly linked list of integers, write a function in java that returns true if the given list is palindrome, else returns false

Convert an unordered tree to a binary tree

merge two binary search trees

Sort a stack using only one other stack and no recursion.