• 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

Templates in C++

Regular Expression Matching

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

Trapping Rain Water

Fibonacci Hashing & Fastest Hashtable

Printing intermediate Integers between one element & next element of array

Connect n ropes with minimum cost

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

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

Find min element in Sorted Rotated Array (With Duplicates)

Edit Distance ( Dynamic Programming )

Knight Tour Problem (Graph – Breadth First Search)

Subset Sum Problem Dynamic programming

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

Walmart Labs Interview Experience

Count Possible Decodings of a given Digit Sequence

Python Array String

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

Binary Tree in Java

Find next greater number with same set of digits

Implement a generic binary search algorithm for Integer Double String etc

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

Closed Parentheses checker

Find loop in Singly linked list

FizzBuzz Solution C C++

DFS (Depth First Search)

TicTacToe Game As Asked in Flipkart

Coin Collection Dynamic Programming

Flipkart SDET Interview Experience

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

Copyright © 2026 · Genesis Framework · WordPress · Log in