- 278
- 50 937
DinaTechy
India
เข้าร่วมเมื่อ 6 เม.ย. 2017
In this channel, you can able to learn which ever language you want. If you ping me about what you want I make video off that concept or language. Looking for an very complicated task.
Always hungry for coding.
Always hungry for coding.
#3 Leet Code Problem✅ - Word Break - Beginner Guide | Tamil | Step by Step | DinaTechy #coding #java
This program checks whether an input string can be fully constructed using words from a predefined dictionary of words.
### Key Points:
1. **Dictionary of Words**:
- A set of predefined words (like "leet", "coded", "problems") is used to form a dictionary. These words are stored in a `HashSet` to ensure quick lookup and eliminate duplicates.
2. **Input String**:
- The input string is `"leetcodeproblems"`. The program checks if this string can be entirely composed of the words in the dictionary.
3. **Regular Expression Creation**:
- A regular expression is dynamically created by joining all the words from the dictionary with a pipe symbol (`|`), which represents an OR condition in regular expressions. This allows checking for any combination of those words in the input string.
- The resulting pattern is enclosed in parentheses and followed by `*`, which means that any of these words can repeat any number of times (including zero).
4. **Pattern Matching**:
- A `Pattern` object is created using the generated regular expression, and a `Matcher` object is used to check whether the input string matches the pattern.
- The `matches()` method is used to determine if the entire input string can be broken down into the words from the dictionary.
5. **Final Output**:
- If the input string fully matches the pattern (i.e., it can be formed entirely using words from the dictionary), the program prints "Matches". Otherwise, it prints "Not Matched".
### Concept:
- The program checks if a given string can be constructed by concatenating words from a set of dictionary words, using regular expressions to perform the matching efficiently.
Telegram - t.me/+lhWGhenJ5tw0NDk1
#codingtamilan #codingintamil #java #javainterviewquestionsandanswers #javainterviewquestionsandanswersforfreshers #javainstitute #javaprogramming #javainterviewquestionsandanswersforexperienced #dynamicprogramming #dynamicprogram #dynamic #1000subscriber #100dayschallenge #100daystransformation #100daysofcode #100days #zohorecruitment #zohospecialist #zoholatestprogramming #zohotutorial #zohojobs #javaleetcode #leetcodejava #leetcodeproblems #leetcodeprograms
### Key Points:
1. **Dictionary of Words**:
- A set of predefined words (like "leet", "coded", "problems") is used to form a dictionary. These words are stored in a `HashSet` to ensure quick lookup and eliminate duplicates.
2. **Input String**:
- The input string is `"leetcodeproblems"`. The program checks if this string can be entirely composed of the words in the dictionary.
3. **Regular Expression Creation**:
- A regular expression is dynamically created by joining all the words from the dictionary with a pipe symbol (`|`), which represents an OR condition in regular expressions. This allows checking for any combination of those words in the input string.
- The resulting pattern is enclosed in parentheses and followed by `*`, which means that any of these words can repeat any number of times (including zero).
4. **Pattern Matching**:
- A `Pattern` object is created using the generated regular expression, and a `Matcher` object is used to check whether the input string matches the pattern.
- The `matches()` method is used to determine if the entire input string can be broken down into the words from the dictionary.
5. **Final Output**:
- If the input string fully matches the pattern (i.e., it can be formed entirely using words from the dictionary), the program prints "Matches". Otherwise, it prints "Not Matched".
### Concept:
- The program checks if a given string can be constructed by concatenating words from a set of dictionary words, using regular expressions to perform the matching efficiently.
Telegram - t.me/+lhWGhenJ5tw0NDk1
#codingtamilan #codingintamil #java #javainterviewquestionsandanswers #javainterviewquestionsandanswersforfreshers #javainstitute #javaprogramming #javainterviewquestionsandanswersforexperienced #dynamicprogramming #dynamicprogram #dynamic #1000subscriber #100dayschallenge #100daystransformation #100daysofcode #100days #zohorecruitment #zohospecialist #zoholatestprogramming #zohotutorial #zohojobs #javaleetcode #leetcodejava #leetcodeproblems #leetcodeprograms
มุมมอง: 122
วีดีโอ
#2 Java Leet code Problems✅ - Reverse Polish Notation - Tamil | Step by Step | DinaTechy #coding
มุมมอง 4319 ชั่วโมงที่ผ่านมา
Reverse Polish Notation (RPN) , also known as postfix notation, is a mathematical notation in which operators follow their operands. This eliminates the need for parentheses to dictate the order of operations, as is required in infix notation (the standard notation we're used to, like 3 5 ). Example In infix notation, you would write: - 3 4 In RPN, the same expression is written as: - 3 4 Here,...
#1 Java Leet code Problem✅ - Rotate Array | Tamil | Step by Step | DinaTechy #coding #leetcodejava
มุมมอง 10019 ชั่วโมงที่ผ่านมา
This program rotates the elements of an array by a specified order (number of positions), and then prints the result. Here's a step-by-step explanation with key points: 1. Divide the array two parts: 1,2,3,4 and 5, 6 2. Rotate first part: 4,3,2,1,5,6 3. Rotate second part: 4,3,2,1,6,5 4. Rotate the whole array: 5,6,1,2,3,4 Step-by-Step Explanation: 1. Input Array and Rotation Order : - An array...
Is possible to Sort Integer in Ascending Order? using Java | Tamil | DinaTechy #coding #java
มุมมอง 97วันที่ผ่านมา
Is possible to Sort Integer in Ascending Order? using Java | Tamil | DinaTechy #coding #java
Count Character Occurrence in String | Java | MNC | DinaTechy #java #coding
มุมมอง 12214 วันที่ผ่านมา
Count Character Occurrence in String | Java | MNC | DinaTechy #java #coding
Removing Character in String #string #java #codingtamilan #replace #money #simplecoding #shorts
มุมมอง 6614 วันที่ผ่านมา
Removing Character in String #string #java #codingtamilan #replace #money #simplecoding #shorts
Custom Exception in Java Step by Step | Tamil | Exception | DinaTechy #coding #java
มุมมอง 2114 วันที่ผ่านมา
Custom Exception in Java Step by Step | Tamil | Exception | DinaTechy #coding #java
Do you know Intersection between Array's? in Tamil | Java | MNC | DinaTechy #coding #java
มุมมอง 2614 วันที่ผ่านมา
Do you know Intersection between Array's? in Tamil | Java | MNC | DinaTechy #coding #java
SingleTon Class - Design Pattern in Java Step by Step | Tamil | DSA | DinaTechy #coding #java
มุมมอง 10714 วันที่ผ่านมา
SingleTon Class - Design Pattern in Java Step by Step | Tamil | DSA | DinaTechy #coding #java
Finding the longest Sub-String's length in Tamil | Java | MNC | DinaTechy #coding #java
มุมมอง 3714 วันที่ผ่านมา
Finding the longest Sub-String's length in Tamil | Java | MNC | DinaTechy #coding #java
Junit Testing with Mockito Part 7 - 2 in Tamil | Springboot | Java | DinaTechy
มุมมอง 6421 วันที่ผ่านมา
Junit Testing with Mockito Part 7 - 2 in Tamil | Springboot | Java | DinaTechy
Junit Testing with Mockito Part 7 - 1 in Tamil | Springboot | Java | DinaTechy
มุมมอง 5521 วันที่ผ่านมา
Junit Testing with Mockito Part 7 - 1 in Tamil | Springboot | Java | DinaTechy
Junit Testing with Mockito Part 6 in Tamil | Springboot | Java | DinaTechy
มุมมอง 3021 วันที่ผ่านมา
Junit Testing with Mockito Part 6 in Tamil | Springboot | Java | DinaTechy
Junit Testing with Mockito Part 5 in Tamil | Springboot | Java | DinaTechy
มุมมอง 5521 วันที่ผ่านมา
Junit Testing with Mockito Part 5 in Tamil | Springboot | Java | DinaTechy
StringJoiner : Convert Integer to String - Java 8? | தமிழ் | Interview | DinaTechy #coding #java #DT
มุมมอง 8621 วันที่ผ่านมา
StringJoiner : Convert Integer to String - Java 8? | தமிழ் | Interview | DinaTechy #coding #java #DT
Junit Testing with Mockito Part 4 in Tamil | Springboot | Java | DinaTechy
มุมมอง 10321 วันที่ผ่านมา
Junit Testing with Mockito Part 4 in Tamil | Springboot | Java | DinaTechy
Is Multiple Inheritance - Possible? in Java | தமிழ் | Explained | DinaTechy #coding #java #interview
มุมมอง 52หลายเดือนก่อน
Is Multiple Inheritance - Possible? in Java | தமிழ் | Explained | DinaTechy #coding #java #interview
Data Structure : Finding Middle Node - Singly Linked List | Java | தமிழ் | Explained | DinaTechy
มุมมอง 43หลายเดือนก่อน
Data Structure : Finding Middle Node - Singly Linked List | Java | தமிழ் | Explained | DinaTechy
Data Structure : Creating Singly Linked List in Java | தமிழ் | Explained | DinaTechy #coding #java
มุมมอง 146หลายเดือนก่อน
Data Structure : Creating Singly Linked List in Java | தமிழ் | Explained | DinaTechy #coding #java
Count Words using HashMap OG in Java | தமிழ் | Explained | DinaTechy #coding #java #interview
มุมมอง 56หลายเดือนก่อน
Count Words using HashMap OG in Java | தமிழ் | Explained | DinaTechy #coding #java #interview
J2EE Installation - OG in தமிழ் | Java | Web Project's | Installation | DinaTechy #installation
มุมมอง 31หลายเดือนก่อน
J2EE Installation - OG in தமிழ் | Java | Web Project's | Installation | DinaTechy #installation
First Unique Character in Java | தமிழ் | Dynamic Programming | DinaTechy #coding #java
มุมมอง 65หลายเดือนก่อน
First Unique Character in Java | தமிழ் | Dynamic Programming | DinaTechy #coding #java
Check Two Array's are Same in Java | தமிழ் | Logical Thinking | DinaTechy #coding #java
มุมมอง 56หลายเดือนก่อน
Check Two Array's are Same in Java | தமிழ் | Logical Thinking | DinaTechy #coding #java
How to Reversing an Array in Java | தமிழ் | Dynamic Programming | DinaTechy #coding #java
มุมมอง 77หลายเดือนก่อน
How to Reversing an Array in Java | தமிழ் | Dynamic Programming | DinaTechy #coding #java
Complete Explanation - Finding Second Largest Number in Array - தமிழ் | Java | DinaTechy #java
มุมมอง 99หลายเดือนก่อน
Complete Explanation - Finding Second Largest Number in Array - தமிழ் | Java | DinaTechy #java
Finding Repetitive Character in String? in தமிழ் | Java | Explained | DinaTechy #coding #java
มุมมอง 46หลายเดือนก่อน
Finding Repetitive Character in String? in தமிழ் | Java | Explained | DinaTechy #coding #java
Java Technical Interview : Reverse a Sentence - தமிழ் | Java | BTS | DinaTechy #java #interview
มุมมอง 86หลายเดือนก่อน
Java Technical Interview : Reverse a Sentence - தமிழ் | Java | BTS | DinaTechy #java #interview
Dynamic Programming : Counting Digit's in Number in தமிழ் | Java | Explained | DinaTechny #coding
มุมมอง 64หลายเดือนก่อน
Dynamic Programming : Counting Digit's in Number in தமிழ் | Java | Explained | DinaTechny #coding
Check the Number is Palindrome or Not! in தமிழ் | Java | MNC | DinaTechy #coding
มุมมอง 61หลายเดือนก่อน
Check the Number is Palindrome or Not! in தமிழ் | Java | MNC | DinaTechy #coding
Regex Patter : F&R Consecutive Duplicate words in தமிழ் | Java | Explained | DinaTechy #java #regex
มุมมอง 78หลายเดือนก่อน
Regex Patter : F&R Consecutive Duplicate words in தமிழ் | Java | Explained | DinaTechy #java #regex
Like
💯
Like
💯
10 not equals not 10 so true so like
Sry dude, wrong answer
Nalla video brother. Happy to see tamil people started solving leet code problems and helping us in our language.
Nandri nanba, keep supporting me ♥️, look more in "100 days coding challenge playlist" bro
Print follow
💯
Superb Explanation bro 💯
Nandri nanba
We want more videos how to solve leedcode program
Sure nanba 💯 , Subscribe and check 100 days coding challenge playlist✅
C
💯
C
💯
B
Nope
C
💯
B
💯
C
💯
B
💯 Subscribe and support for more useful content♥️
B
💯
Condition false
💯
Filter ❤
💯♥️
One doubt bro reply panuga
Yenna doubt sollunga
B)
💯
C
💯
B
💯
C
💯
Ok bro
C)
💯
Condition false
💯
Fliter
💯
Switch
Nope
Purila bro question
It is Html not Java
C)
Nope
==, <=
What is JVM, JIT, JDK EXPLAIN bro
Sure bro
Just in time
💯
| not arithmetic operator
💯
💥👌
Java virtual machine
Crt💯
Hash map pathi oru video potuga bro 🎉🎉🎉🎉
Sure pa
What is steam bro
It is java 8 concept
Thread vasu soluga bro🎉🎉🎉
Podren bro
Super, this java keyword pathi oru video potuga bro
Sure bro
Ethe mari video potuga bro🎉
Sure nanba💯
sir, You say serializable is an interface. If there is any method in interface we will implement it only if so what method is there in serializable port why implement it please tell me clearly sir
It's markable interface, this type of interfaces doesn't have any methods.
@@dinatechy1805 Okay sir, Thank you for your reply
Make more videos we are watching
Sure 💯
Etha concept nala enna use sir
Orey service thirumba thirumba manual check panna Venda idha run pannivita adhuvey check panni sollodum, whether it's working or not
What is junit bro
Watch the part one in JUnit playlist
Ok sir
package jj; import java.util.*; public class bh { public static void main(String[] args) { int[] a={1,2,3,4 ,5}; String re=Arrays.toString(a).replace(",","-"); re=re.substring(1,re.length()-1); System.out.println(re); } } Ethu la time and space complexity evalo bro varu
Time Complexity: O(n), Space Complexity: O(n) - StringJoiner is better in terms of both space efficiency and readability.
can you write testcase to cover the catch block?
Here's the video - th-cam.com/video/Z6MX5nEfVuE/w-d-xo.html . Share your feedback after watching, Subscribe and Support.....
Hi sir Good Explanations
Tqs pa❤ Subscribe and Share it to your friends...
Excellent bro🎉🎉🎉
Tqs bro
Tq bro🎉🎉😊😊
Println ella ma pota ore line la tha sir varuthu