• 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

Linked List V/S Binary Search Tree

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

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

SAP Off Campus Hiring_ March 2015 Computer Skills

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

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

Find if two rectangles overlap

Given a float number convert it into the string WITHOUT using any inbuilt Function

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

Generate next palindrome number

Right view of Binary tree

Trie Dictionary

How strtok() Works

Leetcode: Merge Intervals

Knight Tour Problem (Graph – Breadth First Search)

Find min element in Sorted Rotated Array (Without Duplicates)

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

Serialise Deserialise N-ary Tree

Apriori algorithm C Code Data Mining

Doubly linked list

HackeEarth Flipkart’s Drone

simple sql injection

Convert number to words java

Print Power Set of a Set

SAP Interview Questions

Find Pythagorean Triplets in an array in O(N)

Flipkart SDET Interview Experience

Password Predictor

Difference between a LinkedList and a Binary Search Tree BST

Longest Increasing Subsequence

Copyright © 2026 · Genesis Framework · WordPress · Log in