🔥 Trending Repository: tech-interview-handbook

📝 Description: 💯 Curated coding interview preparation materials for busy software engineers

🔗 Repository URL: https://github.com/yangshun/tech-interview-handbook

🌐 Website: https://www.techinterviewhandbook.org

📖 Readme: https://github.com/yangshun/tech-interview-handbook#readme

📊 Statistics:
🌟 Stars: 130K stars
👀 Watchers: 2.2k
🍴 Forks: 15.8K forks

💻 Programming Languages: TypeScript - JavaScript - Python

🏷️ Related Topics:

#algorithm #algorithms #interview_practice #interview_questions #coding_interviews #interview_preparation #system_design #algorithm_interview #behavioral_interviews #algorithm_interview_questions

==================================
🧠 By: https://t.iss.one/DataScienceM

Advanced Competitive Programming Interview Test (20 Questions)

1. Which of the following time complexities represents the most efficient algorithm?
A) O(n²)
B) O(2ⁿ)
C) O(log n)
D) O(n log n)

2. What will be the output of the following code?

   def mystery(n):
       if n <= 1:
           return 1
       return n * mystery(n - 1)
   print(mystery(5))
   

3. Write a function to find the longest increasing subsequence in an array using dynamic programming.

4. Explain the difference between BFS and DFS in graph traversal, and when each is preferred.

5. Given a sorted array of integers, which algorithm can be used to find a target value in O(log n) time?
A) Linear search
B) Binary search
C) Bubble sort
D) Merge sort

6. What is the time complexity of the following code snippet?

   for i in range(n):
       for j in range(i, n):
           print(i, j)
   

7. Write a program to implement Dijkstra's algorithm for finding the shortest path in a weighted graph.

8. What does the term "greedy choice property" refer to in greedy algorithms?

9. Which data structure is most suitable for implementing a priority queue efficiently?
A) Stack
B) Queue
C) Binary heap
D) Linked list

10. What will be the output of this code?

    import sys
    sys.setrecursionlimit(10000)
    def f(n):
        if n == 0:
            return 0
        return n + f(n-1)
    print(f(999))
    

11. Implement a recursive function to compute the nth Fibonacci number with memoization.

12. Describe the concept of divide and conquer with an example.

13. What is the space complexity of quicksort in the worst case?
A) O(1)
B) O(log n)
C) O(n)
D) O(n²)

14. Write a function that checks whether a given string is a palindrome using recursion.

15. In the context of competitive programming, what is the purpose of using bit manipulation?

16. What will be the output of the following code?

    s = "abc"
    print(s[1:3] + s[0])
    

17. Design a solution to find the maximum sum subarray using Kadane’s algorithm.

18. Explain the concept of backtracking with an example (e.g., N-Queens problem).

19. Which of the following problems cannot be solved using dynamic programming?
A) Longest common subsequence
B) Matrix chain multiplication
C) Traveling Salesman Problem
D) Binary search

20. Given two strings, write a function to determine if one is a permutation of the other using character frequency counting.

#CompetitiveProgramming #Algorithms #InterviewPrep #CodeForces #LeetCode #ProgrammingContest #DataStructures #AlgorithmDesign

By: @DataScienceQ 🚀

Advanced Problem Solving & Real-World Simulation Exam

1. Which of the following best describes the time complexity of a binary search algorithm on a sorted array of size n?
A) O(1)
B) O(log n)
C) O(n)
D) O(n log n)

2. Given a graph represented as an adjacency list, what is the most efficient way to find all nodes reachable from a given source node in an undirected graph?
A) Depth-First Search (DFS)
B) Breadth-First Search (BFS)
C) Dijkstra’s Algorithm
D) Bellman-Ford Algorithm

3. What will be the output of the following Python code snippet?

   def func(x):
       return x * 2 if x > 5 else x + 1
   print(func(4))
   

4. Write a function in Python that takes a list of integers and returns the maximum sum of a contiguous subarray (Kadane's Algorithm).

5. In a real-world simulation of traffic flow at intersections, which data structure would be most suitable for efficiently managing the queue of vehicles waiting at a red light?
A) Stack
B) Queue
C) Heap
D) Linked List

6. Explain how dynamic programming can be applied to optimize resource allocation in cloud computing environments.

7. Consider a scenario where you are simulating a distributed system with multiple servers handling requests. How would you ensure consistency across replicas in the event of a network partition?

8. What is the output of the following C++ code?

   #include <iostream>
   using namespace std;
   int main() {
       int a = 5, b = 2;
       cout << a / b << " " << a % b;
       return 0;
   }
   

9. Implement a Python program to simulate a producer-consumer problem using threading and a shared buffer with proper synchronization.

10. Which of the following is NOT a characteristic of a real-time operating system?
A) Deterministic response times
B) Preemptive scheduling
C) Long-term process blocking
D) High availability

11. Describe how a Bloom filter works and provide a use case in large-scale web systems.

12. You are designing a simulation for a hospital emergency room. Patients arrive randomly and are assigned to doctors based on severity. Which algorithm would you use to prioritize patients?
A) Round Robin
B) Priority Queue
C) First-Come-First-Serve
D) Random Selection

13. What does the following Java code print?

   public class Test {
       public static void main(String[] args) {
           String s1 = "Hello";
           String s2 = new String("Hello");
           System.out.println(s1 == s2);
       }
   }
   

14. Write a recursive function in Python to compute the nth Fibonacci number, and explain its time complexity.

15. In a simulated financial market, you want to detect anomalies in stock price movements. Which machine learning model would be most appropriate for this task?
A) Linear Regression
B) K-Means Clustering
C) Support Vector Machine
D) Recurrent Neural Network

