• Skip to primary navigation
  • Skip to content
  • Skip to primary sidebar
  • Skip to secondary sidebar

GoHired

Interview Questions asked in Google, Microsoft, Amazon

Join WeekEnd Online Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

  • Home
  • Best Java Books
  • Algorithm
  • Internship
  • Certificates
  • About Us
  • Contact Us
  • Privacy Policy
  • Array
  • Stack
  • Queue
  • LinkedList
  • DP
  • Strings
  • Tree
  • Mathametical
  • Puzzles
  • Graph

Java

Best Java Book | Top Java Programming Book for Beginners

August 26, 2016 by Dhaval Dave

Best Java Books

best java programming books

Being certified Java programmer SE 7, Enterprise Edition ( EE ) Application, etc. from Oracle & ex-Developer at Oracle, I can refer some of the best java books for learning.

Why Java?  Java is most … Read More

Filed Under: Interview Questions, problem, Uncategorized Tagged With: Java

Convert number to words java

May 19, 2015 by Dhaval Dave

Write a code to Convert number to words . example  ip 15  op : fifteen

ip : 1234  op : one thousand and thirty four

Algorithm : When we detect a number at any place … Read More

Filed Under: Flipkart Interview Questions, Hacker Earth Questions, Interview Questions, problem Tagged With: Java, string

Binary Tree in Java

April 9, 2015 by Dhaval Dave

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

Filed Under: Interview Questions, problem Tagged With: Java

Binary Tree in Java

March 19, 2014 by Dhaval Dave

Implementation of Binary Tree in Java Language.

import java.io.*;
import java.util.*;
class Node
   {
   public int iData;              // data item (key)
   public double dData;           // data item
   public Node leftChild;         // this node's left child
   
… Read More

Filed Under: problem Tagged With: Binary Tree, Java

Primary Sidebar

Join WeekEnd Online/Offline Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

Join WeekEnd Online/Offline Batch from 4-April-2020

WhatsApp us

Secondary Sidebar

Custom Search

  • How I cracked AMAZON
  • LeetCode
  • Adobe
  • Amazon
  • Facebook
  • Microsoft
  • Hacker Earth
  • CSE Interview

Top Rated Questions

Amazon Interview On-Campus For Internship – 1

Count number of ways to reach a given score in a game

Test Cases for Round Function

K’th Largest Element in BST when modification to BST is not allowed

Amazon Interview Experience – SDE Chennai

Daughter’s Age VeryGood Puzzle

N Petrol bunks or City arranged in circle. You have Fuel and distance between petrol bunks. Is it possible to find starting point so that we can travel all Petrol Bunks

BFS (Breath First Search)

Difference between a LinkedList and a Binary Search Tree BST

‘N’ Story Building, with 1,2,3 steps how many ways can a person reach top of building.

Trapping Rain Water

Rectangular chocolate bar Create at least one piece which consists of exactly nTiles tiles

Microsoft BING Interview Experience

N teams are participating. each team plays twice with all other teams. Some of them will go to the semi final. Find Minimum and Maximum number of matches that a team has to win to qualify for finals ?

Reliance Jio Software Developer Interview Experience

Find and print longest consecutive number sequence in a given sequence in O(n)

Common Ancestor in a Binary Tree or Binary Search Tree

Subset Sum Problem Dynamic programming

ADOBE Aptitude C Language Test

Trie Dictionary

Print Power Set of a Set

Doubly linked list

The greedy coins game Dynamic Programming

LeetCode: Binary Tree Maximum Path Sum

Find Percentage of Words matching in Two Strings

Python Array String

Find Pythagorean Triplets in an array in O(N)

Handle duplicates in Binary Search Tree

Find Nearest Minimum number in left side in O(n)

Top 10 Interviews Techniqes for Campus Interview in IIT NIT BITS for MTech

Copyright © 2025 · Genesis Framework · WordPress · Log in