Write a program takes in a string and a delimiter, and uses that delimiter to split a string and then will reverse the characters in every word (or jumble of characters between the delimiters), stuffing them back into a string when finished. ('The dog walks' becomes..... 'ehT god sklaw')
Given a binary tree, how would you set the keys/values of all the nodes and their child pointers to null. No language restriction. Do it iteratively in O(N) time with O(1) space complexity where N is the number of nodes in the tree. Other Details: - Tree is just a regular Binary Tree and doesn't have the BST property. - It is not guaranteed to be balanced. - You may do whatever you want to the tree however, you must ensure that all the nodes in the tree and their left/right pointers are set to null.
Divide two numbers without using / or % and return quotient.
Check if tic-tac-toe has a winner
In a BST write a program to find 2 nodes x and y such that X+y=k
find duplicated item from an array, output the duplicated item with their times
Write a function to find the maximum sum of sub array where the array can have negative and positive numbers.
According to you what is a good code?
In a sequence of alphabets (like aaabbddaabbcc) write a program to find the number of the consecutive alphabets in and print the alphabet and number. example :if input is aaabbddaabbcc then output should be 3a, 2b, 2d, 2a, 2b, 2c
Given an int array, find the sequence of elements that has the largest sum
Viewing 11 - 20 interview questions