Placement Materials

Here are 15 top websites for interview preparation along with their URLs: LeetCode - Ideal for coding practice and technical interview preparation. leetcode.com GeeksforGeeks - Comprehensive resources for coding, data structures, algorithms, and more. geeksforgeeks.org HackerRank - Offers coding challenges and contests to sharpen your programming skills. hackerrank.com Pramp - Provides free peer-to-peer mock interviews tailored for software engineers. pramp.com Glassdoor - Access company reviews, interview questions, and salary information. glassdoor.com CareerCup - Focuses on coding interview questions and answers. careercup.com IndiaBix - Great for practicing aptitude questions commonly asked in interviews. interviewup.com PracticeInterviews - Allows for virtual mock interviews and provides feedback on performance. practiceinterviews.com AceTheInterview - Provides a variety of interview preparation questions and tips. acetheinterview.com Gainlo - Connects users with experts for mock interviews, especially for technical roles. gainlo.co My Interview Practice - Offers a platform for practicing common interview questions. myinterviewpractice.com InterviewBuddy - Provides mock interviews with industry experts. interviewbuddy.in Codercareer - Specializes in helping coders prepare for technical interviews. codercareer.com InterviewCake - Provides coding interview preparation through detailed problem explanations. interviewcake.com TopCoder - Known for its coding competitions and challenges, which are great for practice 🚀 Helpful Websites for ATS-friendly Resumes: 1.Jobscan.co : Optimize your resume for specific job descriptions. 2.ResumeWorded.com : Get instant feedback on your resume. 3.Zety.com : Create ATS-friendly resumes with professional templates. 4.Resume.io : Offers tools for creating and optimizing your resume for ATS. 5.Overleaf.com Coding resume preparation from prompt

DSA question by understanding patterns If the input array is sorted then - Binary search - Two pointers If asked for all permutations/subsets then - Backtracking If given a tree then - DFS - BFS If given a graph then - DFS - BFS If given a linked list then - Two pointers If recursion is banned then - Stack If must solve in-place then - Swap corresponding values - Store one or more different values in the same pointer If asked for maximum/minimum subarray/ subset/options then - Dynamic programming If asked for top/least K items then - Heap - QuickSelect If asked for common strings then - Map - Trie Else - Map/Set for O(1) time & O(n) space - Sort input for O(nlogn) time and O(1) space