GitHub - patidar622/gfg_amazon_questions: Interview question of amazon microsoft

Name		Name	Last commit message	Last commit date
Latest commit History 165 Commits
1192. Critical Connections in a Network(amazon).cpp		1192. Critical Connections in a Network(amazon).cpp
2-Sum Binary Search Tree(o(N) time and o(height) space).cpp		2-Sum Binary Search Tree(o(N) time and o(height) space).cpp
992. Subarrays with K Different Integers(same for substrings also).cpp		992. Subarrays with K Different Integers(same for substrings also).cpp
Activity Selection (dp achha he).cpp		Activity Selection (dp achha he).cpp
Allocate Books(same as painters partition problem).cpp		Allocate Books(same as painters partition problem).cpp
Atoi(interview bit implimentation).cpp		Atoi(interview bit implimentation).cpp
Best Time to Buy and Sell Stock atmost B times(same as best time leetcode 3).cpp		Best Time to Buy and Sell Stock atmost B times(same as best time leetcode 3).cpp
Bipartite Graph.cpp		Bipartite Graph.cpp
Bottom View of Binary Tree.cpp		Bottom View of Binary Tree.cpp
Bridge Edge in Graph(very imp) simple dfs.cpp		Bridge Edge in Graph(very imp) simple dfs.cpp
Check if subtree.cpp		Check if subtree.cpp
Circular tour (BOTH SOLUTION WORK ON GFG).cpp		Circular tour (BOTH SOLUTION WORK ON GFG).cpp
Clone Graph(undirected graph) interview bit.cpp		Clone Graph(undirected graph) interview bit.cpp
Clone a Binary Tree(with random pointer).cpp		Clone a Binary Tree(with random pointer).cpp
Clone a linked list with next and random pointer(with o(n) ans o(1) space) and with hash table also.cpp		Clone a linked list with next and random pointer(with o(n) ans o(1) space) and with hash table also.cpp
Construct Binary Search Tree from Preorder Traversal.cpp		Construct Binary Search Tree from Preorder Traversal.cpp
Container With Most Water(interview bit famous).cpp		Container With Most Water(interview bit famous).cpp
Convert to Palindrome(3 methods interview bit).cpp		Convert to Palindrome(3 methods interview bit).cpp
Delete Edge!(interview bit).cpp		Delete Edge!(interview bit).cpp
Delete a node from BST.cpp		Delete a node from BST.cpp
Different Bits Sum Pairwise(same as total hamming distance in every pair of array).cpp		Different Bits Sum Pairwise(same as total hamming distance in every pair of array).cpp
Diffk(same concept in diffrent way as 2 sum) interview bit.cpp		Diffk(same concept in diffrent way as 2 sum) interview bit.cpp
Divide Integers(bit manipulation).cpp		Divide Integers(bit manipulation).cpp
Dungeon Princess(interview bit DP).cpp		Dungeon Princess(interview bit DP).cpp
Egg Drop Problem!(using bianry search).cpp		Egg Drop Problem!(using bianry search).cpp
Equal(interview bit ) facebook.cpp		Equal(interview bit ) facebook.cpp
Evaluate Expression To True(standard problem matrix chain multi) jaise he.cpp		Evaluate Expression To True(standard problem matrix chain multi) jaise he.cpp
Find Minimum in Rotated Sorted Array II(leetcode july).cpp		Find Minimum in Rotated Sorted Array II(leetcode july).cpp
Find Missing And Repeating.cpp		Find Missing And Repeating.cpp
Find Nth Fibonacci(two method o(n) and o(log(n)) ).cpp		Find Nth Fibonacci(two method o(n) and o(log(n)) ).cpp
Find the Duplicate Number(leetcode june achha he).cpp		Find the Duplicate Number(leetcode june achha he).cpp
First Missing Integer(interview bit o(N) and o(1) space).cpp		First Missing Integer(interview bit o(N) and o(1) space).cpp
Flatten a Multilevel Doubly Linked List(leetcode july).cpp		Flatten a Multilevel Doubly Linked List(leetcode july).cpp
Frequencies of Limited Range Array Elements(in o(n) time and o(1) space).cpp		Frequencies of Limited Range Array Elements(in o(n) time and o(1) space).cpp
Generate all Parentheses II(interview bit).cpp		Generate all Parentheses II(interview bit).cpp
Get minimum element from stack.cpp		Get minimum element from stack.cpp
Given a linked list of 0s, 1s and 2s, sort it..cpp		Given a linked list of 0s, 1s and 2s, sort it..cpp
Given a linked list, reverse alternate nodes and append at the end.cpp		Given a linked list, reverse alternate nodes and append at the end.cpp
Handshakes(important dp).cpp		Handshakes(important dp).cpp
Hotel Bookings Possible(interview bit same as min platform of gfg).cpp		Hotel Bookings Possible(interview bit same as min platform of gfg).cpp
Implement StrStr(using KMP algo interview bit o(N) ).cpp		Implement StrStr(using KMP algo interview bit o(N) ).cpp
Implement Trie (Prefix Tree) leetcode may.cpp		Implement Trie (Prefix Tree) leetcode may.cpp
Infix to Postfix.cpp		Infix to Postfix.cpp
Inorder Successor in BST.cpp		Inorder Successor in BST.cpp
Insertion Sort Linked List(interview bit).cpp		Insertion Sort Linked List(interview bit).cpp
Is Binary Number Multiple of 3(bit manipulation).cpp		Is Binary Number Multiple of 3(bit manipulation).cpp
Is Sudoku Valid.cpp		Is Sudoku Valid.cpp
Kingdom War(interview bit).cpp		Kingdom War(interview bit).cpp
Knight Walk(Achha question he bfs).cpp		Knight Walk(Achha question he bfs).cpp
Kth Smallest Element In Binary searchTree (interview bit 2 methods).cpp		Kth Smallest Element In Binary searchTree (interview bit 2 methods).cpp
Kth largest element in BST(priority queue ).cpp		Kth largest element in BST(priority queue ).cpp
LRU Cache.cpp		LRU Cache.cpp
Largest Number formed from an Array.cpp		Largest Number formed from an Array.cpp
Largest area of rectangle with permutations(ye jarur dekhna he).cpp		Largest area of rectangle with permutations(ye jarur dekhna he).cpp
Largest number in K swaps.cpp		Largest number in K swaps.cpp
Length of the longest substring.cpp		Length of the longest substring.cpp
Longest Duplicate Substring( very imp interview question).cpp		Longest Duplicate Substring( very imp interview question).cpp
Longest Palindrome Substring.cpp		Longest Palindrome Substring.cpp
Longest Substring Without Repeating Characters(famous question).cpp		Longest Substring Without Repeating Characters(famous question).cpp
Make Binary Tree From Linked List.cpp		Make Binary Tree From Linked List.cpp
Matrix Median(binary Search interview bit).cpp		Matrix Median(binary Search interview bit).cpp
Matrix Search(2 methods) binary search.cpp		Matrix Search(2 methods) binary search.cpp
Max rectangle in binary matrix (achha he question).cpp		Max rectangle in binary matrix (achha he question).cpp
Max sum in the configuration(VERY IMPOARTANT).cpp		Max sum in the configuration(VERY IMPOARTANT).cpp
Maximal String( apple interview bit).cpp		Maximal String( apple interview bit).cpp
Maximum Ones After Modification(2 methods imp) interview bit.cpp		Maximum Ones After Modification(2 methods imp) interview bit.cpp
Maximum Product Subarray(gfg) sahi he.cpp		Maximum Product Subarray(gfg) sahi he.cpp
Maximum Profit(important) same as buy ans sell stock.cpp		Maximum Profit(important) same as buy ans sell stock.cpp
Maximum Rectangular Area in a Histogram (important).cpp		Maximum Rectangular Area in a Histogram (important).cpp
Maximum Sum Circular Subarray(leecode may).cpp		Maximum Sum Circular Subarray(leecode may).cpp
Maximum Unsorted Subarray(interview bit achha he karna he).cpp		Maximum Unsorted Subarray(interview bit achha he karna he).cpp
Maximum Width of Binary Tree(leetcode july) using deque.cpp		Maximum Width of Binary Tree(leetcode july) using deque.cpp
Median of Array(very important interview question ).cpp		Median of Array(very important interview question ).cpp
Merge Intervals(google interview bit ) achha he easy.cpp		Merge Intervals(google interview bit ) achha he easy.cpp
Merge Sort List (o(nlogn)) constant space.cpp		Merge Sort List (o(nlogn)) constant space.cpp
Merge elements(interview bit.cpp		Merge elements(interview bit.cpp
Merge k Sorted Arrays ( using priority queue).cpp		Merge k Sorted Arrays ( using priority queue).cpp
Merge two sorted linked lists(inplace).cpp		Merge two sorted linked lists(inplace).cpp
Min Cost Path(0 1 BFS concept) interview bit.cpp		Min Cost Path(0 1 BFS concept) interview bit.cpp
Min Jumps Array(interview bit o(n) and o(1) sapce).cpp		Min Jumps Array(interview bit o(n) and o(1) sapce).cpp
Min Stack ( implementation) intreview bit.cpp		Min Stack ( implementation) intreview bit.cpp
Min distance between two given nodes of a Binary Tree(lca concept).cpp		Min distance between two given nodes of a Binary Tree(lca concept).cpp
Minimum Cost of ropes(priority queue).cpp		Minimum Cost of ropes(priority queue).cpp
Minimum Platforms (USING PRIORITY QUEUE).cpp		Minimum Platforms (USING PRIORITY QUEUE).cpp
Minimum element in a sorted and rotated array.cpp		Minimum element in a sorted and rotated array.cpp
N max pair combinations(interview bit complex question).cpp		N max pair combinations(interview bit complex question).cpp
NQueens(interview bit).cpp		NQueens(interview bit).cpp
Next Permutation( next greater in arry or smallest if not possible next premutation).cpp		Next Permutation( next greater in arry or smallest if not possible next premutation).cpp
Optimal Strategy For A Game(important he bhai).cpp		Optimal Strategy For A Game(important he bhai).cpp
Overlapping Intervals (very imp_).cpp		Overlapping Intervals (very imp_).cpp
Painter's Partition Problem(very famous problem) interview bit.cpp		Painter's Partition Problem(very famous problem) interview bit.cpp
Pattern Searching( rabin karp algo (rolling hash) impoatant).cpp		Pattern Searching( rabin karp algo (rolling hash) impoatant).cpp
Perfect Sum Problem(subset sum count).cpp		Perfect Sum Problem(subset sum count).cpp
Possible Bipartition(may leetcode) GRAPH COLOURING PROBLEM AND IS GRAPH BIPARTITE.cpp		Possible Bipartition(may leetcode) GRAPH COLOURING PROBLEM AND IS GRAPH BIPARTITE.cpp
Power of 2(interview bit best way to find).cpp		Power of 2(interview bit best way to find).cpp
Queue Reconstruction by Height(VERY IMPORTANT).cpp		Queue Reconstruction by Height(VERY IMPORTANT).cpp
Random Pick with Weight(leetcode june).cpp		Random Pick with Weight(leetcode june).cpp
Reconstruct Itinerary(june leetcode).cpp		Reconstruct Itinerary(june leetcode).cpp
Regular Expression II(interview bit same as leetcode ).cpp		Regular Expression II(interview bit same as leetcode ).cpp
Remove loop in Linked List.cpp		Remove loop in Linked List.cpp

patidar622/gfg_amazon_questions

Folders and files

Latest commit

History

About

Topics

Stars

Watchers

Forks

Releases

Packages 0

Languages

Packages