• 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

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

Doubly linked list

Level order traversal in Spiral form

Knight Tour Problem (Graph – Breadth First Search)

C Program for TAIL command of UNIX

BlueStone E-commerce Interview Experience

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

strtok()

Skiing on Mountains Matrix

Get K Max and Delete K Max in stream of incoming integers

Implement a generic binary search algorithm for Integer Double String etc

Find position of the only set bit

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

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

Printing Longest Common Subsequence

The Magic HackerEarth Nirvana solutions Hiring Challenge

Binary Tree in Java

Sequence Finder Dynamic Programming

Introduction To Number Theory ( Part 1 )

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

VMWare Openings

Check Binary Tree is Binary Search Tree or not

Find two non repeating elements in an array of repeating elements

Interfaces in C++ (Abstract Classes in C++)

Find if two rectangles overlap

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

Cisco Hiring Event 21st – 22nd Feb 2015

Facebook Interview Question : Interleave List

Trie Dictionary

Regular Expression Matching

Copyright © 2026 · Genesis Framework · WordPress · Log in