gamee

-

0

19

0



Comments

Post a Comment

Popular posts from this blog

Interview Preparation Kit

-
Interview Preparation Resources : 1. Data Structures and Algorithms Must Do Problems on Topic Wise (GFG) Must Do Problems on Topic Wise (Practice) (GFG) Complete DSA Roadmap (InterviewBit) Abdul Bari Standard DSA Playlist (YT) Leetcode Problems 2. Programming Language OOPs Commonly Asked Questions 1 (GFG) Quiz (GFG) How to draw Class Diagrams (YT) C++ Commonly Asked Questions 1 (GFG) Commonly Asked Questions 2 (GFG) Quiz (GFG) Java Commonly Asked Questions 1 (GFG) Commonly Asked Questions 2 (GFG) Quiz (GFG) 3. Database Management Systems Most Important DBMS Questions + Video Crash Course (InterviewBit) SQL Syntax Ref Commonly Asked Questions 1 (GFG) Commonly Asked Questions 2 (GFG) SQL Problems (Leetcode) How to draw ER Diagram (YT) Sanchit Jain Complete Playlist (YT) 4. Operating Systems Commonly Asked Questions 1 (GFG) Sanchit Jain Complete Playlist (YT) Quiz (GFG) 5. System Design Usually not asked during Internship Interviews Gaura...
Read more

How to crack the interviews and get a decent job?

-
How to crack the interviews and get a decent job? So, the organizations will be coming in many colleges soon, and conduct their shortlisting tests. Now, I will be talking very short and to the point. Each point is important. Basic Skill Set (BSS):  1. Quick implementation & debugging (practise questions on codeforces, hackerrank, participate in contests) 2. String Matching (important, KMP, Z-Algorithm, etc) 3. Binary Search , Sorting, STL (sets, maps, unordered set/map, vector, sort) - very very very useful 4. Data Structures - (Linked Lists, stacks, queues, BIT useful, Segment Tree - asked in Google) 5. Dynamic Programming - very very important (medium level problems, all companies ask) 6. Binary Trees & BST - super important! (All companies ask this) 7. DFS/BFS questions on Graphs (Dijsktra and flows are rarely asked) 8. DP on Trees (yes, an important topic) 9. Greedy, Backtracking - (Important, can be tricky) 10. Math Concepts like Prime Seive - Not that m...
Read more

permutation of a given string

-
Image
public class StringPermutation { public List< String > permute ( char input []) { Map< Character , Integer > countMap = new TreeMap<> (); for ( char ch : input) { countMap . compute(ch, (key, val) - > { if (val == null ) { return 1 ; } else { return val + 1 ; } }); } char str[] = new char [countMap . size()]; int count[] = new int [countMap . size()]; int index = 0 ; for ( Map . Entry< Character , Integer > entry : countMap . entrySet()) { str[index] = entry . getKey(); count[index] = entry . getValue(); index ++ ; } List< String > resultList = new ArrayList<> (); char result[] = new char [input . length]; permuteUtil(str, count, result, 0 , resultList); return resultList; } public void permuteUtil ( char str [], int count [], char result [], int level , List< String > resultList ) { if (level == result . length) { resultList . add( new String (re...
Read more