Would like to thank you for being different than other channels by being reasonable in your selection of problems to benefit the listener the most without going into DP and recursive vague type of problems that he interviewers themselves cant code without cheating. I have encountered an undirected bidirectional graph where we need to find all possible paths from source to destination using dfs, the graph has possible two bidirectional links between two nodes so a node can be visited during one path search, can we see a solution or can u guide me to similar problem. thanks a lot
Can’t really do anything unless you provide me with a leetcode problem number. There’s too little information there to give a sensible answer without knowing the proper constraints of the problem
Dont have a number for it, however, I can send you details and even written solution, it is the site seeing problem for karat. Not sure how I can send you.
Hmm yea good point. The general gist of the algorithm is the same. You can perform the integer check inline it just gets messy. I suppose even passing the index and the string itself would cause a copy to be made so you'd have to do it in place. Either way the logic is still the same. So much for writing clean code and abstracting logic away to a helper function 😂
"One or more digits, followed by a dot '.', followed by one or more digits." why is "4." among the list of valid numbers? It doesn't have one or more digits after the '.'
Would like to thank you for being different than other channels by being reasonable in your selection of problems to benefit the listener the most without going into DP and recursive vague type of problems that he interviewers themselves cant code without cheating. I have encountered an undirected bidirectional graph where we need to find all possible paths from source to destination using dfs, the graph has possible two bidirectional links between two nodes so a node can be visited during one path search, can we see a solution or can u guide me to similar problem. thanks a lot
Can’t really do anything unless you provide me with a leetcode problem number. There’s too little information there to give a sensible answer without knowing the proper constraints of the problem
Dont have a number for it, however, I can send you details and even written solution, it is the site seeing problem for karat. Not sure how I can send you.
Congrats for 1k!:)
Thanks for the continuing support!
Thanks for the video. But The space wont be O(1) since you are slicing the string in one of your if statements!
Hmm yea good point. The general gist of the algorithm is the same. You can perform the integer check inline it just gets messy. I suppose even passing the index and the string itself would cause a copy to be made so you'd have to do it in place. Either way the logic is still the same. So much for writing clean code and abstracting logic away to a helper function 😂
Liked the simplicity
You're Brilliant!
Thank you.
Nice work.
"One or more digits, followed by a dot '.', followed by one or more digits." why is "4." among the list of valid numbers? It doesn't have one or more digits after the '.'
Now that the target (1K) is reached. Set up the new target and keep going. Never stop!
10k next and then 100k
The description of this problem is so bad, seriously !!!