Today we will work on hard task Word Break II. Why this task is hard? I can say, here, during resolving this problem, you will and you should use a few techniques. First one traversing method called DFS (or BFS), second is Dynamic programming, third is some combining and tricks 🙂 to pass tests on leetcode. OK, try to read task description : Given a string s and a dictionary of words dict, add spaces in s…
"Algorithm {Word Break II}"Author: Hashim
Today I will describe about easy but with interesting solution problem – Intersection of Two Linked Lists. OK, let’s read problem description: Write a program to find the node at which the intersection of two singly linked lists begins. For example, the following two linked lists: A: a1 → a2 ↘ c1 → c2 → c3 ↗ B: b1 → b2 → b3 begin to intersect at node c1. Notes: If the two linked lists…
"Algorithm {Intersection of Two Linked Lists}"
The new generation Android smartphones pack 256 MB to 4 GB of RAM. ie, 4096 MB of Random Access Memory!. 1 GB RAM is okay for performing everyday tasks effortlessly on any Android smartphone, but if you want to work on multiple apps simultaneously then 1 GB RAM is just not sufficient. You should invest in a 2 GB RAM smartphones or 3 GB RAM smartphones if you plan on using it for the next…
"Top Best 3 GB Ram Smartphones In India"In this two part series of jQuery Form Validation in ASP net I’ll show you how to override the built-in ASP.net validation functions with your own jQuery-ized versions. Turn your boring ASP.net form validation controls into intuitive, user-friendly, and just all around snazzy feature of your ASP.net web forms. You’ll make your users want to throw validation errors! In Part 1 I showed how to override the built-in javascript and highlight an input control if it is…
"jQuery Form Validation in ASP.net Pt 2: The ValidatorUpdateDisplay Function"Today we will try to solve that problem for the Longest valid parentheses. First time I’ve faced the task I did fail, Yes, I’ve thought about the task in right way but had problems in some implementation details. Today, I’ve analysed the problem on the fresh mind and found/fixed my mistakes. So, task description: Given a string containing just the characters ‘(‘ and ‘)’, find the length of the longest valid (well-formed) parentheses substring. For…
"Algorithm {Longest Valid Parentheses}"