• 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

Sequence Finder Dynamic Programming

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

Flipkart Set 1 On Campus with Answers

Trapping Rain Water

Flipkart SDET Interview Experience

N teams are participating. each team plays twice with all other teams. Some of them will go to the semi final. Find Minimum and Maximum number of matches that a team has to win to qualify for finals ?

Leetcode: Edit Distance

FizzBuzz Solution C C++

System Design: Designing a LLD for Hotel Booking

Fibonacci Hashing & Fastest Hashtable

Amazon Interview On-Campus For Internship – 1

Printing Longest Common Subsequence

Walmart Labs Interview Experience

Find min element in Sorted Rotated Array (Without Duplicates)

Introduction To Number Theory ( Part 1 )

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

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

Top 10 Interviews Techniqes for Campus Interview in IIT NIT BITS for MTech

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

Facebook Interview Question : Interleave List

TicTacToe Game As Asked in Flipkart

Difference between a LinkedList and a Binary Search Tree BST

Practo Hiring Experience

Print Power Set of a Set

Generic Object Oriented Stack with Template

Client Server C program

How strtok() Works

VMWare SDEII Interview

Longest Increasing Subsequence

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

Copyright © 2026 · Genesis Framework · WordPress · Log in