Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
51 views

LeetCode Round 2

The document discusses various topics that will be covered in an interview, including graphs, backtracking, bit manipulation, trees, and easy and medium level problems. It provides examples of problems for each topic area, with a total of 77 questions to be covered. The interviewer notes that there is less than a 1% chance that one or two questions may be missed.

Uploaded by

yash gangwar
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
51 views

LeetCode Round 2

The document discusses various topics that will be covered in an interview, including graphs, backtracking, bit manipulation, trees, and easy and medium level problems. It provides examples of problems for each topic area, with a total of 77 questions to be covered. The interviewer notes that there is less than a 1% chance that one or two questions may be missed.

Uploaded by

yash gangwar
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

श्री राधा 🌹

Round 2

Number of Questions : 77

LinkedIn : Mr. Gresh Sehrawat


Note : We all are Human , so there might be possibility that any one or two question may
be miss , less than 1% chances are there for that but if you find any question which is not
mentioned there , let me know please. Trust on your Own Risk Please.

Graph :

Number of Islands

BackTracking :

• 1. Generate Parentheses
• 2. Combination Sum
• 3. Subsets
• 4. Combination Sum III
• 5. Combination Sum II

BitMagic :

• 1. Reverse Bits
• 2. Number of 1 Bits
• 3. Hamming Distance

Tree :

• 1. Binary Tree Inorder Traversal


• 2. Same Tree
• 3. Binary Tree Level Order Traversal
• 4. Binary Tree Zigzag Level Order Traversal
• 5. Maximum Depth of Binary Tree
• 6. Convert Sorted Array to Binary Search Tree
• 7. Balanced Binary Tree
• 8. Minimum Depth of Binary Tree
• 9. Binary Tree Maximum Path Sum
• 10. Binary Tree Preorder Traversal
• 11. Binary Tree Postorder Traversal
• 12. Invert Binary Tree
• 13. Lowest Common Ancestor of a Binary Tree
• 14. Serialize and Deserialize Binary Tree
• 15. Insert into a Binary Search Tree
• 16. Range Sum of BST
• 17. Construct Binary Search Tree from Preorder Traversal

Easy :
• 1. Two Sum
• 2. Add Two Numbers
• 3. Reverse Integer
• 4. Palindrome Number
• 5. Remove Nth Node From End of List
• 6. Swap Nodes in Pairs
• 7. Search Insert Position
• 8. Length of Last Word
• 9. Rotate List
• 10. Sort Colors
• 11. Factorial Trailing Zeroes
• 12. Rotate Array
• 13. Happy Number
• 14. Reverse Linked List
• 15. Kth Largest Element in an Array
• 16. Missing Number
• 17. First Bad Version
• 18. Move Zeroes
• 19. Odd Even Linked List
• 20. Reverse String
• 21. Valid Perfect Square
• 22. First Unique Character in a String
• 23. Find the Difference
• 24. Find All Duplicates in an Array
• 25. Add Two Numbers II
• 26. Find All Numbers Disappeared in an Array
• 27. Subarray Product Less Than K
• 28. Jewels and Stones
• 29. Binary Search
• 30. Middle of the Linked List
• 31. Fibonacci Number
• 32. Check If It Is a Straight Line
• 33. Minimum Difficulty of a Job Schedule
• 34. Average Salary Excluding the Minimum and Maximum Salary

Medium Level 2 :
• 1. Jump Game II
• 2. Jump Game
• 3. Unique Paths
• 4. Unique Paths II
• 5. Minimum Path Sum
• 6. Climbing Stairs
• 7. Edit Distance
• 8. Best Time to Buy and Sell Stock
• 9. Best Time to Buy and Sell Stock II
• 10. Gas Station
• 11. Find Minimum in Rotated Sorted Array
• 12. House Robber
• 13. Longest Increasing Subsequence
• 14. Coin Change
• 15. Coin Change II
• 16. Longest Common Subsequence
• 17. House Robber III

You might also like