16. Explain the concept of CAP theorem and its implications in distributed database design.

17. What is the output of the following JavaScript code?

   console.log(1 + '2' - '3');
   

18. Design a state machine for a vending machine that accepts coins, dispenses products, and returns change. Briefly describe each state and transition.

19. How would you simulate a multi-agent system where agents interact based on environmental feedback? Discuss the key components involved.

20. Why is the use of memoization important in recursive algorithms used in real-world simulations?

#AdvancedInterviewPrep #ProblemSolving #RealWorldSimulation #CodingExam #TechInterview #SoftwareEngineering #Algorithms #DataStructures #Programming #SystemDesign

By: @DataScienceQ 🚀

World Programming Championship Problem Solving Test

1. Given an array of integers, write a program to find the length of the longest increasing subsequence.

2. What will the output be for the following code snippet?

def func(n):  
    if n == 0:  
        return 0  
    return n + func(n - 1)  

print(func(5))

3. Which data structure is most efficient for implementing a priority queue? 
   a) Array 
   b) Linked List 
   c) Heap 
   d) Stack

4. Write a function to check whether a given string is a palindrome considering only alphanumeric characters and ignoring cases.

5. Explain the difference between Depth-First Search (DFS) and Breadth-First Search (BFS) with examples where each is preferred.

6. Output the result of this snippet:

print(3 * 'abc' + 'def' * 2)

7. Given a graph represented as an adjacency list, write a program to detect if there is a cycle in the graph.

8. What is the time complexity of binary search on a sorted array?

9. Implement a function that returns the number of ways to make change for an amount given a list of coin denominations.

10. What is the output of this code?

def f(x=[]):  
    x.append(1)  
    return x  

print(f())  
print(f())

11. Describe the sliding window technique and provide a problem example where it is used effectively.

12. Write code to find the median of two sorted arrays of possibly different sizes.

13. Which sorting algorithm has the best average-case time complexity for large datasets? 
    a) Bubble Sort 
    b) Quick Sort 
    c) Insertion Sort 
    d) Selection Sort

14. Given the task of finding the shortest path between two nodes in a weighted graph with no negative edges, which algorithm would you use and why?

15. What does this code output?

for i in range(3):  
    print(i)  
else:  
    print("Done")

16. Implement a program that finds the maximum sum subarray (Kadane’s Algorithm).

17. How is memoization used to optimize recursive solutions? Provide a classic example.

18. Write a function that returns all valid combinations of n pairs of parentheses.

19. Given an integer array, find the maximum product of any three numbers.

20. Explain what a greedy algorithm is and present a problem where a greedy approach yields an optimal solution.

#CompetitiveProgramming #Algorithms #DataStructures #ProblemSolving #CodingInterview

By: @DataScienceQ 🚀

#include <iostream>
#include <vector>

int main() {
    std::vector<int> numbers;
    numbers.push_back(5);
    numbers.push_back(10);
    std::cout << "Vector size: " << numbers.size();
    return 0;
}

Vector size: 2

#34. .size()
Member function that returns the number of elements in a container like std::vector or std::string.

#include <iostream>
#include <vector>

int main() {
    std::vector<std::string> fruits = {"Apple", "Banana"};
    std::cout << "There are " << fruits.size() << " fruits.";
    return 0;
}

There are 2 fruits.

#35. .length()
A member function of std::string that returns its length. It's synonymous with .size().

#include <iostream>
#include <string>

int main() {
    std::string text = "C++";
    std::cout << "The length of the string is: " << text.length();
    return 0;
}

The length of the string is: 3

---
#CPP #STL #Algorithms

#36. #include <algorithm>
Includes the standard library algorithms, like sort, find, copy, etc.

#include <iostream>
#include <vector>
#include <algorithm> // Required for std::sort

int main() {
    std::vector<int> nums = {3, 1, 4};
    std::sort(nums.begin(), nums.end());
    std::cout << "Sorting is possible with <algorithm>.";
    return 0;
}

Sorting is possible with <algorithm>.

#37. std::sort()
Sorts the elements in a range (e.g., a vector).

#include <iostream>
#include <vector>
#include <algorithm>

int main() {
    std::vector<int> nums = {50, 20, 40, 10, 30};
    std::sort(nums.begin(), nums.end());
    for(int n : nums) {
        std::cout << n << " ";
    }
    return 0;
}

10 20 30 40 50

#38. .begin()
Returns an iterator pointing to the first element in a container.

#include <iostream>
#include <vector>

int main() {
    std::vector<int> nums = {100, 200, 300};
    auto it = nums.begin();
    std::cout << "First element: " << *it;
    return 0;
}

First element: 100

#39. .end()
Returns an iterator referring to the past-the-end element in the container.

#include <iostream>
#include <vector>
#include <algorithm>

int main() {
    std::vector<int> nums = {1, 2, 3};
    // .end() points after the last element, used as a boundary
    std::cout << "Vector has elements until the end.";
    return 0;
}

Vector has elements until the end.

#40. #define
A preprocessor directive used to create macros or symbolic constants.

#include <iostream>
#define PI 3.14159

int main() {
    std::cout << "The value of PI is " << PI;
    return 0;
}

The value of PI is 3.14159

---
#CPP #OOP #Classes

#41. class
A keyword used to declare a class, which is a blueprint for creating objects.

#include <iostream>

class Dog {
public:
    void bark() {
        std::cout << "Woof!";
    }
};

int main() {
    Dog myDog;
    myDog.bark();
    return 0;
}

Woof!

#42. struct
Similar to a class, but its members are public by default.