#Sat Preparation

Sat Preparation
unisala image

nishan thapaSep 1, 2023

how to prepare for sat to get 1400+ . hey i have been studying sat and applying USA since 6 months.

how to prepare for sat to get 1400+ . hey i have been studying sat and applying USA since 6 months. so i got to know that for non english native speakers like u

1 min read·General

Good Picks

Understanding Backtracking Patterns: Sequential vs Choice Generation

Prashant Basnet

Pub/Sub: The Invisible Glue That Makes Modern Apps Work

Prashant Basnet

Snowflake Curated Question Set : Leetcode

Brain Dump

Reorganize String | Two adjacent characters are not the same.

Anonymous User

Kahn's Algorithm | Topological Sort | Graph Cycle Detection

Prashant Basnet

Data Structures Based on Array

Prashant Basnet

Think Like an Engineer: Optimize Swaps with Cycle Insight | Sort Array | Moving Items to Empty Space

Prashant Basnet

Matrix Rotation: A Must-Know for Devs & ML Engineers

Prashant Basnet

From Brute Force to Optimal: Subarray Ranges Explained via Monotonic Stacks 🔥

Prashant Basnet

Largest Color Value in a Directed Graph

Prashant Basnet

Decode String Problem: Mastering Stacks for Nested String Parsing

Prashant Basnet

Shortest Unsorted Continuous Subarray

Prashant Basnet

Finding the Number of Visible Mountains

Prashant Basnet

Number of Islands | DFS vs BFS

Brain Dump

Loop Order in 2D Arrays | The Case of the Slow Matrix: A Developer’s Mystery 🔍

Prashant Basnet

The Greedy Gardener: A Simple Tale of Algorithms

Prashant Basnet

Minimum Weight Arborescence | CSCE 500 | Project 5

Prashant Basnet

Solving All Variations of the Lowest Common Ancestor (LCA) Problem in Binary Trees

Prashant Basnet

How to Identify Greedy Problems?

Prashant Basnet

Make Array Zero by Subtracting Equal Amounts

Prashant Basnet

Thread: Understanding the 132 Pattern Problem | Monotonic Stack | N^3 -> N Complexity

Prashant Basnet

Finding the Single Non-Duplicate Element in a Sorted Array: A Binary Search

Prashant Basnet

Hamiltonian Cycles: The Problem That Could Win You $1 Million

Prashant Basnet

Greedy Algorithm | Dijkstra Algorithm

Prashant Basnet

Same Binary Tree | Leet - Code

Brain Dump

Subtree of Another Tree

Brain Dump

Binary Search Tree | Subset of Binary Tree

Brain Dump

Balanced Binary Tree | Neetcode

Brain Dump

Max - Depth VS Diameter of Binary Search Tree

Brain Dump

Rotten Orange Grid Traversal Algorithm | 2D Array | Graph Traversal Algo

Anonymous User

Kahn's Algorithm | Course Schedule

Anonymous User

The Universal Framework for solving 5 Interval Problems | Greedy Algorithm

Prashant Basnet

Exploring Backtracking and Memoization for Decoding Digit Strings

Array Alchemist

Understanding Palindromes: Brute Force vs Expand Around Center Algorithms | Optimizing Time Complexity | n^3 vs n^2

Array Alchemist

Dynamic Programming: One Solution for Multiple Problems

Prashant Basnet

Singleton Design Pattern: The Key to Efficient and Maintainable Code

Prashant Basnet

🧵 Speed or 💾 Memory: The Trade-off Every Dev Must Know

Prashant Basnet

From Treasure Maps to Tech: Understanding Multi-Source Pathfinding | Islands and Treasures | Grid Algorithms

Prashant Basnet

Clone Graph: Deep Copying in Connected Systems

Prashant Basnet

A Deep Dive into Graph Theory and Applications | Types of Graphs

Brain Dump

Efficient Graph Design: Matrix vs List Decision Guide | Data Structure

Prashant Basnet

What are Heaps? Priority Queue | Real World Usage Like News - Feed Design

Prashant Basnet

Last Stone Weight | Heap | Priority Queue

Brain Dump

Combination Sum | Backtracking Algorithm

Brain Dump

Subsets | Back - Tracking Explained

Brain Dump

Backtracking | Algorithmic Apporoach

Brain Dump

What, Why How to implement Trie?

Prashant Basnet

How to validate a Binary Search Tree | Importance and algorithm | Leetcode

Brain Dump

Lowest Common Ancestor | Binary Search Tree

Brain Dump

Construct Binary Tree from Preorder & Inorder

Array Alchemist

Same Binary Tree | Leet - Code

Brain Dump

LRU Cache | Using Doubly Linked List & Map

Array Alchemist

Implement the Least Recently Used | LRU Cache | Leetcode | Using Map

Brain Dump

Merge Two Sorted Linked Lists | Leetcode | Blind 175

Brain Dump

Longest Repeating Character Replacement | Sliding Window | Leetcode

Brain Dump

Maximum Depth of Binary Tree | Blind 75 | Leetcode

Kira Rana

Recommended topics

#CSCE-572: Combinatorics and Geometric Algorithms #CSCE-669: Advanced Topics in Computer Information Systems #us phd research advisors hub #Amazon #unisala #CSCE-609: Advanced Topics in Machine Vision #CSCE-695: Doctoral Seminar #CSCE-699: Dissertation Research and Dissertation #usa student visa-step 1 - research programs and universities