Whoever you are i don't give a damn i will never respond so do respond on that poll
Java Hyd Team
The game is rigged, but that doesn't mean you shouldn't play. Learn the rules, network like hell, and make moves.
This is for those who think only few members are getting the opportunity to get a job we are not privileged for the job or interview we do learn n implement things for the job if you can beat 8rounds of interview you can also join let me know i will personally send your resume with a good remark of yours on HR mind
Java Hyd Team
How to achieve 100% abstraction??
14 people saw this poll out of 14 only 3 voted and rest 11 things we are privileged to get a job think wisely before uttering a single word we are ready to push you to next level but you guys have to come ahead then only we can offer you the best
Who the hell will provide you videos for each concept, hand written notes with diagram and everything possible that we can do
You might think that we have a good connection with people but definitely we made that happen they know what we deliver what we are pushing if someone is having issues with me let me know please don't tell to someone your image will only be down for me n literally i don't care because that creates some red mark on your profile only don't be nibba nibbi here those day's gone be professional
You might think that we have a good connection with people but definitely we made that happen they know what we deliver what we are pushing if someone is having issues with me let me know please don't tell to someone your image will only be down for me n literally i don't care because that creates some red mark on your profile only don't be nibba nibbi here those day's gone be professional
We are not here to entertain we are here to push you all to the next level of organisation with a good package with a attitude to reject something that you don't want if you want us to push you please be active else message me in person I will remove everyone because I have a team to care for n that'also is good if i can push 10 members of my team i can push rest 112 members also take it as an opportunity not as something school ki baatein
What we want you all to be you will remember for almost 5 years from now ๐
You can ask any of my teammates who followed me they have a great change in concepts and coding skills if they will give level easy questions also 95% of members can't do those questions
This media is not supported in your browser
VIEW IN TELEGRAM
โฒillustration of data processing from raw to end userโฒ
โพits step by step process how data flows from data source.
โข data source: data source is simply the source of the data.
โขdata loaders: data loader is a application for the bulk import or export of data.
โขdata lake: a data lake is a centralized repository designed to store, process, and secure large amounts of structured, semi structured, and unstructured data.
โข data visualization: data visualization is a way to represent information graphically, highlighting patterns and trends in data.
โข ml development: machine learning deals with the issue of how to build computer programs that improve their performance at some tasks through experience.
graphic credit: semantix (data platform)
โพthis infographics delivers highly valuable information to understand the flow of data.
tags-
#data #engineering #analytics #science #intelligence #visualization #machinelearning #bigdata #dataengineering #computing #datascience #dataanalytics #datamining #ai #ml #learning
โพits step by step process how data flows from data source.
โข data source: data source is simply the source of the data.
โขdata loaders: data loader is a application for the bulk import or export of data.
โขdata lake: a data lake is a centralized repository designed to store, process, and secure large amounts of structured, semi structured, and unstructured data.
โข data visualization: data visualization is a way to represent information graphically, highlighting patterns and trends in data.
โข ml development: machine learning deals with the issue of how to build computer programs that improve their performance at some tasks through experience.
graphic credit: semantix (data platform)
โพthis infographics delivers highly valuable information to understand the flow of data.
tags-
#data #engineering #analytics #science #intelligence #visualization #machinelearning #bigdata #dataengineering #computing #datascience #dataanalytics #datamining #ai #ml #learning
Top LeetCode questions asked in ๐๐ฉ๐ฉ๐ฅ๐ ๐๐ง๐ญ๐๐ซ๐ฏ๐ข๐๐ฐ๐ฌ for SDE role โค๏ธ
๐ Two Sum (32 times): https://lnkd.in/dz-nQabK
๐ Move Zeroes : https://lnkd.in/dWrM3guU
๐ Roman to Integer : https://lnkd.in/d3wrkWAb
๐ Reverse Integer : https://lnkd.in/dakwsvz9
๐ Contains Duplicate : https://lnkd.in/dSGzKSpr
๐ Longest Common Prefix: https://lnkd.in/dinx-Rxz
๐ Container With Most Water : https://lnkd.in/d866PPSK
๐ First Missing Positive : https://lnkd.in/dniF7c7g
๐ Search Insert Position : https://lnkd.in/dZwwnapr
๐ Search in Rotated Sorted Array : https://lnkd.in/dAnewRjw
๐ Trapping Rain Water : https://lnkd.in/dseQCGsV
๐ Product of Array Except Self : https://lnkd.in/d4UZTW7G
๐ Number of Islands (13 times): https://lnkd.in/dEcneG2G
๐ Reverse Linked List (11 times): https://lnkd.in/dVmKdqvP
๐ Group Anagrams (11 times): https://lnkd.in/d9wXHgK9
๐ Valid Parentheses (10 times): https://lnkd.in/d2qy5P9D
๐ Merge Intervals (9 times): https://lnkd.in/dvQYHsQf
๐ Word Break (9 times): https://lnkd.in/dTyrvmrd
๐ Median of Two Sorted Arrays (9 times): https://lnkd.in/dtF7QHsY
๐ Product of Array Except Self (8 times): https://lnkd.in/ddtJrVQX
๐ Maximum Subarray (8 times): https://lnkd.in/d8t24BMj
๐ Longest Common Prefix (7 times): https://lnkd.in/gG6J3N6v
๐ Longest Substring Without Repeating Characters (7 times): https://lnkd.in/dAr9a5Ny
๐ Word Search II (7 times): https://lnkd.in/dAV9Xg24
๐ 3Sum (7 times): https://lnkd.in/d_vhP7X8
๐ Permutations (7 times): https://lnkd.in/gHzEEqw3
๐ Longest Palindromic Substring (6 times): https://lnkd.in/dFpK7Vbu
๐Click this link and let the magic begin
https://www.linkedin.com/mwlite/in/aman-raj-6168b616a
๐ Two Sum (32 times): https://lnkd.in/dz-nQabK
๐ Move Zeroes : https://lnkd.in/dWrM3guU
๐ Roman to Integer : https://lnkd.in/d3wrkWAb
๐ Reverse Integer : https://lnkd.in/dakwsvz9
๐ Contains Duplicate : https://lnkd.in/dSGzKSpr
๐ Longest Common Prefix: https://lnkd.in/dinx-Rxz
๐ Container With Most Water : https://lnkd.in/d866PPSK
๐ First Missing Positive : https://lnkd.in/dniF7c7g
๐ Search Insert Position : https://lnkd.in/dZwwnapr
๐ Search in Rotated Sorted Array : https://lnkd.in/dAnewRjw
๐ Trapping Rain Water : https://lnkd.in/dseQCGsV
๐ Product of Array Except Self : https://lnkd.in/d4UZTW7G
๐ Number of Islands (13 times): https://lnkd.in/dEcneG2G
๐ Reverse Linked List (11 times): https://lnkd.in/dVmKdqvP
๐ Group Anagrams (11 times): https://lnkd.in/d9wXHgK9
๐ Valid Parentheses (10 times): https://lnkd.in/d2qy5P9D
๐ Merge Intervals (9 times): https://lnkd.in/dvQYHsQf
๐ Word Break (9 times): https://lnkd.in/dTyrvmrd
๐ Median of Two Sorted Arrays (9 times): https://lnkd.in/dtF7QHsY
๐ Product of Array Except Self (8 times): https://lnkd.in/ddtJrVQX
๐ Maximum Subarray (8 times): https://lnkd.in/d8t24BMj
๐ Longest Common Prefix (7 times): https://lnkd.in/gG6J3N6v
๐ Longest Substring Without Repeating Characters (7 times): https://lnkd.in/dAr9a5Ny
๐ Word Search II (7 times): https://lnkd.in/dAV9Xg24
๐ 3Sum (7 times): https://lnkd.in/d_vhP7X8
๐ Permutations (7 times): https://lnkd.in/gHzEEqw3
๐ Longest Palindromic Substring (6 times): https://lnkd.in/dFpK7Vbu
๐Click this link and let the magic begin
https://www.linkedin.com/mwlite/in/aman-raj-6168b616a
lnkd.in
LinkedIn
This link will take you to a page thatโs not on LinkedIn
๐๐ข๐ฌ๐ญ๐ซ๐ข๐๐ฎ๐ญ๐๐ ๐๐๐๐ก๐ ๐๐ฒ๐ฌ๐ญ๐๐ฆ: One of the most interesting concepts in system design.
๐๐ก๐๐ญ ๐ข๐ฌ ๐๐๐๐ก๐?
A cache is a data storage component that can be hardware or software. It enables the client to find data more quickly than other types of memory.
๐๐ก๐๐ญ ๐ข๐ฌ ๐๐ข๐ฌ๐ญ๐ซ๐ข๐๐ฎ๐ญ๐๐ ๐๐๐๐ก๐ ๐๐ฒ๐ฌ๐ญ๐๐ฆ?
If the data is too large to be served by a single cache on a single machine, a distributed machine is required to serve the clients' requests in a scalable and distributed manner. This is referred to as a distributed cache system.
๐๐จ๐ฐ ๐๐ข๐ฌ๐ญ๐ซ๐ข๐๐ฎ๐ญ๐๐ ๐๐๐๐ก๐ ๐๐ฒ๐ฌ๐ญ๐๐ฆ ๐ฐ๐จ๐ซ๐ค๐ฌ?
Generally, a Distributed Cache is based on a Distributed Hash Table(DHT) (a decentralized storage system that provides lookup and storage schemes similar to a hash table for storing key-value pairs.) which is similar to a hash table but spread across multiple nodes. By managing the addition, DHT enables a distributed cache to scale on the fly.
๐๐จ๐ฐ ๐๐จ ๐ฐ๐ ๐๐ฏ๐ข๐๐ญ ๐ญ๐ก๐ ๐๐๐๐ก๐ ๐๐ง๐ ๐ฐ๐ก๐๐ง ๐๐จ ๐ฐ๐ ๐ง๐๐๐ ๐ญ๐จ ๐๐ฏ๐ข๐๐ญ ๐ญ๐ก๐ ๐๐๐๐ก๐?
Eviction means removing key and value entries from the cache memory, as the cache is expensive, and not all the values present there are always being used. So we need to identify which entry is not being used and is sitting at the location ideally.
One of the common strategies is โLeast Recently Usedโ or LRU. Delete the entry which is recently being used.
๐๐จ๐ฐ ๐๐๐ง ๐ฐ๐ ๐ฌ๐ฉ๐๐๐ ๐ฎ๐ฉ ๐ญ๐ก๐ ๐ฉ๐ซ๐จ๐๐๐ฌ๐ฌ?
We need a service that serves get/put/delete requests; even though we're using RAM, which is fast, it's still blocking calls.
We can use 2 Logic:
- spawn n no of threads as and when we get the requests or we can have a bigger thread pool to handle thread.
- Event-driven logic.
๐๐ก๐๐ญ ๐ข๐ฌ ๐๐๐๐ก๐?
A cache is a data storage component that can be hardware or software. It enables the client to find data more quickly than other types of memory.
๐๐ก๐๐ญ ๐ข๐ฌ ๐๐ข๐ฌ๐ญ๐ซ๐ข๐๐ฎ๐ญ๐๐ ๐๐๐๐ก๐ ๐๐ฒ๐ฌ๐ญ๐๐ฆ?
If the data is too large to be served by a single cache on a single machine, a distributed machine is required to serve the clients' requests in a scalable and distributed manner. This is referred to as a distributed cache system.
๐๐จ๐ฐ ๐๐ข๐ฌ๐ญ๐ซ๐ข๐๐ฎ๐ญ๐๐ ๐๐๐๐ก๐ ๐๐ฒ๐ฌ๐ญ๐๐ฆ ๐ฐ๐จ๐ซ๐ค๐ฌ?
Generally, a Distributed Cache is based on a Distributed Hash Table(DHT) (a decentralized storage system that provides lookup and storage schemes similar to a hash table for storing key-value pairs.) which is similar to a hash table but spread across multiple nodes. By managing the addition, DHT enables a distributed cache to scale on the fly.
๐๐จ๐ฐ ๐๐จ ๐ฐ๐ ๐๐ฏ๐ข๐๐ญ ๐ญ๐ก๐ ๐๐๐๐ก๐ ๐๐ง๐ ๐ฐ๐ก๐๐ง ๐๐จ ๐ฐ๐ ๐ง๐๐๐ ๐ญ๐จ ๐๐ฏ๐ข๐๐ญ ๐ญ๐ก๐ ๐๐๐๐ก๐?
Eviction means removing key and value entries from the cache memory, as the cache is expensive, and not all the values present there are always being used. So we need to identify which entry is not being used and is sitting at the location ideally.
One of the common strategies is โLeast Recently Usedโ or LRU. Delete the entry which is recently being used.
๐๐จ๐ฐ ๐๐๐ง ๐ฐ๐ ๐ฌ๐ฉ๐๐๐ ๐ฎ๐ฉ ๐ญ๐ก๐ ๐ฉ๐ซ๐จ๐๐๐ฌ๐ฌ?
We need a service that serves get/put/delete requests; even though we're using RAM, which is fast, it's still blocking calls.
We can use 2 Logic:
- spawn n no of threads as and when we get the requests or we can have a bigger thread pool to handle thread.
- Event-driven logic.
Java Hyd Team
OracleDatabaseNotesForProfessionals (1).pdf
Keep these notes always it will help you in everything related to Oracle database
//Write a java program accept date of birth from scanner and check eligible for vote ?
import java.util.Scanner;
public class Main
{
public static void main(String[] args)
{
Scanner in = new Scanner(System.in);
System.out.print("Input your date of birth (yyyy-mm-dd) : ");
String inputString = in.nextLine();
if (inputString.length() != 10)
{
System.out.println("Error: Invalid length");
}
else
{
String[] date = inputString.split("-");
int year = Integer.parseInt(date[0]);
int month = Integer.parseInt(date[1]);
int day = Integer.parseInt(date[2]);
if (year < 2002)
{
System.out.println("You are eligible to vote.");
}
else
{
if (year > 2002)
{
System.out.println("You are not eligible to vote.");
}
else
{
if (month < 10)
{
System.out.println("You are eligible to vote.");
}
else
{
if (month > 10)
{
System.out.println("You are not eligible to vote.");
}
else
{
if (day <= 27)
{
System.out.println("You are eligible to vote.");
}
else
{
System.out.println("You are not eligible to vote.");
}
}
}
}
}
}
}
}
import java.util.Scanner;
public class Main
{
public static void main(String[] args)
{
Scanner in = new Scanner(System.in);
System.out.print("Input your date of birth (yyyy-mm-dd) : ");
String inputString = in.nextLine();
if (inputString.length() != 10)
{
System.out.println("Error: Invalid length");
}
else
{
String[] date = inputString.split("-");
int year = Integer.parseInt(date[0]);
int month = Integer.parseInt(date[1]);
int day = Integer.parseInt(date[2]);
if (year < 2002)
{
System.out.println("You are eligible to vote.");
}
else
{
if (year > 2002)
{
System.out.println("You are not eligible to vote.");
}
else
{
if (month < 10)
{
System.out.println("You are eligible to vote.");
}
else
{
if (month > 10)
{
System.out.println("You are not eligible to vote.");
}
else
{
if (day <= 27)
{
System.out.println("You are eligible to vote.");
}
else
{
System.out.println("You are not eligible to vote.");
}
}
}
}
}
}
}
}
This is correct code but this brute code will update you with correct n small code for the same