• 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

Binary Tree Isomorphic to each other

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

Max Sum in circularly situated Values

Find shortest distances between every pair of vertices ( Dynamic Programming Floyd Warshall Algorithm)

HackeEarth Flipkart’s Drone

How strtok() Works

Difference between a LinkedList and a Binary Search Tree BST

Urban Ladder Written Test.

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

Find two non repeating elements in an array of repeating elements

Stickler thief

Diagonal Traversal of Binary Tree

Flipkart Set 1 On Campus with Answers

Reliance Jio Software Developer Interview Experience

SAP Hiring Off-Campus General Aptitude

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

Binary Tree in Java

Sequence Finder Dynamic Programming

Find loop in Singly linked list

Right view of Binary tree

Check if an array has duplicate numbers in O(n) time and O(1) space

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

Serialise Deserialise N-ary Tree

C++ OOPs Part2

Trie Dictionary

FizzBuzz Solution C C++

Add Sub Multiply very large number stored as string

Best Java Book | Top Java Programming Book for Beginners

Maximum of all subarrays of size k

How Radix sort works

Copyright © 2026 · Genesis Framework · WordPress · Log in