See things in action
Problem Given a singly linked list containing integer keys, write an algorithm to do in-place reverse of the Singly linked list(SLL). Example Given the following Singly linked list Constraints [1] All the keys are integers [2] 0 <= Singly Linked ListLen < 10000 Singly Linked List SLL basically an ordered list where each node contains…
Introduction This is a continuation of our discussion on web crawler for large language models at scale series. In part 1 we discussed how to get desired data from the HTML page for LLM, if not gone through it see here. In this part we shall talk about how to write web crawler for a…
Introduction In today AI world, LLM(large language model) like Chat GPT from OpenAI has become overnight famous. But do you know how this models are getting their training data? If not then you are correct place. It the web crawlers that feed the data to this models. We all might have heard about the crawler…
Problem Given K sorted arrays write an efficient algorithm to merge them into one. Example Given the below sorted array where K = 3 k1 : 4 5 6 k2 : 1 2 3 k3 : 8 9 10 output sorted list : 1 2 3 4 5 6 8 9 10 Constraints [1] 1…
Introduction Continuing our discussion on S.O.L.I.D principle, checkout Open Closed Principle (OCP), Liskov Substitution Principle (LSP), Dependency Inversion Principle (DIP), Interface Segregation Principle (ISP) if not so far. In this blog lets cover yet another principle i.e. Single Responsibility Principle short hand (SRP). Let’s dive in. Single Responsibility Principle SRP states that “Any class should…
Introduction Continuing our discussion on S.O.L.I.D principle, checkout Open Closed Principle (OCP), Liskov Substitution Principle (LSP), Dependency Inversion Principle (DIP) if not so far. In this blog lets cover yet another principle i.e. Interface Segregation Principle short hand ISP. Lets dive in Interface Segregation Principle If an interface is serving multiple clients then better to…
Introduction Continuing our discussion on S.O.L.I.D principle, checkout Open Closed Principle (OCP), Liskov Substitution Principle (LSP) if not so far. In this blog lets cover yet another principle i.e. Dependency Inversion Principle short hand DIP. Lets dive in Dependency Inversion Principle Dependency Inversion Principle states High level modules should not depend on concrete implementation of…
Introduction Continuing our discussion on S.O.L.I.D principles, in the previous blog we discussed OCP(Open Closed Principle), check it out in case missed. Now let’s discuss the Liskov Substitution Principle short hand (LSP). Let’s dive in. Liskov Substitution Principle LSP states that: “If the base class object is being used by the client function, then the…
Introduction Is software design hard? The answer to that question depends on what process is being followed when we initially start designing the software. Well good news is someone has already done hard work for us, come up with a set of principles. When followed we can mostly likely come up with maintainable, high cohesive…
Problem Given a balanced binary search tree and node element E from the tree, find the immediate lesser element K. In case when the K is not present then return -1. Example [1] Given below binary search tree If E = 20 then K = 15 If E = 25 then K = 20 If…