How to write Binary Search Tree Code in Java with proper class structure and methods.
Here is the implementation of Binary Search Tree in Java.
Class Structure, Get Set Methods, Binary Tree Operation, Pre-Post-InOrder code … Read More
problem
K’th Largest Element in BST when modification to BST is not allowed
Given a Binary Search Tree (BST) and a positive integer k, find the k’th largest element in the Binary Search Tree.
Count number of ways to reach a given score in a game
Consider a game where a player can score 3 or 5 or 10 points in a move. Given a total score n, find number of ways to reach the given score.Examples:
Input: n = 20
… Read More Input: n = 20
Daughter’s Age VeryGood Puzzle
Hello folks,Today I am posting an Interview Puzzle which was asked to my friend in his Interview. This puzzle will be helpful in job interview preparation.
… Read More I have also posted many puzzles for interview before,
Python Dictionaries
Python dictionaries are also known as associative arrays or hash tables. The general syntax of a dictionary is as follows:
The Magic HackerEarth Nirvana solutions Hiring Challenge
Navi got a task at school to collect N stones. Each day he can collect only one stone. As N can be a very large number so it could take many days to complete the
Mirror of Tree
Count Possible Decodings of a given Digit Sequence
Find number of ways a string can be decoded into, if A=1, B=2, C=3 … Z=25 and encoding number is 123 ways decoding can be done is
1 2 3 = A B C
1
… Read More 1 2 3 = A B C
1
Find the element that appears once others appears thrice
Given an array where every element occurs three times, except one element which occurs only once. Find the element that occurs once.
Expected time complexity is O(n) and O(1) extra space.
Examples:
Input: arr[] =
… Read More Expected time complexity is O(n) and O(1) extra space.
Examples:
Input: arr[] =
Find the smallest window in a string containing all characters of another string
Given two strings string1 and string2, find the smallest substring in string1 containing all characters of string2 efficiently.For Example:
Input string1: “this is a test string”
Input string2: “tist”
Output string: “t stri”