Skip to content

bhaver11/fundamentals

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

18 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Fundamental programs in Algorithms and Data structures

  1. Maximum Subarray Problem using Kadene's Algorithm
  2. Rotate Array
  3. Add one To number
  4. Minimum steps in an infinite grid
    • You are in an infinite 2D grid where you can move in any of the 8 directions
    • You are given a sequence of points and the order in which you need to cover the points. Give the minimum number of steps in which you can achieve it. You start from the first point.
    • https://www.interviewbit.com/problems/min-steps-in-infinite-grid/
  5. Kth row of Pascal's triangle
  6. Maximum sub array sum using divide and conquer
  7. Find the single non-repeating number
  8. Find if the number is happy number
  9. Product of array except self
  10. Finding an element in a rotated sorted array
  11. Is BST symmetric (Left and right halves are mirror images)
  12. Construct BST from PRE-ORDER
  13. Bitwise AND of the range of given numbers
  14. Median of two sorted arrays
  15. Maxiumal Square

About

Fundamental programs in Algorithms and Data structures.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published