Skip to primary navigation
Skip to content
Skip to primary sidebar
Skip to secondary sidebar

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

DFS BFS Graph traversal

March 29, 2015 by Dhaval Dave

DFS BFS Graph traversal

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

Python List

SAP Off Campus Hiring_ March 2015 Computer Skills

Templates in C++

Sequence Finder Dynamic Programming

Stickler thief

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

Connect n ropes with minimum cost

Find loop in Singly linked list

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

Sort an array according to the order defined by another array

How Radix sort works

Printing intermediate Integers between one element & next element of array

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

Find min element in Sorted Rotated Array (Without Duplicates)

Level order traversal in Spiral form

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

Python String and numbers

Test Cases for Round Function

Implement LRU Cache

Circular Linked List

robot standing at first cell of an M*N matrix. It can move only in two directions, right and down. In how many ways, it can reach to the last cell i.e. (M, N) Code it

LeetCode: Binary Tree Maximum Path Sum

Memory Efficient LinkedList

Find if two rectangles overlap

HackeEarth Flipkart’s Drone

SAP Interview Questions

Adobe Interview Questions 8 month Exp

N teams are participating. each team plays twice with all other teams. Some of them will go to the semi final. Find Minimum and Maximum number of matches that a team has to win to qualify for finals ?

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

Find the element that appears once others appears thrice

Copyright © 2023 · Genesis Framework · WordPress · Log in