CrackYourInternship

******Revise with Arsh challenge A 45-day challenge to help you improve your DSA skills and earn exciting prizes!

******How to participate? Solve the DSA Sheet by Arsh in 45-60 Days with 4-5 questions daily. Maintain a GitHub repository named #CrackYourInternship or #CrackYourPlacement and update your progress.

******What is the DSA Sheet? A curated set of around 270-280 questions frequently asked in product-based company interviews and online assessments.

******How was it curated? Based on recent trends in assessments and interviews from 50+ big tech companies, including Amazon, Microsoft, Uber, Adobe, and startups.

******Build in Public Announce on LinkedIn/Twitter/Instagram that you are starting #CrackYourInternship or #CrackYourPlacement Challenge to stay accountable.

******Benefits: Interview-ready for your Internship and Placement season. Referrals to dream companies upon completion. Mentorship sessions for top performers. Dedicated test series for company assessments. Prizes for consistent participants.

Name		Name	Last commit message	Last commit date
Latest commit History 14 Commits
.gitignore		.gitignore
3Sum.cpp		3Sum.cpp
4Sum.cpp		4Sum.cpp
AGGRCOW - Aggressive cows.cpp		AGGRCOW - Aggressive cows.cpp
Add Binary.cpp		Add Binary.cpp
Add Two Numbers II.cpp		Add Two Numbers II.cpp
Add Two Numbers.cpp		Add Two Numbers.cpp
Alien Dictionary.cpp		Alien Dictionary.cpp
All Nodes Distance K in Binary Tree.cpp		All Nodes Distance K in Binary Tree.cpp
All Unique Permutations of an array.cpp		All Unique Permutations of an array.cpp
Allocate Minimum Pages.cpp		Allocate Minimum Pages.cpp
Array		Array
Array1		Array1
As Far from Land as Possible.cpp		As Far from Land as Possible.cpp
BFS of graph.cpp		BFS of graph.cpp
Backspace String Compare.cpp		Backspace String Compare.cpp
Balanced Binary Tree.cpp		Balanced Binary Tree.cpp
Basic Calculator II.cpp		Basic Calculator II.cpp
Beautiful Arrangement.cpp		Beautiful Arrangement.cpp
Best Time to Buy and Sell Stock II		Best Time to Buy and Sell Stock II
Best Time to Buy and Sell Stock IV.cpp		Best Time to Buy and Sell Stock IV.cpp
Best Time to Buy and Sell Stock.cpp		Best Time to Buy and Sell Stock.cpp
Binary Search Tree Iterator.cpp		Binary Search Tree Iterator.cpp
Binary Tree Cameras.cpp		Binary Tree Cameras.cpp
Binary Tree Inorder Traversal.cpp		Binary Tree Inorder Traversal.cpp
Binary Tree Level Order Traversal.cpp		Binary Tree Level Order Traversal.cpp
Binary Tree Maximum Path Sum.cpp		Binary Tree Maximum Path Sum.cpp
Binary Tree Paths.cpp		Binary Tree Paths.cpp
Binary Tree Right Side View.cpp		Binary Tree Right Side View.cpp
Binary Tree Zigzag Level Order Traversal.cpp		Binary Tree Zigzag Level Order Traversal.cpp
Binary Tree to DLL.cpp		Binary Tree to DLL.cpp
Bipartite Graph.cpp		Bipartite Graph.cpp
Boyer Moore Algorithm for Pattern Searching.cpp		Boyer Moore Algorithm for Pattern Searching.cpp
Burst Balloons.cpp		Burst Balloons.cpp
CHOCOLA - Chocolate.cpp		CHOCOLA - Chocolate.cpp
Ceiling in a sorted array.cpp		Ceiling in a sorted array.cpp
Cheapest Flights Within K Stops.cpp		Cheapest Flights Within K Stops.cpp
Check if reversing a sub array make the array sorted.cpp		Check if reversing a sub array make the array sorted.cpp
Check whether BST contains Dead End.cpp		Check whether BST contains Dead End.cpp
Chocolate Distribution Problem.cpp		Chocolate Distribution Problem.cpp
Circular tour.cpp		Circular tour.cpp
Climbing Stairs.cpp		Climbing Stairs.cpp
Coin Change.cpp		Coin Change.cpp
Combination Sum II.cpp		Combination Sum II.cpp
Combinations.cpp		Combinations.cpp
Construct Binary Tree from Preorder and Postorder Traversal.cpp		Construct Binary Tree from Preorder and Postorder Traversal.cpp
Construct Tree from Preorder Traversal.cpp		Construct Tree from Preorder Traversal.cpp
Container With Most Water.cpp		Container With Most Water.cpp
Convert Binary Number in a Linked List to Integer.cpp		Convert Binary Number in a Linked List to Integer.cpp
Convert Sorted Array to Binary Search Tree.cpp		Convert Sorted Array to Binary Search Tree.cpp
Copy List with Random Pointer.cpp		Copy List with Random Pointer.cpp
Count BST nodes that lie in a given range.cpp		Count BST nodes that lie in a given range.cpp
Count Different Palindromic Subsequences.cpp		Count Different Palindromic Subsequences.cpp
Count Square Submatrices with All Ones.cpp		Count Square Submatrices with All Ones.cpp
Count of Range Sum.cpp		Count of Range Sum.cpp
Count of Smaller Numbers After Self.cpp		Count of Smaller Numbers After Self.cpp
Counting Bits.cpp		Counting Bits.cpp
DFS of Graph.cpp		DFS of Graph.cpp
Daily Temperatures.cpp		Daily Temperatures.cpp
Decode String.cpp		Decode String.cpp
Decode Ways.cpp		Decode Ways.cpp
Delete and Earn.cpp		Delete and Earn.cpp
Delete nodes having greater value on right.cpp		Delete nodes having greater value on right.cpp
Design Add and Search Words Data Structure.cpp		Design Add and Search Words Data Structure.cpp
Detect a negative cycle in a Graph.cpp		Detect a negative cycle in a Graph.cpp
Diameter of Binary Tree.cpp		Diameter of Binary Tree.cpp
Directed Graph Cycle.cpp		Directed Graph Cycle.cpp
Distinct Subsequences.cpp		Distinct Subsequences.cpp
Evaluate Division.cpp		Evaluate Division.cpp
Evaluate Reverse Polish Notation.cpp		Evaluate Reverse Polish Notation.cpp
Evaluation of Postfix Expression.cpp		Evaluation of Postfix Expression.cpp
Excel Sheet Column Title.cpp		Excel Sheet Column Title.cpp
Find All Duplicates in an Array.cpp		Find All Duplicates in an Array.cpp
Find Eventual Safe States.cpp		Find Eventual Safe States.cpp
Find Pair Given Difference.cpp		Find Pair Given Difference.cpp
Find Peak Element.cpp		Find Peak Element.cpp
Find all possible palindromic partitions of a String.cpp		Find all possible palindromic partitions of a String.cpp
Find paths from corner cell to middle cell in maze.cpp		Find paths from corner cell to middle cell in maze.cpp
Find the City With the Smallest Number of Neighbors at a Threshold Distance.cpp		Find the City With the Smallest Number of Neighbors at a Threshold Distance.cpp
Find the Duplicate Number.cpp		Find the Duplicate Number.cpp
Find the Index of the First Occurrence in a String.cpp		Find the Index of the First Occurrence in a String.cpp
Find the Most Competitive Subsequence.cpp		Find the Most Competitive Subsequence.cpp
Flatten Binary Tree to Linked List.cpp		Flatten Binary Tree to Linked List.cpp
Flatten Nested List Iterator.cpp		Flatten Nested List Iterator.cpp
Flatten a Multilevel Doubly Linked List.cpp		Flatten a Multilevel Doubly Linked List.cpp
Flattening a Linked List.cpp		Flattening a Linked List.cpp
Flood Fill.cpp		Flood Fill.cpp
Floyd Warshall.cpp		Floyd Warshall.cpp
Frog Jump.cpp		Frog Jump.cpp
Furthest Building You Can Reach.cpp		Furthest Building You Can Reach.cpp
Game Of Life.cpp		Game Of Life.cpp
Gas Station.cpp		Gas Station.cpp
Generate Parentheses.cpp		Generate Parentheses.cpp
Given a matrix of ‘O’ and ‘X’, replace ‘O’ with ‘X’ if surrounded by ‘X’.cpp		Given a matrix of ‘O’ and ‘X’, replace ‘O’ with ‘X’ if surrounded by ‘X’.cpp
Group Anagrams.cpp		Group Anagrams.cpp
Implement Queue using Stacks.cpp		Implement Queue using Stacks.cpp
Implement Stack and Queue using Deque.cpp		Implement Stack and Queue using Deque.cpp
Implement Stack using Queues.cpp		Implement Stack using Queues.cpp
Implement Trie (Prefix Tree).cpp		Implement Trie (Prefix Tree).cpp
Implement two stacks in an array.cpp		Implement two stacks in an array.cpp

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Uh oh!

Repository files navigation

CrackYourInternship

About

Uh oh!

Releases

Packages

Uh oh!

Languages

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

License

codehub001/CrackYourInternship

Folders and files

Latest commit

History

Repository files navigation

CrackYourInternship

About

Topics

Resources

License

Uh oh!

Stars

Watchers

Forks

Releases

Packages 0

Uh oh!

Languages

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Packages