• 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

Closed Parentheses checker

Leetcode: Edit Distance

Given array of 0’s and 1’s. All 0’s are coming first followed by 1’s. find the position of first 1

Circular Linked List

Printing Longest Common Subsequence

LeetCode: Binary Tree Maximum Path Sum

Calculate price of parking from parking start end time prices

HackeEarth Flipkart’s Drone

Templates in C++

Find next greater number with same set of digits

CodeChef Code SGARDEN

Edit Distance ( Dynamic Programming )

Difference between a LinkedList and a Binary Search Tree BST

Find the smallest window in a string containing all characters of another string

Diagonal Traversal of Binary Tree

Generic Object Oriented Stack with Template

write a c program that given a set a of n numbers and another number x determines whether or not there exist two elements in s whose sum is exactly x

Right view of Binary tree

SAP Hiring Off-Campus General Aptitude

Common Ancestor in a Binary Tree or Binary Search Tree

Knight Tour Problem (Graph – Breadth First Search)

1014 Practice Question of New GRE – Princeton

Find Percentage of Words matching in Two Strings

Add Sub Multiply very large number stored as string

Find the kth number with prime factors 3, 5 and 7

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

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

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

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

Number of Islands BFS/DFS

Copyright © 2026 · Genesis Framework · WordPress · Log in