• Sun, Dec 17th, 2023
  • Tutor: Abhishek Tripathi
  • Review: Class wasn’t so good, tutor was stuck on a problem that he told is a problem that appeared in GATE exam and wasn’t able to solve it. His knowledge of DSA was average and he didn’t believe DSA is important in development. Claimed to have worked in few of FAANG companies which will not reflect on his Linkedin profile.
  • Avoid Recursion in interview since on increasing limit to 10^6 or so the solution won’t be stable. What about memoization?
  • Can Binary Search be done with Recursion?
  • Binary Search
    • 2D array, Binary Search
    • n x m
    • gyan_pelo
    • One way can be to compare target element with the first element of element of every row, once the row is decided
    • max (log m, log n)
    • What about total elements/ number of rows, then go to that row.
  • Coco monkey problem
    • Minima maxima
    • No of hours
    • Optimize lot size
  • media.net
  • Tower research