• 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

1014 Practice Question of New GRE – Princeton

Find Pythagorean Triplets in an array in O(N)

SAP Interview Questions

Cisco Hiring Event 21st – 22nd Feb 2015

Printing each word reverse in string

Templates in C++

Python String and numbers

SAP Off Campus Hiring_ March 2015 Verbal Skills

Get Minimum element in O(1) from input numbers or Stack

Find if a binary tree is height balanced ?

Maximum difference between two elements s.t larger element appears after the smaller number

CodeChef’ RRCOPY

Printing intermediate Integers between one element & next element of array

Subset Sum Problem Dynamic programming

In Given LinkedList Divide LL in N Sub parts and delete first K nodes of each part

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

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

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

Find Percentage of Words matching in Two Strings

strtok()

Level order traversal in Spiral form

Print vertical sum of all the axis in the given binary tree

Adobe Interview Questions 8 month Exp

Trie Dictionary

Hackerearth : Counting Subarrays

Spanning Tree

Add Sub Multiply very large number stored as string

Generic Object Oriented Stack with Template

Find an index i such that Arr [i] = i in array of n distinct integers sorted in ascending order.

Code Chef PRGIFT Solution

Copyright © 2026 · Genesis Framework · WordPress · Log in