• 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 two rectangles overlap

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

Given a sorted array and a number x, find the pair in array whose sum is closest to x

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

Find the smallest window in a string containing all characters of another string

Microsoft BING Interview Experience

The Magic HackerEarth Nirvana solutions Hiring Challenge

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

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

Doubly linked list

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

VMWare SDEII Interview

Edit Distance ( Dynamic Programming )

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

Reliance Jio Software Developer Interview Experience

Spanning Tree

Stickler thief

strtok()

Given a string, find the first character which is non-repetitive

Linked List V/S Binary Search Tree

CodeChef’ RRCOPY

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

Maximum occurred Smallest integer in n ranges

DFS (Depth First Search)

Maximum sum contiguous subarray of an Array

Find min element in Sorted Rotated Array (Without Duplicates)

Regular Expression Matching

Stock Buy Sell to Maximize Profit

Maximum path sum between two leaves

Find Pythagorean Triplets in an array in O(N)

Copyright © 2026 · Genesis Framework · WordPress · Log in