• 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

Trie

Trie Dictionary

April 14, 2015 by Dhaval Dave

tries

Trie also called prefix tree (as they can be searched by prefixes).
The term trie comes from retrieval.
In the example shown, keys are listed in the nodes and values below them. Each … Read More

Filed Under: Amazon Interview Question, Interview Questions, Microsoft Interview Questions, problem Tagged With: tree, Trie

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

Check a String is SUBSEQUENCE of another String Find Minimum length for that ( DNA Matching )

Closed Parentheses checker

Find if two rectangles overlap

Given array of 0’s and 1’s. All 0’s are coming first followed by 1’s. find the position of first 1

SAP Off Campus Hiring_ March 2015 Verbal Skills

Mirror of Tree

Convert number to words java

Right view of Binary tree

Check Binary Tree is Binary Search Tree or not

LeetCode : Word Search

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

Practo Hiring Experience

DFS (Depth First Search)

Urban Ladder Written Test.

Regular Expression Matching

Advanced SQL Injection

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

building with N steps, we can take 1,2,3 steps calculate number of ways to reach at top of building

Leetcode: Merge Intervals

Common Ancestor in a Binary Tree or Binary Search Tree

The greedy coins game Dynamic Programming

Longest Increasing Subsequence

Handle duplicates in Binary Search Tree

Trapping Rain Water

Maximum path sum between two leaves

CodeChef Code SGARDEN

1014 Practice Question of New GRE – Princeton

Templates in C++

Python String and numbers

Reliance Jio Software Developer Interview Experience

Copyright © 2026 · Genesis Framework · WordPress · Log in