30 days agenda to learn Two Pointers approach. Follow our company page to get more content.
https://www.linkedin.com/posts/badkul-technology_two-pointers-30-days-agenda-activity-7259060076244557824-ZpIK?utm_source=share&utm_medium=member_desktop
https://www.linkedin.com/posts/badkul-technology_two-pointers-30-days-agenda-activity-7259060076244557824-ZpIK?utm_source=share&utm_medium=member_desktop
Linkedin
Badkul Technology on LinkedIn: Two Pointers 30 days Agenda
30 days agenda to learn Two Pointers approach
๐3โค1
https://www.linkedin.com/company/badkul-technology/posts/?feedView=all
Please follow our company page to get informative content and job openings at one place
Please follow our company page to get informative content and job openings at one place
LinkedIn
LinkedIn Login, Sign in | LinkedIn
Login to LinkedIn to keep in touch with people you know, share ideas, and build your career.
๐1
Here are most asked DSA topic wise questions to clear your next interview
https://www.linkedin.com/feed/update/urn:li:activity:7263749192651579392
https://www.linkedin.com/feed/update/urn:li:activity:7263749192651579392
๐1๐ฅฐ1
Most asked interview questions on LinkedList
https://www.linkedin.com/feed/update/urn:li:activity:7264151426816233473
https://www.linkedin.com/feed/update/urn:li:activity:7264151426816233473
Linkedin
Badkul Technology on LinkedIn: #interview #interviewprep
Most Asked Interview Questions
โค ๐๐ถ๐ป๐ธ๐ฒ๐ฑ ๐๐ถ๐๐๐:
10. Reverse a linked list.
11. Detect a cycle in a linked list.
12. Find the middle of a linkedโฆ
โค ๐๐ถ๐ป๐ธ๐ฒ๐ฑ ๐๐ถ๐๐๐:
10. Reverse a linked list.
11. Detect a cycle in a linked list.
12. Find the middle of a linkedโฆ
โค1
This completes our list of 40 most important questions on data structure
https://www.linkedin.com/posts/badkul-technology_most-asked-questions-on-stack-and-queue-activity-7265603628105695232-GGtk?utm_source=share&utm_medium=member_desktop
https://www.linkedin.com/posts/badkul-technology_most-asked-questions-on-stack-and-queue-activity-7265603628105695232-GGtk?utm_source=share&utm_medium=member_desktop
Linkedin
โค ๐ฆ๐ผ๐ฟ๐๐ถ๐ป๐ด ๐ฎ๐ป๐ฑ ๐ฆ๐ฒ๐ฎ๐ฟ๐ฐ๐ต๐ถ๐ป๐ด:
35. Implement (bubbleโฆ | Badkul Technology
35. Implement (bubbleโฆ | Badkul Technology
โค ๐ฆ๐ผ๐ฟ๐๐ถ๐ป๐ด ๐ฎ๐ป๐ฑ ๐ฆ๐ฒ๐ฎ๐ฟ๐ฐ๐ต๐ถ๐ป๐ด:
35. Implement (bubble, insertion, selection, merge) sort.
36. Implement quicksort.
37. Implement binary search.
38. Implement interpolation search.
39. Find the kth smallest element in an array.
40. Given an array of integersโฆ
35. Implement (bubble, insertion, selection, merge) sort.
36. Implement quicksort.
37. Implement binary search.
38. Implement interpolation search.
39. Find the kth smallest element in an array.
40. Given an array of integersโฆ
๐3
Which Java 8 feature allows us to filter a collection based on a predicate?
Anonymous Quiz
51%
Lambda Expression
11%
Default Method
7%
Optional class
31%
Stream API
โค9๐2๐1
Predict the output of the program
List<Integer> numbers = Arrays.asList(11, 20, 33, 45, 52);
int sum = numbers.stream()
.filter(n -> n % 4 == 0)
.map(n -> n * 2)
.reduce(0, Integer::sum);
System.out.println(sum);
List<Integer> numbers = Arrays.asList(11, 20, 33, 45, 52);
int sum = numbers.stream()
.filter(n -> n % 4 == 0)
.map(n -> n * 2)
.reduce(0, Integer::sum);
System.out.println(sum);
โค9๐2
https://www.linkedin.com/posts/sonam-jain-32326145_urgent-hiring-for-automation-lead-4-7-years-activity-7273228373546389505-O1wp?utm_source=share&utm_medium=member_desktop
apply if you are looking for job.
apply if you are looking for job.
Linkedin
Urgent Hiring for Automation Lead (4-7 years exp)
Notice Period:โฆ | Sonam Jain
Notice Period:โฆ | Sonam Jain
Urgent Hiring for Automation Lead (4-7 years exp)
Notice Period: asap
Key Responsibilities :
Mentor the QA team, setting clear objectives and ensuring high-quality deliverables.
Design, develop, and execute comprehensive test plans and test cases for manualโฆ
Notice Period: asap
Key Responsibilities :
Mentor the QA team, setting clear objectives and ensuring high-quality deliverables.
Design, develop, and execute comprehensive test plans and test cases for manualโฆ
๐1