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 string, konylabsinterview write a program to return bool if a given pattern matches.pattern example - kon*lab*terview*
Difficult to answer in short and first time attempt.
Not difficult. It is like why can not compare two strings. And how to compare one object which initialed as a string with string. The coding quesition is to find the kth in two sorted arrays.
First explain what a tree, then binary tree, then a binary search tree is. Now implement a function that verifies whether a binary tree is a valid binary search tree.
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.
1) 6 hours problem - Walls and Guards, use triple loop as a solutions and matrix. 2) Live coding question - 3 boxes with apples, oranges and apple and oranges, famous problem.
Divide two numbers without using / or % and return quotient.
Didnt ask anything about me or my resume. They sent ma link to write the code. Asked me to write the code for finding the number of words in a string without using split and scanner. Then asked me to improve the code to accommodate corner case i.e if multiple spaces or null string etc. Asked me to write the test cases for the program.
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
Viewing 21 - 30 interview questions