![Shrayansh Jain](/img/default-banner.jpg)
- 82
- 90 406
Shrayansh Jain
India
เข้าร่วมเมื่อ 24 พ.ย. 2022
DSA Practice + Career Experience talks + Mock Interviews + Guidance + other Software engineering stuffs but little in casual way will happen here :)
HTTP response status codes | REST API response codes | @ConceptandCoding
Spring boot playlist: th-cam.com/play/PL6W8uoQQ2c60g6_fcjDCLHSx1LBeVYqyZ.html
#springboot #java #softwareengineer
#springboot #java #softwareengineer
มุมมอง: 966
วีดีโอ
HATEOAS (Spring boot) in 10Mins | HATEOAS RESTful API by @ConceptandCoding
มุมมอง 1.2K12 ชั่วโมงที่ผ่านมา
in-depth video: th-cam.com/video/agts012X8h4/w-d-xo.htmlsi=noTHVVgM0nKdt4dV
Spring boot Filters vs Interceptors in 10Mins | @ConceptandCoding
มุมมอง 1.1K21 ชั่วโมงที่ผ่านมา
👉 Spring boot playlist: th-cam.com/play/PL6W8uoQQ2c60g6_fcjDCLHSx1LBeVYqyZ.html In-depth video on Filters vs Interceptors: th-cam.com/video/H6Xi0UlHjh0/w-d-xo.html #springboot #java #softwareengineer
Maven in 10 Mins | SpringBoot Maven Quick Overview and Revision | @ConceptandCoding
มุมมอง 1.2Kวันที่ผ่านมา
👉 Maven in depth video: th-cam.com/video/1e4jNP8iKLo/w-d-xo.html 👉 Spring boot playlist: th-cam.com/play/PL6W8uoQQ2c60g6_fcjDCLHSx1LBeVYqyZ.html 👉 Pre-requisite: Java: th-cam.com/play/PL6W8uoQQ2c63f469AyV78np0rbxRFppkx.html #springboot #java #softwareengineer
AMQ vs Batch Job | Kafka vs Spring Batch | Software Engineer | @ConceptandCoding
มุมมอง 1.5K14 วันที่ผ่านมา
AMQ (message queue): It’s used to send and receive messages between different parts of a system in async manner. Batch Job: This is like doing things in bulk at a scheduled time. Instead of processing each task as soon as it comes in (like AMQ), a batch job collects tasks and processes them all at once, usually at a specific time or interval. For example, NEFT Money trafer which process the job...
Amazon SDE Interview Question and Solution || LC: 735, Asteroid Collision
มุมมอง 38710 หลายเดือนก่อน
#amazon #dsa #interview
LC: 443 || String Compression || Can you find its correct Time Complexity?
มุมมอง 1.8K10 หลายเดือนก่อน
LC: 443 || String Compression || Can you find its correct Time Complexity?
LC: 75 || SORT COLORS || DSA Interview Preparation
มุมมอง 42910 หลายเดือนก่อน
LC: 75 || SORT COLORS || DSA Interview Preparation
Microsoft Online Assessment Questions and Solution || DSA Interview Practice || SDE
มุมมอง 3.4K10 หลายเดือนก่อน
Microsoft Online Assessment Questions and Solution || DSA Interview Practice || SDE
LC: 283 || Move Zeroes || DSA Interview Preparation
มุมมอง 51610 หลายเดือนก่อน
LC: 283 || Move Zeroes || DSA Interview Preparation
LC: 1356 | Sort Integers by the number of 1 Bits
มุมมอง 1.6K10 หลายเดือนก่อน
LC: 1356 | Sort Integers by the number of 1 Bits
Walmart SDE Interview DSA Questions - Interview preparation
มุมมอง 4.7K10 หลายเดือนก่อน
Walmart SDE Interview DSA Questions - Interview preparation
LC:542 | 01 Matrix | Microsoft interview question
มุมมอง 33210 หลายเดือนก่อน
LC:542 | 01 Matrix | Microsoft interview question
Microsoft SDE1 Interview DSA Questions - Interview preparation
มุมมอง 66110 หลายเดือนก่อน
Microsoft SDE1 Interview DSA Questions - Interview preparation
LC:14 | Longest Common Prefix | DSA Coding interview preparation
มุมมอง 45311 หลายเดือนก่อน
LC:14 | Longest Common Prefix | DSA Coding interview preparation
LC:70 | Climbing Stairs | DSA Coding interview preparation
มุมมอง 53311 หลายเดือนก่อน
LC:70 | Climbing Stairs | DSA Coding interview preparation
LC:202 | Happy Number | DSA Coding interview preparation
มุมมอง 36311 หลายเดือนก่อน
LC:202 | Happy Number | DSA Coding interview preparation
LC:13 | Roman to Integer | DSA Coding interview preparation
มุมมอง 37911 หลายเดือนก่อน
LC:13 | Roman to Integer | DSA Coding interview preparation
LC: 219 | Contains Duplicate II | Daily DSA interview problem practice
มุมมอง 70111 หลายเดือนก่อน
LC: 219 | Contains Duplicate II | Daily DSA interview problem practice
LC: 101 | Symmetric Tree | Daily DSA interview problem practice
มุมมอง 52311 หลายเดือนก่อน
LC: 101 | Symmetric Tree | Daily DSA interview problem practice
LC: 190 | Reverse Bits | Daily DSA interview problem practice
มุมมอง 38711 หลายเดือนก่อน
LC: 190 | Reverse Bits | Daily DSA interview problem practice
LC: 350 | Intersection of 2 Array | Easy
มุมมอง 46611 หลายเดือนก่อน
LC: 350 | Intersection of 2 Array | Easy
Facing Health issues & need break, should i change company or stay in same company | Career Guidance
มุมมอง 1.1Kปีที่แล้ว
Facing Health issues & need break, should i change company or stay in same company | Career Guidance
Non IT experience + 2yr Career Break, Anish Career Guidance call
มุมมอง 552ปีที่แล้ว
Non IT experience 2yr Career Break, Anish Career Guidance call
Tips to Grow as a YouTube and LinkedIn Content Creator | Dos and Don't for SDE content creator
มุมมอง 271ปีที่แล้ว
Tips to Grow as a TH-cam and LinkedIn Content Creator | Dos and Don't for SDE content creator
Could you make a short video on GetMapping vs PostMapping Put mapping vs Patch Mapping
noted
Please upgrade to smart board.😢
Thanks for the clear explanation.
awesome
New subscriber here🎉 Pls do videos on java development springboot ❤
I was solving it by using a 10 Length Array of Max Heap. Numbers starting with the same digit are put in the maxheap. Then polling Max Heap from digits 9 to 0. But then realized the same thing that custom comparator logic is needed to keep the numbers starting with the same digit sorted.
I am going to join hcl sholinganallur. Which location would be the best for home rent? Anyone please let me know.
olympia opaline
First one is similar to paint house and second is LIS
Sir just a quick suggestion content is too much good but board size effect
tried to solve in latest video
Hi I want to transition as a backend engg in java , i dont have any knowledge about java and its frameworks, where do i start on your channel?.
at concept and coding channel, pls check Java Basics to advanced playlist and then springboot playlist,
@@JainShrayansh thanks One question do the udemy course gets upated with time?
yes
Want to see the whiteboard information rather you😅
its a bundle :)
Seems Good Way to cover topic, little bit more focus on white board will add more value to video.
Same
very nice video, thank you.
Spring Boot from Basics to Advanced (All Videos are in English) th-cam.com/play/PL6W8uoQQ2c60g6_fcjDCLHSx1LBeVYqyZ.html
Ok
Looks like he forget about this account password 😂
i think 2nd question is somewhat like mergeIntervals , for every ith pair we will see if the jth pair can be merged with it
Very good explanation
Superb explanation
Great content what ever you said 💯% true m here in Chennai from last 7 months people of chennai is very nice and educated there is no hate for North Indian here even they respect hindi speaking people more what ever we see in media is totally false and fake Tamil people are hard working and honest they are very down-to-earth very helpful no showoff life in Chennai is peaceful you can settle here with family also
in second question, what will be the approach if we can rearrange the elements ?
😪
thank you for making this channel
Bhaiya what about job losses due to AI and being replaced by AI?
where is code
bhaiya konsa pentab and software h , mujhe lena h dsa k notes and question k liye
Is it in c or c++ language?
first question is leetcode 1004 max consecutive ones III. already solved using sliding window.
Very nice explaination
how is kla tencor Chennai?
result[0]=1; why you use this??
i did this in question in o(n^2 + m) because of that i am getting time exceed in leetcode algorithm optimisation is very hard
I think First question is of DP and second question is of dfs with memorization. O(N) complexity for both
can u please provide me pdf of this book
ack
This question has been asked to me in EPAM Company's interview. Thanks Shreyansh for DSA series
thanks
But your speaking style is funny 😂
from collections import Counter def minimum_window(str1,str2): window="a"*(len(str1)+1) left=0 count=0 hashmap=Counter(str2) for i in range(len(str1)): if str1[i] in hashmap: hashmap [str1[i]]-=1 if hashmap [str1[i]]>=0: count+=1 while count==len(str2): if len(str1[left:i+1]) < len(window): window=str1[left:i+1] if str1[left] in hashmap: hashmap [str1[left]]+=1 if hashmap [str1[left]]>0: count-=1 left+=1 return window str1='ADOBECODEBANC' str2='ABC' print(minimum_window(str1,str2)) str1 = "PRWSOERIUSFK" str2 = "OSU" print(minimum_window(str1,str2))
Just one for loop in the efficient approach.......use one more index say nonzero index.....and make nums(nonzeroindex) = num and nums(i) = 0 .....???
Ground to earth
if someone needs the code . class Solution { TrieSearch root; public List<List<String>> suggestedProducts(String[] products, String searchWord) { List<List<String>> result = new ArrayList<List<String>>(); root = callFillTrie(products); String prefix=""; for(char c : searchWord.toCharArray()) { List<String> outputforprefix = new ArrayList<String>(); prefix = prefix + c; outputforprefix = searchString(prefix); result.add(outputforprefix); } return result; } public List<String> searchString(String prefix) { TrieSearch searchStartNode = root; List<String> result = new ArrayList<String>(); for (char c : prefix.toCharArray()) { if (searchStartNode.nodes[c - 'a'] == null) { return result; } searchStartNode = searchStartNode.nodes[c - 'a']; } dfs(searchStartNode, result); return result; } public void dfs(TrieSearch rootNode, List<String> outputforprefix) { if (outputforprefix.size() == 3) { return; } if (rootNode.word != null) { outputforprefix.add(rootNode.word); } for (int i = 0; i < 26; i++) { if (rootNode.nodes[i] != null) { dfs(rootNode.nodes[i], outputforprefix); } } } public TrieSearch callFillTrie(String[] products) { TrieSearch result = new TrieSearch(); for (String product : products) { insertIntoTrie(product, result); } return result; } public void insertIntoTrie(String product, TrieSearch trieSearchNode) { for (int i = 0; i < product.length(); i++) { char ch = product.charAt(i); int index = ch - 'a'; TrieSearch searchNode; if (trieSearchNode.nodes[index] == null) { searchNode = new TrieSearch(); trieSearchNode.nodes[index] = searchNode; } searchNode = trieSearchNode.nodes[index]; if (i == product.length() - 1) { searchNode.word = product; } trieSearchNode = searchNode; } } class TrieSearch { String word; TrieSearch nodes[] = new TrieSearch[26]; } }
for 2nd solution eg. " )(* " expected ans - False as per soln - True i think second solution is not valid
@preetnandeshwar5331 see when first character is ')' [closing bracket] then according to the condition minleft= max(0,minleft-1) so minleft=0 and maxleft=maxleft-1 so maxleft=-1 after that at last one condition is there if(maxleft<0) return false so this algorithm will give answer=false.
What is this man, you dont even know how to explain the algorithm, you are just showing the code. Where is intuition, approach and nothing is explained clearly. Please improve yourself, you are wasting others time.
Sorry, I am not a DSA expertise, this channel I have created for my DSA practice and maintaining my consistency. But I will try to add those details which you have mentioned. Thanks for the feedback
Hi Shrayansh, I miss this series. I have decided to follow along with you for 100days. But unfortunately, There were no videos for the past 2 weeks now. What happened?
Hi, sorry buddy, got involved in couple of office projects with hard timelines. I am practicing but video making is not getting possible, as creation/ uploading takes time too. I am solving 3 days in a week for now, But hope from December I will start uploading video too.
Problem for food in Chennai is a joke.
try to learn south Indian language when you come to south. don’t impose Hindi here.
It's very hard to learn these noodles like language 😂
@@spinandexplore then don't come here
@@spinandexplore at least you can learn to speak..... Or communicate in English. Don't impose Hindi
@@subramanyamshankar1767 Who is imposing Hindi here, if you guys can understand it then try to communicate and cooperate with us. No one wants to leave their native place but life creates such situations that we have to leave it.
@@spinandexplore guys coming from North have no inclination to learn local language.... When we south Indian come to north, we learn Hindi.
Millenia Business Park Phase - II Campus 3A 143, Dr. M.G.R Road, N Veeranam Salai, Kandhanchavadi, Perungudi, Chennai, Tamil Nadu 600096 Idhar office ho to kaha rehna sahi rehega aur kitna kharcha ho sakta hai for single living? For pg and 1bhk or 1RK flat? Btw, I have been searching for a good comprehensive vdo regarding this and your video is the proper one I need. So, thank you❣️
Hi Shrayansh, Please post the question by Morning so that we can give it a try before coming to the solution video. Kindly consider.
Yes, sorry generally i do this but i forgot to post today. Will do it from tomm
@@JainShrayansh No issues Shrayansh! Apart from your office work, you are doing this and helping us a lot! Thanks a lot!
Thanks buddy.
Promo`SM
2 nd question do check it out and suggest any optimizations #include <iostream> #include <bits/stdc++.h> using namespace std; int ans = INT_MIN; void f(int idx,vector<int> &arr,int cnt,vector<int> &dp); int main() { // Write C++ code here vector<int> arr = {34,23,1,2,42,12,2,4,1,3,4,7,7,8,8,9,9,12}; //output : 3 pairs to be deleted = 34,23 | 42,12 | 1,3 vector<int> dp(arr.size(),-1); for(int i=0;i<arr.size();i+=2){ f(i,arr,1,dp); } cout<<arr.size()/2 - ans; return 0; } void f(int idx,vector<int> &arr,int cnt,vector<int> &dp){ // cout<<"Running"<<endl; // int ans = INT_MIN; if(dp[idx]!=-1){ cnt = dp[idx]; return ; } if(idx>=arr.size()-2){ // cout<<"Running"<<endl; ans = max(ans,cnt); dp[idx] = ans; return ; } for(int k=idx+2;k<arr.size();k+=2){ // cout<<arr[k]<<endl; if(arr[k] == arr[idx+1]){ // cout<<"Runing"<<endl; f(k,arr,cnt+1,dp); } if(k>=arr.size()-2){ ans = max(ans,cnt); dp[idx] = ans; return ; } } }
thanks for the question, dnf algo i think
Yes