Coding-Interview

Coding Interview Questions Asked by BIG MNC like Amazon,Google,Microsoft,Apple,Flipkart,IBM,Goldman sachs and many other Firms.

Navigation Menu

Repository files navigation

Coding-Interview

About

Releases

Packages

Contributors

Languages

Name		Name	Last commit message	Last commit date
Practice		Practice
[Amdoc] Print pattern(Hallow Triangle with different secq. numbers at each edge)		[Amdoc] Print pattern(Hallow Triangle with different secq. numbers at each edge)
Find All Duplicates in an Array having Constant space complexity and O(N) Time Complexity.ipynb		Find All Duplicates in an Array having Constant space complexity and O(N) Time Complexity.ipynb
Find First and Last Position of Element in Sorted Array having log(n) time complexity.ipynb		Find First and Last Position of Element in Sorted Array having log(n) time complexity.ipynb
Find number is in the array or list or not(Time Complexity and Space Complexity Constraint).ipynb		Find number is in the array or list or not(Time Complexity and Space Complexity Constraint).ipynb
Given a array containing both negative and positive number,write an algorithm to sort the array by taking absolute values(Time and space complexity[NAGARRO].ipynb		Given a array containing both negative and positive number,write an algorithm to sort the array by taking absolute values(Time and space complexity[NAGARRO].ipynb
Given a list L of vide names and their watch rates.Write a algorithm that will return the videos names with the least 10 watch rates..ipynb		Given a list L of vide names and their watch rates.Write a algorithm that will return the videos names with the least 10 watch rates..ipynb
Integer is a palindrome or not.ipynb		Integer is a palindrome or not.ipynb
Number of zeros in an integer.ipynb		Number of zeros in an integer.ipynb
Print Pattern for N=4 [ThoughtWork].ipynb		Print Pattern for N=4 [ThoughtWork].ipynb
Product of Array Except Self without using division and having time complexity O(N).ipynb		Product of Array Except Self without using division and having time complexity O(N).ipynb
README.md		README.md
Remove all X present in a string.ipynb		Remove all X present in a string.ipynb
Replace pi with 3.14 in a string recursively.ipynb		Replace pi with 3.14 in a string recursively.ipynb
Subarray Sum Equals K.ipynb		Subarray Sum Equals K.ipynb
The Stock Span Problem.ipynb		The Stock Span Problem.ipynb
Two Sum.ipynb		Two Sum.ipynb
bs001.png		bs001.png
bs002.png		bs002.png
stock_span.png		stock_span.png

Latest commit

History

Folders and files

Repository files navigation

Coding-Interview

About

Resources

Stars

Watchers

Forks

Releases

Packages

Contributors

Languages