• 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

1014 Practice Question of New GRE – Princeton

October 17, 2014 by Dhaval Dave

To prepare GRE from scratch first of all you need to clear all the fundamentals. And in beginning one should go with Easy question. So the first step to wards GRE is to solve this Book ” Princeton 1014 “. 

This Book is comparatively easy. But D.I problems are hard. So in beginning one should solve this book. Get your soft copy from here :)

 http://s000.tinyupload.com/?file_id=02578154218750947314

Similar Articles

Filed Under: problem Tagged With: GRE

Reader Interactions

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

Find if a binary tree is height balanced ?

Flipkart SDET Interview Experience

SAP Off Campus Hiring_ March 2015 Verbal Skills

Inorder and Preorder traversals of a Binary Tree given. Output the Postorder traversal of it.

Code Chef PRGIFT Solution

The greedy coins game Dynamic Programming

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

Connect n ropes with minimum cost

Sequence Finder Dynamic Programming

Mirror of Tree

Trapping Rain Water

Knight Tour Problem (Graph – Breadth First Search)

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

VMWare SDEII Interview

SAP Off Campus Hiring_ March 2015 Analytical Aptitude

Maximum sum contiguous subarray of an Array

Python Array String

Adobe Interview Questions 8 month Exp

Max Sum in circularly situated Values

Count Possible Decodings of a given Digit Sequence

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

Fibonacci Hashing & Fastest Hashtable

Memory Efficient LinkedList

How strtok() Works

Linked List V/S Binary Search Tree

Client Server C program

LeetCode : Word Search

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

Python Dictionaries

Search element in a matrix with all rows and columns in sorted order

Copyright © 2026 · Genesis Framework · WordPress · Log in