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

Wordbreak Problem

April 13, 2015 by Dhaval Dave Leave a Comment

Wordbreak Problem

Reader Interactions

Leave a ReplyCancel reply

This site uses Akismet to reduce spam. Learn how your comment data is processed.

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

Find min element in Sorted Rotated Array (Without Duplicates)

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

VMWare Openings

Find Pythagorean Triplets in an array in O(N)

Sequence Finder Dynamic Programming

Client Server C program

System Design: Designing a LLD for Hotel Booking

Find position of the only set bit

Level order traversal in Spiral form

LeetCode : Word Search

Find min element in Sorted Rotated Array (With Duplicates)

HackeEarth Flipkart’s Drone

Convert number to words java

Coin Collection Dynamic Programming

Python Array String

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

Minimum insertions to form a palindrome

Flipkart SDET Interview Experience

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

Find the smallest window in a string containing all characters of another string

There are N nuts and N bolts, u have to find all the pairs of nuts and bolts in minimum no. of iteration

Leetcode: Merge Intervals

Knight Tour Problem (Graph – Breadth First Search)

Handle duplicates in Binary Search Tree

Serialise Deserialise N-ary Tree

DFS (Depth First Search)

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

Leetcode: Edit Distance

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

Maximum of all subarrays of size k

Copyright © 2026 · Genesis Framework · WordPress · Log in