• 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

Dhaval Dave

Get K Max and Delete K Max in stream of incoming integers

March 25, 2014 by Dhaval Dave

Get K Max and Delete K Max in stream of Incoming Integers

Solution 1 : Using Min Heap
Algorithm :

1) Keep a Min & Max Heap of K size
2) Store first K elements 
… Read More

Filed Under: Adobe Interview Questions, Amazon Interview Question, Interview Questions, Microsoft Interview Questions, problem Tagged With: Linked List, Max Heap, Min Heap

building with N steps, we can take 1,2,3 steps calculate number of ways to reach at top of building

March 24, 2014 by Dhaval Dave

Given n stairs, how many number of ways can you climb if u use either 1, 2 or 3 at a time?

When you find any difficult problem first step is to reduce it to
… Read More

Filed Under: Adobe Interview Questions, problem, Puzzle Tagged With: Mathematical

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

March 24, 2014 by Dhaval Dave

Given an array A[] and a number x, check for pair in A[] with sum as x

Write a C program that, given an array A[] of n numbers and another number x, determines whether
… Read More

Filed Under: Adobe Interview Questions, Flipkart Interview Questions, Interview Questions, problem Tagged With: Array, Sorting

strtok()

March 21, 2014 by Dhaval Dave

Function Strtok

char * strtok ( char * str, const char * delimiters );
What it does : Split string into tokens
A sequence of calls to this function split str into tokens,
which are

… Read More

Filed Under: problem Tagged With: Array, string

ADOBE Aptitude C Language Test

March 21, 2014 by Dhaval Dave

ADOBE Aptitude C Language Written Test

Section 1 : Adobe Aptitude .
Section 2 : Adobe C Language and WAP.
Adobe Aptitude Questions

Before Starting to prepare for Aptitude and C language test MOST IMPORTANT TO READ   is Adobe Interview Experience
… Read More

Filed Under: Adobe Interview Questions Tagged With: c

Implement a generic binary search algorithm for Integer Double String etc

March 20, 2014 by Dhaval Dave

A Simple Binary Search for Integers

BinarySearch(A[0..N-1], value) 
{
   low = 0
   high = N - 1
   while (low <= high) {
       mid = low + ((high - low) / 2)
       if (A[mid] > value)
           
… Read More

Filed Under: problem Tagged With: algorithm

Linked List V/S Binary Search Tree

March 19, 2014 by Dhaval Dave

Linked List :

Node(1) -> Node(2) -> Node(3) -> Node(4) -> Node(5) -> Node(6) -> Node(7)
  • In linked list, the items are linked together through a single next pointer.
  • Next Node’s Key Can be larger
… Read More

Filed Under: problem Tagged With: Binary Search Tree, BST, Linked List

Adobe Interview Questions 8 month Exp

March 19, 2014 by Dhaval Dave

Adobe Interview Questions Set 1

For Experience : 8 months
 
First Round :
Held on interview street Aptitude + Technical (standard pattern and questions)
Check Questions : Adobe C,Aptitude Written Questions Answers
… Read More

Filed Under: Adobe Interview Questions, Interview Experience

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

Spanning Tree

March 1, 2014 by Dhaval Dave

In the mathematical field of graph theory, a spanning tree T of a connected, undirected graph G is a tree that includes all of the vertices and some or all of the edges of G.

… Read More

Filed Under: problem Tagged With: Graph, tree

  • « Previous Page
  • Page 1
  • …
  • Page 14
  • Page 15
  • Page 16
  • Page 17
  • Next Page »

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

simple sql injection

Generate largest number arranging a no. of given non negative integer numbers

Puzzle : 100 doors in a row Visit and Toggle the door. What state the door will be after nth pass ?

Python Dictionaries

Find the number ABCD such that when multipled by 4 gives DCBA.

Singly linked list

Generate next palindrome number

Password Predictor

SAP Off Campus Hiring_ March 2015 Computer Skills

Trapping Rain Water

Introduction To Number Theory ( Part 1 )

Max Sum in circularly situated Values

Microsoft BING Interview Experience

Print all nodes that are at distance k from a leaf node

Given Set of words or A String find whether chain is possible from these words or not

Minimum insertions to form a palindrome

C Program for TAIL command of UNIX

25 horses 5 tracks Find 3 fastest puzzle

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

Interfaces in C++ (Abstract Classes in C++)

BlueStone E-commerce Interview Experience

Skiing on Mountains Matrix

Code Chef PRGIFT Solution

How Radix sort works

Print Power Set of a Set

Binary Tree Isomorphic to each other

Maximum size of square sub matrix with all 1’s in a binary matrix

Python Array String

Given a float number convert it into the string WITHOUT using any inbuilt Function

Binary Tree in Java

Copyright © 2025 · Genesis Framework · WordPress · Log in